{"id":"https://openalex.org/W7162004326","doi":"https://doi.org/10.48550/arxiv.2605.20328","title":"Targeting Clause Type Distributions: a Picklock for Random Satisfiability Problems","display_name":"Targeting Clause Type Distributions: a Picklock for Random Satisfiability Problems","publication_year":2026,"publication_date":"2026-05-19","ids":{"openalex":"https://openalex.org/W7162004326","doi":"https://doi.org/10.48550/arxiv.2605.20328"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.20328","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.20328","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.20328","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5114739589","display_name":"J. Schwardt","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Schwardt, J.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5136719200","display_name":"J. C. Budich","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Budich, J. C.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.26820001006126404,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.26820001006126404,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.11540000140666962,"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/T10591","display_name":"Theoretical and Computational Physics","score":0.11129999905824661,"subfield":{"id":"https://openalex.org/subfields/3104","display_name":"Condensed Matter Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6194999814033508},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.4887999892234802},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.436599999666214},{"id":"https://openalex.org/keywords/ising-model","display_name":"Ising model","score":0.42980000376701355},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4075999855995178},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.396699994802475},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.3912999927997589},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.35510000586509705},{"id":"https://openalex.org/keywords/random-search","display_name":"Random search","score":0.3479999899864197}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6194999814033508},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.4887999892234802},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4715999960899353},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.436599999666214},{"id":"https://openalex.org/C51329190","wikidata":"https://www.wikidata.org/wiki/Q1076349","display_name":"Ising model","level":2,"score":0.42980000376701355},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41609999537467957},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4075999855995178},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.399399995803833},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.396699994802475},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.3912999927997589},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.35510000586509705},{"id":"https://openalex.org/C126661757","wikidata":"https://www.wikidata.org/wiki/Q4925641","display_name":"Random search","level":2,"score":0.3479999899864197},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34689998626708984},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.3384000062942505},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.3377000093460083},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3285999894142151},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3188000023365021},{"id":"https://openalex.org/C148220186","wikidata":"https://www.wikidata.org/wiki/Q7111912","display_name":"Outcome (game theory)","level":2,"score":0.3125},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3091000020503998},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.29490000009536743},{"id":"https://openalex.org/C114289077","wikidata":"https://www.wikidata.org/wiki/Q3284399","display_name":"Statistical model","level":2,"score":0.29339998960494995},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2883000075817108},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.287200003862381},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.2815999984741211},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.2709999978542328},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.2703999876976013},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.2687999904155731},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.25839999318122864},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.25679999589920044},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.25099998712539673}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.20328","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.20328","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.20328","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.20328","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.7785234451293945}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Optimization":[0],"problems":[1,32,196],"such":[2],"as":[3,33],"the":[4,12,45,53,78,85,90,111,115,130,159,181,187,191,199],"NP-complete":[5],"3-SAT":[6,31],"provide":[7],"an":[8,94],"important":[9],"benchmark":[10],"for":[11,73],"difficult":[13],"task":[14],"of":[15,29,47,55,60,102,114,165,201],"finding":[16],"ground-states":[17],"in":[18,37,89,98,110,121,163,180,189],"strongly":[19],"correlated":[20],"many-body":[21],"systems":[22],"with":[23,93],"rugged":[24],"energy":[25],"landscapes.":[26],"The":[27],"study":[28],"random":[30,194],"Ising":[34],"spin":[35],"Hamiltonians":[36],"statistical":[38,107],"physics":[39],"has":[40,70],"yielded":[41],"major":[42],"insights":[43],"including":[44],"existence":[46],"a":[48,56,99,127,152,166],"satisfiability":[49,195],"phase":[50],"transition,":[51],"and":[52],"prediction":[54],"critical":[57,161],"parameter":[58,132,183],"line":[59,162],"particularly":[61],"hard":[62],"instances.":[63],"Yet,":[64],"progress":[65],"on":[66],"solving":[67,190],"those":[68],"instances":[69],"been":[71],"scarce":[72],"several":[74],"decades.":[75],"Here,":[76],"introducing":[77],"Target-SAT":[79],"(TSAT)":[80],"algorithm,":[81],"we":[82,157],"roughly":[83],"triple":[84],"tractable":[86],"problem":[87],"sizes":[88,149],"hardest":[91,192],"regime,":[92],"even":[95],"greater":[96],"improvement":[97],"vast":[100,153],"range":[101],"neighboring":[103],"regions.":[104],"By":[105],"leveraging":[106],"information":[108],"hidden":[109],"combinatorial":[112],"constraints":[113],"problem,":[116],"TSAT":[117,178],"is":[118,174],"actively":[119],"guided":[120],"its":[122],"stochastic":[123,202],"local":[124,140,203],"search":[125,141,204],"toward":[126],"target":[128],"within":[129],"relevant":[131],"space.":[133,184],"Our":[134],"analysis":[135],"also":[136],"explains":[137],"why":[138],"established":[139],"algorithms":[142],"are":[143],"limited":[144],"to":[145,151,198],"relatively":[146],"small":[147],"system":[148],"due":[150],"low-energy":[154],"trap.":[155],"Furthermore,":[156],"characterize":[158],"aforementioned":[160],"terms":[164],"dominant":[167],"additional":[168],"complexity":[169],"barrier,":[170],"whose":[171],"exponential":[172],"scaling":[173],"quickly":[175],"overcome":[176],"by":[177],"only":[179],"surrounding":[182],"With":[185],"TSAT,":[186],"lead":[188],"known":[193],"returns":[197],"realm":[200],"algorithms.":[205]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-22T00:00:00"}