{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:04:24Z","timestamp":1781028264196,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:00:00Z","timestamp":1780963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Quantum Science and Technology - National Science and Technology Major Project (QNMP)","award":["2021ZD0302901"],"award-info":[{"award-number":["2021ZD0302901"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800810","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"967-978","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["New Planar Algorithms and a Full Complexity Classification of the Eight-Vertex Model"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-0675-6060","authenticated-orcid":false,"given":"Jin-Yi","family":"Cai","sequence":"first","affiliation":[{"name":"University of Wisconsin-Madison, Madison, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7714-2195","authenticated-orcid":false,"given":"Austen","family":"Fan","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0935-2929","authenticated-orcid":false,"given":"Shuai","family":"Shao","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-2857-9786","authenticated-orcid":false,"given":"Zhuxiao","family":"Tang","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2018.12"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.26.832"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2528400"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2011.12.002"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.93"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","unstructured":"Jin-Yi Cai Zhiguo Fu and Mingji Xia. 2018. Complexity classification of the six-vertex model. Inf. Comput. 259 Part (2018) 130\u2013141. https:\/\/doi.org\/10.1016\/j.ic.2018.01.003 10.1016\/j.ic.2018.01.003","DOI":"10.1016\/j.ic.2018.01.003"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","unstructured":"Jin-Yi Cai and Tianyu Liu. 2020. FPRAS via MCMC where it mixes torpidly (and very little effort). arxiv:2010.05425. https:\/\/doi.org\/10.48550\/arXiv.2010.05425 10.48550\/arXiv.2010.05425","DOI":"10.48550\/arXiv.2010.05425"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2013.07.003"},{"key":"e_1_3_2_1_9_1","volume-title":"Complexity Dichotomies for Counting Problems","author":"Cai Jin-Yi","unstructured":"Jin-Yi Cai and Xi Chen. 2017. Complexity Dichotomies for Counting Problems: Volume 1, Boolean Domain. Cambridge University Press, Cambridge, UK."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2822891"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1032314"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1131672"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2023.105064"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-021-10032-1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2020.104589"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2020.22"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1049798"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/100814585"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.132"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2013.07.003"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.118"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/13\/9\/093021"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/100811258"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevB.2.723"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2371656.2371660"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10090"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222066"},{"key":"e_1_3_2_1_28_1","volume-title":"Graph theory and crystal physics","author":"Kasteleyn Pieter W.","unstructured":"Pieter W. Kasteleyn. 1967. Graph theory and crystal physics. In Graph Theory and Theoretical Physics, Frank Harary (Ed.). Academic Press, London and New York. 43\u2013110."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4842-8_20"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.5"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M113304X"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1021\/ja01315a102"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00105"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.1665111"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1080\/14786436108243366"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/070682575"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(69)80033-5"}],"event":{"name":"STOC '26: 58th Annual ACM Symposium on Theory of Computing","location":"Salt Lake City UT USA","acronym":"STOC '26","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 58th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800810","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:55:57Z","timestamp":1781027757000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800810"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":37,"alternative-id":["10.1145\/3798129.3800810","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800810","relation":{},"subject":[],"published":{"date-parts":[[2026,6,9]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}