{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7KK6AC5TBYQ72VBPTDOMQXAIQH","short_pith_number":"pith:7KK6AC5T","canonical_record":{"source":{"id":"1611.10007","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-11-30T05:37:11Z","cross_cats_sorted":["cs.MA","cs.RO","math.CO","math.DS"],"title_canon_sha256":"aa2411dc6fc8b7cbcb6f6fe696ca2d37b38d43a68ed57e98fe403d22f5de6a31","abstract_canon_sha256":"4780dde0e3a2bca86c06c63406d163464ee51323f864ecdd2f35d1034a498295"},"schema_version":"1.0"},"canonical_sha256":"fa95e00bb30e21fd542f98dcc85c0881d97309a97d616c3a0a0d3e61c543d9a7","source":{"kind":"arxiv","id":"1611.10007","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.10007","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"arxiv_version","alias_value":"1611.10007v1","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.10007","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"pith_short_12","alias_value":"7KK6AC5TBYQ7","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7KK6AC5TBYQ72VBP","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7KK6AC5T","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7KK6AC5TBYQ72VBPTDOMQXAIQH","target":"record","payload":{"canonical_record":{"source":{"id":"1611.10007","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-11-30T05:37:11Z","cross_cats_sorted":["cs.MA","cs.RO","math.CO","math.DS"],"title_canon_sha256":"aa2411dc6fc8b7cbcb6f6fe696ca2d37b38d43a68ed57e98fe403d22f5de6a31","abstract_canon_sha256":"4780dde0e3a2bca86c06c63406d163464ee51323f864ecdd2f35d1034a498295"},"schema_version":"1.0"},"canonical_sha256":"fa95e00bb30e21fd542f98dcc85c0881d97309a97d616c3a0a0d3e61c543d9a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:11.411740Z","signature_b64":"DAnbJ+6LzL16T12lWbfUJl7osN7m2U8De/Q4Ghra4U701xfEB1QtpV/V0pnEiqDDUyPGVJGlRjXRDuojJDK6Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa95e00bb30e21fd542f98dcc85c0881d97309a97d616c3a0a0d3e61c543d9a7","last_reissued_at":"2026-05-18T00:56:11.411301Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:11.411301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.10007","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-18T00:56:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wpUYRNXX3movM1/s3OSsq1XNQVqDrKMiDU3NBy/F4Ifza+kxmibKqDKEe8a7bfKIEr6uxqijJzjECstk3JIODw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:06:50.449823Z"},"content_sha256":"83fe3927f712cb83773e920c15d9abee6d476ade9754dc26d0566720df724d72","schema_version":"1.0","event_id":"sha256:83fe3927f712cb83773e920c15d9abee6d476ade9754dc26d0566720df724d72"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7KK6AC5TBYQ72VBPTDOMQXAIQH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structural Controllability of Multi-Agent Networks: Robustness against Simultaneous Failures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.RO","math.CO","math.DS"],"primary_cat":"cs.SY","authors_text":"Amir G. Aghdam, M. Amin Rahimian","submitted_at":"2016-11-30T05:37:11Z","abstract_excerpt":"In this paper, structural controllability of a leader-follower multi-agent system with multiple leaders is studied from a graph-theoretic point of view. The problem of preservation of structural controllability under simultaneous failures in both the communication links and the agents is investigated. The effects of the loss of agents and communication links on the controllability of an information flow graph are previously studied. In this work, the corresponding results are exploited to introduce some useful indices and importance measures that help characterize and quantify the role of indi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.10007","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-18T00:56:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n7jWjceXx18l84rWeKfiQFDQvRMgekgWHB9QbNSEAehWLmztixeAxXunnw010KpOZWCCg835KTfGU38I09vhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T14:06:50.450418Z"},"content_sha256":"a821ac208cd4979602f82ee5863ccb66ccab1538ab9b6a76619261ed4d8d7928","schema_version":"1.0","event_id":"sha256:a821ac208cd4979602f82ee5863ccb66ccab1538ab9b6a76619261ed4d8d7928"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7KK6AC5TBYQ72VBPTDOMQXAIQH/bundle.json","state_url":"https://pith.science/pith/7KK6AC5TBYQ72VBPTDOMQXAIQH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7KK6AC5TBYQ72VBPTDOMQXAIQH/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-07-05T14:06:50Z","links":{"resolver":"https://pith.science/pith/7KK6AC5TBYQ72VBPTDOMQXAIQH","bundle":"https://pith.science/pith/7KK6AC5TBYQ72VBPTDOMQXAIQH/bundle.json","state":"https://pith.science/pith/7KK6AC5TBYQ72VBPTDOMQXAIQH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7KK6AC5TBYQ72VBPTDOMQXAIQH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7KK6AC5TBYQ72VBPTDOMQXAIQH","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":"4780dde0e3a2bca86c06c63406d163464ee51323f864ecdd2f35d1034a498295","cross_cats_sorted":["cs.MA","cs.RO","math.CO","math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-11-30T05:37:11Z","title_canon_sha256":"aa2411dc6fc8b7cbcb6f6fe696ca2d37b38d43a68ed57e98fe403d22f5de6a31"},"schema_version":"1.0","source":{"id":"1611.10007","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.10007","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"arxiv_version","alias_value":"1611.10007v1","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.10007","created_at":"2026-05-18T00:56:11Z"},{"alias_kind":"pith_short_12","alias_value":"7KK6AC5TBYQ7","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7KK6AC5TBYQ72VBP","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7KK6AC5T","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:a821ac208cd4979602f82ee5863ccb66ccab1538ab9b6a76619261ed4d8d7928","target":"graph","created_at":"2026-05-18T00:56:11Z","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, structural controllability of a leader-follower multi-agent system with multiple leaders is studied from a graph-theoretic point of view. The problem of preservation of structural controllability under simultaneous failures in both the communication links and the agents is investigated. The effects of the loss of agents and communication links on the controllability of an information flow graph are previously studied. In this work, the corresponding results are exploited to introduce some useful indices and importance measures that help characterize and quantify the role of indi","authors_text":"Amir G. Aghdam, M. Amin Rahimian","cross_cats":["cs.MA","cs.RO","math.CO","math.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-11-30T05:37:11Z","title":"Structural Controllability of Multi-Agent Networks: Robustness against Simultaneous Failures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.10007","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:83fe3927f712cb83773e920c15d9abee6d476ade9754dc26d0566720df724d72","target":"record","created_at":"2026-05-18T00:56:11Z","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":"4780dde0e3a2bca86c06c63406d163464ee51323f864ecdd2f35d1034a498295","cross_cats_sorted":["cs.MA","cs.RO","math.CO","math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-11-30T05:37:11Z","title_canon_sha256":"aa2411dc6fc8b7cbcb6f6fe696ca2d37b38d43a68ed57e98fe403d22f5de6a31"},"schema_version":"1.0","source":{"id":"1611.10007","kind":"arxiv","version":1}},"canonical_sha256":"fa95e00bb30e21fd542f98dcc85c0881d97309a97d616c3a0a0d3e61c543d9a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa95e00bb30e21fd542f98dcc85c0881d97309a97d616c3a0a0d3e61c543d9a7","first_computed_at":"2026-05-18T00:56:11.411301Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:11.411301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DAnbJ+6LzL16T12lWbfUJl7osN7m2U8De/Q4Ghra4U701xfEB1QtpV/V0pnEiqDDUyPGVJGlRjXRDuojJDK6Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:11.411740Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.10007","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83fe3927f712cb83773e920c15d9abee6d476ade9754dc26d0566720df724d72","sha256:a821ac208cd4979602f82ee5863ccb66ccab1538ab9b6a76619261ed4d8d7928"],"state_sha256":"4ce30a258142a4dae98232edc91fef58bb95ee784de780dfb4ea194846a51bea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9DnLHhcia4f8A4P4/xcOSVg8ex0HRtytNPf9CJ1A2Xufio/I9iLpa/SeSmmpeBO1P/a7xLKug7HosUhxXFaFCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T14:06:50.454190Z","bundle_sha256":"017281858ebe4517d225f0ec115e6d2eb69b62e191049dee17509baa32c09f07"}}