{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4KECC5YFCHJ73AT2QBGXTLMAIW","short_pith_number":"pith:4KECC5YF","schema_version":"1.0","canonical_sha256":"e28821770511d3fd827a804d79ad8045a9a18696ed54f15da0c19d3e8445b04c","source":{"kind":"arxiv","id":"1904.09960","version":2},"attestation_state":"computed","paper":{"title":"Strong Structural Controllability of Networks under Time-Invariant and Time-Varying Topological Perturbations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.DS","authors_text":"Mehran Mesbahi, Mohammad Haeri, Shima Sadat Mousavi","submitted_at":"2019-04-22T17:23:26Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1904.09960","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.DS","submitted_at":"2019-04-22T17:23:26Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"daba03ce15f021f310caa0ec1d34f16661968b94ea628d880e7a62abf79ca998","abstract_canon_sha256":"8889f4bd4f396bed0d03818217c2f3992e16b86a6e1f40ad871e5fbd139cf6a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:05:23.348688Z","signature_b64":"NE/6wwlRpQwOz9asMWBdS/+Ci7vjADcYaYJQXDiE12BImJf407cXWVosIKwdg4hbB6+2Z2r/4mIqwMSmEd6DAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e28821770511d3fd827a804d79ad8045a9a18696ed54f15da0c19d3e8445b04c","last_reissued_at":"2026-07-05T01:05:23.348141Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:05:23.348141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong Structural Controllability of Networks under Time-Invariant and Time-Varying Topological Perturbations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.DS","authors_text":"Mehran Mesbahi, Mohammad Haeri, Shima Sadat Mousavi","submitted_at":"2019-04-22T17:23:26Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09960","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1904.09960/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.09960","created_at":"2026-07-05T01:05:23.348198+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.09960v2","created_at":"2026-07-05T01:05:23.348198+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09960","created_at":"2026-07-05T01:05:23.348198+00:00"},{"alias_kind":"pith_short_12","alias_value":"4KECC5YFCHJ7","created_at":"2026-07-05T01:05:23.348198+00:00"},{"alias_kind":"pith_short_16","alias_value":"4KECC5YFCHJ73AT2","created_at":"2026-07-05T01:05:23.348198+00:00"},{"alias_kind":"pith_short_8","alias_value":"4KECC5YF","created_at":"2026-07-05T01:05:23.348198+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.05732","citing_title":"Strong Structural Controllability of Signed Networks","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4KECC5YFCHJ73AT2QBGXTLMAIW","json":"https://pith.science/pith/4KECC5YFCHJ73AT2QBGXTLMAIW.json","graph_json":"https://pith.science/api/pith-number/4KECC5YFCHJ73AT2QBGXTLMAIW/graph.json","events_json":"https://pith.science/api/pith-number/4KECC5YFCHJ73AT2QBGXTLMAIW/events.json","paper":"https://pith.science/paper/4KECC5YF"},"agent_actions":{"view_html":"https://pith.science/pith/4KECC5YFCHJ73AT2QBGXTLMAIW","download_json":"https://pith.science/pith/4KECC5YFCHJ73AT2QBGXTLMAIW.json","view_paper":"https://pith.science/paper/4KECC5YF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.09960&json=true","fetch_graph":"https://pith.science/api/pith-number/4KECC5YFCHJ73AT2QBGXTLMAIW/graph.json","fetch_events":"https://pith.science/api/pith-number/4KECC5YFCHJ73AT2QBGXTLMAIW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4KECC5YFCHJ73AT2QBGXTLMAIW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4KECC5YFCHJ73AT2QBGXTLMAIW/action/storage_attestation","attest_author":"https://pith.science/pith/4KECC5YFCHJ73AT2QBGXTLMAIW/action/author_attestation","sign_citation":"https://pith.science/pith/4KECC5YFCHJ73AT2QBGXTLMAIW/action/citation_signature","submit_replication":"https://pith.science/pith/4KECC5YFCHJ73AT2QBGXTLMAIW/action/replication_record"}},"created_at":"2026-07-05T01:05:23.348198+00:00","updated_at":"2026-07-05T01:05:23.348198+00:00"}