{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T14:28:11Z","timestamp":1764858491239,"version":"3.46.0"},"reference-count":74,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T00:00:00Z","timestamp":1759881600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000769","name":"University of Oxford","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000769","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1016\/j.jctb.2025.10.002","type":"journal-article","created":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:34:08Z","timestamp":1760708048000},"page":"404-439","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Quantum advantage and CSP complexity"],"prefix":"10.1016","volume":"176","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9491-2016","authenticated-orcid":false,"given":"Lorenzo","family":"Ciardo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.jctb.2025.10.002_br0010","series-title":"12th Conference on the Theory of Quantum Computation, Communication and Cryptography","first-page":"9:1","article-title":"Minimum quantum resources for strong non-locality","volume":"vol. 73","author":"Abramsky","year":"2017"},{"key":"10.1016\/j.jctb.2025.10.002_br0020","series-title":"42nd International Symposium on Mathematical Foundations of Computer Science","article-title":"The quantum monad on relational structures","volume":"vol. 83","author":"Abramsky","year":"2017"},{"key":"10.1016\/j.jctb.2025.10.002_br0030","series-title":"Proc. 2022 ACM-SIAM Symposium on Discrete Algorithms (SODA'22)","first-page":"1129","article-title":"Promise constraint satisfaction and width","author":"Atserias","year":"2022"},{"key":"10.1016\/j.jctb.2025.10.002_br0040","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.jcss.2019.05.003","article-title":"Generalized satisfiability problems via operator assignments","volume":"105","author":"Atserias","year":"2019","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"10.1016\/j.jctb.2025.10.002_br0050","doi-asserted-by":"crossref","first-page":"1:1","DOI":"10.1145\/3265985","article-title":"Proof complexity meets algebra","volume":"20","author":"Atserias","year":"2019","journal-title":"ACM Trans. Comput. Log."},{"issue":"5","key":"10.1016\/j.jctb.2025.10.002_br0060","doi-asserted-by":"crossref","first-page":"1554","DOI":"10.1137\/15M1006507","article-title":"(2+\u03f5)-SAT is NP-hard","volume":"46","author":"Austrin","year":"2017","journal-title":"SIAM J. Comput."},{"issue":"5","key":"10.1016\/j.jctb.2025.10.002_br0070","doi-asserted-by":"crossref","first-page":"1378","DOI":"10.1093\/ietfec\/e89-a.5.1378","article-title":"A quantum protocol to win the graph colouring game on all Hadamard graphs","volume":"89-A","author":"Avis","year":"2006","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"10.1016\/j.jctb.2025.10.002_br0080","series-title":"Proc. 40th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS'25)","article-title":"Classical simulation of quantum CSP strategies","author":"Banakh","year":"2025"},{"issue":"4","key":"10.1016\/j.jctb.2025.10.002_br0090","doi-asserted-by":"crossref","first-page":"28:1","DOI":"10.1145\/3457606","article-title":"Algebraic approach to promise constraint satisfaction","volume":"68","author":"Barto","year":"2021","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/j.jctb.2025.10.002_br0100","doi-asserted-by":"crossref","DOI":"10.1145\/2556646","article-title":"Constraint satisfaction problems solvable by local consistency methods","volume":"61","author":"Barto","year":"2014","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/j.jctb.2025.10.002_br0110","doi-asserted-by":"crossref","first-page":"1646","DOI":"10.1137\/130915479","article-title":"Robustly solvable constraint satisfaction problems","volume":"45","author":"Barto","year":"2016","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jctb.2025.10.002_br0120","series-title":"The Constraint Satisfaction Problem: Complexity and Approximability","first-page":"1","article-title":"Polymorphisms, and how to use them","volume":"vol. 7","author":"Barto","year":"2017"},{"issue":"1","key":"10.1016\/j.jctb.2025.10.002_br0130","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/s11856-017-1621-9","article-title":"The wonderland of reflections","volume":"223","author":"Barto","year":"2018","journal-title":"Isr. J. Math."},{"issue":"1","key":"10.1016\/j.jctb.2025.10.002_br0140","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.artint.2007.09.001","article-title":"Theoretical analysis of singleton arc consistency and its extensions","volume":"172","author":"Bessiere","year":"2008","journal-title":"Artif. Intell."},{"key":"10.1016\/j.jctb.2025.10.002_br0150","series-title":"Proc. 31st Conference on Computational Complexity (CCC'16)","first-page":"14:1","article-title":"New hardness results for graph and hypergraph colorings","volume":"vol. 50","author":"Brakensiek","year":"2016"},{"issue":"6","key":"10.1016\/j.jctb.2025.10.002_br0160","doi-asserted-by":"crossref","first-page":"1663","DOI":"10.1137\/19M128212X","article-title":"Promise constraint satisfaction: algebraic structure and a symmetric Boolean dichotomy","volume":"50","author":"Brakensiek","year":"2021","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jctb.2025.10.002_br0170","series-title":"Proc. 55th Annual ACM Symposium on Theory of Computing (STOC'23)","first-page":"609","article-title":"SDPs and robust satisfiability of promise CSP","author":"Brakensiek","year":"2023"},{"issue":"6","key":"10.1016\/j.jctb.2025.10.002_br0180","doi-asserted-by":"crossref","first-page":"1232","DOI":"10.1137\/20M1312745","article-title":"The power of the combined basic linear programming and affine relaxation for promise constraint satisfaction problems","volume":"49","author":"Brakensiek","year":"2020","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jctb.2025.10.002_br0190","doi-asserted-by":"crossref","first-page":"1232","DOI":"10.1137\/20M1312745","article-title":"The power of the combined basic LP and affine relaxation for promise CSPs","volume":"49","author":"Brakensiek","year":"2020","journal-title":"SIAM J. Comput."},{"issue":"11","key":"10.1016\/j.jctb.2025.10.002_br0200","doi-asserted-by":"crossref","first-page":"1877","DOI":"10.1007\/s10701-005-7353-4","article-title":"Quantum pseudo-telepathy","volume":"35","author":"Brassard","year":"2005","journal-title":"Found. Phys."},{"issue":"9","key":"10.1016\/j.jctb.2025.10.002_br0210","doi-asserted-by":"crossref","first-page":"1874","DOI":"10.1103\/PhysRevLett.83.1874","article-title":"Cost of exactly simulating quantum entanglement with classical communication","volume":"83","author":"Brassard","year":"1999","journal-title":"Phys. Rev. Lett."},{"issue":"4","key":"10.1016\/j.jctb.2025.10.002_br0220","first-page":"275","article-title":"Minimum entangled state dimension required for pseudo-telepathy","volume":"5","author":"Brassard","year":"2005","journal-title":"Quantum Inf. Comput."},{"issue":"1","key":"10.1016\/j.jctb.2025.10.002_br0230","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1103\/RevModPhys.82.665","article-title":"Nonlocality and communication complexity","volume":"82","author":"Buhrman","year":"2010","journal-title":"Rev. Mod. Phys."},{"issue":"1","key":"10.1016\/j.jctb.2025.10.002_br0240","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.tcs.2005.09.028","article-title":"H-coloring dichotomy revisited","volume":"349","author":"Bulatov","year":"2005","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jctb.2025.10.002_br0250","series-title":"Proc. 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS'17)","first-page":"319","article-title":"A dichotomy theorem for nonuniform CSPs","author":"Bulatov","year":"2017"},{"issue":"3","key":"10.1016\/j.jctb.2025.10.002_br0260","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1137\/S0097539700376676","article-title":"Classifying the complexity of constraints using finite algebras","volume":"34","author":"Bulatov","year":"2005","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jctb.2025.10.002_br0270","series-title":"52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025)","first-page":"1","article-title":"Satisfiability of commutative vs. non-commutative CSPs","author":"Bulatov","year":"2025"},{"issue":"1","key":"10.1016\/j.jctb.2025.10.002_br0280","article-title":"On the quantum chromatic number of a graph","volume":"14","author":"Cameron","year":"2007","journal-title":"Electron. J. Comb."},{"issue":"1","key":"10.1016\/j.jctb.2025.10.002_br0290","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1093\/logcom\/exr039","article-title":"Arc consistency and friends","volume":"23","author":"Chen","year":"2013","journal-title":"J. Log. Comput."},{"key":"10.1016\/j.jctb.2025.10.002_br0300","series-title":"Proc. 39th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS'24)","article-title":"Quantum advantage and CSP complexity","author":"Ciardo","year":"2024"},{"key":"10.1016\/j.jctb.2025.10.002_br0310","series-title":"Proc. 2026 ACM-SIAM Symposium on Discrete Algorithms (SODA'26)","article-title":"On the quantum chromatic gap","author":"Ciardo","year":"2026"},{"key":"10.1016\/j.jctb.2025.10.002_br0320","series-title":"Proc. 2023 ACM-SIAM Symposium on Discrete Algorithms (SODA'23)","first-page":"2256","article-title":"Approximate graph colouring and crystals","author":"Ciardo","year":"2023"},{"key":"10.1016\/j.jctb.2025.10.002_br0330","series-title":"Proc. 55th Annual ACM Symposium on Theory of Computing (STOC'23)","first-page":"623","article-title":"Approximate graph colouring and the hollow shadow","author":"Ciardo","year":"2023"},{"issue":"1","key":"10.1016\/j.jctb.2025.10.002_br0340","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/22M1476435","article-title":"CLAP: a new algorithm for promise CSPs","volume":"52","author":"Ciardo","year":"2023","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jctb.2025.10.002_br0350","series-title":"Proc. 2023 ACM-SIAM Symposium on Discrete Algorithms (SODA'23)","first-page":"568","article-title":"Hierarchies of minion tests for PCSPs through tensors","author":"Ciardo","year":"2023"},{"key":"10.1016\/j.jctb.2025.10.002_br0360","series-title":"19th Annual IEEE Conference on Computational Complexity (CCC 2004)","first-page":"236","article-title":"Consequences and limits of nonlocal strategies","author":"Cleve","year":"2004"},{"key":"10.1016\/j.jctb.2025.10.002_br0370","series-title":"Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I","first-page":"320","article-title":"Characterization of binary constraint system games","volume":"vol. 8572","author":"Cleve","year":"2014"},{"key":"10.1016\/j.jctb.2025.10.002_br0380","series-title":"Principles and Practice of Constraint Programming - CP 2002, 8th International Conference, CP 2002, Ithaca, NY, USA, September 9-13, 2002, Proceedings","first-page":"310","article-title":"Constraint satisfaction, bounded treewidth, and finite-variable logics","volume":"vol. 2470","author":"Dalmau","year":"2002"},{"key":"10.1016\/j.jctb.2025.10.002_br0390","series-title":"Proc. 39th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS'24)","first-page":"1","article-title":"Local consistency as a reduction between constraint satisfaction problems","author":"Dalmau","year":"2024"},{"key":"10.1016\/j.jctb.2025.10.002_br0400","series-title":"Proc. 15th International Joint Conference on Artificial Intelligence (IJCAI'97)","first-page":"412","article-title":"Some practicable filtering techniques for the constraint satisfaction problem","author":"Debruyne","year":"1997"},{"key":"10.1016\/j.jctb.2025.10.002_br0410","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/j.jcta.2019.06.008","article-title":"Spectral lower bounds for the quantum chromatic number of a graph","volume":"168","author":"Elphick","year":"2019","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"1","key":"10.1016\/j.jctb.2025.10.002_br0420","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1137\/S0097539794266766","article-title":"The computational structure of monotone monadic SNP and constraint satisfaction: a study through datalog and group theory","volume":"28","author":"Feder","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jctb.2025.10.002_br0430","series-title":"Asian Conference on Quantum Information Science (AQIS'11)","article-title":"Quantum coloring games via symmetric SAT games","author":"Fukawa","year":"2011"},{"key":"10.1016\/j.jctb.2025.10.002_br0440","series-title":"IEEE International Symposium on Information Theory, 2003. Proceedings","first-page":"457","article-title":"The impossibility of pseudotelepathy without quantum entanglement","author":"Galliard","year":"2003"},{"key":"10.1016\/j.jctb.2025.10.002_br0450","series-title":"Proceedings IEEE International Symposium on Information Theory","first-page":"101","article-title":"Pseudo-telepathy, entanglement, and graph colorings","author":"Galliard","year":"2002"},{"issue":"1","key":"10.1016\/j.jctb.2025.10.002_br0460","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/321921.321926","article-title":"The complexity of near-optimal graph coloring","volume":"23","author":"Garey","year":"1976","journal-title":"J. ACM"},{"year":"1979","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","key":"10.1016\/j.jctb.2025.10.002_br0470"},{"key":"10.1016\/j.jctb.2025.10.002_br0480","series-title":"The Logico-Algebraic Approach to Quantum Mechanics: Volume I: Historical Evolution","first-page":"123","article-title":"Measures on the closed subspaces of a Hilbert space","author":"Gleason","year":"1975"},{"author":"Godsil","key":"10.1016\/j.jctb.2025.10.002_br0490"},{"issue":"1","key":"10.1016\/j.jctb.2025.10.002_br0500","doi-asserted-by":"crossref","first-page":"1:1","DOI":"10.1145\/1206035.1206036","article-title":"The complexity of homomorphism and constraint satisfaction problems seen from the other side","volume":"54","author":"Grohe","year":"2007","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/j.jctb.2025.10.002_br0510","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","article-title":"On the complexity of H-coloring","volume":"48","author":"Hell","year":"1990","journal-title":"J. Comb. Theory, Ser. B"},{"year":"2013","series-title":"Handbook of Linear Algebra","author":"Hogben","key":"10.1016\/j.jctb.2025.10.002_br0520"},{"key":"10.1016\/j.jctb.2025.10.002_br0530","series-title":"24th Annual IEEE Conference on Computational Complexity","first-page":"217","article-title":"Oracularization and two-prover one-round interactive proofs against nonlocal strategies","author":"Ito","year":"2008"},{"key":"10.1016\/j.jctb.2025.10.002_br0540","series-title":"53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012","first-page":"243","article-title":"A multi-prover interactive proof for NEXP sound against entangled provers","author":"Ito","year":"2012"},{"issue":"1\u20132","key":"10.1016\/j.jctb.2025.10.002_br0550","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0304-3975(97)00230-2","article-title":"On the algebraic structure of combinatorial problems","volume":"200","author":"Jeavons","year":"1998","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"10.1016\/j.jctb.2025.10.002_br0560","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1145\/263867.263489","article-title":"Closure properties of constraints","volume":"44","author":"Jeavons","year":"1997","journal-title":"J. ACM"},{"issue":"11","key":"10.1016\/j.jctb.2025.10.002_br0570","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1145\/3485628","article-title":"MIP* = RE","volume":"64","author":"Ji","year":"2021","journal-title":"Commun. ACM"},{"key":"10.1016\/j.jctb.2025.10.002_br0580","series-title":"Proc. Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"issue":"3","key":"10.1016\/j.jctb.2025.10.002_br0590","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1137\/090751293","article-title":"Entangled games are hard to approximate","volume":"40","author":"Kempe","year":"2011","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jctb.2025.10.002_br0600","series-title":"Proc. 34th Annual ACM Symposium on Theory of Computing (STOC'02)","first-page":"767","article-title":"On the power of unique 2-prover 1-round games","author":"Khot","year":"2002"},{"issue":"4","key":"10.1016\/j.jctb.2025.10.002_br0610","doi-asserted-by":"crossref","first-page":"1263","DOI":"10.1137\/18M117577X","article-title":"Solving CSPs using weak local consistency","volume":"50","author":"Kozik","year":"2021","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.jctb.2025.10.002_br0620","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1137\/20M1378223","article-title":"Topology and adjunction in promise constraint satisfaction","volume":"52","author":"Krokhin","year":"2023","journal-title":"SIAM J. Comput."},{"author":"Lalonde","key":"10.1016\/j.jctb.2025.10.002_br0630"},{"issue":"4","key":"10.1016\/j.jctb.2025.10.002_br0640","article-title":"Oddities of quantum colorings","volume":"4","author":"Man\u010dinska","year":"2016","journal-title":"Balt. J. Mod. Comput."},{"key":"10.1016\/j.jctb.2025.10.002_br0650","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/j.jctb.2015.12.009","article-title":"Quantum homomorphisms","volume":"118","author":"Man\u010dinska","year":"2016","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"6","key":"10.1016\/j.jctb.2025.10.002_br0660","doi-asserted-by":"crossref","first-page":"4025","DOI":"10.1109\/TIT.2013.2248031","article-title":"New separations in zero-error channel capacity through projective Kochen-Specker sets and quantum coloring","volume":"59","author":"Man\u010dinska","year":"2013","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.jctb.2025.10.002_br0670","series-title":"60th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2019","first-page":"510","article-title":"NEEXP is contained in MIP","author":"Natarajan","year":"2019"},{"issue":"6","key":"10.1016\/j.jctb.2025.10.002_br0680","doi-asserted-by":"crossref","first-page":"2188","DOI":"10.1016\/j.jfa.2016.01.010","article-title":"Estimating quantum chromatic numbers","volume":"270","author":"Paulsen","year":"2016","journal-title":"J. Funct. Anal."},{"issue":"1\u20133","key":"10.1016\/j.jctb.2025.10.002_br0690","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/S0012-365X(01)00297-7","article-title":"Galois theory for minors of finite functions","volume":"254","author":"Pippenger","year":"2002","journal-title":"Discrete Math."},{"year":"1982","series-title":"Quantum Mechanics in Hilbert Space","author":"Prugovecki","key":"10.1016\/j.jctb.2025.10.002_br0700"},{"key":"10.1016\/j.jctb.2025.10.002_br0710","series-title":"Proc. 40th Annual ACM Symposium on Theory of Computing (STOC'08)","first-page":"245","article-title":"Optimal algorithms and inapproximability results for every CSP?","author":"Prasad","year":"2008"},{"issue":"4","key":"10.1016\/j.jctb.2025.10.002_br0720","doi-asserted-by":"crossref","first-page":"2524","DOI":"10.1109\/TIT.2011.2178018","article-title":"Kochen\u2013Specker sets and the rank-1 quantum chromatic number","volume":"58","author":"Scarpa","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"10.1016\/j.jctb.2025.10.002_br0730","doi-asserted-by":"crossref","first-page":"30:1","DOI":"10.1145\/3402029","article-title":"A proof of the CSP dichotomy conjecture","volume":"67","author":"Zhuk","year":"2020","journal-title":"J. ACM"},{"author":"Zhuk","key":"10.1016\/j.jctb.2025.10.002_br0740"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895625000759?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895625000759?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T14:23:46Z","timestamp":1764858226000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0095895625000759"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":74,"alternative-id":["S0095895625000759"],"URL":"https:\/\/doi.org\/10.1016\/j.jctb.2025.10.002","relation":{},"ISSN":["0095-8956"],"issn-type":[{"type":"print","value":"0095-8956"}],"subject":[],"published":{"date-parts":[[2026,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Quantum advantage and CSP complexity","name":"articletitle","label":"Article Title"},{"value":"Journal of Combinatorial Theory, Series B","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jctb.2025.10.002","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 Inc.","name":"copyright","label":"Copyright"}]}}