{"id":"https://openalex.org/W7225318864","doi":"https://doi.org/10.5281/zenodo.23991293","title":"A Parsimonious Reduction from #SAT to Motif-Avoidant Attractors in Bounded-Fan-In AND-NOT Boolean Networks","display_name":"A Parsimonious Reduction from #SAT to Motif-Avoidant Attractors in Bounded-Fan-In AND-NOT Boolean Networks","publication_year":2026,"publication_date":"2026-11-06","ids":{"openalex":"https://openalex.org/W7225318864","doi":"https://doi.org/10.5281/zenodo.23991293"},"language":"en","primary_location":{"id":"doi:10.5281/zenodo.23991293","doi":"https://doi.org/10.5281/zenodo.23991293","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23991293","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.23991293","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5146382536","display_name":"Kias Henry","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Henry, Kias","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5146382536"],"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/T10374","display_name":"Advanced Graph Theory Research","score":0.2750999927520752,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.2750999927520752,"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.2012999951839447,"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/T11567","display_name":"semigroups and automata theory","score":0.14640000462532043,"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/sat","display_name":"SAT","score":0.8389999866485596},{"id":"https://openalex.org/keywords/boolean-networks","display_name":"Boolean networks","score":0.7490000128746033},{"id":"https://openalex.org/keywords/counting-complexity","display_name":"counting complexity","score":0.6639999747276306},{"id":"https://openalex.org/keywords/p-hardness","display_name":"#P-hardness","score":0.9869999885559082},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.9779999852180481},{"id":"https://openalex.org/keywords/strongly-connected-components","display_name":"strongly connected components","score":0.7039999961853027},{"id":"https://openalex.org/keywords/asynchronous-boolean-networks","display_name":"asynchronous Boolean networks","score":0.5339999794960022}],"concepts":[{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6290000081062317},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6207000017166138},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.6115000247955322},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5787000060081482},{"id":"https://openalex.org/C164380108","wikidata":"https://www.wikidata.org/wiki/Q507187","display_name":"Attractor","level":2,"score":0.5756000280380249},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.5407000184059143},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4564000070095062},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43389999866485596},{"id":"https://openalex.org/C168167062","wikidata":"https://www.wikidata.org/wiki/Q1117970","display_name":"Component (thermodynamics)","level":2,"score":0.4108000099658966},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38519999384880066},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.3718999922275543},{"id":"https://openalex.org/C134444547","wikidata":"https://www.wikidata.org/wiki/Q585230","display_name":"Boolean network","level":3,"score":0.36390000581741333},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.3456999957561493},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3393999934196472},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.3386000096797943},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3377000093460083},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.30869999527931213},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.30410000681877136},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.2987000048160553},{"id":"https://openalex.org/C153658351","wikidata":"https://www.wikidata.org/wiki/Q746264","display_name":"Constant function","level":3,"score":0.2980000078678131},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.2978000044822693},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2935999929904938},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.29330000281333923},{"id":"https://openalex.org/C2779664074","wikidata":"https://www.wikidata.org/wiki/Q3518405","display_name":"Terminal (telecommunication)","level":2,"score":0.2752000093460083},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.2687000036239624},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.25940001010894775},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.25920000672340393},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.2581000030040741},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.2524999976158142}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.5281/zenodo.23991293","doi":"https://doi.org/10.5281/zenodo.23991293","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23991293","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.23991294","doi":"https://doi.org/10.5281/zenodo.23991294","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23991294","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.23991293","doi":"https://doi.org/10.5281/zenodo.23991293","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23991293","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/W4414360479","https://openalex.org/W6968254940","https://openalex.org/W1975274391","https://openalex.org/W2166214692","https://openalex.org/W2953062976","https://openalex.org/W2277731820","https://openalex.org/W2113446372","https://openalex.org/W4411253946","https://openalex.org/W425577271","https://openalex.org/W4386548873"],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2],"explicit":[3],"polynomial-time":[4],"parsimonious":[5],"reduction":[6],"from":[7],"#SAT":[8],"to":[9],"counting":[10,75],"motif-avoidant":[11,76],"attractors":[12,77],"of":[13,26,44,74,80],"asynchronous":[14],"Boolean":[15],"networks.":[16],"Every":[17],"update":[18],"function":[19],"is":[20],"a":[21,24],"constant":[22],"or":[23],"conjunction":[25],"at":[27],"most":[28],"two":[29,45],"signed":[30],"literals,":[31],"and":[32,68,78,111],"the":[33,52,94,105],"interaction":[34],"graph":[35],"has":[36],"exactly":[37],"one":[38],"nontrivial":[39],"strongly":[40,65],"connected":[41,66],"component":[42],"consisting":[43],"vertices.":[46],"For":[47],"every":[48],"CNF":[49],"formula":[50],"\u03c6,":[51],"constructed":[53],"network":[54,87],"satisfies":[55],"#MAA(N\u03c6)":[56],"=":[57],"#SAT(\u03c6).":[58],"The":[59,100],"proof":[60],"classifies":[61],"both":[62],"terminal":[63],"state-transition":[64],"components":[67],"minimal":[69],"trap":[70],"subcubes,":[71],"establishing":[72],"#P-hardness":[73],"NP-hardness":[79],"deciding":[81],"their":[82],"existence":[83],"within":[84],"this":[85],"restricted":[86],"class.":[88],"Independent":[89],"exact":[90],"finite-state":[91],"implementations":[92],"check":[93],"construction":[95],"on":[96],"representative":[97],"small":[98],"formulas.":[99],"accompanying":[101],"source":[102],"archive":[103],"includes":[104],"LaTeX":[106],"manuscript,":[107],"verification":[108],"code,":[109],"logs":[110],"checksums.":[112]},"counts_by_year":[],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-11-06T00:00:00"}