{"entities":{"Q7203529":{"pageid":22248158,"ns":120,"title":"Item:Q7203529","lastrevid":107548514,"modified":"2026-10-27T10:38:37Z","type":"item","id":"Q7203529","labels":{"en":{"language":"en","value":"Optimal and Efficient Partite Decompositions of Hypergraphs"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"c41cdedf9a33b5b97d332c4eeab329e3e1f1dd6c","datavalue":{"value":"math.CO","type":"string"},"datatype":"string"},"type":"statement","id":"Q7203529$54A3443A-3134-4D38-84D1-4CFA5C114991","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"1533ef58fe3b6ac0b6e76c86b8ed9a818696c893","datavalue":{"value":{"time":"+2025-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7203529$012876E4-AB0A-4DEC-810E-DCF031AC5CAA","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"99e94fe2652b051a78ce949bb19a1d0b533c1289","datavalue":{"value":"2511.11855","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7203529$664EF822-0FB7-4EBA-A659-ED02EE8664B7","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"24bdbc3177d41492cc20e688ccab9804755f529e","datavalue":{"value":{"entity-type":"item","numeric-id":6760973,"id":"Q6760973"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7203529$82F6BD64-3D76-47A5-8F28-90FABEDEE93E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"2e7cd3808dd336493792efd2f0b61aafddde92bd","datavalue":{"value":{"entity-type":"item","numeric-id":2073304,"id":"Q2073304"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7203529$A47683FF-5D6A-49BF-BBA1-EE511B827430","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"f21260a62fd2395afe9d31cc1aa749974c5ec755","datavalue":{"value":{"entity-type":"item","numeric-id":271629,"id":"Q271629"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7203529$2AC2CD58-387B-4F6D-BA3B-C7ED394CC6CC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"a3d305b28db5d4e01d452b9fa54b208b8d3ed3fb","datavalue":{"value":{"entity-type":"item","numeric-id":6424198,"id":"Q6424198"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7203529$2C9D0670-7E4E-4D3F-A5FB-94281479BE6F","rank":"normal"}],"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7203529$1BA4D9C2-31E9-48C6-BCA0-91C3390BDAB6","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7203529$FFBC2652-1C04-4F11-B466-A6EBA260840B","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Optimal and Efficient Partite Decompositions of Hypergraphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Optimal_and_Efficient_Partite_Decompositions_of_Hypergraphs"}}}}}