{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PUAU4NJP2LNQFIAKSMIYE4ZC3P","short_pith_number":"pith:PUAU4NJP","canonical_record":{"source":{"id":"1511.03488","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-11-11T13:16:41Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"2394039262aadf0d602a47e2c02f7463267b9dc01f4f3f68858320b8915077d7","abstract_canon_sha256":"b39bf8314c43425b542ef198a25885116dfb132dab806e3caafac6c4afcbd0b3"},"schema_version":"1.0"},"canonical_sha256":"7d014e352fd2db02a00a9311827322dbe52749b12ce7a9d966d49b8e4399ec73","source":{"kind":"arxiv","id":"1511.03488","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.03488","created_at":"2026-05-18T01:15:00Z"},{"alias_kind":"arxiv_version","alias_value":"1511.03488v2","created_at":"2026-05-18T01:15:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.03488","created_at":"2026-05-18T01:15:00Z"},{"alias_kind":"pith_short_12","alias_value":"PUAU4NJP2LNQ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PUAU4NJP2LNQFIAK","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PUAU4NJP","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PUAU4NJP2LNQFIAKSMIYE4ZC3P","target":"record","payload":{"canonical_record":{"source":{"id":"1511.03488","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-11-11T13:16:41Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"2394039262aadf0d602a47e2c02f7463267b9dc01f4f3f68858320b8915077d7","abstract_canon_sha256":"b39bf8314c43425b542ef198a25885116dfb132dab806e3caafac6c4afcbd0b3"},"schema_version":"1.0"},"canonical_sha256":"7d014e352fd2db02a00a9311827322dbe52749b12ce7a9d966d49b8e4399ec73","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:00.195674Z","signature_b64":"l6O2TQOcVS/53MnnJn103yNEcyW7xJXGKlgPMj/MGhEe4iyQVxnXcxKhHTtL87UIKd4ZOstrhNRGXypJAm3zAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d014e352fd2db02a00a9311827322dbe52749b12ce7a9d966d49b8e4399ec73","last_reissued_at":"2026-05-18T01:15:00.195050Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:00.195050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.03488","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-18T01:15:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5omzhoKuc/XySigFnuMZndFtKSzBwlhg1duc4Sa4lqf8SLYt3XCluqDhLS49SmiJemP4GislOr48BwTa7qwYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:35:44.206801Z"},"content_sha256":"e6da7f3f1e53d000386863461de41b2003a9ee46f73ee97c7792c3d31882dd6d","schema_version":"1.0","event_id":"sha256:e6da7f3f1e53d000386863461de41b2003a9ee46f73ee97c7792c3d31882dd6d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PUAU4NJP2LNQFIAKSMIYE4ZC3P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constraint-Tightening and Stability in Stochastic Model Predictive Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Fabrizio Dabbene, Frank Allg\\\"ower, Matthias Lorenzen, Roberto Tempo","submitted_at":"2015-11-11T13:16:41Z","abstract_excerpt":"Constraint tightening to non-conservatively guarantee recursive feasibility and stability in Stochastic Model Predictive Control is addressed. Stability and feasibility requirements are considered separately, highlighting the difference between existence of a solution and feasibility of a suitable, a priori known candidate solution. Subsequently, a Stochastic Model Predictive Control algorithm which unifies previous results is derived, leaving the designer the option to balance an increased feasible region against guaranteed bounds on the asymptotic average performance and convergence time. Be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.03488","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-18T01:15:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ODPBKse5FItW5e38zK08ivTDYdfAb59T3UZWobxgZB3LMRudwRxpeQQZnAknFiBIwzAcYLHUVxFiU7pmLv2tBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:35:44.207445Z"},"content_sha256":"6428d82c19b66f337df25e8fe89c919d17b9b0680a7423a5e394952f4aaa3a56","schema_version":"1.0","event_id":"sha256:6428d82c19b66f337df25e8fe89c919d17b9b0680a7423a5e394952f4aaa3a56"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PUAU4NJP2LNQFIAKSMIYE4ZC3P/bundle.json","state_url":"https://pith.science/pith/PUAU4NJP2LNQFIAKSMIYE4ZC3P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PUAU4NJP2LNQFIAKSMIYE4ZC3P/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-02T11:35:44Z","links":{"resolver":"https://pith.science/pith/PUAU4NJP2LNQFIAKSMIYE4ZC3P","bundle":"https://pith.science/pith/PUAU4NJP2LNQFIAKSMIYE4ZC3P/bundle.json","state":"https://pith.science/pith/PUAU4NJP2LNQFIAKSMIYE4ZC3P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PUAU4NJP2LNQFIAKSMIYE4ZC3P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PUAU4NJP2LNQFIAKSMIYE4ZC3P","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":"b39bf8314c43425b542ef198a25885116dfb132dab806e3caafac6c4afcbd0b3","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-11-11T13:16:41Z","title_canon_sha256":"2394039262aadf0d602a47e2c02f7463267b9dc01f4f3f68858320b8915077d7"},"schema_version":"1.0","source":{"id":"1511.03488","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.03488","created_at":"2026-05-18T01:15:00Z"},{"alias_kind":"arxiv_version","alias_value":"1511.03488v2","created_at":"2026-05-18T01:15:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.03488","created_at":"2026-05-18T01:15:00Z"},{"alias_kind":"pith_short_12","alias_value":"PUAU4NJP2LNQ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PUAU4NJP2LNQFIAK","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PUAU4NJP","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:6428d82c19b66f337df25e8fe89c919d17b9b0680a7423a5e394952f4aaa3a56","target":"graph","created_at":"2026-05-18T01:15:00Z","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":"Constraint tightening to non-conservatively guarantee recursive feasibility and stability in Stochastic Model Predictive Control is addressed. Stability and feasibility requirements are considered separately, highlighting the difference between existence of a solution and feasibility of a suitable, a priori known candidate solution. Subsequently, a Stochastic Model Predictive Control algorithm which unifies previous results is derived, leaving the designer the option to balance an increased feasible region against guaranteed bounds on the asymptotic average performance and convergence time. Be","authors_text":"Fabrizio Dabbene, Frank Allg\\\"ower, Matthias Lorenzen, Roberto Tempo","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-11-11T13:16:41Z","title":"Constraint-Tightening and Stability in Stochastic Model Predictive Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.03488","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:e6da7f3f1e53d000386863461de41b2003a9ee46f73ee97c7792c3d31882dd6d","target":"record","created_at":"2026-05-18T01:15:00Z","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":"b39bf8314c43425b542ef198a25885116dfb132dab806e3caafac6c4afcbd0b3","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2015-11-11T13:16:41Z","title_canon_sha256":"2394039262aadf0d602a47e2c02f7463267b9dc01f4f3f68858320b8915077d7"},"schema_version":"1.0","source":{"id":"1511.03488","kind":"arxiv","version":2}},"canonical_sha256":"7d014e352fd2db02a00a9311827322dbe52749b12ce7a9d966d49b8e4399ec73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d014e352fd2db02a00a9311827322dbe52749b12ce7a9d966d49b8e4399ec73","first_computed_at":"2026-05-18T01:15:00.195050Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:00.195050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l6O2TQOcVS/53MnnJn103yNEcyW7xJXGKlgPMj/MGhEe4iyQVxnXcxKhHTtL87UIKd4ZOstrhNRGXypJAm3zAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:00.195674Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.03488","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e6da7f3f1e53d000386863461de41b2003a9ee46f73ee97c7792c3d31882dd6d","sha256:6428d82c19b66f337df25e8fe89c919d17b9b0680a7423a5e394952f4aaa3a56"],"state_sha256":"feb8d8a56d97a5b0c6eeef35aad229c87f5422b5c80bea057b1e7f5329fb9714"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rbi/H0Y12HqYLAFRd09ss32XifHPWrBXICX/2Q7ivGkPMIprRk/UczwxyqmZt6+P8IctbkLN8poaef6VW211DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T11:35:44.210736Z","bundle_sha256":"1ae9c4ca970fd83858041dd2b27e014e39cd230ef701915079fa3ea2b2257ed9"}}