{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:GNLHSRD5L7L6CVVP7MNTBNTS4M","short_pith_number":"pith:GNLHSRD5","canonical_record":{"source":{"id":"2303.11021","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2023-03-20T10:59:11Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"3d6c623594ecfc7f44c39d14d684f3d7cdc6d7ec7e3736e1687e490f7f06a339","abstract_canon_sha256":"68dfdc02c1792d0bf86e90a83a2942f27f798574ac90497b4e57bf4055492454"},"schema_version":"1.0"},"canonical_sha256":"335679447d5fd7e156affb1b30b672e317e50dbd6af04fa29e64b80d2124b137","source":{"kind":"arxiv","id":"2303.11021","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.11021","created_at":"2026-07-05T05:52:39Z"},{"alias_kind":"arxiv_version","alias_value":"2303.11021v1","created_at":"2026-07-05T05:52:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.11021","created_at":"2026-07-05T05:52:39Z"},{"alias_kind":"pith_short_12","alias_value":"GNLHSRD5L7L6","created_at":"2026-07-05T05:52:39Z"},{"alias_kind":"pith_short_16","alias_value":"GNLHSRD5L7L6CVVP","created_at":"2026-07-05T05:52:39Z"},{"alias_kind":"pith_short_8","alias_value":"GNLHSRD5","created_at":"2026-07-05T05:52:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:GNLHSRD5L7L6CVVP7MNTBNTS4M","target":"record","payload":{"canonical_record":{"source":{"id":"2303.11021","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2023-03-20T10:59:11Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"3d6c623594ecfc7f44c39d14d684f3d7cdc6d7ec7e3736e1687e490f7f06a339","abstract_canon_sha256":"68dfdc02c1792d0bf86e90a83a2942f27f798574ac90497b4e57bf4055492454"},"schema_version":"1.0"},"canonical_sha256":"335679447d5fd7e156affb1b30b672e317e50dbd6af04fa29e64b80d2124b137","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:52:39.306194Z","signature_b64":"K7/FW7G19Q3cim1gcz0mTWoHlj+R2Bm9rX1qWBMZHWi94vF6/b2ZOBClq1E1kKbnuoznbRSPoRn0Q3fR5aNxAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"335679447d5fd7e156affb1b30b672e317e50dbd6af04fa29e64b80d2124b137","last_reissued_at":"2026-07-05T05:52:39.305819Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:52:39.305819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2303.11021","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-07-05T05:52:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7rvuJiZuqqRhFf8fI44JSa7ZW5H3Na4R3F580NJhL3740r2q43bpcOrvHUZnne9MMy1LePktNFeG/bY+eY73BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T20:48:53.497461Z"},"content_sha256":"1fff7addccddd2dacbe84076b4cee6b3fe11dcafde4fd33386c0611284b263db","schema_version":"1.0","event_id":"sha256:1fff7addccddd2dacbe84076b4cee6b3fe11dcafde4fd33386c0611284b263db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:GNLHSRD5L7L6CVVP7MNTBNTS4M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Once upon a time step: A closed-loop approach to robust MPC design","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Amber Srivastava, Anilkumar Parsi, Marcell Bartos, Roy S. Smith, Sebastien Gros","submitted_at":"2023-03-20T10:59:11Z","abstract_excerpt":"A novel perspective on the design of robust model predictive control (MPC) methods is presented, whereby closed-loop constraint satisfaction is ensured using recursive feasibility of the MPC optimization. Necessary and sufficient conditions are derived for recursive feasibility, based on the effects of model perturbations and disturbances occurring at one time step. Using these conditions and Farkas' lemma, sufficient conditions suitable for design are formulated. The proposed method is called a closed-loop design, as only the existence of feasible inputs at the next time step is enforced by d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.11021","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.11021/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:52:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n9dtd0dqz6ErLRILz7h17ZKpN35AzXTrWWk/alNGJo2e25ON6n4P9MfLtQMqEZeIlglCv8A3PhxYChB15bK0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T20:48:53.498275Z"},"content_sha256":"589c31d0332844e9cc1e8f51724ad67b787acc22c7aa47cfbb21cd2f40c5ec26","schema_version":"1.0","event_id":"sha256:589c31d0332844e9cc1e8f51724ad67b787acc22c7aa47cfbb21cd2f40c5ec26"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GNLHSRD5L7L6CVVP7MNTBNTS4M/bundle.json","state_url":"https://pith.science/pith/GNLHSRD5L7L6CVVP7MNTBNTS4M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GNLHSRD5L7L6CVVP7MNTBNTS4M/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-08-03T20:48:53Z","links":{"resolver":"https://pith.science/pith/GNLHSRD5L7L6CVVP7MNTBNTS4M","bundle":"https://pith.science/pith/GNLHSRD5L7L6CVVP7MNTBNTS4M/bundle.json","state":"https://pith.science/pith/GNLHSRD5L7L6CVVP7MNTBNTS4M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GNLHSRD5L7L6CVVP7MNTBNTS4M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:GNLHSRD5L7L6CVVP7MNTBNTS4M","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":"68dfdc02c1792d0bf86e90a83a2942f27f798574ac90497b4e57bf4055492454","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2023-03-20T10:59:11Z","title_canon_sha256":"3d6c623594ecfc7f44c39d14d684f3d7cdc6d7ec7e3736e1687e490f7f06a339"},"schema_version":"1.0","source":{"id":"2303.11021","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.11021","created_at":"2026-07-05T05:52:39Z"},{"alias_kind":"arxiv_version","alias_value":"2303.11021v1","created_at":"2026-07-05T05:52:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.11021","created_at":"2026-07-05T05:52:39Z"},{"alias_kind":"pith_short_12","alias_value":"GNLHSRD5L7L6","created_at":"2026-07-05T05:52:39Z"},{"alias_kind":"pith_short_16","alias_value":"GNLHSRD5L7L6CVVP","created_at":"2026-07-05T05:52:39Z"},{"alias_kind":"pith_short_8","alias_value":"GNLHSRD5","created_at":"2026-07-05T05:52:39Z"}],"graph_snapshots":[{"event_id":"sha256:589c31d0332844e9cc1e8f51724ad67b787acc22c7aa47cfbb21cd2f40c5ec26","target":"graph","created_at":"2026-07-05T05:52:39Z","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/2303.11021/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A novel perspective on the design of robust model predictive control (MPC) methods is presented, whereby closed-loop constraint satisfaction is ensured using recursive feasibility of the MPC optimization. Necessary and sufficient conditions are derived for recursive feasibility, based on the effects of model perturbations and disturbances occurring at one time step. Using these conditions and Farkas' lemma, sufficient conditions suitable for design are formulated. The proposed method is called a closed-loop design, as only the existence of feasible inputs at the next time step is enforced by d","authors_text":"Amber Srivastava, Anilkumar Parsi, Marcell Bartos, Roy S. Smith, Sebastien Gros","cross_cats":["cs.SY","math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2023-03-20T10:59:11Z","title":"Once upon a time step: A closed-loop approach to robust MPC design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.11021","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:1fff7addccddd2dacbe84076b4cee6b3fe11dcafde4fd33386c0611284b263db","target":"record","created_at":"2026-07-05T05:52:39Z","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":"68dfdc02c1792d0bf86e90a83a2942f27f798574ac90497b4e57bf4055492454","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2023-03-20T10:59:11Z","title_canon_sha256":"3d6c623594ecfc7f44c39d14d684f3d7cdc6d7ec7e3736e1687e490f7f06a339"},"schema_version":"1.0","source":{"id":"2303.11021","kind":"arxiv","version":1}},"canonical_sha256":"335679447d5fd7e156affb1b30b672e317e50dbd6af04fa29e64b80d2124b137","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"335679447d5fd7e156affb1b30b672e317e50dbd6af04fa29e64b80d2124b137","first_computed_at":"2026-07-05T05:52:39.305819Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:52:39.305819Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K7/FW7G19Q3cim1gcz0mTWoHlj+R2Bm9rX1qWBMZHWi94vF6/b2ZOBClq1E1kKbnuoznbRSPoRn0Q3fR5aNxAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T05:52:39.306194Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.11021","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1fff7addccddd2dacbe84076b4cee6b3fe11dcafde4fd33386c0611284b263db","sha256:589c31d0332844e9cc1e8f51724ad67b787acc22c7aa47cfbb21cd2f40c5ec26"],"state_sha256":"69d41d9c929eaa0eaed845280b31a051391a55f603e11d886d0399a3ed946def"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yAk/A2/adGr9g3k0B8fe4GDdHESaL84T+cKwMhaC883PSOkCdCsrpLmoxIsGaiZn21DUXrUuDjw+WiMKmy8MAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T20:48:53.504055Z","bundle_sha256":"d919c2e1c4ff797ef1881dca3f93c7ad8139ef3ebc14d775909f2d8160cb9d9e"}}