{"id":"https://openalex.org/W7128715363","doi":"https://doi.org/10.48550/arxiv.2602.10368","title":"New Algorithms and Hardness Results for Robust Satisfiability of (Promise) CSPs","display_name":"New Algorithms and Hardness Results for Robust Satisfiability of (Promise) CSPs","publication_year":2026,"publication_date":"2026-02-10","ids":{"openalex":"https://openalex.org/W7128715363","doi":"https://doi.org/10.48550/arxiv.2602.10368"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2602.10368","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.10368","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":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2602.10368","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028220417","display_name":"Joshua Brakensiek","orcid":"https://orcid.org/0000-0003-4149-7298"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Brakensiek, Joshua","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125732649","display_name":"Lorenzo Ciardo","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ciardo, Lorenzo","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125744234","display_name":"Venkatesan Guruswami","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guruswami, Venkatesan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053469573","display_name":"Aaron Potechin","orcid":"https://orcid.org/0009-0008-8205-1608"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Potechin, Aaron","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5109045834","display_name":"Stanislas Zivny","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"\u017divn\u00fd, Stanislav","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5028220417"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.5845999717712402,"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.5845999717712402,"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.2567000091075897,"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/T10142","display_name":"Formal Methods in Verification","score":0.03909999877214432,"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/satisfiability","display_name":"Satisfiability","score":0.6909000277519226},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.5756000280380249},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.490200012922287},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.48570001125335693},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.47099998593330383},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.4616999924182892},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.3614000082015991},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.32179999351501465}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6909000277519226},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6662999987602234},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5827000141143799},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.5756000280380249},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.490200012922287},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.48570001125335693},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.47099998593330383},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.4616999924182892},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4593000113964081},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4431000053882599},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3614000082015991},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.32179999351501465},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.3165000081062317},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.31630000472068787},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.31279999017715454},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3118000030517578},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.2924000024795532},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.27799999713897705},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27730000019073486},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.27059999108314514},{"id":"https://openalex.org/C152062344","wikidata":"https://www.wikidata.org/wiki/Q818888","display_name":"Computability","level":2,"score":0.2639000117778778},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.25699999928474426},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2547000050544739}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2602.10368","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.10368","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":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2602.10368","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.10368","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":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.7485812306404114}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,38,96,190],"continue":[4],"the":[5,27,31,45,62,67,71,81,104,109,118,124,131,136,143,175,182,193,206,215],"study":[6],"of":[7,10,73,103,111,117,145,168,184,208,214,231],"robust":[8,177,201,212],"satisfiability":[9,178],"promise":[11],"CSPs":[12,221],"(PCSPs),":[13],"initiated":[14],"in":[15,55,78],"(Brakensiek,":[16],"Guruswami,":[17],"Sandeep,":[18],"STOC":[19],"2023":[20],"/":[21],"Discrete":[22],"Analysis":[23],"2025),":[24],"and":[25,129,211],"obtain":[26],"following":[28],"results:":[29],"For":[30,88],"PCSP":[32,91],"1-in-3-SAT":[33],"vs":[34],"NAE-SAT":[35],"with":[36,142,156],"negations,":[37],"prove":[39,172],"that":[40,61,92,173],"it":[41],"is":[42,76,162,179],"hard,":[43],"under":[44,135,181],"Unique":[46],"Games":[47],"conjecture":[48],"(UGC),":[49],"to":[50,80,151,200,223],"satisfy":[51],"$1-\u03a9(1/\\log":[52],"(1/\u03b5))$":[53],"constraints":[54,106],"a":[56,157,166,188,209],"$(1-\u03b5)$-satisfiable":[57],"instance.":[58],"This":[59,121],"shows":[60],"exponential":[63],"loss":[64,83,144],"incurred":[65],"by":[66],"BGS":[68],"algorithm":[69,99,126,139,219],"for":[70,85,127,197,220],"case":[72],"Alternating-Threshold":[74],"polymorphisms":[75],"necessary,":[77],"contrast":[79],"polynomial":[82],"achievable":[84],"Majority":[86,94],"polymorphisms.":[87,170],"any":[89],"Boolean":[90],"admits":[93],"polymorphisms,":[95],"give":[97],"an":[98,112,146],"satisfying":[100,114],"$1-O(\\sqrt\u03b5)$":[101],"fraction":[102,116],"weaker":[105],"when":[107],"promised":[108],"existence":[110],"assignment":[113],"$1-\u03b5$":[115],"stronger":[119],"constraints.":[120,186],"significantly":[122],"generalizes":[123],"Charikar--Makarychev--Makarychev":[125],"2-SAT,":[128],"matches":[130],"optimal":[132],"trade-off":[133],"possible":[134],"UGC.":[137],"The":[138,203],"also":[140],"extends,":[141],"extra":[147],"$\\log":[148],"(1/\u03b5)$":[149],"factor,":[150],"PCSPs":[152,199],"on":[153],"larger":[154],"domains":[155],"certain":[158],"structural":[159],"condition,":[160],"which":[161,228],"implied":[163],"by,":[164],"e.g.,":[165],"family":[167],"Plurality":[169],"We":[171],"assuming":[174],"UGC,":[176],"preserved":[180],"addition":[183],"equality":[185],"As":[187],"consequence,":[189],"can":[191],"extend":[192],"rich":[194],"algebraic":[195],"techniques":[196],"decision/search":[198],"PCSPs.":[202],"methods":[204],"involve":[205],"development":[207],"correlated":[210],"version":[213],"general":[216],"SDP":[217],"rounding":[218],"due":[222],"(Brown-Cohen,":[224],"Raghavendra,":[225],"ICALP":[226],"2016),":[227],"might":[229],"be":[230],"independent":[232],"interest.":[233]},"counts_by_year":[],"updated_date":"2026-02-13T13:40:29.240086","created_date":"2026-02-13T00:00:00"}