{"entities":{"Q6517593":{"pageid":14096552,"ns":120,"title":"Item:Q6517593","lastrevid":99720020,"modified":"2026-06-05T20:34:26Z","type":"item","id":"Q6517593","labels":{"en":{"language":"en","value":"Branch and Cut for Partitioning a Graph into a Cycle of Clusters"}},"descriptions":{"en":{"language":"en","value":"scientific article from arXiv"}},"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":"Q6517593$6C7443DE-253C-4221-AA95-90F88A585FA1","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"224a9dc9403febbab50369b670b001de57c2d32e","datavalue":{"value":{"text":"Branch and Cut for Partitioning a Graph into a Cycle of Clusters","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6517593$68A1269C-52BF-4180-8DC1-C0B0956C054D","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"d07d6cd08eac8f167f417f8273d6e404420ded59","datavalue":{"value":{"entity-type":"item","numeric-id":2061872,"id":"Q2061872"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6517593$61A41BEF-43A0-4E48-BA4A-4953BE2A9AD6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"7f51b6b54a1490c90ec7acc9fc34aceda12688fd","datavalue":{"value":{"entity-type":"item","numeric-id":2011592,"id":"Q2011592"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6517593$A6BC727C-3CC4-4887-B9D1-7B0E8FC09F08","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"3d09836a38257b0d6b29a0830cb1729bcc6faddd","datavalue":{"value":{"entity-type":"item","numeric-id":522265,"id":"Q522265"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6517593$618BABFF-7E8D-45DE-84FD-8D2388C7406C","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"0b4fa5b59eb6fe6e43618f9e005f4a49f4390971","datavalue":{"value":"65K05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6517593$D5DA136F-2F64-4C30-849A-B50CF359BFF7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"bf44f3ad3a2f88c9b2a45e4395030d611f0589bf","datavalue":{"value":"90C11","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6517593$82B70542-A971-4F81-8C11-4C8711A2778A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"a0657b38d33102649f2f5881bf34640a78b8d196","datavalue":{"value":"60-XX","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6517593$49F44F91-5E6E-42E8-BCA8-D65AF8AD230A","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":"Q6517593$BBFD7190-FA02-48B1-B9A2-6648B0147648","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"2099096c348cf7af3a4adfc352a63eab6abb7504","datavalue":{"value":"2401.08412","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6517593$79774A15-C6B8-4996-8E53-23C3793F97E3","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Branch and Cut for Partitioning a Graph into a Cycle of Clusters","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Branch_and_Cut_for_Partitioning_a_Graph_into_a_Cycle_of_Clusters"}}}}}