{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ENPLJISWKN3YTAUHQLJ4WOUOCX","short_pith_number":"pith:ENPLJISW","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"},"canonical_sha256":"235eb4a256537789828782d3cb3a8e15c4b1291c94efd7c96c0a5cf202e9ebe2","source":{"kind":"arxiv","id":"1905.05977","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05977","created_at":"2026-05-17T23:46:07Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05977v1","created_at":"2026-05-17T23:46:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05977","created_at":"2026-05-17T23:46:07Z"},{"alias_kind":"pith_short_12","alias_value":"ENPLJISWKN3Y","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"ENPLJISWKN3YTAUH","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"ENPLJISW","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ENPLJISWKN3YTAUHQLJ4WOUOCX","target":"record","payload":{"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"},"canonical_sha256":"235eb4a256537789828782d3cb3a8e15c4b1291c94efd7c96c0a5cf202e9ebe2","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"},"source_kind":"arxiv","source_id":"1905.05977","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-17T23:46:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w5+MZgvrDMkZTWFrwCfWsR8t4Llm2P+Eg58UigOREmog7keC26H6mfVX7RMcw0NOhfs1sMTVPlevRmhLdzYxCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T07:35:56.800367Z"},"content_sha256":"a1e8d28fe6b6aae3377c95f236c73e3dce8191eb0181fdf7fbb7a601df3fb406","schema_version":"1.0","event_id":"sha256:a1e8d28fe6b6aae3377c95f236c73e3dce8191eb0181fdf7fbb7a601df3fb406"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ENPLJISWKN3YTAUHQLJ4WOUOCX","target":"graph","payload":{"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"},"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-17T23:46:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ivALhsrQzuvW6sqs5/PlPaaQPY0i8mWlbvMjwgDE9/ppCGUhozKZx0L2puBoB8plibq5Ymlh6A+8ozQvAJPDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T07:35:56.800748Z"},"content_sha256":"a3ca7ca0080f96bff712a32d1832847132f6b7467dd9292ea7ec81d33643d7d8","schema_version":"1.0","event_id":"sha256:a3ca7ca0080f96bff712a32d1832847132f6b7467dd9292ea7ec81d33643d7d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ENPLJISWKN3YTAUHQLJ4WOUOCX/bundle.json","state_url":"https://pith.science/pith/ENPLJISWKN3YTAUHQLJ4WOUOCX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ENPLJISWKN3YTAUHQLJ4WOUOCX/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-04T07:35:56Z","links":{"resolver":"https://pith.science/pith/ENPLJISWKN3YTAUHQLJ4WOUOCX","bundle":"https://pith.science/pith/ENPLJISWKN3YTAUHQLJ4WOUOCX/bundle.json","state":"https://pith.science/pith/ENPLJISWKN3YTAUHQLJ4WOUOCX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ENPLJISWKN3YTAUHQLJ4WOUOCX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ENPLJISWKN3YTAUHQLJ4WOUOCX","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":"7dab8864f21fde4a7135dec39b3e30193a5fdf90c572d3315754e92f373050a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-15T07:04:19Z","title_canon_sha256":"dfeed0ca36a74754525ef45a9c24942b35fd910f10858be74ffdf262fe02c631"},"schema_version":"1.0","source":{"id":"1905.05977","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.05977","created_at":"2026-05-17T23:46:07Z"},{"alias_kind":"arxiv_version","alias_value":"1905.05977v1","created_at":"2026-05-17T23:46:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.05977","created_at":"2026-05-17T23:46:07Z"},{"alias_kind":"pith_short_12","alias_value":"ENPLJISWKN3Y","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"ENPLJISWKN3YTAUH","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"ENPLJISW","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:a3ca7ca0080f96bff712a32d1832847132f6b7467dd9292ea7ec81d33643d7d8","target":"graph","created_at":"2026-05-17T23:46:07Z","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, 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","authors_text":"Subashish Datta, Swanand Khare, Tanay Saha","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-15T07:04:19Z","title":"Structured real radius of controllability for higher order LTI systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.05977","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:a1e8d28fe6b6aae3377c95f236c73e3dce8191eb0181fdf7fbb7a601df3fb406","target":"record","created_at":"2026-05-17T23:46:07Z","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":"7dab8864f21fde4a7135dec39b3e30193a5fdf90c572d3315754e92f373050a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-15T07:04:19Z","title_canon_sha256":"dfeed0ca36a74754525ef45a9c24942b35fd910f10858be74ffdf262fe02c631"},"schema_version":"1.0","source":{"id":"1905.05977","kind":"arxiv","version":1}},"canonical_sha256":"235eb4a256537789828782d3cb3a8e15c4b1291c94efd7c96c0a5cf202e9ebe2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"235eb4a256537789828782d3cb3a8e15c4b1291c94efd7c96c0a5cf202e9ebe2","first_computed_at":"2026-05-17T23:46:07.907722Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:07.907722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VVAlJqFOe9xJmFZOPrfHWg7WWK9o28JgFayXpdXr8wIEGNNFNKUA4T1mjaMF5vgjj6U6n6a6QYSXus6VxQ7JDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:07.908306Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.05977","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a1e8d28fe6b6aae3377c95f236c73e3dce8191eb0181fdf7fbb7a601df3fb406","sha256:a3ca7ca0080f96bff712a32d1832847132f6b7467dd9292ea7ec81d33643d7d8"],"state_sha256":"8ef723804b515efa98b97a05a9cd441915068e16c47e122828538ecd9e6baacd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w9EWvH7MbleDbVwl1wjPGmXnFrFYkGx6JRjvCrVxM1hMzY/f7dI7gyxJC9hKqzbF4WIPz1YpPj+1QiRBFGXhAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T07:35:56.803030Z","bundle_sha256":"72a3c5321ab1836c7f63556a7ebb9f8a5e274658067b97eb2acee1c782459bb5"}}