{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BYLLVHEYUWWR6NYUXY6ZIBOQX7","short_pith_number":"pith:BYLLVHEY","schema_version":"1.0","canonical_sha256":"0e16ba9c98a5ad1f3714be3d9405d0bfde1346bd8dcf587cbf1f12f719bf5d7c","source":{"kind":"arxiv","id":"1802.10400","version":2},"attestation_state":"computed","paper":{"title":"A framework for (de)composing with Boolean automata networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DM","authors_text":"K\\'evin Perrot, Pac\\^ome Perrotin, Sylvain Sen\\'e","submitted_at":"2018-02-28T13:33:12Z","abstract_excerpt":"Boolean automata networks (BANs) are a generalisation of Boolean cellular automata. In such, any theorem describing the way BANs compute information is a strong tool that can be applied to a wide range of models of computation. In this paper we explore a way of working with BANs which involves adding external inputs to the base model (via modules), and more importantly, a way to link networks together using the above mentioned inputs (via wirings). Our aim is to develop a powerful formalism for BAN (de)composition. We formulate two results: the first one shows that our modules/wirings definiti"},"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":"1802.10400","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2018-02-28T13:33:12Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"8439a6896f7d44316a813cea3b7a75be41d2aa88b441660a1fc168b13abb69d8","abstract_canon_sha256":"270c41d506fecb219de62a59734909b73b0225c46b41aec0a10aa790a54de4d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:02.260597Z","signature_b64":"VcG8TlVmCKpdLtTvdPN4jW9eyXGGYWLWOJOLL5EpqHaGaB4XtCjyZQ2Blj7o3ob+qDEQPHpjAtwYuxvZSbR9DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e16ba9c98a5ad1f3714be3d9405d0bfde1346bd8dcf587cbf1f12f719bf5d7c","last_reissued_at":"2026-05-18T00:19:02.259751Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:02.259751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A framework for (de)composing with Boolean automata networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DM","authors_text":"K\\'evin Perrot, Pac\\^ome Perrotin, Sylvain Sen\\'e","submitted_at":"2018-02-28T13:33:12Z","abstract_excerpt":"Boolean automata networks (BANs) are a generalisation of Boolean cellular automata. In such, any theorem describing the way BANs compute information is a strong tool that can be applied to a wide range of models of computation. In this paper we explore a way of working with BANs which involves adding external inputs to the base model (via modules), and more importantly, a way to link networks together using the above mentioned inputs (via wirings). Our aim is to develop a powerful formalism for BAN (de)composition. We formulate two results: the first one shows that our modules/wirings definiti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.10400","kind":"arxiv","version":2},"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":"1802.10400","created_at":"2026-05-18T00:19:02.259890+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.10400v2","created_at":"2026-05-18T00:19:02.259890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.10400","created_at":"2026-05-18T00:19:02.259890+00:00"},{"alias_kind":"pith_short_12","alias_value":"BYLLVHEYUWWR","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BYLLVHEYUWWR6NYU","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BYLLVHEY","created_at":"2026-05-18T12:32:16.446611+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/BYLLVHEYUWWR6NYUXY6ZIBOQX7","json":"https://pith.science/pith/BYLLVHEYUWWR6NYUXY6ZIBOQX7.json","graph_json":"https://pith.science/api/pith-number/BYLLVHEYUWWR6NYUXY6ZIBOQX7/graph.json","events_json":"https://pith.science/api/pith-number/BYLLVHEYUWWR6NYUXY6ZIBOQX7/events.json","paper":"https://pith.science/paper/BYLLVHEY"},"agent_actions":{"view_html":"https://pith.science/pith/BYLLVHEYUWWR6NYUXY6ZIBOQX7","download_json":"https://pith.science/pith/BYLLVHEYUWWR6NYUXY6ZIBOQX7.json","view_paper":"https://pith.science/paper/BYLLVHEY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.10400&json=true","fetch_graph":"https://pith.science/api/pith-number/BYLLVHEYUWWR6NYUXY6ZIBOQX7/graph.json","fetch_events":"https://pith.science/api/pith-number/BYLLVHEYUWWR6NYUXY6ZIBOQX7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BYLLVHEYUWWR6NYUXY6ZIBOQX7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BYLLVHEYUWWR6NYUXY6ZIBOQX7/action/storage_attestation","attest_author":"https://pith.science/pith/BYLLVHEYUWWR6NYUXY6ZIBOQX7/action/author_attestation","sign_citation":"https://pith.science/pith/BYLLVHEYUWWR6NYUXY6ZIBOQX7/action/citation_signature","submit_replication":"https://pith.science/pith/BYLLVHEYUWWR6NYUXY6ZIBOQX7/action/replication_record"}},"created_at":"2026-05-18T00:19:02.259890+00:00","updated_at":"2026-05-18T00:19:02.259890+00:00"}