{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZZ4NKJL5IZSXHOORVTJ2TX7F2I","short_pith_number":"pith:ZZ4NKJL5","schema_version":"1.0","canonical_sha256":"ce78d5257d466573b9d1acd3a9dfe5d206e6c5e6d97cade2f89c99dd56990b3f","source":{"kind":"arxiv","id":"1302.6346","version":3},"attestation_state":"computed","paper":{"title":"Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"cs.DM","authors_text":"Adrien Richard","submitted_at":"2013-02-26T07:29:23Z","abstract_excerpt":"We are interested in fixed points in Boolean networks, {\\em i.e.} functions $f$ from $\\{0,1\\}^n$ to itself. We define the subnetworks of $f$ as the restrictions of $f$ to the subcubes of $\\{0,1\\}^n$, and we characterizes a class $\\mathcal{F}$ of Boolean networks satisfying the following property: Every subnetwork of $f$ has a unique fixed point if and only if $f$ has no subnetwork in $\\mathcal{F}$. This characterization generalizes the fixed point theorem of Shih and Dong, which asserts that if for every $x$ in $\\{0,1\\}^n$ there is no directed cycle in the directed graph whose the adjacency ma"},"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":"1302.6346","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-02-26T07:29:23Z","cross_cats_sorted":["math.DS"],"title_canon_sha256":"5f35ed411b4590b902fb1951cbc9324cf4418adf4de9e01515c1e12835630ff7","abstract_canon_sha256":"0e5e888f9ec4e937b4580ad63a39ccbab9a82692d55595b97d46f0076ae06ab8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:12.334539Z","signature_b64":"xu2o+ftZ3NUSsVWv/cIpzyxluZm6jCChRa+Uoaf+1ssFILNZFBYkXCZgi+4OVW/LyuSl+mLnfxlQVDg1MyxmBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce78d5257d466573b9d1acd3a9dfe5d206e6c5e6d97cade2f89c99dd56990b3f","last_reissued_at":"2026-05-18T02:32:12.334120Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:12.334120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS"],"primary_cat":"cs.DM","authors_text":"Adrien Richard","submitted_at":"2013-02-26T07:29:23Z","abstract_excerpt":"We are interested in fixed points in Boolean networks, {\\em i.e.} functions $f$ from $\\{0,1\\}^n$ to itself. We define the subnetworks of $f$ as the restrictions of $f$ to the subcubes of $\\{0,1\\}^n$, and we characterizes a class $\\mathcal{F}$ of Boolean networks satisfying the following property: Every subnetwork of $f$ has a unique fixed point if and only if $f$ has no subnetwork in $\\mathcal{F}$. This characterization generalizes the fixed point theorem of Shih and Dong, which asserts that if for every $x$ in $\\{0,1\\}^n$ there is no directed cycle in the directed graph whose the adjacency ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6346","kind":"arxiv","version":3},"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":"1302.6346","created_at":"2026-05-18T02:32:12.334181+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.6346v3","created_at":"2026-05-18T02:32:12.334181+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6346","created_at":"2026-05-18T02:32:12.334181+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZZ4NKJL5IZSX","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZZ4NKJL5IZSXHOOR","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZZ4NKJL5","created_at":"2026-05-18T12:28:09.283467+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/ZZ4NKJL5IZSXHOORVTJ2TX7F2I","json":"https://pith.science/pith/ZZ4NKJL5IZSXHOORVTJ2TX7F2I.json","graph_json":"https://pith.science/api/pith-number/ZZ4NKJL5IZSXHOORVTJ2TX7F2I/graph.json","events_json":"https://pith.science/api/pith-number/ZZ4NKJL5IZSXHOORVTJ2TX7F2I/events.json","paper":"https://pith.science/paper/ZZ4NKJL5"},"agent_actions":{"view_html":"https://pith.science/pith/ZZ4NKJL5IZSXHOORVTJ2TX7F2I","download_json":"https://pith.science/pith/ZZ4NKJL5IZSXHOORVTJ2TX7F2I.json","view_paper":"https://pith.science/paper/ZZ4NKJL5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.6346&json=true","fetch_graph":"https://pith.science/api/pith-number/ZZ4NKJL5IZSXHOORVTJ2TX7F2I/graph.json","fetch_events":"https://pith.science/api/pith-number/ZZ4NKJL5IZSXHOORVTJ2TX7F2I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZZ4NKJL5IZSXHOORVTJ2TX7F2I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZZ4NKJL5IZSXHOORVTJ2TX7F2I/action/storage_attestation","attest_author":"https://pith.science/pith/ZZ4NKJL5IZSXHOORVTJ2TX7F2I/action/author_attestation","sign_citation":"https://pith.science/pith/ZZ4NKJL5IZSXHOORVTJ2TX7F2I/action/citation_signature","submit_replication":"https://pith.science/pith/ZZ4NKJL5IZSXHOORVTJ2TX7F2I/action/replication_record"}},"created_at":"2026-05-18T02:32:12.334181+00:00","updated_at":"2026-05-18T02:32:12.334181+00:00"}