{"id":"https://openalex.org/W7225403489","doi":"https://doi.org/10.5281/zenodo.24011060","title":"A Deterministic Linear-Time Framework for 3SAT via Local Sieve and Additive Backtracking","display_name":"A Deterministic Linear-Time Framework for 3SAT via Local Sieve and Additive Backtracking","publication_year":2026,"publication_date":"2026-11-06","ids":{"openalex":"https://openalex.org/W7225403489","doi":"https://doi.org/10.5281/zenodo.24011060"},"language":"en","primary_location":{"id":"doi:10.5281/zenodo.24011060","doi":"https://doi.org/10.5281/zenodo.24011060","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24011060","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"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":"Preprint"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.5281/zenodo.24011060","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5158414403","display_name":"Rudra Jana","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jana, Rudra","raw_affiliation_strings":["Independent Researcher"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Independent Researcher","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5158414403"],"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9829000234603882,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9829000234603882,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.010999999940395355,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0038999998942017555,"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/3-sat","display_name":"3-SAT","score":0.9929999709129333},{"id":"https://openalex.org/keywords/connected-components","display_name":"connected components","score":0.7540000081062317},{"id":"https://openalex.org/keywords/unit-propagation","display_name":"unit propagation","score":0.8690000176429749},{"id":"https://openalex.org/keywords/backtracking","display_name":"backtracking","score":0.42100000381469727},{"id":"https://openalex.org/keywords/complexity-bounds","display_name":"complexity bounds","score":0.32199999690055847}],"concepts":[{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.714900016784668},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6128000020980835},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.522599995136261},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5019999742507935},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39570000767707825},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39500001072883606},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.376800000667572},{"id":"https://openalex.org/C143936061","wikidata":"https://www.wikidata.org/wiki/Q2030088","display_name":"DPLL algorithm","level":4,"score":0.37279999256134033},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.3626999855041504},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35499998927116394},{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.3449999988079071},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.3427000045776367},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.34130001068115234},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.3310000002384186},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.32019999623298645},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.31839999556541443},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.31709998846054077},{"id":"https://openalex.org/C34146451","wikidata":"https://www.wikidata.org/wiki/Q5048094","display_name":"Cascade","level":2,"score":0.3131999969482422},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.31150001287460327},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.28870001435279846},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.28200000524520874},{"id":"https://openalex.org/C147297375","wikidata":"https://www.wikidata.org/wiki/Q6674930","display_name":"Look-ahead","level":2,"score":0.27900001406669617},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2759999930858612},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.2667999863624573},{"id":"https://openalex.org/C43521106","wikidata":"https://www.wikidata.org/wiki/Q2165493","display_name":"Pipeline (software)","level":2,"score":0.2632000148296356},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.2630000114440918},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.25040000677108765}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.5281/zenodo.24011060","doi":"https://doi.org/10.5281/zenodo.24011060","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24011060","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"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":"Preprint"},{"id":"doi:10.5281/zenodo.24011061","doi":"https://doi.org/10.5281/zenodo.24011061","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24011061","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"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":"Preprint"}],"best_oa_location":{"id":"doi:10.5281/zenodo.24011060","doi":"https://doi.org/10.5281/zenodo.24011060","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24011060","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"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":"Preprint"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7221473118","https://openalex.org/W7129001100","https://openalex.org/W7096428179","https://openalex.org/W2156223756","https://openalex.org/W7118159614","https://openalex.org/W1583135763","https://openalex.org/W1509587667","https://openalex.org/W7164136666","https://openalex.org/W4293566921","https://openalex.org/W2005599008"],"abstract_inverted_index":{"Overview":[0],"This":[1],"repository":[2],"contains":[3],"the":[4,24,27,90,119,174,203,215,226,266,269,301],"formal":[5],"proof":[6],"and":[7,53],"algorithmic":[8],"framework":[9,25,171],"for":[10,16],"a":[11,81,94,107,113,151,159,190,198,290],"deterministic,":[12,291],"linear-time":[13],"resolution":[14],"strategy":[15],"3SAT":[17,42],"instances.":[18],"By":[19],"exploiting":[20],"high-density":[21],"clause":[22,76,181],"intersections,":[23],"bypasses":[26],"traditional":[28,302],"exponential":[29,303],"branching":[30],"cascades":[31],"($O(2^n)$)":[32],"typical":[33],"of":[34,93,161,228,258,268,295],"standard":[35],"satisfiability":[36],"solvers.":[37],"The":[38,58,170,241,255],"methodology":[39],"decomposes":[40],"complex":[41],"instances":[43],"into":[44,75,202],"structured,":[45],"localized":[46,193],"components":[47,92],"where":[48],"variable":[49,194],"states":[50],"are":[51,73,144,183],"restricted":[52],"resolved":[54,145],"additively.":[55],"Core":[56],"Architecture":[57],"proposed":[59],"pipeline":[60],"operates":[61],"over":[62,127],"three":[63],"distinct,":[64],"deterministic":[65],"phases:":[66],"1.":[67],"High-Density":[68],"Connected":[69],"Components:":[70],"Input":[71],"clauses":[72,131],"partitioned":[74],"groups":[77,182],"($\\mathcal{G}$)":[78],"based":[79],"on":[80],"strict":[82,221],"minimum":[83],"$2$-variable":[84,114],"overlap":[85],"constraint,":[86],"mathematically":[87],"mapping":[88],"onto":[89],"connected":[91],"clause-intersection":[95],"graph.":[96],"2.":[97],"Local":[98],"Structural":[99],"Sieve":[100],"&":[101,208],"Unit":[102],"Propagation:":[103],"For":[104],"each":[105],"component,":[106],"static":[108],"structural":[109],"metric":[110],"deterministically":[111,146],"selects":[112],"pivot":[115],"backbone":[116],"($V_c$).":[117],"Evaluating":[118],"$4$":[120,162],"invariant":[121],"configurations":[122],"($\\text{TT,":[123],"TF,":[124],"FT,":[125],"FF}$)":[126],"$V_c$":[128],"either":[129],"satisfies":[130],"directly":[132],"or":[133],"cleanly":[134],"reduces":[135],"them":[136],"to":[137,186,225,249],"single-literal":[138],"unit":[139],"clauses.":[140],"Remaining":[141],"isolated":[142],"variables":[143],"via":[147],"**unit":[148],"propagation**,":[149],"populating":[150],"pre-filtered":[152],"local":[153,176,216],"solution":[154],"list":[155],"($\\mathcal{S}_G$)":[156],"capped":[157],"at":[158,188],"maximum":[160,256],"valid":[163],"profiles.":[164],"3.":[165],"Sequential":[166],"Additive":[167],"Global":[168],"Synthesis:":[169],"sequentially":[172],"reconciles":[173],"filtered":[175],"lists.":[177],"Crucially,":[178],"because":[179],"distinct":[180],"structurally":[184,247,299],"proven":[185,248],"share":[187],"most":[189],"single":[191],"variable,":[192],"mismatches":[195],"cannot":[196],"trigger":[197],"geometric":[199],"backtracking":[200,244,259],"cascade":[201],"past":[204],"history.":[205],"Key":[206],"Breakthroughs":[207],"Complexity":[209],"Bounds":[210],"Phase":[211,238],"1":[212],"Complexity:":[213,240],"Constructing":[214],"sieved":[217],"lists":[218],"executes":[219],"in":[220],"linear":[222],"time":[223],"relative":[224],"number":[227,257],"input":[229],"clauses:":[230],"$T_{\\text{Phase":[231],"1}}":[232],"=":[233,236,281],"\\sum":[234,275],"O(|G_i|)":[235],"O(m)$.":[237],"2":[239],"global":[242,292],"synthesis":[243],"mechanism":[245],"is":[246,262],"behave":[250],"additively":[251],"rather":[252],"than":[253],"multiplicatively.":[254],"steps":[260],"($B$)":[261],"strictly":[263],"bounded":[264],"by":[265],"summation":[267],"alternative":[270],"pool":[271],"choices:":[272],"$B":[273],"\\le":[274,279],"(S_i":[276],"-":[277],"1)":[278],"3k":[280],"O(k)$.":[282],"Complete":[283],"Linear":[284],"Resolution:":[285],"Combining":[286],"both":[287],"phases":[288],"establishes":[289],"runtime":[293],"bound":[294],"$O(n":[296],"+":[297],"m)$,":[298],"flattening":[300],"search":[304],"tree.":[305]},"counts_by_year":[],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2026-11-07T00:00:00"}