{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HC7UFXSZIMXIJBOV77XN4TBI2I","short_pith_number":"pith:HC7UFXSZ","schema_version":"1.0","canonical_sha256":"38bf42de59432e8485d5ffeede4c28d23c98c8521869099d3349d343495f4f8d","source":{"kind":"arxiv","id":"1804.01931","version":1},"attestation_state":"computed","paper":{"title":"On fixable families of Boolean networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Adrien Richard, Maximilien Gadouleau","submitted_at":"2018-04-05T16:11:18Z","abstract_excerpt":"The asynchronous dynamics associated with a Boolean network $f : \\{0,1\\}^n \\to \\{0,1\\}^n$ is a finite deterministic automaton considered in many applications. The set of states is $\\{0,1\\}^n$, the alphabet is $[n]$, and the action of letter $i$ on a state $x$ consists in either switching the $i$th component if $f_i(x)\\neq x_i$ or doing nothing otherwise. This action is extended to words in the natural way. We then say that a word $w$ {\\em fixes} $f$ if, for all states $x$, the result of the action of $w$ on $x$ is a fixed point of $f$. A whole family of networks is fixable if its members are a"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1804.01931","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-05T16:11:18Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"dfe13f7bd6b5bb560b6ce4ff4baf891699f7eff5330f38683abdbd980f00cb2a","abstract_canon_sha256":"1de366c96deda73227ff9f22f82497d7c6de554069cf2b943182987f1a6ecff1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:09.526004Z","signature_b64":"5vDwcJ5BXcDTksE4jiiUXo7I4oSbC9Uz5ieAnmv9LhCho9pS7LBYy7juOLNR1jSx+Ht/oDclqEb56pcfRw64Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38bf42de59432e8485d5ffeede4c28d23c98c8521869099d3349d343495f4f8d","last_reissued_at":"2026-05-18T00:19:09.525165Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:09.525165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On fixable families of Boolean networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Adrien Richard, Maximilien Gadouleau","submitted_at":"2018-04-05T16:11:18Z","abstract_excerpt":"The asynchronous dynamics associated with a Boolean network $f : \\{0,1\\}^n \\to \\{0,1\\}^n$ is a finite deterministic automaton considered in many applications. The set of states is $\\{0,1\\}^n$, the alphabet is $[n]$, and the action of letter $i$ on a state $x$ consists in either switching the $i$th component if $f_i(x)\\neq x_i$ or doing nothing otherwise. This action is extended to words in the natural way. We then say that a word $w$ {\\em fixes} $f$ if, for all states $x$, the result of the action of $w$ on $x$ is a fixed point of $f$. A whole family of networks is fixable if its members are a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01931","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.01931","created_at":"2026-05-18T00:19:09.525300+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.01931v1","created_at":"2026-05-18T00:19:09.525300+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01931","created_at":"2026-05-18T00:19:09.525300+00:00"},{"alias_kind":"pith_short_12","alias_value":"HC7UFXSZIMXI","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HC7UFXSZIMXIJBOV","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HC7UFXSZ","created_at":"2026-05-18T12:32:28.185984+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HC7UFXSZIMXIJBOV77XN4TBI2I","json":"https://pith.science/pith/HC7UFXSZIMXIJBOV77XN4TBI2I.json","graph_json":"https://pith.science/api/pith-number/HC7UFXSZIMXIJBOV77XN4TBI2I/graph.json","events_json":"https://pith.science/api/pith-number/HC7UFXSZIMXIJBOV77XN4TBI2I/events.json","paper":"https://pith.science/paper/HC7UFXSZ"},"agent_actions":{"view_html":"https://pith.science/pith/HC7UFXSZIMXIJBOV77XN4TBI2I","download_json":"https://pith.science/pith/HC7UFXSZIMXIJBOV77XN4TBI2I.json","view_paper":"https://pith.science/paper/HC7UFXSZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.01931&json=true","fetch_graph":"https://pith.science/api/pith-number/HC7UFXSZIMXIJBOV77XN4TBI2I/graph.json","fetch_events":"https://pith.science/api/pith-number/HC7UFXSZIMXIJBOV77XN4TBI2I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HC7UFXSZIMXIJBOV77XN4TBI2I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HC7UFXSZIMXIJBOV77XN4TBI2I/action/storage_attestation","attest_author":"https://pith.science/pith/HC7UFXSZIMXIJBOV77XN4TBI2I/action/author_attestation","sign_citation":"https://pith.science/pith/HC7UFXSZIMXIJBOV77XN4TBI2I/action/citation_signature","submit_replication":"https://pith.science/pith/HC7UFXSZIMXIJBOV77XN4TBI2I/action/replication_record"}},"created_at":"2026-05-18T00:19:09.525300+00:00","updated_at":"2026-05-18T00:19:09.525300+00:00"}