{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MELYU7YFANFH2TPBVO64P7LEDG","short_pith_number":"pith:MELYU7YF","schema_version":"1.0","canonical_sha256":"61178a7f05034a7d4de1abbdc7fd64199fa52d47575018131fa35396e727ccad","source":{"kind":"arxiv","id":"2506.01729","version":2},"attestation_state":"computed","paper":{"title":"Update-Aware Robust Optimal Model Predictive Control for Nonlinear Systems","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"E. C. Kerrigan, J. Wehbeh","submitted_at":"2025-06-02T14:40:53Z","abstract_excerpt":"Robust optimal or min-max model predictive control (MPC) approaches aim to guarantee constraint satisfaction over a known, bounded uncertainty set while minimizing a worst-case performance bound. Traditionally, these methods compute a trajectory that meets the desired properties over a fixed prediction horizon, apply a portion of the resulting input, and then re-solve the MPC problem using newly obtained measurements at the next time step. However, this approach fails to account for the fact that the control trajectory will be updated in the future, potentially leading to conservative designs."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2506.01729","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"eess.SY","submitted_at":"2025-06-02T14:40:53Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"18b4881d2424fe92f8f2444dd802a69a2d695df4e1c341e05e9e7c1808904c53","abstract_canon_sha256":"51cdf9e68161d2b9962a20bb118605466f89c4009a7d8abf282b8cca33ee0b7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:04:15.334116Z","signature_b64":"x1eSlNH6i9mUPIxzUAgl4U4R0kwJygNKeD7ToUeYNbWJKOzzBOcoUpymu+OEcVPMBZaejiDlPziEsQJazlNvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"61178a7f05034a7d4de1abbdc7fd64199fa52d47575018131fa35396e727ccad","last_reissued_at":"2026-07-05T12:04:15.333543Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:04:15.333543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Update-Aware Robust Optimal Model Predictive Control for Nonlinear Systems","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"E. C. Kerrigan, J. Wehbeh","submitted_at":"2025-06-02T14:40:53Z","abstract_excerpt":"Robust optimal or min-max model predictive control (MPC) approaches aim to guarantee constraint satisfaction over a known, bounded uncertainty set while minimizing a worst-case performance bound. Traditionally, these methods compute a trajectory that meets the desired properties over a fixed prediction horizon, apply a portion of the resulting input, and then re-solve the MPC problem using newly obtained measurements at the next time step. However, this approach fails to account for the fact that the control trajectory will be updated in the future, potentially leading to conservative designs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.01729","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2506.01729/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2506.01729","created_at":"2026-07-05T12:04:15.333612+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.01729v2","created_at":"2026-07-05T12:04:15.333612+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.01729","created_at":"2026-07-05T12:04:15.333612+00:00"},{"alias_kind":"pith_short_12","alias_value":"MELYU7YFANFH","created_at":"2026-07-05T12:04:15.333612+00:00"},{"alias_kind":"pith_short_16","alias_value":"MELYU7YFANFH2TPB","created_at":"2026-07-05T12:04:15.333612+00:00"},{"alias_kind":"pith_short_8","alias_value":"MELYU7YF","created_at":"2026-07-05T12:04:15.333612+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MELYU7YFANFH2TPBVO64P7LEDG","json":"https://pith.science/pith/MELYU7YFANFH2TPBVO64P7LEDG.json","graph_json":"https://pith.science/api/pith-number/MELYU7YFANFH2TPBVO64P7LEDG/graph.json","events_json":"https://pith.science/api/pith-number/MELYU7YFANFH2TPBVO64P7LEDG/events.json","paper":"https://pith.science/paper/MELYU7YF"},"agent_actions":{"view_html":"https://pith.science/pith/MELYU7YFANFH2TPBVO64P7LEDG","download_json":"https://pith.science/pith/MELYU7YFANFH2TPBVO64P7LEDG.json","view_paper":"https://pith.science/paper/MELYU7YF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.01729&json=true","fetch_graph":"https://pith.science/api/pith-number/MELYU7YFANFH2TPBVO64P7LEDG/graph.json","fetch_events":"https://pith.science/api/pith-number/MELYU7YFANFH2TPBVO64P7LEDG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MELYU7YFANFH2TPBVO64P7LEDG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MELYU7YFANFH2TPBVO64P7LEDG/action/storage_attestation","attest_author":"https://pith.science/pith/MELYU7YFANFH2TPBVO64P7LEDG/action/author_attestation","sign_citation":"https://pith.science/pith/MELYU7YFANFH2TPBVO64P7LEDG/action/citation_signature","submit_replication":"https://pith.science/pith/MELYU7YFANFH2TPBVO64P7LEDG/action/replication_record"}},"created_at":"2026-07-05T12:04:15.333612+00:00","updated_at":"2026-07-05T12:04:15.333612+00:00"}