{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4KECC5YFCHJ73AT2QBGXTLMAIW","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":"8889f4bd4f396bed0d03818217c2f3992e16b86a6e1f40ad871e5fbd139cf6a3","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2019-04-22T17:23:26Z","title_canon_sha256":"daba03ce15f021f310caa0ec1d34f16661968b94ea628d880e7a62abf79ca998"},"schema_version":"1.0","source":{"id":"1904.09960","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.09960","created_at":"2026-07-05T01:05:23Z"},{"alias_kind":"arxiv_version","alias_value":"1904.09960v2","created_at":"2026-07-05T01:05:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09960","created_at":"2026-07-05T01:05:23Z"},{"alias_kind":"pith_short_12","alias_value":"4KECC5YFCHJ7","created_at":"2026-07-05T01:05:23Z"},{"alias_kind":"pith_short_16","alias_value":"4KECC5YFCHJ73AT2","created_at":"2026-07-05T01:05:23Z"},{"alias_kind":"pith_short_8","alias_value":"4KECC5YF","created_at":"2026-07-05T01:05:23Z"}],"graph_snapshots":[{"event_id":"sha256:9eec1b2d6ff340f7506bcda1da54ef1aae054a30b938883152183ab66f2f432f","target":"graph","created_at":"2026-07-05T01:05:23Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1904.09960/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper investigates the robustness of strong structural controllability for linear time-invariant and linear time-varying directed networks with respect to structural perturbations, including edge deletions and additions. In this direction, we introduce a new construct referred to as a perfect graph associated with a network with a given set of control nodes. The tight upper bounds on the number of edges that can be added to, or removed from a network, while ensuring strong structural controllability, are then derived. Moreover, we obtain a characterization of critical edge-sets, the maxim","authors_text":"Mehran Mesbahi, Mohammad Haeri, Shima Sadat Mousavi","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2019-04-22T17:23:26Z","title":"Strong Structural Controllability of Networks under Time-Invariant and Time-Varying Topological Perturbations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09960","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:6826f88c80cf8a118b19047e9107d7d658df72a83d09bdf26f78b8148c62c548","target":"record","created_at":"2026-07-05T01:05:23Z","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":"8889f4bd4f396bed0d03818217c2f3992e16b86a6e1f40ad871e5fbd139cf6a3","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2019-04-22T17:23:26Z","title_canon_sha256":"daba03ce15f021f310caa0ec1d34f16661968b94ea628d880e7a62abf79ca998"},"schema_version":"1.0","source":{"id":"1904.09960","kind":"arxiv","version":2}},"canonical_sha256":"e28821770511d3fd827a804d79ad8045a9a18696ed54f15da0c19d3e8445b04c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e28821770511d3fd827a804d79ad8045a9a18696ed54f15da0c19d3e8445b04c","first_computed_at":"2026-07-05T01:05:23.348141Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:05:23.348141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NE/6wwlRpQwOz9asMWBdS/+Ci7vjADcYaYJQXDiE12BImJf407cXWVosIKwdg4hbB6+2Z2r/4mIqwMSmEd6DAg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:05:23.348688Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.09960","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6826f88c80cf8a118b19047e9107d7d658df72a83d09bdf26f78b8148c62c548","sha256:9eec1b2d6ff340f7506bcda1da54ef1aae054a30b938883152183ab66f2f432f"],"state_sha256":"ea70338f2aebbe3388c5b2d8841c33b262e0163b41e244ba2ad27ba9a018ff60"}