{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DJUDBGAEZ7LSXWYUUME6X5E2LT","short_pith_number":"pith:DJUDBGAE","canonical_record":{"source":{"id":"1812.06860","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-12-17T15:57:18Z","cross_cats_sorted":[],"title_canon_sha256":"438a3f0d7e506511694ea9a48f955b2fa62947c26535a9e2f3b07d08bfd4b936","abstract_canon_sha256":"b8e5651bb1d9ecb0102203894e387b3872cb8e5fbf5d92a7ed2e46e404223cb0"},"schema_version":"1.0"},"canonical_sha256":"1a68309804cfd72bdb14a309ebf49a5ccc68efa9ddd27fad078c4a7ea6d25be0","source":{"kind":"arxiv","id":"1812.06860","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06860","created_at":"2026-05-17T23:55:53Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06860v2","created_at":"2026-05-17T23:55:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06860","created_at":"2026-05-17T23:55:53Z"},{"alias_kind":"pith_short_12","alias_value":"DJUDBGAEZ7LS","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DJUDBGAEZ7LSXWYU","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DJUDBGAE","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DJUDBGAEZ7LSXWYUUME6X5E2LT","target":"record","payload":{"canonical_record":{"source":{"id":"1812.06860","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-12-17T15:57:18Z","cross_cats_sorted":[],"title_canon_sha256":"438a3f0d7e506511694ea9a48f955b2fa62947c26535a9e2f3b07d08bfd4b936","abstract_canon_sha256":"b8e5651bb1d9ecb0102203894e387b3872cb8e5fbf5d92a7ed2e46e404223cb0"},"schema_version":"1.0"},"canonical_sha256":"1a68309804cfd72bdb14a309ebf49a5ccc68efa9ddd27fad078c4a7ea6d25be0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:53.397819Z","signature_b64":"+4uzkirndQ1qnKNk2ALho1wF7J/LqSuAdud7B0yM0MMHq7clMkIcFApfDLmpBrKeoFB0B0GitK5OhSe37vJYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a68309804cfd72bdb14a309ebf49a5ccc68efa9ddd27fad078c4a7ea6d25be0","last_reissued_at":"2026-05-17T23:55:53.397215Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:53.397215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.06860","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-17T23:55:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zJnVCF2Ytk03VHHDQRKTZrfn4ub5y9Fnuk/H4x4HXEt8i5VfabMj8tQGo9Z6yWhk2ump6hso3HxVXuejaLQoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:37:07.923774Z"},"content_sha256":"acb9186c716a62f2fe1764836f8bb4ad445a7d8289f5e8b33c7bcc39c73dd035","schema_version":"1.0","event_id":"sha256:acb9186c716a62f2fe1764836f8bb4ad445a7d8289f5e8b33c7bcc39c73dd035"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DJUDBGAEZ7LSXWYUUME6X5E2LT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recursively Feasible Stochastic Model Predictive Control using Indirect Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Kim P. Wabersich, Lukas Hewing, Melanie N. Zeilinger","submitted_at":"2018-12-17T15:57:18Z","abstract_excerpt":"We present a stochastic model predictive control (MPC) method for linear discrete-time systems subject to possibly unbounded and correlated additive stochastic disturbance sequences. Chance constraints are treated in analogy to robust MPC using the concept of probabilistic reachable sets for constraint tightening. We introduce an initialization of each MPC iteration which is always recursively feasibility and thereby allows that chance constraint satisfaction for the closed-loop system can readily be shown. Under an i.i.d. zero mean assumption on the additive disturbance, we furthermore provid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06860","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-17T23:55:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xJ+cbma4qU7PyNwGoOpQ3RaZK9z90ORg+8ELDcsMpGBMd6aiB0BfIsG1McTPt7ZCVt4m4hzV+IqT0XZd3ePGAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T02:37:07.924566Z"},"content_sha256":"808bb3ccebb17a4c622984608680515d65d5941cb4f60445da60dab30735e915","schema_version":"1.0","event_id":"sha256:808bb3ccebb17a4c622984608680515d65d5941cb4f60445da60dab30735e915"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DJUDBGAEZ7LSXWYUUME6X5E2LT/bundle.json","state_url":"https://pith.science/pith/DJUDBGAEZ7LSXWYUUME6X5E2LT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DJUDBGAEZ7LSXWYUUME6X5E2LT/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-09T02:37:07Z","links":{"resolver":"https://pith.science/pith/DJUDBGAEZ7LSXWYUUME6X5E2LT","bundle":"https://pith.science/pith/DJUDBGAEZ7LSXWYUUME6X5E2LT/bundle.json","state":"https://pith.science/pith/DJUDBGAEZ7LSXWYUUME6X5E2LT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DJUDBGAEZ7LSXWYUUME6X5E2LT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DJUDBGAEZ7LSXWYUUME6X5E2LT","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":"b8e5651bb1d9ecb0102203894e387b3872cb8e5fbf5d92a7ed2e46e404223cb0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-12-17T15:57:18Z","title_canon_sha256":"438a3f0d7e506511694ea9a48f955b2fa62947c26535a9e2f3b07d08bfd4b936"},"schema_version":"1.0","source":{"id":"1812.06860","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06860","created_at":"2026-05-17T23:55:53Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06860v2","created_at":"2026-05-17T23:55:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06860","created_at":"2026-05-17T23:55:53Z"},{"alias_kind":"pith_short_12","alias_value":"DJUDBGAEZ7LS","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DJUDBGAEZ7LSXWYU","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DJUDBGAE","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:808bb3ccebb17a4c622984608680515d65d5941cb4f60445da60dab30735e915","target":"graph","created_at":"2026-05-17T23:55:53Z","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":"We present a stochastic model predictive control (MPC) method for linear discrete-time systems subject to possibly unbounded and correlated additive stochastic disturbance sequences. Chance constraints are treated in analogy to robust MPC using the concept of probabilistic reachable sets for constraint tightening. We introduce an initialization of each MPC iteration which is always recursively feasibility and thereby allows that chance constraint satisfaction for the closed-loop system can readily be shown. Under an i.i.d. zero mean assumption on the additive disturbance, we furthermore provid","authors_text":"Kim P. Wabersich, Lukas Hewing, Melanie N. Zeilinger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-12-17T15:57:18Z","title":"Recursively Feasible Stochastic Model Predictive Control using Indirect Feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06860","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:acb9186c716a62f2fe1764836f8bb4ad445a7d8289f5e8b33c7bcc39c73dd035","target":"record","created_at":"2026-05-17T23:55:53Z","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":"b8e5651bb1d9ecb0102203894e387b3872cb8e5fbf5d92a7ed2e46e404223cb0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-12-17T15:57:18Z","title_canon_sha256":"438a3f0d7e506511694ea9a48f955b2fa62947c26535a9e2f3b07d08bfd4b936"},"schema_version":"1.0","source":{"id":"1812.06860","kind":"arxiv","version":2}},"canonical_sha256":"1a68309804cfd72bdb14a309ebf49a5ccc68efa9ddd27fad078c4a7ea6d25be0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a68309804cfd72bdb14a309ebf49a5ccc68efa9ddd27fad078c4a7ea6d25be0","first_computed_at":"2026-05-17T23:55:53.397215Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:53.397215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+4uzkirndQ1qnKNk2ALho1wF7J/LqSuAdud7B0yM0MMHq7clMkIcFApfDLmpBrKeoFB0B0GitK5OhSe37vJYAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:53.397819Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.06860","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:acb9186c716a62f2fe1764836f8bb4ad445a7d8289f5e8b33c7bcc39c73dd035","sha256:808bb3ccebb17a4c622984608680515d65d5941cb4f60445da60dab30735e915"],"state_sha256":"1d4e535e44bc4bb64ef267dd1d52289cd5691a72c99b46f31af636515df8301c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uv3Srw7+A6CshvVUgTQAupwxgalpEL6j4d5fhu44J2qWaHv021Qo2/Ep/NOdiLOErBEhBGQ4DOvcfU+9gQLsAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T02:37:07.928526Z","bundle_sha256":"3739a55425eeb49cfb69af76afe3564fdcb856d90b185bd8041196374fdf68ac"}}