{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SUH7FN5FIH2WKCOXMU2YG5J6ZN","short_pith_number":"pith:SUH7FN5F","canonical_record":{"source":{"id":"1407.2104","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.OC","submitted_at":"2014-06-14T14:31:24Z","cross_cats_sorted":[],"title_canon_sha256":"1a3e9f30f23ae09c3ff7ac23052581832c975e85dc67bcc5a6bbf0b816f412d7","abstract_canon_sha256":"040631225f9ff86675f4a32b902feddb41be78ba73b9bdc8b50392a50f5634dd"},"schema_version":"1.0"},"canonical_sha256":"950ff2b7a541f56509d7653583753ecb7fbd7147b078bc32621c433873db54f6","source":{"kind":"arxiv","id":"1407.2104","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2104","created_at":"2026-05-18T02:48:08Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2104v1","created_at":"2026-05-18T02:48:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2104","created_at":"2026-05-18T02:48:08Z"},{"alias_kind":"pith_short_12","alias_value":"SUH7FN5FIH2W","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SUH7FN5FIH2WKCOX","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SUH7FN5F","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SUH7FN5FIH2WKCOXMU2YG5J6ZN","target":"record","payload":{"canonical_record":{"source":{"id":"1407.2104","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.OC","submitted_at":"2014-06-14T14:31:24Z","cross_cats_sorted":[],"title_canon_sha256":"1a3e9f30f23ae09c3ff7ac23052581832c975e85dc67bcc5a6bbf0b816f412d7","abstract_canon_sha256":"040631225f9ff86675f4a32b902feddb41be78ba73b9bdc8b50392a50f5634dd"},"schema_version":"1.0"},"canonical_sha256":"950ff2b7a541f56509d7653583753ecb7fbd7147b078bc32621c433873db54f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:08.429569Z","signature_b64":"GKUa2E8VW7IHwYc5lcsizIzLNueGk/BoBTyFywRJMY1x6cphuh6IUGGuSf6V1epjImOrRSzrb6qevZBUaO9/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"950ff2b7a541f56509d7653583753ecb7fbd7147b078bc32621c433873db54f6","last_reissued_at":"2026-05-18T02:48:08.429012Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:08.429012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.2104","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-18T02:48:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IaqYCREfSGnz5uacueZx0XqyF5dVdhEWmyuVq2zHq9BZNJcnDo22FDREz7Mrhqmag0qzB25og1vr3O6V5nNWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T15:20:13.528425Z"},"content_sha256":"d5ff8599d9c371c60ef433a3ecbe21296e57f35141c2d9204859395680543bc9","schema_version":"1.0","event_id":"sha256:d5ff8599d9c371c60ef433a3ecbe21296e57f35141c2d9204859395680543bc9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SUH7FN5FIH2WKCOXMU2YG5J6ZN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decomposition with respect to outputs for Boolean control networks","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jiandong Zhu, Yunlei Zou","submitted_at":"2014-06-14T14:31:24Z","abstract_excerpt":"This paper investigates the problem of decomposition with respect to outputs for Boolean control networks (BCNs). First, with the linear expression of BCNs and the matrix semi-tensor product, some algebraic equivalent conditions for the decomposition are obtained. Second, a necessary and sufficient graphical condition for the decomposition with respect to outputs is given. Third, an effective method is proposed to reduce the computational burden in the realization of the decomposition. Finally, some examples are addressed to validate the effectiveness of the proposed method."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2104","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-18T02:48:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CZ7QDURQhYqpBHh6VpTurPAHbtVnIr1zF77g5p/Jx3R2hbNh7HMXK7YBCxvDxxcdBwwU+/WpcSSr4Xe/UpwMBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T15:20:13.528773Z"},"content_sha256":"bffed939812ce84f78ab60c788159f1c77853c63e7f73fc535f830bcc6a37018","schema_version":"1.0","event_id":"sha256:bffed939812ce84f78ab60c788159f1c77853c63e7f73fc535f830bcc6a37018"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SUH7FN5FIH2WKCOXMU2YG5J6ZN/bundle.json","state_url":"https://pith.science/pith/SUH7FN5FIH2WKCOXMU2YG5J6ZN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SUH7FN5FIH2WKCOXMU2YG5J6ZN/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-10T15:20:13Z","links":{"resolver":"https://pith.science/pith/SUH7FN5FIH2WKCOXMU2YG5J6ZN","bundle":"https://pith.science/pith/SUH7FN5FIH2WKCOXMU2YG5J6ZN/bundle.json","state":"https://pith.science/pith/SUH7FN5FIH2WKCOXMU2YG5J6ZN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SUH7FN5FIH2WKCOXMU2YG5J6ZN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SUH7FN5FIH2WKCOXMU2YG5J6ZN","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":"040631225f9ff86675f4a32b902feddb41be78ba73b9bdc8b50392a50f5634dd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.OC","submitted_at":"2014-06-14T14:31:24Z","title_canon_sha256":"1a3e9f30f23ae09c3ff7ac23052581832c975e85dc67bcc5a6bbf0b816f412d7"},"schema_version":"1.0","source":{"id":"1407.2104","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2104","created_at":"2026-05-18T02:48:08Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2104v1","created_at":"2026-05-18T02:48:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2104","created_at":"2026-05-18T02:48:08Z"},{"alias_kind":"pith_short_12","alias_value":"SUH7FN5FIH2W","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SUH7FN5FIH2WKCOX","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SUH7FN5F","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:bffed939812ce84f78ab60c788159f1c77853c63e7f73fc535f830bcc6a37018","target":"graph","created_at":"2026-05-18T02:48:08Z","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":"This paper investigates the problem of decomposition with respect to outputs for Boolean control networks (BCNs). First, with the linear expression of BCNs and the matrix semi-tensor product, some algebraic equivalent conditions for the decomposition are obtained. Second, a necessary and sufficient graphical condition for the decomposition with respect to outputs is given. Third, an effective method is proposed to reduce the computational burden in the realization of the decomposition. Finally, some examples are addressed to validate the effectiveness of the proposed method.","authors_text":"Jiandong Zhu, Yunlei Zou","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.OC","submitted_at":"2014-06-14T14:31:24Z","title":"Decomposition with respect to outputs for Boolean control networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2104","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:d5ff8599d9c371c60ef433a3ecbe21296e57f35141c2d9204859395680543bc9","target":"record","created_at":"2026-05-18T02:48:08Z","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":"040631225f9ff86675f4a32b902feddb41be78ba73b9bdc8b50392a50f5634dd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.OC","submitted_at":"2014-06-14T14:31:24Z","title_canon_sha256":"1a3e9f30f23ae09c3ff7ac23052581832c975e85dc67bcc5a6bbf0b816f412d7"},"schema_version":"1.0","source":{"id":"1407.2104","kind":"arxiv","version":1}},"canonical_sha256":"950ff2b7a541f56509d7653583753ecb7fbd7147b078bc32621c433873db54f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"950ff2b7a541f56509d7653583753ecb7fbd7147b078bc32621c433873db54f6","first_computed_at":"2026-05-18T02:48:08.429012Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:08.429012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GKUa2E8VW7IHwYc5lcsizIzLNueGk/BoBTyFywRJMY1x6cphuh6IUGGuSf6V1epjImOrRSzrb6qevZBUaO9/BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:08.429569Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.2104","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5ff8599d9c371c60ef433a3ecbe21296e57f35141c2d9204859395680543bc9","sha256:bffed939812ce84f78ab60c788159f1c77853c63e7f73fc535f830bcc6a37018"],"state_sha256":"62172906660e1a0f9d15db694bbe0035d3138e4423e162b58981eca572ea1fad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3RCyoZqZ3/L9OR1W4GQnZP0fPsWhZljthcIP0uLCU7msA1FLRpY/0qZZWwvOEmrVG/M2xKn9UG0zZUzEOXiZCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T15:20:13.530679Z","bundle_sha256":"548d20ce3b1fc1e0896f86567ea2ed95cfd4ccebfe8014fa0cc7211e5d782d09"}}