{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7DDOXGGJDJLW4HZUTRWVCUESC3","short_pith_number":"pith:7DDOXGGJ","schema_version":"1.0","canonical_sha256":"f8c6eb98c91a576e1f349c6d51509216cc0ace64c1ac10994d228972824b6d6b","source":{"kind":"arxiv","id":"1606.05172","version":1},"attestation_state":"computed","paper":{"title":"Asynchronous simulation of Boolean networks by monotone Boolean networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Adrien Richard, Damien Regnault, Sylvain Sen\\'e, Tarek Melliti","submitted_at":"2016-06-16T13:01:43Z","abstract_excerpt":"We prove that the fully asynchronous dynamics of a Boolean network $f:\\{0,1\\}^n\\to\\{0,1\\}^n$ without negative loop can be simulated, in a very specific way, by a monotone Boolean network with $2n$ components. We then use this result to prove that, for every even $n$, there exists a monotone Boolean network $f:\\{0,1\\}^n\\to\\{0,1\\}^n$, an initial configuration $x$ and a fixed point $y$ of $f$ such that: (i) $y$ can be reached from $x$ with a fully asynchronous updating strategy, and (ii) all such strategies contains at least $2^{\\frac{n}{2}}$ updates. This contrasts with the following known prope"},"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":"1606.05172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-06-16T13:01:43Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"72f9b7e7ca79bd70611a11c890b33a2786d8242abcc2736ee169970401f6c40d","abstract_canon_sha256":"32264412b4fccaba790d68ed237e78e529d2125534fee7aa9fad0a69c456a5b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:21.897798Z","signature_b64":"zYk2Ahw94M5zWNQDm3WKK3CfRZ5sZlJ9Zf5vwVYeSEeG8ze59Esa1XPQng5j4qlfBgaHYUx7w5CwTMuFmvRsCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8c6eb98c91a576e1f349c6d51509216cc0ace64c1ac10994d228972824b6d6b","last_reissued_at":"2026-05-18T01:12:21.897408Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:21.897408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asynchronous simulation of Boolean networks by monotone Boolean networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Adrien Richard, Damien Regnault, Sylvain Sen\\'e, Tarek Melliti","submitted_at":"2016-06-16T13:01:43Z","abstract_excerpt":"We prove that the fully asynchronous dynamics of a Boolean network $f:\\{0,1\\}^n\\to\\{0,1\\}^n$ without negative loop can be simulated, in a very specific way, by a monotone Boolean network with $2n$ components. We then use this result to prove that, for every even $n$, there exists a monotone Boolean network $f:\\{0,1\\}^n\\to\\{0,1\\}^n$, an initial configuration $x$ and a fixed point $y$ of $f$ such that: (i) $y$ can be reached from $x$ with a fully asynchronous updating strategy, and (ii) all such strategies contains at least $2^{\\frac{n}{2}}$ updates. This contrasts with the following known prope"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05172","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":"1606.05172","created_at":"2026-05-18T01:12:21.897468+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.05172v1","created_at":"2026-05-18T01:12:21.897468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05172","created_at":"2026-05-18T01:12:21.897468+00:00"},{"alias_kind":"pith_short_12","alias_value":"7DDOXGGJDJLW","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7DDOXGGJDJLW4HZU","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7DDOXGGJ","created_at":"2026-05-18T12:30:04.600751+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/7DDOXGGJDJLW4HZUTRWVCUESC3","json":"https://pith.science/pith/7DDOXGGJDJLW4HZUTRWVCUESC3.json","graph_json":"https://pith.science/api/pith-number/7DDOXGGJDJLW4HZUTRWVCUESC3/graph.json","events_json":"https://pith.science/api/pith-number/7DDOXGGJDJLW4HZUTRWVCUESC3/events.json","paper":"https://pith.science/paper/7DDOXGGJ"},"agent_actions":{"view_html":"https://pith.science/pith/7DDOXGGJDJLW4HZUTRWVCUESC3","download_json":"https://pith.science/pith/7DDOXGGJDJLW4HZUTRWVCUESC3.json","view_paper":"https://pith.science/paper/7DDOXGGJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.05172&json=true","fetch_graph":"https://pith.science/api/pith-number/7DDOXGGJDJLW4HZUTRWVCUESC3/graph.json","fetch_events":"https://pith.science/api/pith-number/7DDOXGGJDJLW4HZUTRWVCUESC3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7DDOXGGJDJLW4HZUTRWVCUESC3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7DDOXGGJDJLW4HZUTRWVCUESC3/action/storage_attestation","attest_author":"https://pith.science/pith/7DDOXGGJDJLW4HZUTRWVCUESC3/action/author_attestation","sign_citation":"https://pith.science/pith/7DDOXGGJDJLW4HZUTRWVCUESC3/action/citation_signature","submit_replication":"https://pith.science/pith/7DDOXGGJDJLW4HZUTRWVCUESC3/action/replication_record"}},"created_at":"2026-05-18T01:12:21.897468+00:00","updated_at":"2026-05-18T01:12:21.897468+00:00"}