{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TOUPYKMZEVTHVBHPWZSLICI7X2","short_pith_number":"pith:TOUPYKMZ","schema_version":"1.0","canonical_sha256":"9ba8fc299925667a84efb664b4091fbe80b13ffbeaa667512575fc44cdcc9c54","source":{"kind":"arxiv","id":"1412.6792","version":1},"attestation_state":"computed","paper":{"title":"A linear time algorithm to verify strong structural controllability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Alexander Weber, Ferdinand Svaricek, Gunther Reissig","submitted_at":"2014-12-21T14:52:36Z","abstract_excerpt":"We prove that strong structural controllability of a pair of structural matrices $(\\mathcal{A},\\mathcal{B})$ can be verified in time linear in $n + r + \\nu$, where $\\mathcal{A}$ is square, $n$ and $r$ denote the number of columns of $\\mathcal{A}$ and $\\mathcal{B}$, respectively, and $\\nu$ is the number of non-zero entries in $(\\mathcal{A},\\mathcal{B})$. We also present an algorithm realizing this bound, which depends on a recent, high-level method to verify strong structural controllability and uses sparse matrix data structures. Linear time complexity is actually achieved by separately storin"},"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":"1412.6792","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-12-21T14:52:36Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"9b6c47284861493350e96e180eb97a1928c93745aae67f84360887757be37bac","abstract_canon_sha256":"17b227a17cd5a69a55cd82d0235ac87abe2c0eae557073c06f7f65a9fcfd200d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:51.226110Z","signature_b64":"FSEApD6yb3qUfQgo0JaEG/HtM3N/KZlXJ8f2OL9xEoZClp1TKeAAmJXbYs9ILGJGMGym09vwmLpoGeJ7fE3FCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ba8fc299925667a84efb664b4091fbe80b13ffbeaa667512575fc44cdcc9c54","last_reissued_at":"2026-05-18T00:57:51.225432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:51.225432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A linear time algorithm to verify strong structural controllability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Alexander Weber, Ferdinand Svaricek, Gunther Reissig","submitted_at":"2014-12-21T14:52:36Z","abstract_excerpt":"We prove that strong structural controllability of a pair of structural matrices $(\\mathcal{A},\\mathcal{B})$ can be verified in time linear in $n + r + \\nu$, where $\\mathcal{A}$ is square, $n$ and $r$ denote the number of columns of $\\mathcal{A}$ and $\\mathcal{B}$, respectively, and $\\nu$ is the number of non-zero entries in $(\\mathcal{A},\\mathcal{B})$. We also present an algorithm realizing this bound, which depends on a recent, high-level method to verify strong structural controllability and uses sparse matrix data structures. Linear time complexity is actually achieved by separately storin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6792","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.6792","created_at":"2026-05-18T00:57:51.225543+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.6792v1","created_at":"2026-05-18T00:57:51.225543+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6792","created_at":"2026-05-18T00:57:51.225543+00:00"},{"alias_kind":"pith_short_12","alias_value":"TOUPYKMZEVTH","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"TOUPYKMZEVTHVBHP","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"TOUPYKMZ","created_at":"2026-05-18T12:28:49.207871+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TOUPYKMZEVTHVBHPWZSLICI7X2","json":"https://pith.science/pith/TOUPYKMZEVTHVBHPWZSLICI7X2.json","graph_json":"https://pith.science/api/pith-number/TOUPYKMZEVTHVBHPWZSLICI7X2/graph.json","events_json":"https://pith.science/api/pith-number/TOUPYKMZEVTHVBHPWZSLICI7X2/events.json","paper":"https://pith.science/paper/TOUPYKMZ"},"agent_actions":{"view_html":"https://pith.science/pith/TOUPYKMZEVTHVBHPWZSLICI7X2","download_json":"https://pith.science/pith/TOUPYKMZEVTHVBHPWZSLICI7X2.json","view_paper":"https://pith.science/paper/TOUPYKMZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.6792&json=true","fetch_graph":"https://pith.science/api/pith-number/TOUPYKMZEVTHVBHPWZSLICI7X2/graph.json","fetch_events":"https://pith.science/api/pith-number/TOUPYKMZEVTHVBHPWZSLICI7X2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TOUPYKMZEVTHVBHPWZSLICI7X2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TOUPYKMZEVTHVBHPWZSLICI7X2/action/storage_attestation","attest_author":"https://pith.science/pith/TOUPYKMZEVTHVBHPWZSLICI7X2/action/author_attestation","sign_citation":"https://pith.science/pith/TOUPYKMZEVTHVBHPWZSLICI7X2/action/citation_signature","submit_replication":"https://pith.science/pith/TOUPYKMZEVTHVBHPWZSLICI7X2/action/replication_record"}},"created_at":"2026-05-18T00:57:51.225543+00:00","updated_at":"2026-05-18T00:57:51.225543+00:00"}