{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T10:18:12Z","timestamp":1781259492364,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","funder":[{"name":"NSF (National Science Foundation)","award":["2227876, 2239160, 1422159, 2130816"],"award-info":[{"award-number":["2227876, 2239160, 1422159, 2130816"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,15]]},"DOI":"10.1145\/3717823.3718127","type":"proceedings-article","created":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T22:21:27Z","timestamp":1750026087000},"page":"62-71","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["On Approximability of Satisfiable \ud835\udc58-CSPs: V"],"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\/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-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"}]}],"member":"320","published-online":{"date-parts":[[2025,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278306"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/273865.273901"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.32"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a012"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-010-0051-1"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451003"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520028"},{"key":"e_1_3_2_1_8_1","unstructured":"Amey Bhangale Subhash Khot and Dor Minzer. 2023. Effective Bounds for Restricted 3 -Arithmetic Progressions in F_p^n. arXiv preprint arXiv:2308.06600."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585120"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585121"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649610"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CCC.2016.14"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.28"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1312745"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.30"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2021.27"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.37"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1541885.1541893"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/22M1476435"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649635"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00401-8"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794266766"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/226643.226652"},{"key":"e_1_3_2_1_25_1","volume-title":"An ergodic Szemer\u00e9di theorem for commuting transformations. Journal d\u2019Analyse Math\u00e9matique, 34, 1","author":"Furstenberg Hillel","year":"1978","unstructured":"Hillel Furstenberg and Yitzhak Katznelson. 1978. An ergodic Szemer\u00e9di theorem for commuting transformations. Journal d\u2019Analyse Math\u00e9matique, 34, 1 (1978), 275\u2013291."},{"key":"e_1_3_2_1_26_1","first-page":"227","article-title":"A density version of the Hales-Jewett theorem for k= 3","author":"Furstenberg Harry","year":"1989","unstructured":"Harry Furstenberg and Yitzhak Katznelson. 1989. A density version of the Hales-Jewett theorem for k= 3. In Annals of Discrete Mathematics. 43, Elsevier, 227\u2013241.","journal-title":"Annals of Discrete Mathematics. 43, Elsevier"},{"key":"e_1_3_2_1_27_1","volume-title":"A density version of the Hales-Jewett theorem. Journal d\u2019Analyse Math\u00e9matique, 57, 1","author":"Furstenberg Hillel","year":"1991","unstructured":"Hillel Furstenberg and Yitzhak Katznelson. 1991. A density version of the Hales-Jewett theorem. Journal d\u2019Analyse Math\u00e9matique, 57, 1 (1991), 64\u2013119."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00157-2"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-016-3383-0"},{"key":"e_1_3_2_1_31_1","volume-title":"Classic Papers in Combinatorics","author":"Hales Alfred W","unstructured":"Alfred W Hales and Robert I Jewett. 2009. Regularity and positional games. In Classic Papers in Combinatorics. Springer, 320\u2013327."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502098"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/120882718"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/274787.274791"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510017"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2006.5"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591817"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/321864.321877"},{"key":"e_1_3_2_1_39_1","volume-title":"Universal sequential search problems. Problemy peredachi informatsii, 9, 3","author":"Levin Leonid Anatolevich","year":"1973","unstructured":"Leonid Anatolevich Levin. 1973. Universal sequential search problems. Problemy peredachi informatsii, 9, 3 (1973), 115\u2013116."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-010-0047-x"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2010.171.295"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.41"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536482"},{"key":"e_1_3_2_1_44_1","first-page":"1283","article-title":"A new proof of the density Hales-Jewett theorem","author":"Polymath DHJ","year":"2012","unstructured":"DHJ Polymath. 2012. A new proof of the density Hales-Jewett theorem. Annals of Mathematics, 1283\u20131327.","journal-title":"Annals of Mathematics"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374414"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.74"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804350"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.74"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.2140\/apde.2010.3.1"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00026-011-0124-3"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3402029"},{"key":"e_1_3_2_1_52_1","first-page":"201","article-title":"Approximation Algorithms for Constraint Satisfaction Problems Involving at Most Three Variables per Constraint","volume":"98","author":"Zwick Uri","year":"1998","unstructured":"Uri Zwick. 1998. Approximation Algorithms for Constraint Satisfaction Problems Involving at Most Three Variables per Constraint.. In SODA. 98, 201\u2013210.","journal-title":"SODA."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301431"}],"event":{"name":"STOC '25: 57th Annual ACM Symposium on Theory of Computing","location":"Prague Czechia","acronym":"STOC '25","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 57th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3717823.3718127","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T15:39:34Z","timestamp":1750693174000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3717823.3718127"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,15]]},"references-count":53,"alternative-id":["10.1145\/3717823.3718127","10.1145\/3717823"],"URL":"https:\/\/doi.org\/10.1145\/3717823.3718127","relation":{},"subject":[],"published":{"date-parts":[[2025,6,15]]},"assertion":[{"value":"2025-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}