{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XGB4UKYLE73T5GXJUGTHG2IAKQ","short_pith_number":"pith:XGB4UKYL","canonical_record":{"source":{"id":"1512.02786","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-09T08:41:52Z","cross_cats_sorted":[],"title_canon_sha256":"8736072177547ba743577ff69c3f37716a7ac81c3c404bdecdb20e8199651f5c","abstract_canon_sha256":"bea2814b35d6f7fd6c6f0bd745c2b72918ad74a792e9e5514f93e4bb3eb55250"},"schema_version":"1.0"},"canonical_sha256":"b983ca2b0b27f73e9ae9a1a67369005416238cc9812f1fd0cf1d28fa7f5c20fa","source":{"kind":"arxiv","id":"1512.02786","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02786","created_at":"2026-05-18T01:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02786v2","created_at":"2026-05-18T01:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02786","created_at":"2026-05-18T01:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"XGB4UKYLE73T","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XGB4UKYLE73T5GXJ","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XGB4UKYL","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XGB4UKYLE73T5GXJUGTHG2IAKQ","target":"record","payload":{"canonical_record":{"source":{"id":"1512.02786","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-09T08:41:52Z","cross_cats_sorted":[],"title_canon_sha256":"8736072177547ba743577ff69c3f37716a7ac81c3c404bdecdb20e8199651f5c","abstract_canon_sha256":"bea2814b35d6f7fd6c6f0bd745c2b72918ad74a792e9e5514f93e4bb3eb55250"},"schema_version":"1.0"},"canonical_sha256":"b983ca2b0b27f73e9ae9a1a67369005416238cc9812f1fd0cf1d28fa7f5c20fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:45.390952Z","signature_b64":"+ioWRim2YUZIopPY0+o8dwaoDk9ZvofLY3inVfhHCaF7klqm3cMvnqwTALpetqhsX2L6uGWgaTbK9E/QYef/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b983ca2b0b27f73e9ae9a1a67369005416238cc9812f1fd0cf1d28fa7f5c20fa","last_reissued_at":"2026-05-18T01:02:45.390527Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:45.390527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.02786","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-18T01:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5EGu4anicBYOGY24TjfV6NjiH/kBjhrs5TgMnA69HEDMFhR2LZ1dC1syDPcLk8OV0RiYkuDmsRVVtM7LBHb8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:18:28.917739Z"},"content_sha256":"a67503314ff349748c0df50adb696688c31ed6fefb60fe4f086bd874824c01f8","schema_version":"1.0","event_id":"sha256:a67503314ff349748c0df50adb696688c31ed6fefb60fe4f086bd874824c01f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XGB4UKYLE73T5GXJUGTHG2IAKQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A weighted pair graph representation for reconstructibility of Boolean control networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kuize Zhang, Lijun Zhang, Rong Su","submitted_at":"2015-12-09T08:41:52Z","abstract_excerpt":"A new concept of weighted pair graphs (WPGs) is proposed to represent a new reconstructibility definition for Boolean control networks (BCNs), which is a generalization of the reconstructibility definition given in [Fornasini & Valcher, TAC2013, Def. 4]. Based on the WPG representation, an effective algorithm for determining the new reconstructibility notion for BCNs is designed with the help of the theories of finite automata and formal languages. We prove that a BCN is not reconstructible iff its WPG has a complete subgraph. Besides, we prove that a BCN is reconstructible in the sense of [Fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02786","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-18T01:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ve+5LJ28TnVUvkmA67GaNe+hfsh5L6wCom2uAx9eCtKlWrVBeyMtgXhgRlHQOgjRAf61d4BM9WPM8sa9JvQtDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:18:28.918114Z"},"content_sha256":"e266d23fda76680b60ef143277402a1a1c783b005a4ed5946f5917871b5d0a1e","schema_version":"1.0","event_id":"sha256:e266d23fda76680b60ef143277402a1a1c783b005a4ed5946f5917871b5d0a1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XGB4UKYLE73T5GXJUGTHG2IAKQ/bundle.json","state_url":"https://pith.science/pith/XGB4UKYLE73T5GXJUGTHG2IAKQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XGB4UKYLE73T5GXJUGTHG2IAKQ/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-26T13:18:28Z","links":{"resolver":"https://pith.science/pith/XGB4UKYLE73T5GXJUGTHG2IAKQ","bundle":"https://pith.science/pith/XGB4UKYLE73T5GXJUGTHG2IAKQ/bundle.json","state":"https://pith.science/pith/XGB4UKYLE73T5GXJUGTHG2IAKQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XGB4UKYLE73T5GXJUGTHG2IAKQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XGB4UKYLE73T5GXJUGTHG2IAKQ","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":"bea2814b35d6f7fd6c6f0bd745c2b72918ad74a792e9e5514f93e4bb3eb55250","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-09T08:41:52Z","title_canon_sha256":"8736072177547ba743577ff69c3f37716a7ac81c3c404bdecdb20e8199651f5c"},"schema_version":"1.0","source":{"id":"1512.02786","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.02786","created_at":"2026-05-18T01:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1512.02786v2","created_at":"2026-05-18T01:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02786","created_at":"2026-05-18T01:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"XGB4UKYLE73T","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XGB4UKYLE73T5GXJ","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XGB4UKYL","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:e266d23fda76680b60ef143277402a1a1c783b005a4ed5946f5917871b5d0a1e","target":"graph","created_at":"2026-05-18T01:02:45Z","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 new concept of weighted pair graphs (WPGs) is proposed to represent a new reconstructibility definition for Boolean control networks (BCNs), which is a generalization of the reconstructibility definition given in [Fornasini & Valcher, TAC2013, Def. 4]. Based on the WPG representation, an effective algorithm for determining the new reconstructibility notion for BCNs is designed with the help of the theories of finite automata and formal languages. We prove that a BCN is not reconstructible iff its WPG has a complete subgraph. Besides, we prove that a BCN is reconstructible in the sense of [Fo","authors_text":"Kuize Zhang, Lijun Zhang, Rong Su","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-09T08:41:52Z","title":"A weighted pair graph representation for reconstructibility of Boolean control networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02786","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:a67503314ff349748c0df50adb696688c31ed6fefb60fe4f086bd874824c01f8","target":"record","created_at":"2026-05-18T01:02:45Z","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":"bea2814b35d6f7fd6c6f0bd745c2b72918ad74a792e9e5514f93e4bb3eb55250","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-09T08:41:52Z","title_canon_sha256":"8736072177547ba743577ff69c3f37716a7ac81c3c404bdecdb20e8199651f5c"},"schema_version":"1.0","source":{"id":"1512.02786","kind":"arxiv","version":2}},"canonical_sha256":"b983ca2b0b27f73e9ae9a1a67369005416238cc9812f1fd0cf1d28fa7f5c20fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b983ca2b0b27f73e9ae9a1a67369005416238cc9812f1fd0cf1d28fa7f5c20fa","first_computed_at":"2026-05-18T01:02:45.390527Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:45.390527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+ioWRim2YUZIopPY0+o8dwaoDk9ZvofLY3inVfhHCaF7klqm3cMvnqwTALpetqhsX2L6uGWgaTbK9E/QYef/Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:45.390952Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.02786","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a67503314ff349748c0df50adb696688c31ed6fefb60fe4f086bd874824c01f8","sha256:e266d23fda76680b60ef143277402a1a1c783b005a4ed5946f5917871b5d0a1e"],"state_sha256":"650ae14545b81f84b8a33f8509f3e0c1fcd404278a9c22f261682fc863f913a8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g/bvpjmG4+NPu8l0r87IqTC2kawRaKIFqAkR2T6DQkHvC/6KnVFnzYzTB2AmgmgzDyCB7j8A528IvbS8E0CsBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:18:28.921671Z","bundle_sha256":"d1f92c8c971ae08cde4c1cd151d16c2419f70800158c1634173fa57cf7fdcf99"}}