{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ENPLJISWKN3YTAUHQLJ4WOUOCX","short_pith_number":"pith:ENPLJISW","schema_version":"1.0","canonical_sha256":"235eb4a256537789828782d3cb3a8e15c4b1291c94efd7c96c0a5cf202e9ebe2","source":{"kind":"arxiv","id":"1905.05977","version":1},"attestation_state":"computed","paper":{"title":"Structured real radius of controllability for higher order LTI systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Subashish Datta, Swanand Khare, Tanay Saha","submitted_at":"2019-05-15T07:04:19Z","abstract_excerpt":"In this paper, we consider the problem of computing the nearest uncontrollable (C-uncontrollable) system to a given higher order system. The distance to the nearest uncontrollable system, also termed as the radius of controllability, is a good measure of gauging the numerical robustness of the given system with respect to controllability. Here, we invoke the equivalence of C-controllability of a higher order system with full rank property of a certain Toeplitz structured matrix. This enables us to pose the problem of computing the radius of controllability as equivalent to the problem of compu"},"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":"1905.05977","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-15T07:04:19Z","cross_cats_sorted":[],"title_canon_sha256":"dfeed0ca36a74754525ef45a9c24942b35fd910f10858be74ffdf262fe02c631","abstract_canon_sha256":"7dab8864f21fde4a7135dec39b3e30193a5fdf90c572d3315754e92f373050a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:07.908306Z","signature_b64":"VVAlJqFOe9xJmFZOPrfHWg7WWK9o28JgFayXpdXr8wIEGNNFNKUA4T1mjaMF5vgjj6U6n6a6QYSXus6VxQ7JDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"235eb4a256537789828782d3cb3a8e15c4b1291c94efd7c96c0a5cf202e9ebe2","last_reissued_at":"2026-05-17T23:46:07.907722Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:07.907722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structured real radius of controllability for higher order LTI systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Subashish Datta, Swanand Khare, Tanay Saha","submitted_at":"2019-05-15T07:04:19Z","abstract_excerpt":"In this paper, we consider the problem of computing the nearest uncontrollable (C-uncontrollable) system to a given higher order system. The distance to the nearest uncontrollable system, also termed as the radius of controllability, is a good measure of gauging the numerical robustness of the given system with respect to controllability. Here, we invoke the equivalence of C-controllability of a higher order system with full rank property of a certain Toeplitz structured matrix. This enables us to pose the problem of computing the radius of controllability as equivalent to the problem of compu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05977","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":"1905.05977","created_at":"2026-05-17T23:46:07.907816+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.05977v1","created_at":"2026-05-17T23:46:07.907816+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05977","created_at":"2026-05-17T23:46:07.907816+00:00"},{"alias_kind":"pith_short_12","alias_value":"ENPLJISWKN3Y","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"ENPLJISWKN3YTAUH","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"ENPLJISW","created_at":"2026-05-18T12:33:15.570797+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/ENPLJISWKN3YTAUHQLJ4WOUOCX","json":"https://pith.science/pith/ENPLJISWKN3YTAUHQLJ4WOUOCX.json","graph_json":"https://pith.science/api/pith-number/ENPLJISWKN3YTAUHQLJ4WOUOCX/graph.json","events_json":"https://pith.science/api/pith-number/ENPLJISWKN3YTAUHQLJ4WOUOCX/events.json","paper":"https://pith.science/paper/ENPLJISW"},"agent_actions":{"view_html":"https://pith.science/pith/ENPLJISWKN3YTAUHQLJ4WOUOCX","download_json":"https://pith.science/pith/ENPLJISWKN3YTAUHQLJ4WOUOCX.json","view_paper":"https://pith.science/paper/ENPLJISW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.05977&json=true","fetch_graph":"https://pith.science/api/pith-number/ENPLJISWKN3YTAUHQLJ4WOUOCX/graph.json","fetch_events":"https://pith.science/api/pith-number/ENPLJISWKN3YTAUHQLJ4WOUOCX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ENPLJISWKN3YTAUHQLJ4WOUOCX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ENPLJISWKN3YTAUHQLJ4WOUOCX/action/storage_attestation","attest_author":"https://pith.science/pith/ENPLJISWKN3YTAUHQLJ4WOUOCX/action/author_attestation","sign_citation":"https://pith.science/pith/ENPLJISWKN3YTAUHQLJ4WOUOCX/action/citation_signature","submit_replication":"https://pith.science/pith/ENPLJISWKN3YTAUHQLJ4WOUOCX/action/replication_record"}},"created_at":"2026-05-17T23:46:07.907816+00:00","updated_at":"2026-05-17T23:46:07.907816+00:00"}