{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:24TJJAWQWPGYCYKQAHOZL6AMR7","short_pith_number":"pith:24TJJAWQ","schema_version":"1.0","canonical_sha256":"d7269482d0b3cd81615001dd95f80c8fcb0016418ffbab8197671bda41ff5da4","source":{"kind":"arxiv","id":"1904.05887","version":2},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.05887","created_at":"2026-05-17T23:40:03.596012+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.05887v2","created_at":"2026-05-17T23:40:03.596012+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.05887","created_at":"2026-05-17T23:40:03.596012+00:00"},{"alias_kind":"pith_short_12","alias_value":"24TJJAWQWPGY","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"24TJJAWQWPGYCYKQ","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"24TJJAWQ","created_at":"2026-05-18T12:33:07.085635+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/24TJJAWQWPGYCYKQAHOZL6AMR7","json":"https://pith.science/pith/24TJJAWQWPGYCYKQAHOZL6AMR7.json","graph_json":"https://pith.science/api/pith-number/24TJJAWQWPGYCYKQAHOZL6AMR7/graph.json","events_json":"https://pith.science/api/pith-number/24TJJAWQWPGYCYKQAHOZL6AMR7/events.json","paper":"https://pith.science/paper/24TJJAWQ"},"agent_actions":{"view_html":"https://pith.science/pith/24TJJAWQWPGYCYKQAHOZL6AMR7","download_json":"https://pith.science/pith/24TJJAWQWPGYCYKQAHOZL6AMR7.json","view_paper":"https://pith.science/paper/24TJJAWQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.05887&json=true","fetch_graph":"https://pith.science/api/pith-number/24TJJAWQWPGYCYKQAHOZL6AMR7/graph.json","fetch_events":"https://pith.science/api/pith-number/24TJJAWQWPGYCYKQAHOZL6AMR7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/24TJJAWQWPGYCYKQAHOZL6AMR7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/24TJJAWQWPGYCYKQAHOZL6AMR7/action/storage_attestation","attest_author":"https://pith.science/pith/24TJJAWQWPGYCYKQAHOZL6AMR7/action/author_attestation","sign_citation":"https://pith.science/pith/24TJJAWQWPGYCYKQAHOZL6AMR7/action/citation_signature","submit_replication":"https://pith.science/pith/24TJJAWQWPGYCYKQAHOZL6AMR7/action/replication_record"}},"created_at":"2026-05-17T23:40:03.596012+00:00","updated_at":"2026-05-17T23:40:03.596012+00:00"}