{"entities":{"Q6412664":{"pageid":13545769,"ns":120,"title":"Item:Q6412664","lastrevid":95198405,"modified":"2026-06-05T08:34:48Z","type":"item","id":"Q6412664","labels":{"en":{"language":"en","value":"Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems like Max-Cut"}},"descriptions":{"en":{"language":"en","value":"preprint 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":"Q6412664$5DB46AD3-48C4-47A5-980C-B1E9D9977CED","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"f49e07c66abbdea8ff241e3f8bd9a1ff9f244e7f","datavalue":{"value":{"time":"+2022-10-02T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6412664$9870A83C-7DB6-4FCA-9F8F-4E607DDCE904","rank":"normal"}],"P21":[{"mainsnak":{"snaktype":"value","property":"P21","hash":"8393afe0e26814374aa02b12e160ce5c1d20e3c2","datavalue":{"value":"2210.00623","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6412664$9744D2E1-6E29-484B-849A-FE80E881EBF4","rank":"normal"}],"P22":[{"mainsnak":{"snaktype":"value","property":"P22","hash":"503ac4c58a72ca327e0f2dbc2bb57f0f7eed6b65","datavalue":{"value":"cond-mat.dis-nn","type":"string"},"datatype":"string"},"type":"statement","id":"Q6412664$CD16AB31-04B9-4E0B-9FF2-E7012C221FB7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P22","hash":"614924768b75c995c88a0e54bf3be36427e60707","datavalue":{"value":"cs.AI","type":"string"},"datatype":"string"},"type":"statement","id":"Q6412664$93CADD97-9318-47CD-AF17-D8A1A649F32E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P22","hash":"5a9a9eaa7fd7e010f3960691b4ec6b49e1992fea","datavalue":{"value":"cs.LG","type":"string"},"datatype":"string"},"type":"statement","id":"Q6412664$A4615F01-C310-4207-8329-B9F41223B223","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P22","hash":"5a067f3cc35200b51bab0398d603e2eb9779a610","datavalue":{"value":"math.OC","type":"string"},"datatype":"string"},"type":"statement","id":"Q6412664$52AF6493-FBF2-4816-901B-576F978F09E1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P22","hash":"e4794c62ed591ec55cb9ec695760878ec8776ef2","datavalue":{"value":"quant-ph","type":"string"},"datatype":"string"},"type":"statement","id":"Q6412664$0066F0DB-6594-4EE1-A802-AE486D7001D0","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"a726f20df5e4697bd2d7692ff96923706a88e301","datavalue":{"value":"Stefan Boettcher","type":"string"},"datatype":"string"},"type":"statement","id":"Q6412664$48F25EAC-1259-4171-B0FB-EAF3A0A7AC82","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":"Q6412664$E6D68FF0-9479-493A-ACE7-66E09CA03715","rank":"normal"}],"P1687":[{"mainsnak":{"snaktype":"value","property":"P1687","hash":"4fa76d75a57171a9070afd4569e852f10e98cdb3","datavalue":{"value":"https://github.com/IvanIsCoding/GNN-for-Combinatorial-Optimization","type":"string"},"datatype":"url"},"type":"statement","id":"Q6412664$698560C6-02D5-4548-B88B-A5A3B4A9081F","rank":"normal","references":[{"hash":"5530a04cc817a1709d0bc2d9894e66a9552123f0","snaks":{"P1688":[{"snaktype":"value","property":"P1688","hash":"751d4347fc35bdb4f30f7c16a04985ae1d09e2d1","datavalue":{"value":"https://paperswithcode.com/paper/inability-of-a-graph-neural-network-heuristic","type":"string"},"datatype":"url"}],"P1689":[{"snaktype":"value","property":"P1689","hash":"f846dfc57207c7640d2726d8f72d9e8a317f0bcf","datavalue":{"value":"repository README","type":"string"},"datatype":"string"}]},"snaks-order":["P1688","P1689"]}]}]},"sitelinks":{"mardi":{"site":"mardi","title":"Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems like Max-Cut","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Inability_of_a_graph_neural_network_heuristic_to_outperform_greedy_algorithms_in_solving_combinatorial_optimization_problems_like_Max-Cut"}}}}}