{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GUPNM4JGU7SK6NFU7F36TM6EJK","short_pith_number":"pith:GUPNM4JG","canonical_record":{"source":{"id":"1802.08033","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-22T13:29:48Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"2770391b42c7bf4c26027332733e3fe50250830970f04b41eaf785347a92305c","abstract_canon_sha256":"4d55791cc63b842104207ee425d295ce87513bcba54dc2cf491eabdf4e70aaaa"},"schema_version":"1.0"},"canonical_sha256":"351ed67126a7e4af34b4f977e9b3c44ab29e37fffb9f2b7b80dccaad4be437a7","source":{"kind":"arxiv","id":"1802.08033","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08033","created_at":"2026-05-17T23:49:59Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08033v3","created_at":"2026-05-17T23:49:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08033","created_at":"2026-05-17T23:49:59Z"},{"alias_kind":"pith_short_12","alias_value":"GUPNM4JGU7SK","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GUPNM4JGU7SK6NFU","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GUPNM4JG","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GUPNM4JGU7SK6NFU7F36TM6EJK","target":"record","payload":{"canonical_record":{"source":{"id":"1802.08033","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-22T13:29:48Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"2770391b42c7bf4c26027332733e3fe50250830970f04b41eaf785347a92305c","abstract_canon_sha256":"4d55791cc63b842104207ee425d295ce87513bcba54dc2cf491eabdf4e70aaaa"},"schema_version":"1.0"},"canonical_sha256":"351ed67126a7e4af34b4f977e9b3c44ab29e37fffb9f2b7b80dccaad4be437a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:59.722678Z","signature_b64":"oCKPhOsAaf1Cw4QQSuE3m0Lf4X2mf9LCS2po2xjxNTLAZtUSulFemGW0wnAK04+YVTrAzvqyeZZlSDaP6ZH9Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"351ed67126a7e4af34b4f977e9b3c44ab29e37fffb9f2b7b80dccaad4be437a7","last_reissued_at":"2026-05-17T23:49:59.722072Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:59.722072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.08033","source_version":3,"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:49:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LaPl9KK4nueoViftA8jjXZTYV1IdNraz55hDQOfZ3ITiIVIFo6StT61xZ2YJtiPt2q3xs4UX/OSL7UUGCSSXBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T21:53:08.023512Z"},"content_sha256":"e2eb07fe7ff75e52f2055a22892318d0dd89baf3f77a17c3e312b937fd204d0c","schema_version":"1.0","event_id":"sha256:e2eb07fe7ff75e52f2055a22892318d0dd89baf3f77a17c3e312b937fd204d0c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GUPNM4JGU7SK6NFU7F36TM6EJK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximating the nearest stable discrete-time system","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"Michael Karow, Nicolas Gillis, Punit Sharma","submitted_at":"2018-02-22T13:29:48Z","abstract_excerpt":"In this paper, we consider the problem of stabilizing discrete-time linear systems by computing a nearby stable matrix to an unstable one. To do so, we provide a new characterization for the set of stable matrices. We show that a matrix $A$ is stable if and only if it can be written as $A=S^{-1}UBS$, where $S$ is positive definite, $U$ is orthogonal, and $B$ is a positive semidefinite contraction (that is, the singular values of $B$ are less or equal to 1). This characterization results in an equivalent non-convex optimization problem with a feasible set on which it is easy to project. We prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08033","kind":"arxiv","version":3},"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:49:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hiDpjzlNUYPQikU/wKQFQNuhlKxSA4erRWBLTqt/ebLWLytvy+cA5YhYC40H+aI7Ruri+3Pq5zcU5qdV0VJpCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T21:53:08.023855Z"},"content_sha256":"df9cd1715ced2b885ce1abef39a9a4154a8a8c5beacdc3dc28a6471c625e2e40","schema_version":"1.0","event_id":"sha256:df9cd1715ced2b885ce1abef39a9a4154a8a8c5beacdc3dc28a6471c625e2e40"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GUPNM4JGU7SK6NFU7F36TM6EJK/bundle.json","state_url":"https://pith.science/pith/GUPNM4JGU7SK6NFU7F36TM6EJK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GUPNM4JGU7SK6NFU7F36TM6EJK/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-03T21:53:08Z","links":{"resolver":"https://pith.science/pith/GUPNM4JGU7SK6NFU7F36TM6EJK","bundle":"https://pith.science/pith/GUPNM4JGU7SK6NFU7F36TM6EJK/bundle.json","state":"https://pith.science/pith/GUPNM4JGU7SK6NFU7F36TM6EJK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GUPNM4JGU7SK6NFU7F36TM6EJK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GUPNM4JGU7SK6NFU7F36TM6EJK","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":"4d55791cc63b842104207ee425d295ce87513bcba54dc2cf491eabdf4e70aaaa","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-22T13:29:48Z","title_canon_sha256":"2770391b42c7bf4c26027332733e3fe50250830970f04b41eaf785347a92305c"},"schema_version":"1.0","source":{"id":"1802.08033","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.08033","created_at":"2026-05-17T23:49:59Z"},{"alias_kind":"arxiv_version","alias_value":"1802.08033v3","created_at":"2026-05-17T23:49:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.08033","created_at":"2026-05-17T23:49:59Z"},{"alias_kind":"pith_short_12","alias_value":"GUPNM4JGU7SK","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GUPNM4JGU7SK6NFU","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GUPNM4JG","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:df9cd1715ced2b885ce1abef39a9a4154a8a8c5beacdc3dc28a6471c625e2e40","target":"graph","created_at":"2026-05-17T23:49:59Z","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 stabilizing discrete-time linear systems by computing a nearby stable matrix to an unstable one. To do so, we provide a new characterization for the set of stable matrices. We show that a matrix $A$ is stable if and only if it can be written as $A=S^{-1}UBS$, where $S$ is positive definite, $U$ is orthogonal, and $B$ is a positive semidefinite contraction (that is, the singular values of $B$ are less or equal to 1). This characterization results in an equivalent non-convex optimization problem with a feasible set on which it is easy to project. We prop","authors_text":"Michael Karow, Nicolas Gillis, Punit Sharma","cross_cats":["math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-22T13:29:48Z","title":"Approximating the nearest stable discrete-time system"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.08033","kind":"arxiv","version":3},"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:e2eb07fe7ff75e52f2055a22892318d0dd89baf3f77a17c3e312b937fd204d0c","target":"record","created_at":"2026-05-17T23:49:59Z","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":"4d55791cc63b842104207ee425d295ce87513bcba54dc2cf491eabdf4e70aaaa","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-22T13:29:48Z","title_canon_sha256":"2770391b42c7bf4c26027332733e3fe50250830970f04b41eaf785347a92305c"},"schema_version":"1.0","source":{"id":"1802.08033","kind":"arxiv","version":3}},"canonical_sha256":"351ed67126a7e4af34b4f977e9b3c44ab29e37fffb9f2b7b80dccaad4be437a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"351ed67126a7e4af34b4f977e9b3c44ab29e37fffb9f2b7b80dccaad4be437a7","first_computed_at":"2026-05-17T23:49:59.722072Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:59.722072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oCKPhOsAaf1Cw4QQSuE3m0Lf4X2mf9LCS2po2xjxNTLAZtUSulFemGW0wnAK04+YVTrAzvqyeZZlSDaP6ZH9Ag==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:59.722678Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.08033","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2eb07fe7ff75e52f2055a22892318d0dd89baf3f77a17c3e312b937fd204d0c","sha256:df9cd1715ced2b885ce1abef39a9a4154a8a8c5beacdc3dc28a6471c625e2e40"],"state_sha256":"3ab9332449c354972718b743d364598d4075b6d7981f6a3aa71a93fb16ec4db0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LEyDH9KlOdVpZr1ik3l8ZN/r0SGe4iALawZeXQlmazDxI8vHOq6NBQ3PdwqoCv4vzb0Xq4Z49dLapBqNbFYNCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T21:53:08.026048Z","bundle_sha256":"697e4c37326d0df13e93fdc6f96ccf2d69d600f985119653f8d11063143ecb1d"}}