{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FHYBXDXK2DFHHRUMAOKQ6Z6GWE","short_pith_number":"pith:FHYBXDXK","canonical_record":{"source":{"id":"1811.09069","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-11-22T09:19:08Z","cross_cats_sorted":[],"title_canon_sha256":"6d95671f8eac427ddcacee8f7dbf3afed6e2bd1efd9cda1a1f54238ba9bc6613","abstract_canon_sha256":"2105c1eaae87a88d61ab9ee1c3c9da13e757203dccf85dd5d387be4ee1929955"},"schema_version":"1.0"},"canonical_sha256":"29f01b8eead0ca73c68c03950f67c6b12d5ef2518f31a67a999867b636879534","source":{"kind":"arxiv","id":"1811.09069","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.09069","created_at":"2026-05-18T00:00:07Z"},{"alias_kind":"arxiv_version","alias_value":"1811.09069v1","created_at":"2026-05-18T00:00:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.09069","created_at":"2026-05-18T00:00:07Z"},{"alias_kind":"pith_short_12","alias_value":"FHYBXDXK2DFH","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FHYBXDXK2DFHHRUM","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FHYBXDXK","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FHYBXDXK2DFHHRUMAOKQ6Z6GWE","target":"record","payload":{"canonical_record":{"source":{"id":"1811.09069","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-11-22T09:19:08Z","cross_cats_sorted":[],"title_canon_sha256":"6d95671f8eac427ddcacee8f7dbf3afed6e2bd1efd9cda1a1f54238ba9bc6613","abstract_canon_sha256":"2105c1eaae87a88d61ab9ee1c3c9da13e757203dccf85dd5d387be4ee1929955"},"schema_version":"1.0"},"canonical_sha256":"29f01b8eead0ca73c68c03950f67c6b12d5ef2518f31a67a999867b636879534","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:07.162377Z","signature_b64":"76umHCpQobeU5lOHAeOFehVftlinjw84B6uqnL9I0V0x8M/icezajYKJxD9pRB6LyFeuJHBnIBIQQ+8TgS+aDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29f01b8eead0ca73c68c03950f67c6b12d5ef2518f31a67a999867b636879534","last_reissued_at":"2026-05-18T00:00:07.161831Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:07.161831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.09069","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-18T00:00:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6kfNdecG1+XhulGRapfGV22/s3ghq91eQdXcleCjdKHkuIr1QAAV8Z33MoMCJ8G9rWvki9XlWkcc+nOeyK7PDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:55:46.192852Z"},"content_sha256":"e788217584d92924bdbe48c69c39d5cf951e387492c0a66f7bf0210feadb3681","schema_version":"1.0","event_id":"sha256:e788217584d92924bdbe48c69c39d5cf951e387492c0a66f7bf0210feadb3681"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FHYBXDXK2DFHHRUMAOKQ6Z6GWE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the use of supervised clustering in stochastic NMPC design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Mazen Alamir","submitted_at":"2018-11-22T09:19:08Z","abstract_excerpt":"In this paper, a supervised clustering based-heuristic is proposed for the real-time implementation of approximate solutions to stochastic nonlinear model predictive control frameworks. The key idea is to update on-line a low cardinality set of uncertainty vectors to be used in the expression of the stochastic cost and constraints. These vectors are the centers of uncertainty clusters that are built using the optimal control sequences, cost and constraints indicators as supervision labels. The use of a moving clustering data buffer which accumulates recent past computations enables to reduce t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.09069","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-18T00:00:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AqSLYJErdgru5bjqIjU00y6gNcW5Pz2EdMY6Wr8sfAhdpsRXYsXBBD3XA8eclGOl3pZemvYiFDw3wBAl7tjvDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T17:55:46.193264Z"},"content_sha256":"64797ca2593f12a9e24831927f2dce55945865be52257d214a9d355b6e4e4414","schema_version":"1.0","event_id":"sha256:64797ca2593f12a9e24831927f2dce55945865be52257d214a9d355b6e4e4414"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FHYBXDXK2DFHHRUMAOKQ6Z6GWE/bundle.json","state_url":"https://pith.science/pith/FHYBXDXK2DFHHRUMAOKQ6Z6GWE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FHYBXDXK2DFHHRUMAOKQ6Z6GWE/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-02T17:55:46Z","links":{"resolver":"https://pith.science/pith/FHYBXDXK2DFHHRUMAOKQ6Z6GWE","bundle":"https://pith.science/pith/FHYBXDXK2DFHHRUMAOKQ6Z6GWE/bundle.json","state":"https://pith.science/pith/FHYBXDXK2DFHHRUMAOKQ6Z6GWE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FHYBXDXK2DFHHRUMAOKQ6Z6GWE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FHYBXDXK2DFHHRUMAOKQ6Z6GWE","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":"2105c1eaae87a88d61ab9ee1c3c9da13e757203dccf85dd5d387be4ee1929955","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-11-22T09:19:08Z","title_canon_sha256":"6d95671f8eac427ddcacee8f7dbf3afed6e2bd1efd9cda1a1f54238ba9bc6613"},"schema_version":"1.0","source":{"id":"1811.09069","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.09069","created_at":"2026-05-18T00:00:07Z"},{"alias_kind":"arxiv_version","alias_value":"1811.09069v1","created_at":"2026-05-18T00:00:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.09069","created_at":"2026-05-18T00:00:07Z"},{"alias_kind":"pith_short_12","alias_value":"FHYBXDXK2DFH","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"FHYBXDXK2DFHHRUM","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"FHYBXDXK","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:64797ca2593f12a9e24831927f2dce55945865be52257d214a9d355b6e4e4414","target":"graph","created_at":"2026-05-18T00:00:07Z","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":"In this paper, a supervised clustering based-heuristic is proposed for the real-time implementation of approximate solutions to stochastic nonlinear model predictive control frameworks. The key idea is to update on-line a low cardinality set of uncertainty vectors to be used in the expression of the stochastic cost and constraints. These vectors are the centers of uncertainty clusters that are built using the optimal control sequences, cost and constraints indicators as supervision labels. The use of a moving clustering data buffer which accumulates recent past computations enables to reduce t","authors_text":"Mazen Alamir","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-11-22T09:19:08Z","title":"On the use of supervised clustering in stochastic NMPC design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.09069","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:e788217584d92924bdbe48c69c39d5cf951e387492c0a66f7bf0210feadb3681","target":"record","created_at":"2026-05-18T00:00:07Z","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":"2105c1eaae87a88d61ab9ee1c3c9da13e757203dccf85dd5d387be4ee1929955","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-11-22T09:19:08Z","title_canon_sha256":"6d95671f8eac427ddcacee8f7dbf3afed6e2bd1efd9cda1a1f54238ba9bc6613"},"schema_version":"1.0","source":{"id":"1811.09069","kind":"arxiv","version":1}},"canonical_sha256":"29f01b8eead0ca73c68c03950f67c6b12d5ef2518f31a67a999867b636879534","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29f01b8eead0ca73c68c03950f67c6b12d5ef2518f31a67a999867b636879534","first_computed_at":"2026-05-18T00:00:07.161831Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:07.161831Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"76umHCpQobeU5lOHAeOFehVftlinjw84B6uqnL9I0V0x8M/icezajYKJxD9pRB6LyFeuJHBnIBIQQ+8TgS+aDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:07.162377Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.09069","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e788217584d92924bdbe48c69c39d5cf951e387492c0a66f7bf0210feadb3681","sha256:64797ca2593f12a9e24831927f2dce55945865be52257d214a9d355b6e4e4414"],"state_sha256":"14d0266cff80873a48d92613cdee3d26926863154b46fe23cbba0f86130d358e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"whzoBMga9EJUH+XO3qrzkUjQO5CdfujtfI8czS6gqfAmqP12apL0OnmMFZ+LlkA3jNdkZPrHQxuCT+docPmoCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T17:55:46.195522Z","bundle_sha256":"3fad2d275694731f0cd91ab961f96accc1cd8a8dd890081e7f1219fd687cec36"}}