{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:24TJJAWQWPGYCYKQAHOZL6AMR7","short_pith_number":"pith:24TJJAWQ","canonical_record":{"source":{"id":"1904.05887","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-04-12T13:48:51Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"e04c555b18407dbe9e5a62e9b08b7e69d51d961d9c80b8b35f0c7ebf11265860","abstract_canon_sha256":"a5de3372b5730c2596cbc351305071848195fb0aed82bd578ceb2b132c05aa6c"},"schema_version":"1.0"},"canonical_sha256":"d7269482d0b3cd81615001dd95f80c8fcb0016418ffbab8197671bda41ff5da4","source":{"kind":"arxiv","id":"1904.05887","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.05887","created_at":"2026-05-17T23:40:03Z"},{"alias_kind":"arxiv_version","alias_value":"1904.05887v2","created_at":"2026-05-17T23:40:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05887","created_at":"2026-05-17T23:40:03Z"},{"alias_kind":"pith_short_12","alias_value":"24TJJAWQWPGY","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"24TJJAWQWPGYCYKQ","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"24TJJAWQ","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:24TJJAWQWPGYCYKQAHOZL6AMR7","target":"record","payload":{"canonical_record":{"source":{"id":"1904.05887","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-04-12T13:48:51Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"e04c555b18407dbe9e5a62e9b08b7e69d51d961d9c80b8b35f0c7ebf11265860","abstract_canon_sha256":"a5de3372b5730c2596cbc351305071848195fb0aed82bd578ceb2b132c05aa6c"},"schema_version":"1.0"},"canonical_sha256":"d7269482d0b3cd81615001dd95f80c8fcb0016418ffbab8197671bda41ff5da4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:03.596589Z","signature_b64":"jn4v3XkpNNdUT+DOgotghF1UhDKsBUvDNPazWqHyY+ilGtr/9ksaoSRVt66p4bYsD61A5UKjv2y+CHRc3QQAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7269482d0b3cd81615001dd95f80c8fcb0016418ffbab8197671bda41ff5da4","last_reissued_at":"2026-05-17T23:40:03.595920Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:03.595920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.05887","source_version":2,"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-17T23:40:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RDW+t0Q43nWOHi5O8OVBzPzUqqAjnHjzf0kwkf2nlkVNBI/DxeWX9crrGePwXZgbIov6GiDaT/YRkSBkgSfPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:10:25.245522Z"},"content_sha256":"ed6831bbffa2cbbd548a2a072c521512f804e5bf59cfecf0632479481fe6ae58","schema_version":"1.0","event_id":"sha256:ed6831bbffa2cbbd548a2a072c521512f804e5bf59cfecf0632479481fe6ae58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:24TJJAWQWPGYCYKQAHOZL6AMR7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Categorization Problem on Controllability of Boolean Control Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Qunxi Zhu, Weihua Gui, Yang Liu, Zuguang Gao","submitted_at":"2019-04-12T13:48:51Z","abstract_excerpt":"A Boolean control network (BCN) is a discrete-time dynamical system whose variables take values from a binary set $\\{0,1\\}$. At each time step, each variable of the BCN updates its value simultaneously according to a Boolean function which takes the state and control of the previous time step as its input. Given an ordered pair of states of a BCN, we define the set of reachable time steps as the set of positive integer $k$'s where there exists a control sequence such that the BCN can be steered from one state to the other in exactly $k$ time steps; and the set of unreachable time steps as the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05887","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"},"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-17T23:40:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h8vqKCpYK9FNWJScoVZaUaCYCygPUtL00nWGg+995wHhUMABURkEVkjoXDpFcOJ8ySErAfTBPDAnVDAa28YDCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T17:10:25.246236Z"},"content_sha256":"c6a133e3a8b09ac557aacfeced122bd6dcce1a0db849293685d66bcf18ec42ba","schema_version":"1.0","event_id":"sha256:c6a133e3a8b09ac557aacfeced122bd6dcce1a0db849293685d66bcf18ec42ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/24TJJAWQWPGYCYKQAHOZL6AMR7/bundle.json","state_url":"https://pith.science/pith/24TJJAWQWPGYCYKQAHOZL6AMR7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/24TJJAWQWPGYCYKQAHOZL6AMR7/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-06-08T17:10:25Z","links":{"resolver":"https://pith.science/pith/24TJJAWQWPGYCYKQAHOZL6AMR7","bundle":"https://pith.science/pith/24TJJAWQWPGYCYKQAHOZL6AMR7/bundle.json","state":"https://pith.science/pith/24TJJAWQWPGYCYKQAHOZL6AMR7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/24TJJAWQWPGYCYKQAHOZL6AMR7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:24TJJAWQWPGYCYKQAHOZL6AMR7","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":"a5de3372b5730c2596cbc351305071848195fb0aed82bd578ceb2b132c05aa6c","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-04-12T13:48:51Z","title_canon_sha256":"e04c555b18407dbe9e5a62e9b08b7e69d51d961d9c80b8b35f0c7ebf11265860"},"schema_version":"1.0","source":{"id":"1904.05887","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.05887","created_at":"2026-05-17T23:40:03Z"},{"alias_kind":"arxiv_version","alias_value":"1904.05887v2","created_at":"2026-05-17T23:40:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05887","created_at":"2026-05-17T23:40:03Z"},{"alias_kind":"pith_short_12","alias_value":"24TJJAWQWPGY","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"24TJJAWQWPGYCYKQ","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"24TJJAWQ","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:c6a133e3a8b09ac557aacfeced122bd6dcce1a0db849293685d66bcf18ec42ba","target":"graph","created_at":"2026-05-17T23:40:03Z","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":"A Boolean control network (BCN) is a discrete-time dynamical system whose variables take values from a binary set $\\{0,1\\}$. At each time step, each variable of the BCN updates its value simultaneously according to a Boolean function which takes the state and control of the previous time step as its input. Given an ordered pair of states of a BCN, we define the set of reachable time steps as the set of positive integer $k$'s where there exists a control sequence such that the BCN can be steered from one state to the other in exactly $k$ time steps; and the set of unreachable time steps as the ","authors_text":"Qunxi Zhu, Weihua Gui, Yang Liu, Zuguang Gao","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-04-12T13:48:51Z","title":"Categorization Problem on Controllability of Boolean Control Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.05887","kind":"arxiv","version":2},"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:ed6831bbffa2cbbd548a2a072c521512f804e5bf59cfecf0632479481fe6ae58","target":"record","created_at":"2026-05-17T23:40:03Z","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":"a5de3372b5730c2596cbc351305071848195fb0aed82bd578ceb2b132c05aa6c","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-04-12T13:48:51Z","title_canon_sha256":"e04c555b18407dbe9e5a62e9b08b7e69d51d961d9c80b8b35f0c7ebf11265860"},"schema_version":"1.0","source":{"id":"1904.05887","kind":"arxiv","version":2}},"canonical_sha256":"d7269482d0b3cd81615001dd95f80c8fcb0016418ffbab8197671bda41ff5da4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7269482d0b3cd81615001dd95f80c8fcb0016418ffbab8197671bda41ff5da4","first_computed_at":"2026-05-17T23:40:03.595920Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:03.595920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jn4v3XkpNNdUT+DOgotghF1UhDKsBUvDNPazWqHyY+ilGtr/9ksaoSRVt66p4bYsD61A5UKjv2y+CHRc3QQAAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:03.596589Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.05887","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ed6831bbffa2cbbd548a2a072c521512f804e5bf59cfecf0632479481fe6ae58","sha256:c6a133e3a8b09ac557aacfeced122bd6dcce1a0db849293685d66bcf18ec42ba"],"state_sha256":"c688270d92b42d54885142aa963ac6d766b84e42983c6b8edbce894a3d6a54de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9JrXDF0nB5bO7DUiXT5h23xSTVrgoOnm2RCYy2XlhieGVSgrhmR/jxREMzOLzc+oISGK322hXENiNPZCS0ZYBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T17:10:25.250426Z","bundle_sha256":"802425f1eefa524c458ae511aa79ee9d1c511d9ec7c230792a6f1c94c67d4494"}}