{"id":"https://openalex.org/W7147261431","doi":"https://doi.org/10.48550/arxiv.2603.27774","title":"Automated Reencoding Meets Graph Theory","display_name":"Automated Reencoding Meets Graph Theory","publication_year":2026,"publication_date":"2026-03-29","ids":{"openalex":"https://openalex.org/W7147261431","doi":"https://doi.org/10.48550/arxiv.2603.27774"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.27774","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.27774","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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.2603.27774","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009136134","display_name":"Benjamin Przybocki","orcid":"https://orcid.org/0009-0007-5489-1733"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Przybocki, Benjamin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030108071","display_name":"Bernardo Subercaseaux","orcid":"https://orcid.org/0000-0003-2295-1299"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Subercaseaux, Bernardo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5025921874","display_name":"Marijn J. H. Heule","orcid":"https://orcid.org/0000-0002-5587-8801"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Heule, Marijn J. H.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"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/T10142","display_name":"Formal Methods in Verification","score":0.5821999907493591,"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/T10142","display_name":"Formal Methods in Verification","score":0.5821999907493591,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.27570000290870667,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.023499999195337296,"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/preprocessor","display_name":"Preprocessor","score":0.6327000260353088},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5113000273704529},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5020999908447266},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.4968999922275543},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.42170000076293945},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.41119998693466187},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.41040000319480896},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3991999924182892}],"concepts":[{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.6327000260353088},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5113000273704529},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5020999908447266},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.4968999922275543},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46630001068115234},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.42170000076293945},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4138000011444092},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.41119998693466187},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.41040000319480896},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3991999924182892},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39750000834465027},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3912999927997589},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3659999966621399},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35370001196861267},{"id":"https://openalex.org/C169272836","wikidata":"https://www.wikidata.org/wiki/Q5668307","display_name":"Variable elimination","level":3,"score":0.34700000286102295},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.33719998598098755},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.3260999917984009},{"id":"https://openalex.org/C178481205","wikidata":"https://www.wikidata.org/wiki/Q5164372","display_name":"Constraint graph","level":5,"score":0.30149999260902405},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.2904999852180481},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28690001368522644},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.2824999988079071},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.28189998865127563},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.26739999651908875},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.25600001215934753}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.27774","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.27774","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.27774","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.27774","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Bounded":[0],"Variable":[1],"Addition":[2],"(BVA)":[3],"is":[4,143],"a":[5,16,109,138,190,199],"central":[6],"preprocessing":[7,51,62,91],"method":[8,106],"in":[9,184],"modern":[10],"state-of-the-art":[11],"SAT":[12],"solvers.":[13],"We":[14,53],"provide":[15],"graph-theoretic":[17,174],"characterization":[18,175],"of":[19,44,168,176,195],"which":[20,158],"2-CNF":[21,70,78,206],"encodings":[22],"can":[23,67,107],"be":[24,163],"constructed":[25,164],"by":[26,145,165],"an":[27,76],"idealized":[28,56,127],"BVA":[29,45,128,166,177,196],"algorithm.":[30],"Based":[31],"on":[32,121,203],"this":[33,131,150],"insight,":[34],"we":[35,85,124,141],"prove":[36,125,142],"new":[37],"results":[38],"about":[39],"the":[40,89,92,114,118,153,169],"behavior":[41],"and":[42,46,102],"limitations":[43],"its":[47],"interaction":[48],"with":[49,72,80],"other":[50,115],"techniques.":[52],"show":[54,86],"that":[55,87,103,126,140,152,197],"BVA,":[57],"plus":[58],"some":[59],"minor":[60],"additional":[61,90],"(e.g.,":[63],"equivalent":[64,77],"literal":[65],"substitution),":[66],"reencode":[68,130],"any":[69],"formula":[71,79],"$n$":[73,122],"variables":[74],"into":[75],"$(\\tfrac{\\lg(3)}{4}+o(1))\\,\\tfrac{n^2}{\\lg":[81],"n}$":[82],"clauses.":[83],"Furthermore,":[84],"without":[88],"constant":[93,110],"factor":[94],"worsens":[95],"from":[96],"$\\tfrac{\\lg(3)}{4}":[97],"\\approx":[98],"0.396$":[99],"to":[100,180,188],"$1$,":[101],"no":[104],"reencoding":[105],"achieve":[108],"below":[111],"$0.25$.":[112],"On":[113],"hand,":[116],"for":[117,156],"at-most-one":[119],"constraint":[120,132],"variables,":[123],"cannot":[129,162],"using":[133],"fewer":[134],"than":[135],"$3n-6$":[136],"clauses,":[137,161],"bound":[139],"achieved":[144],"actual":[146],"implementations.":[147],"In":[148],"particular,":[149],"shows":[151],"product":[154],"encoding":[155],"at-most-one,":[157],"uses":[159],"$2n+o(n)$":[160],"regardless":[167],"heuristics":[170],"used.":[171],"Finally,":[172],"our":[173],"allows":[178],"us":[179],"leverage":[181],"recent":[182],"work":[183],"algorithmic":[185],"graph":[186],"theory":[187],"develop":[189],"drastically":[191],"more":[192],"efficient":[193],"implementation":[194],"achieves":[198],"comparable":[200],"clause":[201],"reduction":[202],"random":[204],"monotone":[205],"formulas.":[207]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-02T00:00:00"}