{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HC7UFXSZIMXIJBOV77XN4TBI2I","short_pith_number":"pith:HC7UFXSZ","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"},"canonical_sha256":"38bf42de59432e8485d5ffeede4c28d23c98c8521869099d3349d343495f4f8d","source":{"kind":"arxiv","id":"1804.01931","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01931","created_at":"2026-05-18T00:19:09Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01931v1","created_at":"2026-05-18T00:19:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01931","created_at":"2026-05-18T00:19:09Z"},{"alias_kind":"pith_short_12","alias_value":"HC7UFXSZIMXI","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HC7UFXSZIMXIJBOV","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HC7UFXSZ","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HC7UFXSZIMXIJBOV77XN4TBI2I","target":"record","payload":{"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"},"canonical_sha256":"38bf42de59432e8485d5ffeede4c28d23c98c8521869099d3349d343495f4f8d","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"},"source_kind":"arxiv","source_id":"1804.01931","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-18T00:19:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2eWSSI//yxrIatNTtHE/7kwU6csx4/rTszf08YfoKTWNrpSnt0oESU8+Z/e3UXIqq5zXnCpXlQTfq/Cd+TJrDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T16:46:10.660338Z"},"content_sha256":"f102a716c8d34fe2a624edf879d30696773cf1a2c810384bdd2c92877a334481","schema_version":"1.0","event_id":"sha256:f102a716c8d34fe2a624edf879d30696773cf1a2c810384bdd2c92877a334481"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HC7UFXSZIMXIJBOV77XN4TBI2I","target":"graph","payload":{"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"},"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-18T00:19:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VRkFwZXNu8D1L71/xUTuWwSljpkwbj1AZQIveZLhHlnECPCM2VhHFnLCXM7H2QDOyOaywHAs4wlY+tYD6SX0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T16:46:10.660697Z"},"content_sha256":"f0f07e72d6fe8d428d624fe86582c20702ee55cf7612ec0c5faf181822d95377","schema_version":"1.0","event_id":"sha256:f0f07e72d6fe8d428d624fe86582c20702ee55cf7612ec0c5faf181822d95377"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HC7UFXSZIMXIJBOV77XN4TBI2I/bundle.json","state_url":"https://pith.science/pith/HC7UFXSZIMXIJBOV77XN4TBI2I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HC7UFXSZIMXIJBOV77XN4TBI2I/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-07-02T16:46:10Z","links":{"resolver":"https://pith.science/pith/HC7UFXSZIMXIJBOV77XN4TBI2I","bundle":"https://pith.science/pith/HC7UFXSZIMXIJBOV77XN4TBI2I/bundle.json","state":"https://pith.science/pith/HC7UFXSZIMXIJBOV77XN4TBI2I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HC7UFXSZIMXIJBOV77XN4TBI2I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HC7UFXSZIMXIJBOV77XN4TBI2I","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":"1de366c96deda73227ff9f22f82497d7c6de554069cf2b943182987f1a6ecff1","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-05T16:11:18Z","title_canon_sha256":"dfe13f7bd6b5bb560b6ce4ff4baf891699f7eff5330f38683abdbd980f00cb2a"},"schema_version":"1.0","source":{"id":"1804.01931","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.01931","created_at":"2026-05-18T00:19:09Z"},{"alias_kind":"arxiv_version","alias_value":"1804.01931v1","created_at":"2026-05-18T00:19:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.01931","created_at":"2026-05-18T00:19:09Z"},{"alias_kind":"pith_short_12","alias_value":"HC7UFXSZIMXI","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HC7UFXSZIMXIJBOV","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HC7UFXSZ","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:f0f07e72d6fe8d428d624fe86582c20702ee55cf7612ec0c5faf181822d95377","target":"graph","created_at":"2026-05-18T00:19:09Z","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":"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","authors_text":"Adrien Richard, Maximilien Gadouleau","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-05T16:11:18Z","title":"On fixable families of Boolean networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.01931","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:f102a716c8d34fe2a624edf879d30696773cf1a2c810384bdd2c92877a334481","target":"record","created_at":"2026-05-18T00:19:09Z","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":"1de366c96deda73227ff9f22f82497d7c6de554069cf2b943182987f1a6ecff1","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-05T16:11:18Z","title_canon_sha256":"dfe13f7bd6b5bb560b6ce4ff4baf891699f7eff5330f38683abdbd980f00cb2a"},"schema_version":"1.0","source":{"id":"1804.01931","kind":"arxiv","version":1}},"canonical_sha256":"38bf42de59432e8485d5ffeede4c28d23c98c8521869099d3349d343495f4f8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"38bf42de59432e8485d5ffeede4c28d23c98c8521869099d3349d343495f4f8d","first_computed_at":"2026-05-18T00:19:09.525165Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:09.525165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5vDwcJ5BXcDTksE4jiiUXo7I4oSbC9Uz5ieAnmv9LhCho9pS7LBYy7juOLNR1jSx+Ht/oDclqEb56pcfRw64Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:09.526004Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.01931","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f102a716c8d34fe2a624edf879d30696773cf1a2c810384bdd2c92877a334481","sha256:f0f07e72d6fe8d428d624fe86582c20702ee55cf7612ec0c5faf181822d95377"],"state_sha256":"0df5267c269f7b42c7b578e9aefe7e5f67fb560156910ab3d7a94a01f1a526be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+4V+iCvIc43K7gK8p/E2zEGffGFoAENv5p9UDH9LdRdO4X8x+nWSVoPS0nZEoh8EVgEfLGP0BNqMec9nced9Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T16:46:10.662653Z","bundle_sha256":"d2a834e3f807a28a006e06dfdfc6d69e2543ceefc78cf5b6bacaf219f03e5989"}}