{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:65HJI3W7F6ML2HJSPE6Y2X5S4L","short_pith_number":"pith:65HJI3W7","canonical_record":{"source":{"id":"1409.8183","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-29T16:42:04Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"34aa61203f86381c0f7f598cc1e9f39a366210037808cf8ecbd55a6a2f735583","abstract_canon_sha256":"c3a82b814c7e319c9ce80daadbe38f0f403cb5a4bf9daeb602f30ebca738f25f"},"schema_version":"1.0"},"canonical_sha256":"f74e946edf2f98bd1d32793d8d5fb2e2d8ab46669c94f864080e92e6b7daadcb","source":{"kind":"arxiv","id":"1409.8183","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.8183","created_at":"2026-05-18T01:12:18Z"},{"alias_kind":"arxiv_version","alias_value":"1409.8183v1","created_at":"2026-05-18T01:12:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8183","created_at":"2026-05-18T01:12:18Z"},{"alias_kind":"pith_short_12","alias_value":"65HJI3W7F6ML","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"65HJI3W7F6ML2HJS","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"65HJI3W7","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:65HJI3W7F6ML2HJSPE6Y2X5S4L","target":"record","payload":{"canonical_record":{"source":{"id":"1409.8183","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-29T16:42:04Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"34aa61203f86381c0f7f598cc1e9f39a366210037808cf8ecbd55a6a2f735583","abstract_canon_sha256":"c3a82b814c7e319c9ce80daadbe38f0f403cb5a4bf9daeb602f30ebca738f25f"},"schema_version":"1.0"},"canonical_sha256":"f74e946edf2f98bd1d32793d8d5fb2e2d8ab46669c94f864080e92e6b7daadcb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:18.680592Z","signature_b64":"PCvUGZsKwJsrJtQerpHQQ2xUwmq1H7PpWL9ysf0WU7VB+a90T0EnNW8a3+ypE6oSMZUaDYYQFGCvl0pw7h/yBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f74e946edf2f98bd1d32793d8d5fb2e2d8ab46669c94f864080e92e6b7daadcb","last_reissued_at":"2026-05-18T01:12:18.680173Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:18.680173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.8183","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-05-18T01:12:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5r3kr5i8QwMjp6s2IkgqYr+cyTBjyyBdCE4Vzr0pdyUcPhWf2wywyEROZAhGs1VJBlJc9DtBqsodxm9tQw+MCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:31:40.910786Z"},"content_sha256":"5f82ed6d67f61995472f6b4c6cee5ea9f407e178b02426bd7a09bb9c742d21da","schema_version":"1.0","event_id":"sha256:5f82ed6d67f61995472f6b4c6cee5ea9f407e178b02426bd7a09bb9c742d21da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:65HJI3W7F6ML2HJSPE6Y2X5S4L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Improved Constraint-Tightening Approach for Stochastic MPC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Fabrizio Dabbene, Frank Allg\\\"ower, Matthias Lorenzen, Roberto Tempo","submitted_at":"2014-09-29T16:42:04Z","abstract_excerpt":"The problem of achieving a good trade-off in Stochastic Model Predictive Control between the competing goals of improving the average performance and reducing conservativeness, while still guaranteeing recursive feasibility and low computational complexity, is addressed. We propose a novel, less restrictive scheme which is based on considering stability and recursive feasibility separately. Through an explicit first step constraint we guarantee recursive feasibility. In particular we guarantee the existence of a feasible input trajectory at each time instant, but we only require that the input"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8183","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":""},"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:12:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"McjDP8/0DwGTyTf3ospctxb9j23Gm1to50KSGRSVv4LEZhK5x2QPtr5UxLJPgzBezH3IgREFeZgr03vrb2SXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:31:40.911147Z"},"content_sha256":"6d4fe975cf3b286242775462906571d7a28405612ebc3e5fced16fc214738ffe","schema_version":"1.0","event_id":"sha256:6d4fe975cf3b286242775462906571d7a28405612ebc3e5fced16fc214738ffe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/65HJI3W7F6ML2HJSPE6Y2X5S4L/bundle.json","state_url":"https://pith.science/pith/65HJI3W7F6ML2HJSPE6Y2X5S4L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/65HJI3W7F6ML2HJSPE6Y2X5S4L/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-05-26T13:31:40Z","links":{"resolver":"https://pith.science/pith/65HJI3W7F6ML2HJSPE6Y2X5S4L","bundle":"https://pith.science/pith/65HJI3W7F6ML2HJSPE6Y2X5S4L/bundle.json","state":"https://pith.science/pith/65HJI3W7F6ML2HJSPE6Y2X5S4L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/65HJI3W7F6ML2HJSPE6Y2X5S4L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:65HJI3W7F6ML2HJSPE6Y2X5S4L","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":"c3a82b814c7e319c9ce80daadbe38f0f403cb5a4bf9daeb602f30ebca738f25f","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-29T16:42:04Z","title_canon_sha256":"34aa61203f86381c0f7f598cc1e9f39a366210037808cf8ecbd55a6a2f735583"},"schema_version":"1.0","source":{"id":"1409.8183","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.8183","created_at":"2026-05-18T01:12:18Z"},{"alias_kind":"arxiv_version","alias_value":"1409.8183v1","created_at":"2026-05-18T01:12:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8183","created_at":"2026-05-18T01:12:18Z"},{"alias_kind":"pith_short_12","alias_value":"65HJI3W7F6ML","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"65HJI3W7F6ML2HJS","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"65HJI3W7","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:6d4fe975cf3b286242775462906571d7a28405612ebc3e5fced16fc214738ffe","target":"graph","created_at":"2026-05-18T01:12: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":"The problem of achieving a good trade-off in Stochastic Model Predictive Control between the competing goals of improving the average performance and reducing conservativeness, while still guaranteeing recursive feasibility and low computational complexity, is addressed. We propose a novel, less restrictive scheme which is based on considering stability and recursive feasibility separately. Through an explicit first step constraint we guarantee recursive feasibility. In particular we guarantee the existence of a feasible input trajectory at each time instant, but we only require that the input","authors_text":"Fabrizio Dabbene, Frank Allg\\\"ower, Matthias Lorenzen, Roberto Tempo","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-29T16:42:04Z","title":"An Improved Constraint-Tightening Approach for Stochastic MPC"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8183","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:5f82ed6d67f61995472f6b4c6cee5ea9f407e178b02426bd7a09bb9c742d21da","target":"record","created_at":"2026-05-18T01:12: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":"c3a82b814c7e319c9ce80daadbe38f0f403cb5a4bf9daeb602f30ebca738f25f","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-29T16:42:04Z","title_canon_sha256":"34aa61203f86381c0f7f598cc1e9f39a366210037808cf8ecbd55a6a2f735583"},"schema_version":"1.0","source":{"id":"1409.8183","kind":"arxiv","version":1}},"canonical_sha256":"f74e946edf2f98bd1d32793d8d5fb2e2d8ab46669c94f864080e92e6b7daadcb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f74e946edf2f98bd1d32793d8d5fb2e2d8ab46669c94f864080e92e6b7daadcb","first_computed_at":"2026-05-18T01:12:18.680173Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:18.680173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PCvUGZsKwJsrJtQerpHQQ2xUwmq1H7PpWL9ysf0WU7VB+a90T0EnNW8a3+ypE6oSMZUaDYYQFGCvl0pw7h/yBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:18.680592Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.8183","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f82ed6d67f61995472f6b4c6cee5ea9f407e178b02426bd7a09bb9c742d21da","sha256:6d4fe975cf3b286242775462906571d7a28405612ebc3e5fced16fc214738ffe"],"state_sha256":"4bad4f219f27178c3ec96cfc5c0bb06531e2cc37306867e14bf697f1c55173f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fdstTWRh48nbaGszfL9En+kiYxcxAfuKFNy7oGy2y20vjoMqUT18ZxN0Tk36TM7Y3Fy8IsWsXwHG9XyFzrK1CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:31:40.913338Z","bundle_sha256":"a3f193ed6338046c69ec58be2520444f93d2f64fac39312dfb4b7e7c4497dfb7"}}