{"id":"https://openalex.org/W4416018238","doi":"https://doi.org/10.1145/3798129.3800749","title":"An Analytical Approach to Parallel Repetition via CSP Inverse Theorems","display_name":"An Analytical Approach to Parallel Repetition via CSP Inverse Theorems","publication_year":2025,"publication_date":"2025-11-05","ids":{"openalex":"https://openalex.org/W4416018238","doi":"https://doi.org/10.1145/3798129.3800749"},"language":null,"primary_location":{"id":"doi:10.1145/3798129.3800749","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800749","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3798129.3800749","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012510300","display_name":"Amey Bhangale","orcid":"https://orcid.org/0000-0002-3878-9241"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bhangale, Amey","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042816355","display_name":"Mark Braverman","orcid":"https://orcid.org/0000-0003-1276-6081"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Braverman, Mark","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067917669","display_name":"Subhash Khot","orcid":"https://orcid.org/0009-0007-9246-4011"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Khot, Subhash","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063729451","display_name":"Yang P. Liu","orcid":"https://orcid.org/0000-0001-6717-0539"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Yang P.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063520549","display_name":"Dor Minzer","orcid":"https://orcid.org/0000-0002-8093-1328"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Minzer, Dor","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5049405486","display_name":"Kunal Mittal","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mittal, Kunal","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5012510300"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.31054261,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"298","last_page":"304"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5716999769210815,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5716999769210815,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.10559999942779541,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.08150000125169754,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/repetition","display_name":"Repetition (rhetorical device)","score":0.8271999955177307},{"id":"https://openalex.org/keywords/ackermann-function","display_name":"Ackermann function","score":0.6338000297546387},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.4846000075340271},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.4097000062465668},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.40230000019073486},{"id":"https://openalex.org/keywords/abelian-group","display_name":"Abelian group","score":0.397599995136261}],"concepts":[{"id":"https://openalex.org/C2776141515","wikidata":"https://www.wikidata.org/wiki/Q1274479","display_name":"Repetition (rhetorical device)","level":2,"score":0.8271999955177307},{"id":"https://openalex.org/C33436860","wikidata":"https://www.wikidata.org/wiki/Q341835","display_name":"Ackermann function","level":3,"score":0.6338000297546387},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5741999745368958},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.4846000075340271},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.4097000062465668},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.40230000019073486},{"id":"https://openalex.org/C136170076","wikidata":"https://www.wikidata.org/wiki/Q181296","display_name":"Abelian group","level":2,"score":0.397599995136261},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.3937000036239624},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.39089998602867126},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37709999084472656},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.3684999942779541},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.3066999912261963},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30489999055862427},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2854999899864197},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.26930001378059387},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2606000006198883},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.25519999861717224}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3798129.3800749","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800749","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2511.03083","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.03083","pdf_url":"https://arxiv.org/pdf/2511.03083","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2511.03083","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2511.03083","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1145/3798129.3800749","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800749","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G46263891","display_name":"AF: Small: Approximability of CSPs on Satisfiable Instances","funder_award_id":"2515155","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4924380218","display_name":"AF: Small: Computational Complexity Lower Bounds: Time, Space and Communication","funder_award_id":"2007462","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5169580875","display_name":null,"funder_award_id":"2239160","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5582643605","display_name":null,"funder_award_id":"1933331","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6581169542","display_name":"CAREER: Analytic and Algebraic Methods in Approximating Constraint Satisfaction Problems and Their Applications","funder_award_id":"2440882","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7317299890","display_name":null,"funder_award_id":"2227876","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309292","display_name":"Princeton University","ror":"https://ror.org/00hx57361"},{"id":"https://openalex.org/F4320309369","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44"},{"id":"https://openalex.org/F4320310207","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33"},{"id":"https://openalex.org/F4320319918","display_name":"York University","ror":"https://ror.org/05fq50484"},{"id":"https://openalex.org/F4320332640","display_name":"Courant Institute of Mathematical Sciences, New York University","ror":"https://ror.org/0190ak572"},{"id":"https://openalex.org/F4320337380","display_name":"Division of Mathematical Sciences","ror":"https://ror.org/051fftw81"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Let":[0],"$\\mathcal{G}$":[1,40],"be":[2],"a":[3,21,59,63,97],"$k$-player":[4,134],"game":[5],"with":[6,107,171],"value":[7,33],"$<1$,":[8],"whose":[9,71,151],"query":[10,72,152],"distribution":[11,73,153],"is":[12,41,74],"such":[13,88],"that":[14,27],"no":[15,155],"marginal":[16],"on":[17],"$k-1$":[18],"players":[19],"admits":[20],"non-trivial":[22,156],"Abelian":[23,157],"embedding.":[24],"We":[25],"show":[26],"for":[28,67,87,100,118,132,143,167],"every":[29],"$n\\geq":[30],"N$,":[31],"the":[32,35],"of":[34,39,115,129],"$n$-fold":[36],"parallel":[37,64,103,116,130],"repetition":[38,65,104,117,131,142,166],"$$":[42,49],"\\text{val}(\\mathcal{G}^{\\otimes":[43],"n})":[44],"\\leq":[45],"\\frac{1}{\\underbrace{\\log\\log\\cdots\\log}_{C\\text{":[46],"times}}":[47],"n},":[48],"where":[50],"$N=N(\\mathcal{G})$":[51],"and":[52],"$1\\leq":[53],"C\\leq":[54],"k^{O(k)}$":[55],"are":[56],"constants.":[57],"As":[58,91],"consequence,":[60],"we":[61,95],"obtain":[62,96],"theorem":[66],"all":[68,101,119,133,144,168],"$3$-player":[69,145],"games":[70,89,121,137,146,170],"pairwise-connected.":[75],"Prior":[76],"to":[77],"our":[78],"work,":[79],"only":[80],"inverse":[81],"Ackermann":[82],"decay":[83],"bounds":[84],"were":[85],"known":[86,102],"[Ver96].":[90],"additional":[92],"special":[93],"cases,":[94],"unified":[98],"proof":[99,114,128],"theorems,":[105],"albeit":[106],"weaker":[108],"bounds:":[109],"(1)":[110],"A":[111,126],"new":[112,127],"analytic":[113],"2-player":[120],"[Raz98,":[122],"Hol09,":[123],"DS14].":[124],"(2)":[125],"playerwise":[135],"connected":[136],"[DHVY17,":[138],"GHMRZ22].":[139],"(3)":[140],"Parallel":[141,165],"(in":[147],"particular":[148],"$3$-XOR":[149],"games)":[150],"has":[154],"embedding":[158],"into":[159],"$(\\mathbb{Z},":[160],"+)$":[161],"[BKM23c,":[162],"BBKLM25].":[163],"(4)":[164],"3-player":[169],"binary":[172],"inputs":[173],"[HR20,":[174],"GHMRZ21,":[175],"GHMRZ22,":[176],"GMRZ22].":[177]},"counts_by_year":[],"updated_date":"2026-06-10T14:10:52.464848","created_date":"2025-11-07T00:00:00"}