{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WYVIPAXZ7RJZ6VZQBROCRG22A7","short_pith_number":"pith:WYVIPAXZ","canonical_record":{"source":{"id":"1601.00416","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-04T09:24:01Z","cross_cats_sorted":["cs.SY","math.DS"],"title_canon_sha256":"4634e2d01217b4451e4c6313de1f8d2491d28419291f64d8a5504c56b5239cc3","abstract_canon_sha256":"37d72e0d3fd58a974a2aa71a027834a139f4ffbf48ddcfdcace976a1875c8ca2"},"schema_version":"1.0"},"canonical_sha256":"b62a8782f9fc539f57300c5c289b5a07d363e435656a8a37ab94c7fb41b07691","source":{"kind":"arxiv","id":"1601.00416","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.00416","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"arxiv_version","alias_value":"1601.00416v2","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00416","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"pith_short_12","alias_value":"WYVIPAXZ7RJZ","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WYVIPAXZ7RJZ6VZQ","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WYVIPAXZ","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WYVIPAXZ7RJZ6VZQBROCRG22A7","target":"record","payload":{"canonical_record":{"source":{"id":"1601.00416","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-04T09:24:01Z","cross_cats_sorted":["cs.SY","math.DS"],"title_canon_sha256":"4634e2d01217b4451e4c6313de1f8d2491d28419291f64d8a5504c56b5239cc3","abstract_canon_sha256":"37d72e0d3fd58a974a2aa71a027834a139f4ffbf48ddcfdcace976a1875c8ca2"},"schema_version":"1.0"},"canonical_sha256":"b62a8782f9fc539f57300c5c289b5a07d363e435656a8a37ab94c7fb41b07691","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:03.092369Z","signature_b64":"tWDc7hkOWDVvJDXK2fPF+CGzu4CyvBrlIeZzFjgAtlNXhZoQdEDf3u1K4UGf134mzbUX8fibLfwlsAfPYeo4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b62a8782f9fc539f57300c5c289b5a07d363e435656a8a37ab94c7fb41b07691","last_reissued_at":"2026-05-18T00:27:03.091718Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:03.091718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.00416","source_version":2,"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-18T00:27:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"COznF9Ozz4m1YKwBvncYXpPwuyqN+8Cnj4z/ez8sQsiJNytpjwK0IhL3NfSpRKDaOSu0k3crSg18uMuIK+UHAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:09:09.901503Z"},"content_sha256":"f30e1735f29aa3534f146fc2c4df25e42d14d6c83b916ff1eefd4a3edc4bfdca","schema_version":"1.0","event_id":"sha256:f30e1735f29aa3534f146fc2c4df25e42d14d6c83b916ff1eefd4a3edc4bfdca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WYVIPAXZ7RJZ6VZQBROCRG22A7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing Robust Controlled Invariant Sets of Linear Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.DS"],"primary_cat":"math.OC","authors_text":"Matthias Rungger, Paulo Tabuada","submitted_at":"2016-01-04T09:24:01Z","abstract_excerpt":"We consider controllable linear discrete-time systems with bounded perturbations and present two methods to compute robust controlled invariant sets. The first method tolerates an arbitrarily small constraint violation to compute an arbitrarily precise outer approximation of the maximal robust controlled invariant set, while the second method provides an inner approximation. The outer approximation scheme is $\\delta$-complete, given that the constraint sets are formulated as finite unions of polytopes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00416","kind":"arxiv","version":2},"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-18T00:27:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nGpFgNqPrhM0RQCfkYrHi2qpmCwzDTBf+A0U2/wL9DClLlT9S8hjYefkep8RwkezfWQAYkYDqTa/q6rBiub1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:09:09.902236Z"},"content_sha256":"01b1f205f2b6fa5055e4d46fb0304c9d2492a8a3f3240a5e55c7688ca8dbdd96","schema_version":"1.0","event_id":"sha256:01b1f205f2b6fa5055e4d46fb0304c9d2492a8a3f3240a5e55c7688ca8dbdd96"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WYVIPAXZ7RJZ6VZQBROCRG22A7/bundle.json","state_url":"https://pith.science/pith/WYVIPAXZ7RJZ6VZQBROCRG22A7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WYVIPAXZ7RJZ6VZQBROCRG22A7/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-05-30T01:09:09Z","links":{"resolver":"https://pith.science/pith/WYVIPAXZ7RJZ6VZQBROCRG22A7","bundle":"https://pith.science/pith/WYVIPAXZ7RJZ6VZQBROCRG22A7/bundle.json","state":"https://pith.science/pith/WYVIPAXZ7RJZ6VZQBROCRG22A7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WYVIPAXZ7RJZ6VZQBROCRG22A7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WYVIPAXZ7RJZ6VZQBROCRG22A7","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":"37d72e0d3fd58a974a2aa71a027834a139f4ffbf48ddcfdcace976a1875c8ca2","cross_cats_sorted":["cs.SY","math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-04T09:24:01Z","title_canon_sha256":"4634e2d01217b4451e4c6313de1f8d2491d28419291f64d8a5504c56b5239cc3"},"schema_version":"1.0","source":{"id":"1601.00416","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.00416","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"arxiv_version","alias_value":"1601.00416v2","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.00416","created_at":"2026-05-18T00:27:03Z"},{"alias_kind":"pith_short_12","alias_value":"WYVIPAXZ7RJZ","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WYVIPAXZ7RJZ6VZQ","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WYVIPAXZ","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:01b1f205f2b6fa5055e4d46fb0304c9d2492a8a3f3240a5e55c7688ca8dbdd96","target":"graph","created_at":"2026-05-18T00:27:03Z","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 consider controllable linear discrete-time systems with bounded perturbations and present two methods to compute robust controlled invariant sets. The first method tolerates an arbitrarily small constraint violation to compute an arbitrarily precise outer approximation of the maximal robust controlled invariant set, while the second method provides an inner approximation. The outer approximation scheme is $\\delta$-complete, given that the constraint sets are formulated as finite unions of polytopes.","authors_text":"Matthias Rungger, Paulo Tabuada","cross_cats":["cs.SY","math.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-04T09:24:01Z","title":"Computing Robust Controlled Invariant Sets of Linear Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.00416","kind":"arxiv","version":2},"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:f30e1735f29aa3534f146fc2c4df25e42d14d6c83b916ff1eefd4a3edc4bfdca","target":"record","created_at":"2026-05-18T00:27:03Z","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":"37d72e0d3fd58a974a2aa71a027834a139f4ffbf48ddcfdcace976a1875c8ca2","cross_cats_sorted":["cs.SY","math.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-01-04T09:24:01Z","title_canon_sha256":"4634e2d01217b4451e4c6313de1f8d2491d28419291f64d8a5504c56b5239cc3"},"schema_version":"1.0","source":{"id":"1601.00416","kind":"arxiv","version":2}},"canonical_sha256":"b62a8782f9fc539f57300c5c289b5a07d363e435656a8a37ab94c7fb41b07691","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b62a8782f9fc539f57300c5c289b5a07d363e435656a8a37ab94c7fb41b07691","first_computed_at":"2026-05-18T00:27:03.091718Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:03.091718Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tWDc7hkOWDVvJDXK2fPF+CGzu4CyvBrlIeZzFjgAtlNXhZoQdEDf3u1K4UGf134mzbUX8fibLfwlsAfPYeo4AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:03.092369Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.00416","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f30e1735f29aa3534f146fc2c4df25e42d14d6c83b916ff1eefd4a3edc4bfdca","sha256:01b1f205f2b6fa5055e4d46fb0304c9d2492a8a3f3240a5e55c7688ca8dbdd96"],"state_sha256":"fc60cf4b9f317e8975f2eabe6d8db6f6c507630e6cdc46cda4a9ccf3aef7c658"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MwVSUP6Z/hnfJ4pkgvUzYWoJ5PU/TXCxLVFR4r2nkuM0eSVHonhPV69RgEmj/epY7S8ZlumUPc/g7pGW+B4aAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T01:09:09.906117Z","bundle_sha256":"77d99c50646394122035c002ae4cc6321b062859ab33eb2d10cb8b27c142263a"}}