{"entities":{"Q6440418":{"pageid":13573430,"ns":120,"title":"Item:Q6440418","lastrevid":99510230,"modified":"2026-06-05T20:07:23Z","type":"item","id":"Q6440418","labels":{"en":{"language":"en","value":"Fast Algorithms for Directed Graph Partitioning Using Flows and Reweighted Eigenvalues"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 900596218"}},"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":"Q6440418$24281756-3BEC-450B-A549-24C25B9E15E5","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b16353a59d462651b8369dc98a71ef493226d62e","datavalue":{"value":{"time":"+2023-06-15T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6440418$4EB54BDE-12A0-4698-9112-A2959FE8CCB5","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"86f340c200ea4ef58b9ef42ffeef32d598716e23","datavalue":{"value":{"entity-type":"item","numeric-id":715087,"id":"Q715087"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6440418$16781A2F-76B8-46E6-99DE-62F7AAC86984","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"896ffe1193411fffb9bdb4c925e2fc58b85cc744","datavalue":{"value":{"entity-type":"item","numeric-id":6393480,"id":"Q6393480"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6440418$2DBD5AA2-D001-4653-84FA-811CEEFDD223","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"503b4c32562b58be3b31067de813e0ac0ed692f9","datavalue":{"value":{"entity-type":"item","numeric-id":4127761,"id":"Q4127761"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6440418$CDC7E6A1-9D91-496C-AEEB-BEFBECA75010","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"253c9bece547cb8b90f4ecee26c455e93dfeb044","datavalue":{"value":"900596218","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6440418$82623EF0-5831-40AE-8648-13D65FE4B484","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":"Q6440418$6C3DFEB7-8585-411F-BE3A-3FADFBAFC9C4","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Fast Algorithms for Directed Graph Partitioning Using Flows and Reweighted Eigenvalues","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Fast_Algorithms_for_Directed_Graph_Partitioning_Using_Flows_and_Reweighted_Eigenvalues"}}}}}