{"entities":{"Q1972596":{"pageid":1983338,"ns":120,"title":"Item:Q1972596","lastrevid":72114810,"modified":"2026-04-14T02:44:39Z","type":"item","id":"Q1972596","labels":{"en":{"language":"en","value":"Computing the nucleolus of min-cost spanning tree games is NP-hard."}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1429822"}},"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":"Q1972596$05E95D18-1C60-49CF-B705-5749655EF53B","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"51dab4809ee7c0e082c07e6ca43cdf48bc39ce84","datavalue":{"value":{"text":"Computing the nucleolus of min-cost spanning tree games is NP-hard.","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1972596$36EFE976-50E2-4492-B336-628D02FDC18D","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"db4e061f5c993cc5cf397197ab644e57466b8306","datavalue":{"value":"1058.91511","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1972596$11C2F6B1-93DB-40B6-8D47-0F5DE5E5C66A","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"5a4e46d7f82b5bd7ae5274f9e30daac89c5398cc","datavalue":{"value":{"entity-type":"item","numeric-id":185691,"id":"Q185691"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1972596$E8E655F1-6506-4152-9851-713AB9250766","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"be8a2df278205be5cc4bc1b3ee6636c3d2eec5ec","datavalue":{"value":{"entity-type":"item","numeric-id":257248,"id":"Q257248"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1972596$2273476F-E368-4670-AC02-6FEE0C2F4829","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"03794ad79d6c849c6904d9a0e8304a678b4ad199","datavalue":{"value":{"entity-type":"item","numeric-id":170461,"id":"Q170461"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1972596$1EDBFED4-3C16-4682-A2D9-F444B8039031","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"ef8712371e142c87c3e57daa1955918131611e11","datavalue":{"value":{"entity-type":"item","numeric-id":267073,"id":"Q267073"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1972596$884F9937-4CA8-4DC7-8D73-53F815285304","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"71be87b5127a36cf0026b68d385bda28356d61ab","datavalue":{"value":{"time":"+2000-04-11T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1972596$80138CB6-83D9-41A7-813F-529774D67B85","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"e7821ac546420ffac288c241a881e247a33d0c98","datavalue":{"value":"91A12","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1972596$2FF7C46D-EAA7-4706-BACA-08C3CC2E1C66","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1972596$88FE9B9B-8EA4-4568-996F-1928858CC0A4","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"d158583306a13d145c709be1aa46fe44d90915db","datavalue":{"value":"1429822","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1972596$817AB8F4-BB0A-42BA-AA7C-5916A73D3104","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9d86618fb1d90f166e8bcc9813a1bd08987df119","datavalue":{"value":"\\(N\\) -person game","type":"string"},"datatype":"string"},"type":"statement","id":"Q1972596$9E8B10C5-E609-41CD-9C14-9E85EAB4CC21","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":"Q1972596$0F8EBB59-9C23-422C-AC82-C312FDD8A2EA","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"4e8d8edc20908fb29f1a36da7cf4b81b8cdce177","datavalue":{"value":"https://doi.org/10.1007/s001820050083","type":"string"},"datatype":"url"},"type":"statement","id":"Q1972596$B749E764-3881-4636-87BB-38CD3C1F3AA8","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"2a5b7822572004789da6f62e139e3d5cc948d989","datavalue":{"value":"W1609615991","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1972596$1EE6D007-3C37-4546-925B-DD05A890203E","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"14e82876745afce995feb78a8a29cdfa49270469","datavalue":{"value":"10.1007/S001820050083","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1972596$B3705D03-F3B2-49B2-9429-F5BC26A4C18F","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Computing the nucleolus of min-cost spanning tree games is NP-hard.","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Computing_the_nucleolus_of_min-cost_spanning_tree_games_is_NP-hard."}}}}}