{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:A7XIO56EBD52BJBZ2E2G25B6UZ","short_pith_number":"pith:A7XIO56E","canonical_record":{"source":{"id":"1809.06540","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-18T05:36:18Z","cross_cats_sorted":[],"title_canon_sha256":"ba72362fd53777a5ef1d3bebc7922c27e4e5d019213bb54ca913eb39c279063f","abstract_canon_sha256":"30a4e3690f33878a69c82ce17fa43764577f9fa8cfb3354b7538b80e3a3264fc"},"schema_version":"1.0"},"canonical_sha256":"07ee8777c408fba0a439d1346d743ea66e1ba30b4ba2e64e2f134881649298b1","source":{"kind":"arxiv","id":"1809.06540","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.06540","created_at":"2026-05-18T00:05:18Z"},{"alias_kind":"arxiv_version","alias_value":"1809.06540v2","created_at":"2026-05-18T00:05:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06540","created_at":"2026-05-18T00:05:18Z"},{"alias_kind":"pith_short_12","alias_value":"A7XIO56EBD52","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A7XIO56EBD52BJBZ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A7XIO56E","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:A7XIO56EBD52BJBZ2E2G25B6UZ","target":"record","payload":{"canonical_record":{"source":{"id":"1809.06540","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-18T05:36:18Z","cross_cats_sorted":[],"title_canon_sha256":"ba72362fd53777a5ef1d3bebc7922c27e4e5d019213bb54ca913eb39c279063f","abstract_canon_sha256":"30a4e3690f33878a69c82ce17fa43764577f9fa8cfb3354b7538b80e3a3264fc"},"schema_version":"1.0"},"canonical_sha256":"07ee8777c408fba0a439d1346d743ea66e1ba30b4ba2e64e2f134881649298b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:18.829185Z","signature_b64":"rI3uRP/L/U2JSUZQlPLiKiYu3d8qwJf++YVIh+gKZ14qOmq9fOFBbApQgAdITgHLnHJarW3gLorTOqoDxl1WDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07ee8777c408fba0a439d1346d743ea66e1ba30b4ba2e64e2f134881649298b1","last_reissued_at":"2026-05-18T00:05:18.828538Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:18.828538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.06540","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:05:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jQtfehpsMXvudQKwbJVx3KIWSQhy3gABLkr2QTtlZelgmoFDu7jzJknghH/O10UAYagvOUERkSif+wyroDP8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:37:11.002258Z"},"content_sha256":"5ec6061f1f99e123640e84e584533cfdee18e42c3bcfce65168063c9ee7af0b0","schema_version":"1.0","event_id":"sha256:5ec6061f1f99e123640e84e584533cfdee18e42c3bcfce65168063c9ee7af0b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:A7XIO56EBD52BJBZ2E2G25B6UZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Model Predictive Control with Adjustable Uncertainty Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Francesco Borrelli, Jacopo Guanetti, Xiaojing Zhang, Yeojun Kim","submitted_at":"2018-09-18T05:36:18Z","abstract_excerpt":"In this paper, we present Robust Model Predictive Control (MPC) problems with adjustable uncertainty sets. In contrast to standard Robust MPC problems with known uncertainty sets, we treat the uncertainty sets in our problems as additional decision variables. In particular, given a metric for adjusting the uncertainty sets, we address the question of determining the optimal size and shape of those uncertainty sets, while ensuring robust constraint satisfaction. The focus of this paper is on ensuring constraint satisfaction over an infinite horizon, also known as persistent feasibility. We show"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06540","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:05:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ipLOFanlsGnWgVsizT08UQfTjsMwsZccJgea68urBbCnajjeO5QXXaAqvGqXD08MvLzRyzQ02XcXFLVF27OzDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:37:11.002603Z"},"content_sha256":"54cfff42556c93edd7c031e429d5fcece3f26d0b208fb193f4054bf1466db38f","schema_version":"1.0","event_id":"sha256:54cfff42556c93edd7c031e429d5fcece3f26d0b208fb193f4054bf1466db38f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A7XIO56EBD52BJBZ2E2G25B6UZ/bundle.json","state_url":"https://pith.science/pith/A7XIO56EBD52BJBZ2E2G25B6UZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A7XIO56EBD52BJBZ2E2G25B6UZ/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-01T11:37:11Z","links":{"resolver":"https://pith.science/pith/A7XIO56EBD52BJBZ2E2G25B6UZ","bundle":"https://pith.science/pith/A7XIO56EBD52BJBZ2E2G25B6UZ/bundle.json","state":"https://pith.science/pith/A7XIO56EBD52BJBZ2E2G25B6UZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A7XIO56EBD52BJBZ2E2G25B6UZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:A7XIO56EBD52BJBZ2E2G25B6UZ","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":"30a4e3690f33878a69c82ce17fa43764577f9fa8cfb3354b7538b80e3a3264fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-18T05:36:18Z","title_canon_sha256":"ba72362fd53777a5ef1d3bebc7922c27e4e5d019213bb54ca913eb39c279063f"},"schema_version":"1.0","source":{"id":"1809.06540","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.06540","created_at":"2026-05-18T00:05:18Z"},{"alias_kind":"arxiv_version","alias_value":"1809.06540v2","created_at":"2026-05-18T00:05:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.06540","created_at":"2026-05-18T00:05:18Z"},{"alias_kind":"pith_short_12","alias_value":"A7XIO56EBD52","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"A7XIO56EBD52BJBZ","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"A7XIO56E","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:54cfff42556c93edd7c031e429d5fcece3f26d0b208fb193f4054bf1466db38f","target":"graph","created_at":"2026-05-18T00:05:18Z","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 present Robust Model Predictive Control (MPC) problems with adjustable uncertainty sets. In contrast to standard Robust MPC problems with known uncertainty sets, we treat the uncertainty sets in our problems as additional decision variables. In particular, given a metric for adjusting the uncertainty sets, we address the question of determining the optimal size and shape of those uncertainty sets, while ensuring robust constraint satisfaction. The focus of this paper is on ensuring constraint satisfaction over an infinite horizon, also known as persistent feasibility. We show","authors_text":"Francesco Borrelli, Jacopo Guanetti, Xiaojing Zhang, Yeojun Kim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-18T05:36:18Z","title":"Robust Model Predictive Control with Adjustable Uncertainty Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.06540","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:5ec6061f1f99e123640e84e584533cfdee18e42c3bcfce65168063c9ee7af0b0","target":"record","created_at":"2026-05-18T00:05:18Z","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":"30a4e3690f33878a69c82ce17fa43764577f9fa8cfb3354b7538b80e3a3264fc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-09-18T05:36:18Z","title_canon_sha256":"ba72362fd53777a5ef1d3bebc7922c27e4e5d019213bb54ca913eb39c279063f"},"schema_version":"1.0","source":{"id":"1809.06540","kind":"arxiv","version":2}},"canonical_sha256":"07ee8777c408fba0a439d1346d743ea66e1ba30b4ba2e64e2f134881649298b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07ee8777c408fba0a439d1346d743ea66e1ba30b4ba2e64e2f134881649298b1","first_computed_at":"2026-05-18T00:05:18.828538Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:18.828538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rI3uRP/L/U2JSUZQlPLiKiYu3d8qwJf++YVIh+gKZ14qOmq9fOFBbApQgAdITgHLnHJarW3gLorTOqoDxl1WDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:18.829185Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.06540","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ec6061f1f99e123640e84e584533cfdee18e42c3bcfce65168063c9ee7af0b0","sha256:54cfff42556c93edd7c031e429d5fcece3f26d0b208fb193f4054bf1466db38f"],"state_sha256":"6bbb790f11a763f2a2ff379d1d7cbf4276bc00c5e6d3dfecb070c18e2f7368e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LHkzhTofVyChOfcJDcdXX85RUoR6ufxQqkdjdF5lN99MqVtDquyjAtUmVqQP0Ac2SvFSUOaHtxCTk548OZgNBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:37:11.004398Z","bundle_sha256":"a1fbd94017030de628cb1dd83a1e284e3207b6a70214bc2d9cab82a866736552"}}