{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T00:58:53Z","timestamp":1766105933481,"version":"3.48.0"},"reference-count":17,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T00:00:00Z","timestamp":1764028800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000143","name":"National Science Foundation Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-2308744"],"award-info":[{"award-number":["CCF-2308744"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["2022-04273"],"award-info":[{"award-number":["2022-04273"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1016\/j.tcs.2025.115656","type":"journal-article","created":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T07:45:53Z","timestamp":1764143153000},"page":"115656","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A tractability gap beyond nim-sums: It\u2019s hard to tell whether a bunch of superstars are losers"],"prefix":"10.1016","volume":"1062","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9222-8832","authenticated-orcid":false,"given":"Kyle","family":"Burke","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5289-7567","authenticated-orcid":false,"given":"Matthew","family":"Ferland","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6808-2469","authenticated-orcid":false,"given":"Svenja","family":"Huntemann","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5011-4514","authenticated-orcid":false,"given":"Shang-Hua","family":"Teng","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3-4","key":"10.1016\/j.tcs.2025.115656_bib0001","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF01755964","article-title":"Playing disjunctive sums is polynomial space complete","volume":"10","author":"Morris","year":"1981","journal-title":"Int. J. Game Theory"},{"year":"1985","author":"Yedwab","series-title":"On playing well in a sum of games","key":"10.1016\/j.tcs.2025.115656_bib0002"},{"year":"1993","author":"Moews","series-title":"On some combinatorial games connected with Go","key":"10.1016\/j.tcs.2025.115656_bib0003"},{"key":"10.1016\/j.tcs.2025.115656_bib0004","series-title":"More Games of No Chance","first-page":"125","article-title":"Go endgames are PSPACE-hard","volume":"42","author":"Wolfe","year":"2002"},{"key":"10.1016\/j.tcs.2025.115656_bib0005","series-title":"Proceedings of the 62nd Annual Symposium on Foundations of Computer Science (FOCS)","article-title":"Winning the war by (strategically) losing battles: settling the complexity of Grundy-values in undirected Geography","author":"Burke","year":"2021"},{"issue":"2","key":"10.1016\/j.tcs.2025.115656_bib0006","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0304-3975(93)90026-P","article-title":"Undirected Edge Geography","volume":"112","author":"Fraenkel","year":"1993","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2025.115656_bib0007","doi-asserted-by":"crossref","DOI":"10.1090\/gsm\/146","article-title":"Combinatorial Game Theory","author":"Siegel","year":"2013"},{"key":"10.1016\/j.tcs.2025.115656_bib0008","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2022.12.015","article-title":"Disjunctive sums of quasi-nimbers","volume":"945","author":"Silva","year":"2023","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2025.115656_bib0009","series-title":"Winning Ways for your Mathematical Plays","volume":"1","author":"Berlekamp","year":"2001"},{"year":"2007","author":"Albert","series-title":"Lessons in Play: An Introduction to Combinatorial Game Theory","key":"10.1016\/j.tcs.2025.115656_bib0010"},{"year":"2000","author":"Conway","article-title":"On Numbers and Games","key":"10.1016\/j.tcs.2025.115656_bib0011"},{"key":"10.1016\/j.tcs.2025.115656_bib0012","series-title":"Proceedings of the Tenth Annual ACM Symposium on Theory of Computing","first-page":"216","article-title":"The complexity of satisfiability problems","author":"Schaefer","year":"1978"},{"issue":"5","key":"10.1016\/j.tcs.2025.115656_bib0013","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/j.dam.2006.07.009","article-title":"Computational complexity of some restricted instances of 3-SAT","volume":"155","author":"Berman","year":"2007","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.tcs.2025.115656_bib0014","series-title":"Proceedings of the Sixth Annual ACM Symposium on Theory of Computing","first-page":"47","article-title":"Some simplified NP-complete problems","author":"Garey","year":"1974"},{"key":"10.1016\/j.tcs.2025.115656_bib0015","first-page":"438","article-title":"\u00dcber mathematische Kampfspiele","volume":"41","author":"Sprague","year":"1935","journal-title":"T\u00f4hoku Mathematical Journal"},{"key":"10.1016\/j.tcs.2025.115656_bib0016","first-page":"198","article-title":"Mathematics and games","volume":"2","author":"Grundy","year":"1939","journal-title":"Eureka"},{"issue":"1\/4","key":"10.1016\/j.tcs.2025.115656_bib0017","doi-asserted-by":"crossref","first-page":"pp.35","DOI":"10.2307\/1967631","article-title":"Nim, a game with a complete mathematical theory","volume":"3","author":"Bouton","year":"1901","journal-title":"Ann. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397525005936?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397525005936?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T00:54:38Z","timestamp":1766105678000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397525005936"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":17,"alternative-id":["S0304397525005936"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2025.115656","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2026,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A tractability gap beyond nim-sums: It\u2019s hard to tell whether a bunch of superstars are losers","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2025.115656","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"115656"}}