{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VNMZPJSCQSG6ZND6DMOA4SAKEJ","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":"396eb8b99632fdbdbfe0f4f23ca5c168d22ae5f83c1dafa916280da956143803","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-12T08:56:20Z","title_canon_sha256":"272bd4178cf6c2189f7eea26024f0d40697d3c4e03657335ca0d606729c6c3b1"},"schema_version":"1.0","source":{"id":"1807.04481","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.04481","created_at":"2026-06-04T19:12:06Z"},{"alias_kind":"arxiv_version","alias_value":"1807.04481v1","created_at":"2026-06-04T19:12:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.04481","created_at":"2026-06-04T19:12:06Z"},{"alias_kind":"pith_short_12","alias_value":"VNMZPJSCQSG6","created_at":"2026-06-04T19:12:06Z"},{"alias_kind":"pith_short_16","alias_value":"VNMZPJSCQSG6ZND6","created_at":"2026-06-04T19:12:06Z"},{"alias_kind":"pith_short_8","alias_value":"VNMZPJSC","created_at":"2026-06-04T19:12:06Z"}],"graph_snapshots":[{"event_id":"sha256:4250e82618895efa77e424338c0d5dd1e437064b9b8ec699899eb3edf351dec0","target":"graph","created_at":"2026-06-04T19:12:06Z","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/1807.04481/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Consider a discrete-time linear time-invariant descriptor system $Ex(k+1)=Ax(k)$ for $k \\in \\mathbb Z_{+}$. In this paper, we tackle for the first time the problem of stabilizing such systems by computing a nearby regular index one stable system $\\hat E x(k+1)= \\hat A x(k)$ with $\\text{rank}(\\hat E)=r$. We reformulate this highly nonconvex problem into an equivalent optimization problem with a relatively simple feasible set onto which it is easy to project. This allows us to employ a block coordinate descent method to obtain a nearby regular index one stable system. We illustrate the effective","authors_text":"Michael Karow, Nicolas Gillis, Punit Sharma","cross_cats":["cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-12T08:56:20Z","title":"A note on approximating the nearest stable discrete-time descriptor system with fixed rank"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.04481","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:0c6d1b7322349ae126ca88844416c4b736c3bf3b4e14cc321f8797ff382a7e45","target":"record","created_at":"2026-06-04T19:12:06Z","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":"396eb8b99632fdbdbfe0f4f23ca5c168d22ae5f83c1dafa916280da956143803","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-12T08:56:20Z","title_canon_sha256":"272bd4178cf6c2189f7eea26024f0d40697d3c4e03657335ca0d606729c6c3b1"},"schema_version":"1.0","source":{"id":"1807.04481","kind":"arxiv","version":1}},"canonical_sha256":"ab5997a642848decb47e1b1c0e480a224bfd90612f896fb24ea6fa6fcbf157da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab5997a642848decb47e1b1c0e480a224bfd90612f896fb24ea6fa6fcbf157da","first_computed_at":"2026-06-04T19:12:06.837978Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T19:12:06.837978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ex72mgLVZB6lJDwrhMBKWXR39aafFlQAunqwgf3jQvYa3ubaKoYsnNjy7utRmbv/ZNCdTyiGagl9gXnhYrE6Ag==","signature_status":"signed_v1","signed_at":"2026-06-04T19:12:06.838488Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.04481","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c6d1b7322349ae126ca88844416c4b736c3bf3b4e14cc321f8797ff382a7e45","sha256:4250e82618895efa77e424338c0d5dd1e437064b9b8ec699899eb3edf351dec0"],"state_sha256":"e15385fe08ac7650bc64f09b70aaeac83d5d625532ebbf43ebeff71d90ba1b07"}