{"entities":{"Q7399430":{"pageid":31729742,"ns":120,"title":"Item:Q7399430","lastrevid":108078692,"modified":"2026-10-27T14:51:49Z","type":"item","id":"Q7399430","labels":{"en":{"language":"en","value":"On several judicious partitioning problems of graphs and 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":"Q7399430$8F6251F7-C49C-47F3-B817-B13EDABA421B","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"fea8258efc0c807aa3a84f12ebcd68838427a662","datavalue":{"value":{"time":"+2026-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":"Q7399430$17CDED4C-391F-43B3-B930-A6775FEF0114","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"8f0589294d18a529045040a5f928c8b136e95253","datavalue":{"value":"2610.19800","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7399430$B54CB118-9068-4373-AF21-AA7840898F2F","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"abe42e42494fdb4d729126297730aad1e07fec3f","datavalue":{"value":{"entity-type":"item","numeric-id":6444173,"id":"Q6444173"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7399430$6DBD9122-BEBB-4F0E-B69C-6D67A6B25240","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"4c327b43c34d5d27f1aa2de2eeb24990b4bc7eb2","datavalue":{"value":{"entity-type":"item","numeric-id":477336,"id":"Q477336"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7399430$141C8FCA-387B-446D-A8D8-AEB28B871818","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":"Q7399430$8A3AE2BC-E169-4EF7-B1C5-B2C6D893F0C9","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":"Q7399430$6F040176-3320-4945-80C0-4911BBEB96A4","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"On several judicious partitioning problems of graphs and hypergraphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/On_several_judicious_partitioning_problems_of_graphs_and_hypergraphs"}}}}}