{"id":"https://openalex.org/W7225429446","doi":"https://doi.org/10.5281/zenodo.24020904","title":"Distance from Structure: Hidden Forcing Across Nine Random Constraint Families, the Local/Global Split, and a Toolkit-Relative Measure of How Far a Problem Sits from the Structure Distinctness Needs","display_name":"Distance from Structure: Hidden Forcing Across Nine Random Constraint Families, the Local/Global Split, and a Toolkit-Relative Measure of How Far a Problem Sits from the Structure Distinctness Needs","publication_year":2026,"publication_date":"2026-11-06","ids":{"openalex":"https://openalex.org/W7225429446","doi":"https://doi.org/10.5281/zenodo.24020904"},"language":"en","primary_location":{"id":"doi:10.5281/zenodo.24020904","doi":"https://doi.org/10.5281/zenodo.24020904","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24020904","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.24020904","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5144319151","display_name":"Brian Spargur","orcid":"https://orcid.org/0009-0007-5416-3357","observed_orcids":["https://orcid.org/0009-0007-5416-3357"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Spargur, Brian","raw_affiliation_strings":["Independent researcher"],"raw_orcid":"https://orcid.org/0009-0007-5416-3357","affiliations":[{"raw_affiliation_string":"Independent researcher","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5144319151"],"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.9926999807357788,"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.9926999807357788,"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.006300000008195639,"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.0003000000142492354,"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-threshold","display_name":"satisfiability threshold","score":0.7480000257492065},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"constraint satisfaction","score":0.7519999742507935},{"id":"https://openalex.org/keywords/unit-propagation","display_name":"unit propagation","score":0.8500000238418579},{"id":"https://openalex.org/keywords/3-sat","display_name":"3-SAT","score":0.7379999756813049},{"id":"https://openalex.org/keywords/2-sat","display_name":"2-SAT","score":0.781000018119812},{"id":"https://openalex.org/keywords/hamiltonian-paths","display_name":"Hamiltonian paths","score":0.6990000009536743},{"id":"https://openalex.org/keywords/perfect-matchings","display_name":"perfect matchings","score":0.7870000004768372},{"id":"https://openalex.org/keywords/3-coloring","display_name":"3-coloring","score":0.8809999823570251},{"id":"https://openalex.org/keywords/gaussian-elimination","display_name":"Gaussian elimination","score":0.7450000047683716},{"id":"https://openalex.org/keywords/algebraic-attacks","display_name":"algebraic attacks","score":0.7870000004768372},{"id":"https://openalex.org/keywords/solver-selection","display_name":"solver selection","score":0.5299999713897705}],"concepts":[{"id":"https://openalex.org/C197115733","wikidata":"https://www.wikidata.org/wiki/Q1003136","display_name":"Forcing (mathematics)","level":2,"score":0.6538000106811523},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6276000142097473},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6161999702453613},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.45809999108314514},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4375},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.4291999936103821},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4237000048160553},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.40220001339912415},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.3991999924182892},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.357699990272522},{"id":"https://openalex.org/C137002209","wikidata":"https://www.wikidata.org/wiki/Q898521","display_name":"Hidden variable theory","level":3,"score":0.34310001134872437},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.3377000093460083},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.32850000262260437},{"id":"https://openalex.org/C23224414","wikidata":"https://www.wikidata.org/wiki/Q176769","display_name":"Hidden Markov model","level":2,"score":0.32679998874664307},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.3249000012874603},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3131999969482422},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.3005000054836273},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.29670000076293945},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.29660001397132874},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.2793000042438507},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.2754000127315521},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.27090001106262207},{"id":"https://openalex.org/C150591576","wikidata":"https://www.wikidata.org/wiki/Q739925","display_name":"Family of sets","level":3,"score":0.2685999870300293},{"id":"https://openalex.org/C21031990","wikidata":"https://www.wikidata.org/wiki/Q355020","display_name":"Probability measure","level":2,"score":0.26600000262260437},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.2630000114440918},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2535000145435333}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.5281/zenodo.24020904","doi":"https://doi.org/10.5281/zenodo.24020904","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24020904","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.24020905","doi":"https://doi.org/10.5281/zenodo.24020905","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24020905","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.24020904","doi":"https://doi.org/10.5281/zenodo.24020904","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.24020904","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2181787709","https://openalex.org/W1514397520","https://openalex.org/W7099863802","https://openalex.org/W610975628","https://openalex.org/W7145087069","https://openalex.org/W2941069689","https://openalex.org/W7065163257","https://openalex.org/W99286309","https://openalex.org/W3143943863","https://openalex.org/W2927082640"],"abstract_inverted_index":{"A":[0,242],"pre-registered":[1],"study":[2,244],"ran":[3],"231,000":[4],"random":[5],"instances":[6,247],"of":[7,42,56,74,153,166],"nine":[8],"constraint":[9],"families":[10,192],"(3-SAT,":[11],"4-SAT,":[12],"NAE-3SAT,":[13],"3-coloring,":[14],"3-XOR-SAT,":[15],"2-SAT,":[16],"Hamiltonian":[17,19],"path,":[18],"cycle":[20],"and":[21,32,54,139,180,209,234],"perfect":[22],"matching),":[23],"with":[24,81,92,201],"every":[25,52,207],"rule":[26,205],"frozen":[27],"before":[28],"an":[29,225],"instance":[30],"existed":[31],"the":[33,38,43,57,66,71,75,77,95,129,160,178,185,189,198],"analysis":[34],"run":[35],"once.":[36],"Near":[37],"satisfiability":[39],"threshold,":[40],"more":[41,55],"decisions":[44,59],"along":[45],"a":[46,100,148,151,164,167,173,196,210,219,231,236],"reference":[47],"search":[48],"are":[49,60,217],"forced,":[50],"in":[51,222],"family,":[53],"forced":[58],"hidden":[61,89,113,135,145],"from":[62,136,150,162,188],"unit":[63,137],"propagation.":[64],"Where":[65],"threshold":[67,96],"is":[68,97,134,147,170,248],"set":[69,98],"by":[70,99],"global":[72],"organization":[73],"solutions,":[76],"transition":[78],"window":[79],"narrows":[80],"size":[82],"and,":[83],"wherever":[84],"propagation":[85,138],"leaves":[86],"anything":[87],"hidden,":[88],"forcing":[90,133,146],"grows":[91,125],"size;":[93],"where":[94,224],"bounded":[101],"local":[102],"obstruction,":[103],"neither":[104],"happens.":[105],"3-XOR-SAT":[106],"read":[107],"as":[108,126,128],"flat":[109],"only":[110],"because":[111],"its":[112],"share":[114],"was":[115],"already":[116],"near":[117],"1;":[118],"on":[119,230,245],"scales":[120],"without":[121],"that":[122,169],"ceiling":[123],"it":[124],"fast":[127],"NP-complete":[130],"families.":[131],"Its":[132],"visible":[140],"to":[141,239],"Gaussian":[142],"elimination,":[143],"so":[144],"distance":[149,161],"toolkit":[152,197],"one":[154,204],"method.":[155],"The":[156],"note":[157],"then":[158],"defines":[159],"structure:":[163],"function":[165],"problem":[168,179,186],"zero":[171],"when":[172],"known":[174],"method":[175],"family":[176],"captures":[177],"otherwise":[181],"says":[182],"how":[183],"far":[184],"sits":[187],"structure":[190],"those":[191],"reach,":[193],"measured":[194],"against":[195],"definition":[199],"names,":[200],"algebra":[202],"counted,":[203],"for":[206],"problem,":[208],"stated":[211],"behavior":[212],"under":[213],"reductions.":[214],"Intended":[215],"uses":[216],"choosing":[218],"solver,":[220],"predicting":[221],"advance":[223],"AI":[226],"model":[227],"will":[228,252],"fail":[229],"constraint-type":[232],"task,":[233],"measuring":[235],"cipher's":[237],"exposure":[238],"algebraic":[240],"attack.":[241],"confirmatory":[243],"fresh":[246],"running;":[249],"version":[250],"2":[251],"report":[253],"it.":[254]},"counts_by_year":[],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2026-11-07T00:00:00"}