{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5VWV2RYWTX4BX5SIHCF4YVBYVR","short_pith_number":"pith:5VWV2RYW","canonical_record":{"source":{"id":"1403.4868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-03-19T16:14:12Z","cross_cats_sorted":[],"title_canon_sha256":"129e63ffcbf94ad7d81b56c633d3a031c3efa493937c78bd300ca3504b9d6da1","abstract_canon_sha256":"49b64e631719f064b30322d61ec9a6d7d411c53cca2447c5a8983b85def04420"},"schema_version":"1.0"},"canonical_sha256":"ed6d5d47169df81bf648388bcc5438ac5216a5c799fcb0a3642489dbe63ffd3a","source":{"kind":"arxiv","id":"1403.4868","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4868","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4868v1","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4868","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"pith_short_12","alias_value":"5VWV2RYWTX4B","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"5VWV2RYWTX4BX5SI","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"5VWV2RYW","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5VWV2RYWTX4BX5SIHCF4YVBYVR","target":"record","payload":{"canonical_record":{"source":{"id":"1403.4868","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-03-19T16:14:12Z","cross_cats_sorted":[],"title_canon_sha256":"129e63ffcbf94ad7d81b56c633d3a031c3efa493937c78bd300ca3504b9d6da1","abstract_canon_sha256":"49b64e631719f064b30322d61ec9a6d7d411c53cca2447c5a8983b85def04420"},"schema_version":"1.0"},"canonical_sha256":"ed6d5d47169df81bf648388bcc5438ac5216a5c799fcb0a3642489dbe63ffd3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:04.291562Z","signature_b64":"vUPvpMFwOM0YmjRPutz7Y2uQjRo6ULPjIsn4KNUxHa75/RBJEUdby7yrHUhL+bD8CETnUD7kkyf5dqK7nEgOCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed6d5d47169df81bf648388bcc5438ac5216a5c799fcb0a3642489dbe63ffd3a","last_reissued_at":"2026-05-18T02:56:04.291130Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:04.291130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.4868","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:56:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mv27Lwd4Iw7JTGaHE3nhh1fyBQ5yoITsRp8O8jvWcHP3tXQZSGNQmmAJ/wLVpzb9/QLSunTwaQPfTT3V1/n+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T03:21:56.697206Z"},"content_sha256":"30057ae791b4b00d459873b3aeb8ade0778f62582c9126ddacced6880ab5bfe5","schema_version":"1.0","event_id":"sha256:30057ae791b4b00d459873b3aeb8ade0778f62582c9126ddacced6880ab5bfe5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5VWV2RYWTX4BX5SIHCF4YVBYVR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Zero forcing sets and controllability of dynamical systems defined on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Kanat Camlibel, Nima Monshizadeh, Shuo Zhang","submitted_at":"2014-03-19T16:14:12Z","abstract_excerpt":"In this paper, controllability of systems defined on graphs is discussed. We consider the problem of controllability of the network for a family of matrices carrying the structure of an underlying directed graph. A one-to-one correspondence between the set of leaders rendering the network controllable and zero forcing sets is established. To illustrate the proposed results, special cases including path, cycle, and complete graphs are discussed. Moreover, as shown for graphs with a tree structure, the proposed results of the present paper together with the existing results on the zero forcing s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4868","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:56:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z7pwB+NA7FUyssqRHSbARyf1kUClIk0423cspvR6Jt3Vum2f6DVAVNiBimarITNzeZ7uowOEiMQhJ3j+UdT0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T03:21:56.697570Z"},"content_sha256":"67d5958fb5848c86b2190e3a041c6abb3ec1c12ba8a8aa4d4f98576757006a98","schema_version":"1.0","event_id":"sha256:67d5958fb5848c86b2190e3a041c6abb3ec1c12ba8a8aa4d4f98576757006a98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5VWV2RYWTX4BX5SIHCF4YVBYVR/bundle.json","state_url":"https://pith.science/pith/5VWV2RYWTX4BX5SIHCF4YVBYVR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5VWV2RYWTX4BX5SIHCF4YVBYVR/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-23T03:21:56Z","links":{"resolver":"https://pith.science/pith/5VWV2RYWTX4BX5SIHCF4YVBYVR","bundle":"https://pith.science/pith/5VWV2RYWTX4BX5SIHCF4YVBYVR/bundle.json","state":"https://pith.science/pith/5VWV2RYWTX4BX5SIHCF4YVBYVR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5VWV2RYWTX4BX5SIHCF4YVBYVR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5VWV2RYWTX4BX5SIHCF4YVBYVR","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":"49b64e631719f064b30322d61ec9a6d7d411c53cca2447c5a8983b85def04420","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-03-19T16:14:12Z","title_canon_sha256":"129e63ffcbf94ad7d81b56c633d3a031c3efa493937c78bd300ca3504b9d6da1"},"schema_version":"1.0","source":{"id":"1403.4868","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4868","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4868v1","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4868","created_at":"2026-05-18T02:56:04Z"},{"alias_kind":"pith_short_12","alias_value":"5VWV2RYWTX4B","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"5VWV2RYWTX4BX5SI","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"5VWV2RYW","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:67d5958fb5848c86b2190e3a041c6abb3ec1c12ba8a8aa4d4f98576757006a98","target":"graph","created_at":"2026-05-18T02:56:04Z","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":"In this paper, controllability of systems defined on graphs is discussed. We consider the problem of controllability of the network for a family of matrices carrying the structure of an underlying directed graph. A one-to-one correspondence between the set of leaders rendering the network controllable and zero forcing sets is established. To illustrate the proposed results, special cases including path, cycle, and complete graphs are discussed. Moreover, as shown for graphs with a tree structure, the proposed results of the present paper together with the existing results on the zero forcing s","authors_text":"Kanat Camlibel, Nima Monshizadeh, Shuo Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-03-19T16:14:12Z","title":"Zero forcing sets and controllability of dynamical systems defined on graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4868","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:30057ae791b4b00d459873b3aeb8ade0778f62582c9126ddacced6880ab5bfe5","target":"record","created_at":"2026-05-18T02:56:04Z","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":"49b64e631719f064b30322d61ec9a6d7d411c53cca2447c5a8983b85def04420","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2014-03-19T16:14:12Z","title_canon_sha256":"129e63ffcbf94ad7d81b56c633d3a031c3efa493937c78bd300ca3504b9d6da1"},"schema_version":"1.0","source":{"id":"1403.4868","kind":"arxiv","version":1}},"canonical_sha256":"ed6d5d47169df81bf648388bcc5438ac5216a5c799fcb0a3642489dbe63ffd3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed6d5d47169df81bf648388bcc5438ac5216a5c799fcb0a3642489dbe63ffd3a","first_computed_at":"2026-05-18T02:56:04.291130Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:04.291130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vUPvpMFwOM0YmjRPutz7Y2uQjRo6ULPjIsn4KNUxHa75/RBJEUdby7yrHUhL+bD8CETnUD7kkyf5dqK7nEgOCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:04.291562Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.4868","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:30057ae791b4b00d459873b3aeb8ade0778f62582c9126ddacced6880ab5bfe5","sha256:67d5958fb5848c86b2190e3a041c6abb3ec1c12ba8a8aa4d4f98576757006a98"],"state_sha256":"e334eebef3e610402eb50211a59f0506344a7b01f1eee7d910117cdfea41cb42"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+tsn2gruq1l9ZL5Bv45afrnVfKYBSrvf9Pl8pvHnQhjIEZttgXMoIQY1iNHt2hV0gCqrlHbSHU/2PNfHExdzDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T03:21:56.699471Z","bundle_sha256":"0407091df1457ab869274f0e1817c2b34d6030b5403aaaeda995382a316deb64"}}