{"id":"https://openalex.org/W4399523073","doi":"https://doi.org/10.1145/3618260.3649610","title":"On Approximability of Satisfiable k-CSPs: IV","display_name":"On Approximability of Satisfiable k-CSPs: IV","publication_year":2024,"publication_date":"2024-06-10","ids":{"openalex":"https://openalex.org/W4399523073","doi":"https://doi.org/10.1145/3618260.3649610"},"language":"en","primary_location":{"id":"doi:10.1145/3618260.3649610","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649610","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649610","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649610","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012510300","display_name":"Amey Bhangale","orcid":"https://orcid.org/0000-0002-3878-9241"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amey Bhangale","raw_affiliation_strings":["University of California, Riverside, USA"],"raw_orcid":"https://orcid.org/0000-0002-3878-9241","affiliations":[{"raw_affiliation_string":"University of California, Riverside, USA","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067917669","display_name":"Subhash Khot","orcid":"https://orcid.org/0009-0007-9246-4011"},"institutions":[{"id":"https://openalex.org/I57206974","display_name":"New York University","ror":"https://ror.org/0190ak572","country_code":"US","type":"education","lineage":["https://openalex.org/I57206974"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Subhash Khot","raw_affiliation_strings":["New York University, New York City, USA"],"raw_orcid":"https://orcid.org/0009-0007-9246-4011","affiliations":[{"raw_affiliation_string":"New York University, New York City, USA","institution_ids":["https://openalex.org/I57206974"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063520549","display_name":"Dor Minzer","orcid":"https://orcid.org/0000-0002-8093-1328"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dor Minzer","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, USA"],"raw_orcid":"https://orcid.org/0000-0002-8093-1328","affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1423","last_page":"1434"},"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.9998000264167786,"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.9998000264167786,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9980999827384949,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.728300929069519},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6579329967498779},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.6529592275619507},{"id":"https://openalex.org/keywords/abelian-group","display_name":"Abelian group","score":0.5950745940208435},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5894659757614136},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5729209184646606},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49496906995773315},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.25028544664382935},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.054083943367004395}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.728300929069519},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6579329967498779},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.6529592275619507},{"id":"https://openalex.org/C136170076","wikidata":"https://www.wikidata.org/wiki/Q181296","display_name":"Abelian group","level":2,"score":0.5950745940208435},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5894659757614136},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5729209184646606},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49496906995773315},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25028544664382935},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.054083943367004395},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3618260.3649610","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649610","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649610","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3618260.3649610","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649610","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649610","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4399523073.pdf"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W1022649828","https://openalex.org/W1970259241","https://openalex.org/W1970278864","https://openalex.org/W1973898585","https://openalex.org/W1989019709","https://openalex.org/W1999705592","https://openalex.org/W2044471216","https://openalex.org/W2052447582","https://openalex.org/W2078929687","https://openalex.org/W2086423976","https://openalex.org/W2110871651","https://openalex.org/W2129578811","https://openalex.org/W2136735959","https://openalex.org/W2161666429","https://openalex.org/W2218607027","https://openalex.org/W2335400162","https://openalex.org/W2543222200","https://openalex.org/W2907567654","https://openalex.org/W2962844449","https://openalex.org/W3102777411","https://openalex.org/W4221158097","https://openalex.org/W4281885517","https://openalex.org/W4310279740","https://openalex.org/W4376639703","https://openalex.org/W4376651385","https://openalex.org/W4385848695","https://openalex.org/W6682895199"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2487162673","https://openalex.org/W2793211469","https://openalex.org/W2949152769","https://openalex.org/W4372354731","https://openalex.org/W2807634898","https://openalex.org/W1692008701","https://openalex.org/W2942366970","https://openalex.org/W2597588799","https://openalex.org/W4360593462"],"abstract_inverted_index":{"We":[0],"prove":[1],"a":[2,32],"stability":[3],"result":[4],"for":[5],"general":[6],"3-wise":[7],"correlations":[8],"over":[9,34],"distributions":[10],"satisfying":[11,76],"mild":[12],"connectivity":[13],"properties.":[14],"More":[15],"concretely,":[16],"we":[17],"show":[18],"that":[19],"if":[20],"\u03a3,\u0393":[21],"and":[22,29,52],"\u03a6":[23],"are":[24],"alphabets":[25],"of":[26,40,67],"constant":[27],"size,":[28],"\u00b5":[30,48,54],"is":[31,43,49],"distribution":[33],"\u03a3\u00d7\u0393\u00d7\u03a6":[35],"satisfying:":[36],"(1)":[37],"the":[38,62],"probability":[39],"each":[41],"atom":[42],"at":[44],"least":[45],"\u03a9(1),":[46],"(2)":[47],"pairwise":[50],"connected,":[51],"(3)":[53],"has":[55],"no":[56],"Abelian":[57],"embeddings":[58],"into":[59],"(\u2124,+),":[60],"then":[61],"following":[63],"holds.":[64],"Any":[65],"triplets":[66],"1-bounded":[68],"functions":[69],"f\u2236":[70],"\u03a3n\u2192\u2102,":[71],"g\u2236":[72],"\u0393n\u2192\u2102,":[73],"h\u2236":[74],"\u03a6n\u2192\u2102":[75]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}