{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ET2CEN3KVADKZQR6Z3A7HF3QIO","short_pith_number":"pith:ET2CEN3K","canonical_record":{"source":{"id":"1608.04309","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-08-15T15:51:42Z","cross_cats_sorted":["cs.SI","math.OC"],"title_canon_sha256":"5c9087c00c1e075aad057dceeed37088699869d02aa8211a919363277c434868","abstract_canon_sha256":"1545e43baf48ce526aa406c88ddca99bae9c07091dabd69d9c569395f8adaafa"},"schema_version":"1.0"},"canonical_sha256":"24f422376aa806acc23ecec1f39770438b3a377ff95709219be0d45d769d5d68","source":{"kind":"arxiv","id":"1608.04309","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04309","created_at":"2026-05-18T01:08:37Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04309v1","created_at":"2026-05-18T01:08:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04309","created_at":"2026-05-18T01:08:37Z"},{"alias_kind":"pith_short_12","alias_value":"ET2CEN3KVADK","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"ET2CEN3KVADKZQR6","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"ET2CEN3K","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ET2CEN3KVADKZQR6Z3A7HF3QIO","target":"record","payload":{"canonical_record":{"source":{"id":"1608.04309","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-08-15T15:51:42Z","cross_cats_sorted":["cs.SI","math.OC"],"title_canon_sha256":"5c9087c00c1e075aad057dceeed37088699869d02aa8211a919363277c434868","abstract_canon_sha256":"1545e43baf48ce526aa406c88ddca99bae9c07091dabd69d9c569395f8adaafa"},"schema_version":"1.0"},"canonical_sha256":"24f422376aa806acc23ecec1f39770438b3a377ff95709219be0d45d769d5d68","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:37.298751Z","signature_b64":"GQ6MjbylZtHFqEx3jtW9oF/N1GqML5wr9xlgi/kv1mK1rXGE1e/469k1Fj8p0u+Gbzuw9qzyODlldUUCR1iGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24f422376aa806acc23ecec1f39770438b3a377ff95709219be0d45d769d5d68","last_reissued_at":"2026-05-18T01:08:37.298053Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:37.298053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.04309","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-18T01:08:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V3yD9aN/GQxiNHE4hpg9y0uh7zPp7eMro2s0siWQx72TVn/2BEFz3eJBS5eTpaCKImxY0X38Nsdu6Le/F5cJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:05:42.598839Z"},"content_sha256":"e69bf608e387705a9c6bfbf07023908e92d53b94a9670b5ea97df13fc90a4f86","schema_version":"1.0","event_id":"sha256:e69bf608e387705a9c6bfbf07023908e92d53b94a9670b5ea97df13fc90a4f86"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ET2CEN3KVADKZQR6Z3A7HF3QIO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Distances and Controllability of Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math.OC"],"primary_cat":"cs.SY","authors_text":"A. Yasin Yazicioglu, Magnus Egerstedt, Waseem Abbas","submitted_at":"2016-08-15T15:51:42Z","abstract_excerpt":"In this technical note, we study the controllability of diffusively coupled networks from a graph theoretic perspective. We consider leader-follower networks, where the external control inputs are injected to only some of the agents, namely the leaders. Our main result relates the controllability of such systems to the graph distances between the agents. More specifically, we present a graph topological lower bound on the rank of the controllability matrix. This lower bound is tight, and it is applicable to systems with arbitrary network topologies, coupling weights, and number of leaders. An "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04309","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-18T01:08:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ug7IA3v8+kkyB8+yP7FT2CXRPJaMGekvCdy5fRhNtrtx6GcAlMcHjpRghgtilYNTz+H9h2HlHusZrebKY8jKDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:05:42.599456Z"},"content_sha256":"0e4d4d665590f719e68ad8f8523738823096f75280bf3669c77473e69a34dd0e","schema_version":"1.0","event_id":"sha256:0e4d4d665590f719e68ad8f8523738823096f75280bf3669c77473e69a34dd0e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ET2CEN3KVADKZQR6Z3A7HF3QIO/bundle.json","state_url":"https://pith.science/pith/ET2CEN3KVADKZQR6Z3A7HF3QIO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ET2CEN3KVADKZQR6Z3A7HF3QIO/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-28T04:05:42Z","links":{"resolver":"https://pith.science/pith/ET2CEN3KVADKZQR6Z3A7HF3QIO","bundle":"https://pith.science/pith/ET2CEN3KVADKZQR6Z3A7HF3QIO/bundle.json","state":"https://pith.science/pith/ET2CEN3KVADKZQR6Z3A7HF3QIO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ET2CEN3KVADKZQR6Z3A7HF3QIO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ET2CEN3KVADKZQR6Z3A7HF3QIO","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":"1545e43baf48ce526aa406c88ddca99bae9c07091dabd69d9c569395f8adaafa","cross_cats_sorted":["cs.SI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-08-15T15:51:42Z","title_canon_sha256":"5c9087c00c1e075aad057dceeed37088699869d02aa8211a919363277c434868"},"schema_version":"1.0","source":{"id":"1608.04309","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04309","created_at":"2026-05-18T01:08:37Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04309v1","created_at":"2026-05-18T01:08:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04309","created_at":"2026-05-18T01:08:37Z"},{"alias_kind":"pith_short_12","alias_value":"ET2CEN3KVADK","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"ET2CEN3KVADKZQR6","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"ET2CEN3K","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:0e4d4d665590f719e68ad8f8523738823096f75280bf3669c77473e69a34dd0e","target":"graph","created_at":"2026-05-18T01:08:37Z","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 technical note, we study the controllability of diffusively coupled networks from a graph theoretic perspective. We consider leader-follower networks, where the external control inputs are injected to only some of the agents, namely the leaders. Our main result relates the controllability of such systems to the graph distances between the agents. More specifically, we present a graph topological lower bound on the rank of the controllability matrix. This lower bound is tight, and it is applicable to systems with arbitrary network topologies, coupling weights, and number of leaders. An ","authors_text":"A. Yasin Yazicioglu, Magnus Egerstedt, Waseem Abbas","cross_cats":["cs.SI","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-08-15T15:51:42Z","title":"Graph Distances and Controllability of Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04309","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:e69bf608e387705a9c6bfbf07023908e92d53b94a9670b5ea97df13fc90a4f86","target":"record","created_at":"2026-05-18T01:08:37Z","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":"1545e43baf48ce526aa406c88ddca99bae9c07091dabd69d9c569395f8adaafa","cross_cats_sorted":["cs.SI","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-08-15T15:51:42Z","title_canon_sha256":"5c9087c00c1e075aad057dceeed37088699869d02aa8211a919363277c434868"},"schema_version":"1.0","source":{"id":"1608.04309","kind":"arxiv","version":1}},"canonical_sha256":"24f422376aa806acc23ecec1f39770438b3a377ff95709219be0d45d769d5d68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"24f422376aa806acc23ecec1f39770438b3a377ff95709219be0d45d769d5d68","first_computed_at":"2026-05-18T01:08:37.298053Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:37.298053Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GQ6MjbylZtHFqEx3jtW9oF/N1GqML5wr9xlgi/kv1mK1rXGE1e/469k1Fj8p0u+Gbzuw9qzyODlldUUCR1iGDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:37.298751Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.04309","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e69bf608e387705a9c6bfbf07023908e92d53b94a9670b5ea97df13fc90a4f86","sha256:0e4d4d665590f719e68ad8f8523738823096f75280bf3669c77473e69a34dd0e"],"state_sha256":"ef18a5a52f8c71fcc80e4d5236bb633ad970e1d57e63575c407273e0e8a072de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aiXlZ8IzLC6HYyKINbISRvWpJyeKmRclEfld2v0XW044zkT6XzRq0zutC+nqlP+EVy3/+57+RT1fJ0xcm5jiBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:05:42.602296Z","bundle_sha256":"76b634b421421889823b443f363f4b15eefeb4607b2b3e4b57d4295915fd1ec9"}}