{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:OF23Y5HMYWLGUDMFOKJNKJER52","short_pith_number":"pith:OF23Y5HM","canonical_record":{"source":{"id":"1312.3399","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-12-12T03:52:22Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b03743496f89d9d2a371a4b2a821b592b935d5b5196328560625286ef6e325ad","abstract_canon_sha256":"62c30865589558b33acbf0012a906c009b0b43c7899e955280375f1552945754"},"schema_version":"1.0"},"canonical_sha256":"7175bc74ecc5966a0d857292d52491eeb4dc1cf9e7bcd9af9085e23ea1c7ece2","source":{"kind":"arxiv","id":"1312.3399","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3399","created_at":"2026-05-18T03:04:58Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3399v1","created_at":"2026-05-18T03:04:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3399","created_at":"2026-05-18T03:04:58Z"},{"alias_kind":"pith_short_12","alias_value":"OF23Y5HMYWLG","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OF23Y5HMYWLGUDMF","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OF23Y5HM","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:OF23Y5HMYWLGUDMFOKJNKJER52","target":"record","payload":{"canonical_record":{"source":{"id":"1312.3399","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-12-12T03:52:22Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"b03743496f89d9d2a371a4b2a821b592b935d5b5196328560625286ef6e325ad","abstract_canon_sha256":"62c30865589558b33acbf0012a906c009b0b43c7899e955280375f1552945754"},"schema_version":"1.0"},"canonical_sha256":"7175bc74ecc5966a0d857292d52491eeb4dc1cf9e7bcd9af9085e23ea1c7ece2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:58.680222Z","signature_b64":"zBiBBTaMDSaadNZdSUYo+jrXSqrqyu9i19oB2kn6n2lybxHbJJ/jRDmaiEdIHa5o27hJ+uYdyJKDkCei1sezCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7175bc74ecc5966a0d857292d52491eeb4dc1cf9e7bcd9af9085e23ea1c7ece2","last_reissued_at":"2026-05-18T03:04:58.679524Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:58.679524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.3399","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-18T03:04:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xx3+ya9Ywy61RE+vk79S6CU7Qezqqbd64eyCwt6ugw8YbYjMMTXzumJ59AqlEh0nC1KHI9/ekcyYswR1MsryBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:46:29.599891Z"},"content_sha256":"51565aa01e974c28f8236e829122c3268965791b26c2e68cc028e4616ac12af0","schema_version":"1.0","event_id":"sha256:51565aa01e974c28f8236e829122c3268965791b26c2e68cc028e4616ac12af0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:OF23Y5HMYWLGUDMFOKJNKJER52","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable Safety-Preserving Robust Control Synthesis for Continuous-Time Linear Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Guy A. Dumont, Ian M. Mitchell, Meeko Oishi, Shahab Kaynama","submitted_at":"2013-12-12T03:52:22Z","abstract_excerpt":"We present a scalable set-valued safety-preserving controller for constrained continuous-time linear time-invariant (LTI) systems subject to additive, unknown but bounded disturbance or uncertainty. The approach relies upon a conservative approximation of the discriminating kernel using robust maximal reachable sets---an extension of our earlier work on computation of the viability kernel for high-dimensional systems. Based on ellipsoidal techniques for reachability, a piecewise ellipsoidal algorithm with polynomial complexity is described that under-approximates the discriminating kernel unde"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3399","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-18T03:04:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f8+1YK34+Cl5PEJG2TcIIm+MGK9kW1dWVYpJHfb6FGvQJ9t4vwEuTx97qTmkyKuuqwjcUFpznpbuBM7B4rv8Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:46:29.600236Z"},"content_sha256":"9bde7b1024c80cf01564de89955faf1ea4f86a3f4b7ad78045d1df229b4c8b34","schema_version":"1.0","event_id":"sha256:9bde7b1024c80cf01564de89955faf1ea4f86a3f4b7ad78045d1df229b4c8b34"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OF23Y5HMYWLGUDMFOKJNKJER52/bundle.json","state_url":"https://pith.science/pith/OF23Y5HMYWLGUDMFOKJNKJER52/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OF23Y5HMYWLGUDMFOKJNKJER52/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-06-04T06:46:29Z","links":{"resolver":"https://pith.science/pith/OF23Y5HMYWLGUDMFOKJNKJER52","bundle":"https://pith.science/pith/OF23Y5HMYWLGUDMFOKJNKJER52/bundle.json","state":"https://pith.science/pith/OF23Y5HMYWLGUDMFOKJNKJER52/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OF23Y5HMYWLGUDMFOKJNKJER52/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:OF23Y5HMYWLGUDMFOKJNKJER52","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":"62c30865589558b33acbf0012a906c009b0b43c7899e955280375f1552945754","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-12-12T03:52:22Z","title_canon_sha256":"b03743496f89d9d2a371a4b2a821b592b935d5b5196328560625286ef6e325ad"},"schema_version":"1.0","source":{"id":"1312.3399","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3399","created_at":"2026-05-18T03:04:58Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3399v1","created_at":"2026-05-18T03:04:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3399","created_at":"2026-05-18T03:04:58Z"},{"alias_kind":"pith_short_12","alias_value":"OF23Y5HMYWLG","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"OF23Y5HMYWLGUDMF","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"OF23Y5HM","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:9bde7b1024c80cf01564de89955faf1ea4f86a3f4b7ad78045d1df229b4c8b34","target":"graph","created_at":"2026-05-18T03:04:58Z","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":"We present a scalable set-valued safety-preserving controller for constrained continuous-time linear time-invariant (LTI) systems subject to additive, unknown but bounded disturbance or uncertainty. The approach relies upon a conservative approximation of the discriminating kernel using robust maximal reachable sets---an extension of our earlier work on computation of the viability kernel for high-dimensional systems. Based on ellipsoidal techniques for reachability, a piecewise ellipsoidal algorithm with polynomial complexity is described that under-approximates the discriminating kernel unde","authors_text":"Guy A. Dumont, Ian M. Mitchell, Meeko Oishi, Shahab Kaynama","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-12-12T03:52:22Z","title":"Scalable Safety-Preserving Robust Control Synthesis for Continuous-Time Linear Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3399","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:51565aa01e974c28f8236e829122c3268965791b26c2e68cc028e4616ac12af0","target":"record","created_at":"2026-05-18T03:04:58Z","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":"62c30865589558b33acbf0012a906c009b0b43c7899e955280375f1552945754","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-12-12T03:52:22Z","title_canon_sha256":"b03743496f89d9d2a371a4b2a821b592b935d5b5196328560625286ef6e325ad"},"schema_version":"1.0","source":{"id":"1312.3399","kind":"arxiv","version":1}},"canonical_sha256":"7175bc74ecc5966a0d857292d52491eeb4dc1cf9e7bcd9af9085e23ea1c7ece2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7175bc74ecc5966a0d857292d52491eeb4dc1cf9e7bcd9af9085e23ea1c7ece2","first_computed_at":"2026-05-18T03:04:58.679524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:58.679524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zBiBBTaMDSaadNZdSUYo+jrXSqrqyu9i19oB2kn6n2lybxHbJJ/jRDmaiEdIHa5o27hJ+uYdyJKDkCei1sezCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:58.680222Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.3399","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51565aa01e974c28f8236e829122c3268965791b26c2e68cc028e4616ac12af0","sha256:9bde7b1024c80cf01564de89955faf1ea4f86a3f4b7ad78045d1df229b4c8b34"],"state_sha256":"135925cebec2acad1b3201bbbdf615aa294d1f60cb38dea963f3077d43fe5b61"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R0QQIHA7c6idG4HYeH2v0GevMOoKYc8kPwb5p00O//mdu/APM0DEaFEXZOQqCp3g8/b062JjZ9LbdJxBTatOBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:46:29.602223Z","bundle_sha256":"635104579b7c5d2afe17b7ad3c7666383d549f6cd32cd9732e472e765b17e936"}}