{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7DDOXGGJDJLW4HZUTRWVCUESC3","short_pith_number":"pith:7DDOXGGJ","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"},"canonical_sha256":"f8c6eb98c91a576e1f349c6d51509216cc0ace64c1ac10994d228972824b6d6b","source":{"kind":"arxiv","id":"1606.05172","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05172","created_at":"2026-05-18T01:12:21Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05172v1","created_at":"2026-05-18T01:12:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05172","created_at":"2026-05-18T01:12:21Z"},{"alias_kind":"pith_short_12","alias_value":"7DDOXGGJDJLW","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7DDOXGGJDJLW4HZU","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7DDOXGGJ","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7DDOXGGJDJLW4HZUTRWVCUESC3","target":"record","payload":{"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"},"canonical_sha256":"f8c6eb98c91a576e1f349c6d51509216cc0ace64c1ac10994d228972824b6d6b","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"},"source_kind":"arxiv","source_id":"1606.05172","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:12:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E0Hhy7g5ApcLSuLlwFkBLFGB0M7+qgL/PPpA/C8EUQ16G9wUvKgXY8Li0SjmSeXKroVHJCRV0xjdGPJB1wFlBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:16:52.595602Z"},"content_sha256":"708e7ea42f3ca293e6f347500fec02cb52623a27f418fd12992e6ebaf26cf85e","schema_version":"1.0","event_id":"sha256:708e7ea42f3ca293e6f347500fec02cb52623a27f418fd12992e6ebaf26cf85e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7DDOXGGJDJLW4HZUTRWVCUESC3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:12:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aWnMjQeB79a5uy6GR4D7cieq2R/r8YCDbovMgBXwfc3YISnFHTZqok4FM45Wwe/g1lSgcgrS03weaane2rYDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:16:52.596223Z"},"content_sha256":"e4a99481056e4c6f59b21eb0139cff32cab5347663df58ff7cbbbb67e069a998","schema_version":"1.0","event_id":"sha256:e4a99481056e4c6f59b21eb0139cff32cab5347663df58ff7cbbbb67e069a998"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7DDOXGGJDJLW4HZUTRWVCUESC3/bundle.json","state_url":"https://pith.science/pith/7DDOXGGJDJLW4HZUTRWVCUESC3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7DDOXGGJDJLW4HZUTRWVCUESC3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T19:16:52Z","links":{"resolver":"https://pith.science/pith/7DDOXGGJDJLW4HZUTRWVCUESC3","bundle":"https://pith.science/pith/7DDOXGGJDJLW4HZUTRWVCUESC3/bundle.json","state":"https://pith.science/pith/7DDOXGGJDJLW4HZUTRWVCUESC3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7DDOXGGJDJLW4HZUTRWVCUESC3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7DDOXGGJDJLW4HZUTRWVCUESC3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"32264412b4fccaba790d68ed237e78e529d2125534fee7aa9fad0a69c456a5b8","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-06-16T13:01:43Z","title_canon_sha256":"72f9b7e7ca79bd70611a11c890b33a2786d8242abcc2736ee169970401f6c40d"},"schema_version":"1.0","source":{"id":"1606.05172","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05172","created_at":"2026-05-18T01:12:21Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05172v1","created_at":"2026-05-18T01:12:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05172","created_at":"2026-05-18T01:12:21Z"},{"alias_kind":"pith_short_12","alias_value":"7DDOXGGJDJLW","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7DDOXGGJDJLW4HZU","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7DDOXGGJ","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:e4a99481056e4c6f59b21eb0139cff32cab5347663df58ff7cbbbb67e069a998","target":"graph","created_at":"2026-05-18T01:12:21Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Adrien Richard, Damien Regnault, Sylvain Sen\\'e, Tarek Melliti","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-06-16T13:01:43Z","title":"Asynchronous simulation of Boolean networks by monotone Boolean networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05172","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:708e7ea42f3ca293e6f347500fec02cb52623a27f418fd12992e6ebaf26cf85e","target":"record","created_at":"2026-05-18T01:12:21Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"32264412b4fccaba790d68ed237e78e529d2125534fee7aa9fad0a69c456a5b8","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-06-16T13:01:43Z","title_canon_sha256":"72f9b7e7ca79bd70611a11c890b33a2786d8242abcc2736ee169970401f6c40d"},"schema_version":"1.0","source":{"id":"1606.05172","kind":"arxiv","version":1}},"canonical_sha256":"f8c6eb98c91a576e1f349c6d51509216cc0ace64c1ac10994d228972824b6d6b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8c6eb98c91a576e1f349c6d51509216cc0ace64c1ac10994d228972824b6d6b","first_computed_at":"2026-05-18T01:12:21.897408Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:21.897408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zYk2Ahw94M5zWNQDm3WKK3CfRZ5sZlJ9Zf5vwVYeSEeG8ze59Esa1XPQng5j4qlfBgaHYUx7w5CwTMuFmvRsCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:21.897798Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.05172","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:708e7ea42f3ca293e6f347500fec02cb52623a27f418fd12992e6ebaf26cf85e","sha256:e4a99481056e4c6f59b21eb0139cff32cab5347663df58ff7cbbbb67e069a998"],"state_sha256":"a4962e0c874e52bd444776eeaf32b0f55478df75a9406a5e17a8cc44d9aecf9c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n9wNLapbD9z/Y+MYBsUQpqi+NOLvUK6wH2g4nAbe60o9V/TgaPzwl963c5V0BPxNOQtUlMnYl5h2blVUVtnBDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:16:52.599102Z","bundle_sha256":"c79d45b25185eb861c13cd7e0d1b09ba3fe4381a07ee3dbd54188a2dcbe65c09"}}