{"entities":{"Q7208342":{"pageid":22265270,"ns":120,"title":"Item:Q7208342","lastrevid":107584094,"modified":"2026-10-27T10:54:19Z","type":"item","id":"Q7208342","labels":{"en":{"language":"en","value":"Sub-$n^k$ Deterministic algorithm for minimum $k$-way cut in simple graphs"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"aliases":{},"claims":{"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"87bfee88203cfe559185aa1c4a52192771738a74","datavalue":{"value":"cs.DS","type":"string"},"datatype":"string"},"type":"statement","id":"Q7208342$5A0C9572-7AD4-42A3-A7E1-3EA1D53302DF","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":"Q7208342$C9418A42-2EF1-4748-A13E-5E87A1514883","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"e88d4f218c5269ceae8cbba0d4465465968c6f6b","datavalue":{"value":"2512.12900","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q7208342$A9FDC884-D53E-49E7-8985-CE76427F985C","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"9d1fec380c45d64dd2974cc3968a20c7073163c5","datavalue":{"value":{"entity-type":"item","numeric-id":5212775,"id":"Q5212775"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7208342$82D0E037-BE47-4DDD-BF4F-BFA062FDB995","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":"Q7208342$A9AA57D4-8FD7-4344-B36F-88FCBFA06884","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":"Q7208342$B65D0F52-3798-468B-8725-CEC380B814AF","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Sub-$n^k$ Deterministic algorithm for minimum $k$-way cut in simple graphs","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Sub-$n%5Ek$_Deterministic_algorithm_for_minimum_$k$-way_cut_in_simple_graphs"}}}}}