{"entities":{"Q6311510":{"pageid":13447459,"ns":120,"title":"Item:Q6311510","lastrevid":99198389,"modified":"2026-06-05T19:26:13Z","type":"item","id":"Q6311510","labels":{"en":{"language":"en","value":"Complexity of Partitioning Hypergraphs"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900367538"}},"aliases":{},"claims":{"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":"Q6311510$702B2399-6112-4F22-B549-22A46916992D","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"6b3e8ce19e9f5978e8f566795e3d4c40e60d6b31","datavalue":{"value":{"time":"+2018-12-21T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6311510$DBCB0BD5-B788-4CD5-BAAC-AA6F39736B35","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"e0b58bcc0d27d80e5baff6b64d069c7a3045cc27","datavalue":{"value":{"entity-type":"item","numeric-id":499466,"id":"Q499466"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6311510$4841DE4D-B95D-4B65-BF7C-ADA8957FB518","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"8195a9e26c453276e1d31339bf2413392412013d","datavalue":{"value":"68Q17","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6311510$4AD2AC1C-9DCF-43F5-B4CD-9C1B3C90F09B","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"f65dd724252c94b9f349f5ce115086a88374ffdb","datavalue":{"value":"900367538","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6311510$9AFA0E24-1982-452D-B92F-F7F5812911D0","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":"Q6311510$D7D9094F-6402-4DA8-9035-996D49E21F75","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Complexity of Partitioning Hypergraphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Complexity_of_Partitioning_Hypergraphs"}}}}}