{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:06:46Z","timestamp":1750694806440,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T00:00:00Z","timestamp":1685664000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NSF (National Science Foundation)","award":["CCF-2227876, CCF-1422159, CCF-2130816"],"award-info":[{"award-number":["CCF-2227876, CCF-1422159, CCF-2130816"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,2]]},"DOI":"10.1145\/3564246.3585120","type":"proceedings-article","created":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T17:34:20Z","timestamp":1684258460000},"page":"632-642","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["On Approximability of Satisfiable k-CSPs: II"],"prefix":"10.1145","author":[{"given":"Amey","family":"Bhangale","sequence":"first","affiliation":[{"name":"University of California at Riverside, Riverside, USA"}]},{"given":"Subhash","family":"Khot","sequence":"additional","affiliation":[{"name":"New York University, USA"}]},{"given":"Dor","family":"Minzer","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,6,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-2011-00725-X"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-014-0252-0"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2022.20"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451003"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520028"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00030"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2021.27"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(82)90062-0"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3519966"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2017.185.1.7"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2017.185.1.8"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548307008826"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.19086\/da.6513"},{"key":"e_1_3_2_1_14_1","volume-title":"A Noisy-Influence Regularity Lemma for Boolean Functions. CoRR, abs\/1610.06950","author":"Jones Chris","year":"2016","unstructured":"Chris Jones . 2016. A Noisy-Influence Regularity Lemma for Boolean Functions. CoRR, abs\/1610.06950 ( 2016 ), arxiv:1610.06950. arxiv:1610.06950 Chris Jones. 2016. A Noisy-Influence Regularity Lemma for Boolean Functions. CoRR, abs\/1610.06950 (2016), arxiv:1610.06950. arxiv:1610.06950"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510017"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(95)90024-1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-010-0047-x"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.53"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004117000482"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374414"},{"volume-title":"Approximating NP-hard problems efficient algorithms and their limits","author":"Raghavendra Prasad","key":"e_1_3_2_1_21_1","unstructured":"Prasad Raghavendra . 2009. Approximating NP-hard problems efficient algorithms and their limits . University of Washington. Prasad Raghavendra. 2009. Approximating NP-hard problems efficient algorithms and their limits. University of Washington."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-28.1.104"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.4064\/aa-27-1-199-245"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1017\/fms.2013.2"}],"event":{"name":"STOC '23: 55th Annual ACM Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Orlando FL USA","acronym":"STOC '23"},"container-title":["Proceedings of the 55th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585120","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585120","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:17:27Z","timestamp":1750295847000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585120"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,2]]},"references-count":24,"alternative-id":["10.1145\/3564246.3585120","10.1145\/3564246"],"URL":"https:\/\/doi.org\/10.1145\/3564246.3585120","relation":{},"subject":[],"published":{"date-parts":[[2023,6,2]]},"assertion":[{"value":"2023-06-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}