{"id":"https://openalex.org/W4407781305","doi":"https://doi.org/10.1145/3635117","title":"New Spectral Algorithms for Refuting Smoothed k-SAT","display_name":"New Spectral Algorithms for Refuting Smoothed k-SAT","publication_year":2025,"publication_date":"2025-02-20","ids":{"openalex":"https://openalex.org/W4407781305","doi":"https://doi.org/10.1145/3635117"},"language":"en","primary_location":{"id":"doi:10.1145/3635117","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3635117","pdf_url":null,"source":{"id":"https://openalex.org/S103482838","display_name":"Communications of the ACM","issn_l":"0001-0782","issn":["0001-0782","1557-7317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068388812","display_name":"Venkatesan Guruswami","orcid":"https://orcid.org/0000-0001-7926-3396"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Venkatesan Guruswami","raw_affiliation_strings":["University of California, Berkeley, Berkeley, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Berkeley, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068103506","display_name":"Pravesh K. Kothari","orcid":"https://orcid.org/0000-0002-8689-6770"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pravesh K. Kothari","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103039175","display_name":"Peter Manohar","orcid":"https://orcid.org/0000-0002-0732-5073"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Peter Manohar","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5068388812"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03159234,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"68","issue":"3","first_page":"83","last_page":"91"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9858999848365784,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9858999848365784,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9812999963760376,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9769999980926514,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6284924745559692},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5667755007743835},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.33253347873687744}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6284924745559692},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5667755007743835},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.33253347873687744}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3635117","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3635117","pdf_url":null,"source":{"id":"https://openalex.org/S103482838","display_name":"Communications of the ACM","issn_l":"0001-0782","issn":["0001-0782","1557-7317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications of the ACM","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W124285993","https://openalex.org/W1528312239","https://openalex.org/W1537654681","https://openalex.org/W2031364557","https://openalex.org/W2033490419","https://openalex.org/W2058374373","https://openalex.org/W2118625817","https://openalex.org/W2122140789","https://openalex.org/W2345432430","https://openalex.org/W2401610261","https://openalex.org/W2574497079","https://openalex.org/W2972186810","https://openalex.org/W3038905491","https://openalex.org/W3085317570","https://openalex.org/W3196550748","https://openalex.org/W4210698013","https://openalex.org/W4210731599","https://openalex.org/W4316652375","https://openalex.org/W4376639534","https://openalex.org/W4377967930","https://openalex.org/W4380886056","https://openalex.org/W4399522666"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109"],"abstract_inverted_index":{"Despite":[0],"being":[1],"a":[2,6,72,120,148],"quintessential":[3],"example":[4],"of":[5,18,48,65,83,112,125,147,151,156],"hard":[7],"problem,":[8],"the":[9,49,76,106,145,154],"quest":[10],"for":[11,15,45,91,105],"finding":[12],"fast":[13],"algorithms":[14,40,90],"deciding":[16],"satisfiability":[17],"propositional":[19],"formulas":[20],"has":[21],"occupied":[22],"computer":[23],"scientists":[24],"both":[25],"in":[26,29,133,159],"theory":[27,135],"and":[28,68,80,109,122,136],"practice.":[30],"In":[31],"this":[32],"article,":[33],"we":[34,142],"survey":[35],"recent":[36],"progress":[37],"on":[38,127,153],"designing":[39],"with":[41,100],"strong":[42],"refutation":[43],"guarantees":[44,101],"smoothed":[46,92],"instances":[47,58,99],"<mml:math":[50,93],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[51,94],"display=\"inline\">":[52,95],"<mml:mi>k</mml:mi>":[53,96],"</mml:math>":[54,97],"-SAT":[55,98],"problem.":[56],"Smoothed":[57],"are":[59],"formed":[60],"by":[61],"slight":[62],"random":[63,113],"perturbations":[64],"arbitrary":[66],"instances,":[67],"their":[69],"study":[70],"is":[71],"way":[73],"to":[74,119],"bridge":[75],"gap":[77],"between":[78],"worst-case":[79],"average-case":[81],"models":[82],"problem":[84],"instances.":[85],"Our":[86],"methods":[87],"yield":[88],"new":[89],"that":[102],"match":[103],"those":[104],"significantly":[107],"simpler":[108],"well-studied":[110],"model":[111],"formulas.":[114],"Additionally,":[115],"they":[116],"have":[117],"led":[118],"novel":[121],"unexpected":[123],"line":[124],"attack":[126],"some":[128],"longstanding":[129],"extremal":[130],"combinatorial":[131],"problems":[132],"graph":[134],"coding":[137],"theory.":[138],"As":[139],"an":[140],"example,":[141],"will":[143],"discuss":[144],"resolution":[146],"2008":[149],"conjecture":[150],"Feige":[152],"existence":[155],"short":[157],"cycles":[158],"hypergraphs.":[160]},"counts_by_year":[],"updated_date":"2025-12-28T23:10:05.387466","created_date":"2025-10-10T00:00:00"}