{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZH4KY6FZ3WUVJNXWNFJ6OLK2CY","short_pith_number":"pith:ZH4KY6FZ","schema_version":"1.0","canonical_sha256":"c9f8ac78b9dda954b6f66953e72d5a162dc66afc53dea23e5f64667bcf6d4067","source":{"kind":"arxiv","id":"2502.06469","version":3},"attestation_state":"computed","paper":{"title":"Stochastic MPC with Online-optimized Policies and Closed-loop Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Alexandre Didier, Jerome Sieber, Johannes K\\\"ohler, Marcell Bartos, Melanie N. Zeilinger","submitted_at":"2025-02-10T13:50:19Z","abstract_excerpt":"This paper proposes a stochastic model predictive control method for linear systems affected by additive Gaussian disturbances that optimizes over disturbance feedback matrices online. Closed-loop satisfaction of probabilistic constraints and recursive feasibility of the underlying convex optimization problem is guaranteed. Optimization over feedback policies online increases performance and reduces conservatism compared to fixed-feedback approaches. The central mechanism is a finitely determined maximal admissible set for probabilistic constraints, together with the reconditioning of the pred"},"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":"2502.06469","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2025-02-10T13:50:19Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"bf33f7240e583877a84e86b47fc834d0424bfea19f2faa93d9a3c2b7da637fd4","abstract_canon_sha256":"8ad1a4a30b4d4a1492fbf262b56e6a2b22e0b7aa8351f6ce0612345f56f0b663"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T01:20:42.681959Z","signature_b64":"bU69gajkrIaVAyssQWyUTmwGAZOKjo7bNK8tKkzg41YTP1WaMXmdJt9zB4zi4OClT0KJV1ReiO9SC0ACK9U1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9f8ac78b9dda954b6f66953e72d5a162dc66afc53dea23e5f64667bcf6d4067","last_reissued_at":"2026-07-14T01:20:42.681004Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T01:20:42.681004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic MPC with Online-optimized Policies and Closed-loop Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Alexandre Didier, Jerome Sieber, Johannes K\\\"ohler, Marcell Bartos, Melanie N. Zeilinger","submitted_at":"2025-02-10T13:50:19Z","abstract_excerpt":"This paper proposes a stochastic model predictive control method for linear systems affected by additive Gaussian disturbances that optimizes over disturbance feedback matrices online. Closed-loop satisfaction of probabilistic constraints and recursive feasibility of the underlying convex optimization problem is guaranteed. Optimization over feedback policies online increases performance and reduces conservatism compared to fixed-feedback approaches. The central mechanism is a finitely determined maximal admissible set for probabilistic constraints, together with the reconditioning of the pred"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.06469","kind":"arxiv","version":3},"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/2502.06469/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":"2502.06469","created_at":"2026-07-14T01:20:42.681510+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.06469v3","created_at":"2026-07-14T01:20:42.681510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.06469","created_at":"2026-07-14T01:20:42.681510+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZH4KY6FZ3WUV","created_at":"2026-07-14T01:20:42.681510+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZH4KY6FZ3WUVJNXW","created_at":"2026-07-14T01:20:42.681510+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZH4KY6FZ","created_at":"2026-07-14T01:20:42.681510+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.07644","citing_title":"Safe Large-Scale Robust Nonlinear MPC in Milliseconds via Reachability-Constrained System Level Synthesis on the GPU","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZH4KY6FZ3WUVJNXWNFJ6OLK2CY","json":"https://pith.science/pith/ZH4KY6FZ3WUVJNXWNFJ6OLK2CY.json","graph_json":"https://pith.science/api/pith-number/ZH4KY6FZ3WUVJNXWNFJ6OLK2CY/graph.json","events_json":"https://pith.science/api/pith-number/ZH4KY6FZ3WUVJNXWNFJ6OLK2CY/events.json","paper":"https://pith.science/paper/ZH4KY6FZ"},"agent_actions":{"view_html":"https://pith.science/pith/ZH4KY6FZ3WUVJNXWNFJ6OLK2CY","download_json":"https://pith.science/pith/ZH4KY6FZ3WUVJNXWNFJ6OLK2CY.json","view_paper":"https://pith.science/paper/ZH4KY6FZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.06469&json=true","fetch_graph":"https://pith.science/api/pith-number/ZH4KY6FZ3WUVJNXWNFJ6OLK2CY/graph.json","fetch_events":"https://pith.science/api/pith-number/ZH4KY6FZ3WUVJNXWNFJ6OLK2CY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZH4KY6FZ3WUVJNXWNFJ6OLK2CY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZH4KY6FZ3WUVJNXWNFJ6OLK2CY/action/storage_attestation","attest_author":"https://pith.science/pith/ZH4KY6FZ3WUVJNXWNFJ6OLK2CY/action/author_attestation","sign_citation":"https://pith.science/pith/ZH4KY6FZ3WUVJNXWNFJ6OLK2CY/action/citation_signature","submit_replication":"https://pith.science/pith/ZH4KY6FZ3WUVJNXWNFJ6OLK2CY/action/replication_record"}},"created_at":"2026-07-14T01:20:42.681510+00:00","updated_at":"2026-07-14T01:20:42.681510+00:00"}