{"id":"https://openalex.org/W7225320067","doi":"https://doi.org/10.5281/zenodo.23991141","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/W7225320067","doi":"https://doi.org/10.5281/zenodo.23991141"},"language":"en","primary_location":{"id":"doi:10.5281/zenodo.23991141","doi":"https://doi.org/10.5281/zenodo.23991141","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23991141","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.23991141","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.42820000648498535,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.42820000648498535,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.3513000011444092,"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.04619999974966049,"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.8420000076293945},{"id":"https://openalex.org/keywords/boolean-networks","display_name":"Boolean networks","score":0.8019999861717224},{"id":"https://openalex.org/keywords/counting-complexity","display_name":"counting complexity","score":0.5929999947547913},{"id":"https://openalex.org/keywords/p-hardness","display_name":"#P-hardness","score":0.9610000252723694},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.9879999756813049},{"id":"https://openalex.org/keywords/strongly-connected-components","display_name":"strongly connected components","score":0.7450000047683716},{"id":"https://openalex.org/keywords/asynchronous-boolean-networks","display_name":"asynchronous Boolean networks","score":0.5049999952316284}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6987000107765198},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6075999736785889},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5449000000953674},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.4690000116825104},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.41769999265670776},{"id":"https://openalex.org/C164380108","wikidata":"https://www.wikidata.org/wiki/Q507187","display_name":"Attractor","level":2,"score":0.39070001244544983},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.3864000141620636},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3801000118255615},{"id":"https://openalex.org/C168167062","wikidata":"https://www.wikidata.org/wiki/Q1117970","display_name":"Component (thermodynamics)","level":2,"score":0.3781999945640564},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36340001225471497},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35530000925064087},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.3537999987602234},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.3449000120162964},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.3353999853134155},{"id":"https://openalex.org/C81518389","wikidata":"https://www.wikidata.org/wiki/Q5156447","display_name":"Complete Boolean algebra","level":5,"score":0.3294999897480011},{"id":"https://openalex.org/C2778738651","wikidata":"https://www.wikidata.org/wiki/Q16546687","display_name":"Novelty","level":2,"score":0.3203999996185303},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.3160000145435333},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31150001287460327},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3027999997138977},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.3018999993801117},{"id":"https://openalex.org/C134444547","wikidata":"https://www.wikidata.org/wiki/Q585230","display_name":"Boolean network","level":3,"score":0.2953999936580658},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.2921000123023987},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.28630000352859497},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.27790001034736633},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.274399995803833},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.2655999958515167},{"id":"https://openalex.org/C59656382","wikidata":"https://www.wikidata.org/wiki/Q191536","display_name":"Conjunction (astronomy)","level":2,"score":0.25609999895095825},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.25600001215934753},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.25369998812675476},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.25369998812675476}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.5281/zenodo.23991141","doi":"https://doi.org/10.5281/zenodo.23991141","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23991141","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.23991141","doi":"https://doi.org/10.5281/zenodo.23991141","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.23991141","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/W6968254940","https://openalex.org/W4414360479","https://openalex.org/W1975274391","https://openalex.org/W4411253946","https://openalex.org/W2113446372","https://openalex.org/W2166214692","https://openalex.org/W2277731820","https://openalex.org/W4386548873","https://openalex.org/W2002305467","https://openalex.org/W2953062976"],"abstract_inverted_index":{"We":[0,49],"construct":[1],"an":[2],"explicit":[3],"polynomial-time":[4],"parsimonious":[5],"reduction":[6],"from":[7],"#SAT":[8],"to":[9],"counting":[10,67],"motif-avoidant":[11],"attractors":[12],"of":[13,22,41,99],"asynchronous":[14],"Boolean":[15],"networks.":[16],"Each":[17],"update":[18],"is":[19,68,74,95,106],"a":[20,29,97],"conjunction":[21],"at":[23],"most":[24],"two":[25,47],"signed":[26],"literals":[27],"or":[28],"constant,":[30],"and":[31,60,70,103,120],"the":[32,82,114],"interaction":[33],"graph":[34],"has":[35,90],"exactly":[36],"one":[37],"strongly":[38,57],"connected":[39,58],"component":[40],"size":[42],"greater":[43],"than":[44],"one,":[45],"comprising":[46],"nodes.":[48],"prove":[50],"#MAA(N_phi)":[51],"=":[52],"#SAT(phi)":[53],"by":[54],"classifying":[55],"terminal":[56],"components":[59],"minimal":[61],"trap":[62],"subcubes.":[63],"Thus":[64],"restricted":[65,71],"MAA":[66,72],"#P-hard":[69],"existence":[73],"NP-hard.":[75],"Two":[76],"independent":[77],"exhaustive":[78],"finite":[79],"verifiers":[80],"corroborate":[81],"construction":[83],"on":[84],"small":[85],"instances.":[86],"Historical":[87],"first-in-literature":[88],"novelty":[89],"not":[91,96,107],"been":[92],"established;":[93],"this":[94],"proof":[98],"P":[100],"!=":[101],"NP,":[102],"full-class":[104],"#P-completeness":[105],"claimed.":[108],"The":[109],"accompanying":[110],"source":[111],"ZIP":[112],"contains":[113],"full":[115],"derivation,":[116],"exact":[117],"verification":[118],"scripts":[119],"logs.":[121]},"counts_by_year":[],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-11-06T00:00:00"}