{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UAGEE74VCSRO77QHJKLW5ZA34Q","short_pith_number":"pith:UAGEE74V","canonical_record":{"source":{"id":"1606.06056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-06-20T10:24:40Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"62691568472a2c178eeadc86c77dd63b4a011d077cca8833be1d11b267240584","abstract_canon_sha256":"437e8d95f36672b56cf9228972b1dd65c18723df442bf0bd14b17c0760f4b29a"},"schema_version":"1.0"},"canonical_sha256":"a00c427f9514a2effe074a976ee41be406193825515bdf78b39fc73c0e1774ad","source":{"kind":"arxiv","id":"1606.06056","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06056","created_at":"2026-05-18T01:12:15Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06056v1","created_at":"2026-05-18T01:12:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06056","created_at":"2026-05-18T01:12:15Z"},{"alias_kind":"pith_short_12","alias_value":"UAGEE74VCSRO","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UAGEE74VCSRO77QH","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UAGEE74V","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UAGEE74VCSRO77QHJKLW5ZA34Q","target":"record","payload":{"canonical_record":{"source":{"id":"1606.06056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-06-20T10:24:40Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"62691568472a2c178eeadc86c77dd63b4a011d077cca8833be1d11b267240584","abstract_canon_sha256":"437e8d95f36672b56cf9228972b1dd65c18723df442bf0bd14b17c0760f4b29a"},"schema_version":"1.0"},"canonical_sha256":"a00c427f9514a2effe074a976ee41be406193825515bdf78b39fc73c0e1774ad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:15.538945Z","signature_b64":"v1AqaKE6dsQWbUainqacMMUrjethrttAaU+wNQAsP4rEhHuMt22xNOaXxMbbKm78r7XbU159LSfgJeqLcDhKDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a00c427f9514a2effe074a976ee41be406193825515bdf78b39fc73c0e1774ad","last_reissued_at":"2026-05-18T01:12:15.538534Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:15.538534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.06056","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:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X+RPm6LRJNfWIFnBlEPgp34/CThmD8eCbv5WrSG0HEtLvYHf418oEzZCuDg8fzpzlPYGFq0vI6eeinL2pjx2Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:58:10.566108Z"},"content_sha256":"45fbf8fa78e38478ba4bc68fe31ac7fd393257c125853a612f12c171a507cce7","schema_version":"1.0","event_id":"sha256:45fbf8fa78e38478ba4bc68fe31ac7fd393257c125853a612f12c171a507cce7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UAGEE74VCSRO77QHJKLW5ZA34Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic MPC with Offline Uncertainty Sampling","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":"2016-06-20T10:24:40Z","abstract_excerpt":"For discrete-time linear systems subject to parametric uncertainty described by random variables, we develop a sampling-based Stochastic Model Predictive Control algorithm. Unlike earlier results employing a scenario approximation, we propose an offline sampling approach in the design phase instead of online scenario generation. The paper highlights the structural difference between online and offline sampling and provides rigorous bounds on the number of samples needed to guarantee chance constraint satisfaction. The approach does not only significantly speed up the online computation, but fu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06056","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:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uTs58WhPhtmFQcRlelZWeXMSJYO+BcBOTMlAPJdCNWLq1z++13UQdp6BQ+qlGcjrPtmqS222Wvl1tL2fW2ReBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:58:10.566743Z"},"content_sha256":"dc69ffc6af366f21a91443b04927fa5fcc39c7492bcfe29c25105ba04d62c982","schema_version":"1.0","event_id":"sha256:dc69ffc6af366f21a91443b04927fa5fcc39c7492bcfe29c25105ba04d62c982"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UAGEE74VCSRO77QHJKLW5ZA34Q/bundle.json","state_url":"https://pith.science/pith/UAGEE74VCSRO77QHJKLW5ZA34Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UAGEE74VCSRO77QHJKLW5ZA34Q/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:58:10Z","links":{"resolver":"https://pith.science/pith/UAGEE74VCSRO77QHJKLW5ZA34Q","bundle":"https://pith.science/pith/UAGEE74VCSRO77QHJKLW5ZA34Q/bundle.json","state":"https://pith.science/pith/UAGEE74VCSRO77QHJKLW5ZA34Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UAGEE74VCSRO77QHJKLW5ZA34Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UAGEE74VCSRO77QHJKLW5ZA34Q","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":"437e8d95f36672b56cf9228972b1dd65c18723df442bf0bd14b17c0760f4b29a","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-06-20T10:24:40Z","title_canon_sha256":"62691568472a2c178eeadc86c77dd63b4a011d077cca8833be1d11b267240584"},"schema_version":"1.0","source":{"id":"1606.06056","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06056","created_at":"2026-05-18T01:12:15Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06056v1","created_at":"2026-05-18T01:12:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06056","created_at":"2026-05-18T01:12:15Z"},{"alias_kind":"pith_short_12","alias_value":"UAGEE74VCSRO","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UAGEE74VCSRO77QH","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UAGEE74V","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:dc69ffc6af366f21a91443b04927fa5fcc39c7492bcfe29c25105ba04d62c982","target":"graph","created_at":"2026-05-18T01:12:15Z","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":"For discrete-time linear systems subject to parametric uncertainty described by random variables, we develop a sampling-based Stochastic Model Predictive Control algorithm. Unlike earlier results employing a scenario approximation, we propose an offline sampling approach in the design phase instead of online scenario generation. The paper highlights the structural difference between online and offline sampling and provides rigorous bounds on the number of samples needed to guarantee chance constraint satisfaction. The approach does not only significantly speed up the online computation, but fu","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":"2016-06-20T10:24:40Z","title":"Stochastic MPC with Offline Uncertainty Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06056","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:45fbf8fa78e38478ba4bc68fe31ac7fd393257c125853a612f12c171a507cce7","target":"record","created_at":"2026-05-18T01:12:15Z","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":"437e8d95f36672b56cf9228972b1dd65c18723df442bf0bd14b17c0760f4b29a","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2016-06-20T10:24:40Z","title_canon_sha256":"62691568472a2c178eeadc86c77dd63b4a011d077cca8833be1d11b267240584"},"schema_version":"1.0","source":{"id":"1606.06056","kind":"arxiv","version":1}},"canonical_sha256":"a00c427f9514a2effe074a976ee41be406193825515bdf78b39fc73c0e1774ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a00c427f9514a2effe074a976ee41be406193825515bdf78b39fc73c0e1774ad","first_computed_at":"2026-05-18T01:12:15.538534Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:15.538534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v1AqaKE6dsQWbUainqacMMUrjethrttAaU+wNQAsP4rEhHuMt22xNOaXxMbbKm78r7XbU159LSfgJeqLcDhKDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:15.538945Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.06056","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45fbf8fa78e38478ba4bc68fe31ac7fd393257c125853a612f12c171a507cce7","sha256:dc69ffc6af366f21a91443b04927fa5fcc39c7492bcfe29c25105ba04d62c982"],"state_sha256":"ba18746cf303ab0f754b7c02d10a478813aa17caafff787ea7a08251962b406c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UuqV1oCLjuCzDrcjjbuVY0nKPwlUlaS0LHpE4ahYwK2Ct3LjJ4dSjDZ7l9AMSqIyHW7NToRUaE257q4FBXbuCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:58:10.570195Z","bundle_sha256":"5000953f6067b98cfdb96fbc765dfb8978b5062191b1feaf17d04c6bb9a56c03"}}