{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:56:53Z","timestamp":1781031413433,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":57,"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":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CAREER award 2440882"],"award-info":[{"award-number":["CAREER award 2440882"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010336","name":"Hellman Foundation","doi-asserted-by":"publisher","award":["Fellowship award to Amey Bhangale"],"award-info":[{"award-number":["Fellowship award to Amey Bhangale"]}],"id":[{"id":"10.13039\/100010336","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["Alan T. Waterman Award 1933331"],"award-info":[{"award-number":["Alan T. Waterman Award 1933331"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-2515155"],"award-info":[{"award-number":["CCF-2515155"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-2227876"],"award-info":[{"award-number":["CCF-2227876"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CAREER award 2239160"],"award-info":[{"award-number":["CAREER award 2239160"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-2007462"],"award-info":[{"award-number":["CCF-2007462"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["Investigator Award to Subhash Khot"],"award-info":[{"award-number":["Investigator Award to Subhash Khot"]}],"id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["Investigator Award to Ran Raz"],"award-info":[{"award-number":["Investigator Award to Ran Raz"]}],"id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800749","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"298-304","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["An Analytical Approach to Parallel Repetition via CSP Inverse Theorems"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3878-9241","authenticated-orcid":false,"given":"Amey","family":"Bhangale","sequence":"first","affiliation":[{"name":"University of California at Riverside, Riverside, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1276-6081","authenticated-orcid":false,"given":"Mark","family":"Braverman","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-9246-4011","authenticated-orcid":false,"given":"Subhash","family":"Khot","sequence":"additional","affiliation":[{"name":"New York University, New York, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6717-0539","authenticated-orcid":false,"given":"Yang","family":"Liu","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8093-1328","authenticated-orcid":false,"given":"Dor","family":"Minzer","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0910-3941","authenticated-orcid":false,"given":"Kunal","family":"Mittal","sequence":"additional","affiliation":[{"name":"New York University, New York, 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.1142\/S1793525309000096"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/JCSS.1997.1472"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278306"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/273865.273901"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/100811969"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Boaz Barak Anup Rao Ran Raz Ricky Rosen and Ronen Shaltiel. 2009. Strong parallel repetition theorem for free projection games. In APPROX-RANDOM. 352\u2013365.","DOI":"10.1007\/978-3-642-03685-9_27"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796302531"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62223"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3717823.3718190"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Amey Bhangale Subhash Khot Yang P. Liu and Dor Minzer. 2024. On approximability of satisfiable k-CSPs: VI. Available at arxiv:2411.15133","DOI":"10.1145\/3618260.3649610"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Amey Bhangale Subhash Khot Yang P. Liu and Dor Minzer. 2024. On approximability of satisfiable k-CSPs: VII. Available at arxiv:2411.15136","DOI":"10.1145\/3618260.3649610"},{"key":"e_1_3_2_1_12_1","unstructured":"Amey Bhangale Subhash Khot Yang P. Liu and Dor Minzer. 2024. Reasonable bounds for combinatorial lines of length three. Available at arxiv:2411.15137"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585121"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585120"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649610"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00037-025-00267-6"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3717823.3718127"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746565"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00080"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.CCC.2021.5"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.85"},{"key":"e_1_3_2_1_22_1","first-page":"3","article-title":"Multipartite entanglement in XOR games","volume":"13","author":"Bri\u00ebt Jop","year":"2013","unstructured":"Jop Bri\u00ebt, Harry Buhrman, Troy Lee, and Thomas Vidick. 2013. Multipartite entanglement in XOR games. Quantum Inf. Comput., 13, 3-4 (2013), 334\u2013360.","journal-title":"Quantum Inf. Comput."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2004.1313847"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704443057"},{"issue":"37","key":"e_1_3_2_1_25_1","first-page":"16","article-title":"Multiplayer parallel repetition for expanding games","author":"Dinur Irit","year":"2017","unstructured":"Irit Dinur, Prahladh Harsha, Rakesh Venkat, and Henry Yuen. 2017. Multiplayer parallel repetition for expanding games. In ITCS. Art. No. 37, 16.","journal-title":"ITCS. Art."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/S00493-005-0032-4"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591884"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1991.160251"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/226643.226652"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2007.39"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-002-0001-0"},{"key":"e_1_3_2_1_33_1","unstructured":"Lance Fortnow. 1989. Complexity theoretic aspects of interactive proof systems. Ph. D. Dissertation. MIT."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90251-8"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03041066"},{"key":"e_1_3_2_1_36_1","first-page":"1","article-title":"Parallel Repetition for the GHZ Game","volume":"62","author":"Girish Uma","year":"2021","unstructured":"Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, and Wei Zhan. 2021. Parallel Repetition for the GHZ Game: A Simpler Proof. In APPROX-RANDOM. 62:1\u201362:19.","journal-title":"A Simpler Proof. In APPROX-RANDOM."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Uma Girish Justin Holmgren Kunal Mittal Ran Raz and Wei Zhan. 2022. Parallel repetition for all 3-player games over binary alphabet. In STOC. 998\u20131009.","DOI":"10.1145\/3519935.3520071"},{"key":"e_1_3_2_1_38_1","first-page":"1","article-title":"Polynomial bounds on parallel repetition for all 3-player games with binary inputs","volume":"6","author":"Girish Uma","year":"2022","unstructured":"Uma Girish, Kunal Mittal, Ran Raz, and Wei Zhan. 2022. Polynomial bounds on parallel repetition for all 3-player games with binary inputs. In APPROX-RANDOM. 6:1\u20136:17.","journal-title":"APPROX-RANDOM."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700377165"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502098"},{"key":"e_1_3_2_1_41_1","volume-title":"Forbidden Subgraph Bounds for Parallel Repetition and the Density Hales-Jewett Theorem. CoRR, abs\/1604.05757","author":"Jan H\u0105z\u0142","year":"2016","unstructured":"Jan H\u0105z\u0142 a, Thomas Holenstein, and Anup Rao. 2016. Forbidden Subgraph Bounds for Parallel Repetition and the Density Hales-Jewett Theorem. CoRR, abs\/1604.05757 (2016), Available at arxiv:1604.05757"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2009.v005a008"},{"key":"e_1_3_2_1_43_1","unstructured":"Justin Holmgren and Ran Raz. 2020. A parallel repetition theorem for the GHZ game. arXiv preprint arXiv:2008.05059 Available at arxiv:2008.05059"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509962"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181879"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.50"},{"key":"e_1_3_2_1_47_1","unstructured":"Kunal Mittal. 2025. Multiplayer Parallel Repetition Is the Same as High-Dimensional Extremal Combinatorics. Available at arxiv:2510.24910"},{"issue":"71","key":"e_1_3_2_1_48_1","first-page":"15","article-title":"Block rigidity: strong multiplayer parallel repetition implies super-linear lower bounds for Turing machines","author":"Mittal Kunal","year":"2021","unstructured":"Kunal Mittal and Ran Raz. 2021. Block rigidity: strong multiplayer parallel repetition implies super-linear lower bounds for Turing machines. In ITCS. Art. No. 71, 15.","journal-title":"ITCS. Art."},{"key":"e_1_3_2_1_49_1","first-page":"431","article-title":"On the connectedness of bichromatic random graphs. Magyar Tud. Akad. Mat","volume":"8","author":"Pal\u00e1sti Ilona","year":"1964","unstructured":"Ilona Pal\u00e1sti. 1964. On the connectedness of bichromatic random graphs. Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl., 8 (1964), 431\u2013441 (1964).","journal-title":"Kutat\u00f3 Int. K\u00f6zl."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258620"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2012.175.3.6"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1137\/080734042"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795280895"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"crossref","unstructured":"Ran Raz. 2010. Parallel repetition of two prover games. In CCC. 3\u20136.","DOI":"10.1109\/CCC.2010.9"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1137\/090747270"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"crossref","unstructured":"Ran Raz and Ricky Rosen. 2012. A strong parallel repetition theorem for projection games on expanders. In CCC. 247\u2013257.","DOI":"10.1109\/CCC.2012.11"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00165-4"}],"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.3800749","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800749","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:57:43Z","timestamp":1781027863000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800749"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":57,"alternative-id":["10.1145\/3798129.3800749","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800749","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"}}]}}