{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:JPHLD5KIDEKHYBS24JAG3KOZRT","short_pith_number":"pith:JPHLD5KI","canonical_record":{"source":{"id":"1911.08607","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-11-19T21:56:33Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"98416da18ddf1ed7d643bd315c2a77b4ca7830f1527d062fdcebf5718a181bd0","abstract_canon_sha256":"09b6ae748dc4cfc03313a83a7fcda45a8dd4d91f4bd07388823bdd47ce447bd5"},"schema_version":"1.0"},"canonical_sha256":"4bceb1f54819147c065ae2406da9d98cd9557b485eb29602362e7e80027e1b10","source":{"kind":"arxiv","id":"1911.08607","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.08607","created_at":"2026-07-05T00:20:34Z"},{"alias_kind":"arxiv_version","alias_value":"1911.08607v1","created_at":"2026-07-05T00:20:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.08607","created_at":"2026-07-05T00:20:34Z"},{"alias_kind":"pith_short_12","alias_value":"JPHLD5KIDEKH","created_at":"2026-07-05T00:20:34Z"},{"alias_kind":"pith_short_16","alias_value":"JPHLD5KIDEKHYBS2","created_at":"2026-07-05T00:20:34Z"},{"alias_kind":"pith_short_8","alias_value":"JPHLD5KI","created_at":"2026-07-05T00:20:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:JPHLD5KIDEKHYBS24JAG3KOZRT","target":"record","payload":{"canonical_record":{"source":{"id":"1911.08607","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-11-19T21:56:33Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"98416da18ddf1ed7d643bd315c2a77b4ca7830f1527d062fdcebf5718a181bd0","abstract_canon_sha256":"09b6ae748dc4cfc03313a83a7fcda45a8dd4d91f4bd07388823bdd47ce447bd5"},"schema_version":"1.0"},"canonical_sha256":"4bceb1f54819147c065ae2406da9d98cd9557b485eb29602362e7e80027e1b10","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:20:34.061199Z","signature_b64":"G9nee+05xHmz1G4ppzxkxIAvsg5zVzicWhj7KGLQd3npRe33MtmozKNinJqS6hx9pwNG1SuJ4pYGLKGgukVYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bceb1f54819147c065ae2406da9d98cd9557b485eb29602362e7e80027e1b10","last_reissued_at":"2026-07-05T00:20:34.060877Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:20:34.060877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.08607","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-07-05T00:20:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QWXpdSaZHEePrnbIJLqdZnf+9mGJyuZg/h1ci+cbISjddvpfOJhUIGn5gHpZtPw15ZpNsUENBFrXnCNChtKnBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T20:36:58.662867Z"},"content_sha256":"cd8639998cadfc2c6775ca96ac720843623af1a0b5d004716bbe2584dd5ac07e","schema_version":"1.0","event_id":"sha256:cd8639998cadfc2c6775ca96ac720843623af1a0b5d004716bbe2584dd5ac07e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:JPHLD5KIDEKHYBS24JAG3KOZRT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Adaptive Model Predictive Control with Worst-Case Cost","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Andrea Iannelli, Anilkumar Parsi, Mingzhou Yin, Mohammad Khosravi, Roy S. Smith","submitted_at":"2019-11-19T21:56:33Z","abstract_excerpt":"A robust adaptive model predictive control (MPC) algorithm is presented for linear, time invariant systems with unknown dynamics and subject to bounded measurement noise. The system is characterized by an impulse response model, which is assumed to lie within a bounded set called the feasible system set. Online set-membership identification is used to reduce uncertainty in the impulse response. In the MPC scheme, robust constraints are enforced to ensure constraint satisfaction for all the models in the feasible set. The performance objective is formulated as a worst-case cost with respect to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.08607","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.08607/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:20:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iIDxaokTyL0WPRhWPnwIeabfDkdRnUmMbXMtfqXJceOyMz57noz+/gkojwjnKjwRuehgCxi7JdlqguUQeLvYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T20:36:58.663807Z"},"content_sha256":"385b7762d9d17768a9f6a953fe7196ffe123a02bfe61e488232e9f6d13d81c83","schema_version":"1.0","event_id":"sha256:385b7762d9d17768a9f6a953fe7196ffe123a02bfe61e488232e9f6d13d81c83"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JPHLD5KIDEKHYBS24JAG3KOZRT/bundle.json","state_url":"https://pith.science/pith/JPHLD5KIDEKHYBS24JAG3KOZRT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JPHLD5KIDEKHYBS24JAG3KOZRT/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-08-03T20:36:58Z","links":{"resolver":"https://pith.science/pith/JPHLD5KIDEKHYBS24JAG3KOZRT","bundle":"https://pith.science/pith/JPHLD5KIDEKHYBS24JAG3KOZRT/bundle.json","state":"https://pith.science/pith/JPHLD5KIDEKHYBS24JAG3KOZRT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JPHLD5KIDEKHYBS24JAG3KOZRT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:JPHLD5KIDEKHYBS24JAG3KOZRT","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":"09b6ae748dc4cfc03313a83a7fcda45a8dd4d91f4bd07388823bdd47ce447bd5","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-11-19T21:56:33Z","title_canon_sha256":"98416da18ddf1ed7d643bd315c2a77b4ca7830f1527d062fdcebf5718a181bd0"},"schema_version":"1.0","source":{"id":"1911.08607","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.08607","created_at":"2026-07-05T00:20:34Z"},{"alias_kind":"arxiv_version","alias_value":"1911.08607v1","created_at":"2026-07-05T00:20:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.08607","created_at":"2026-07-05T00:20:34Z"},{"alias_kind":"pith_short_12","alias_value":"JPHLD5KIDEKH","created_at":"2026-07-05T00:20:34Z"},{"alias_kind":"pith_short_16","alias_value":"JPHLD5KIDEKHYBS2","created_at":"2026-07-05T00:20:34Z"},{"alias_kind":"pith_short_8","alias_value":"JPHLD5KI","created_at":"2026-07-05T00:20:34Z"}],"graph_snapshots":[{"event_id":"sha256:385b7762d9d17768a9f6a953fe7196ffe123a02bfe61e488232e9f6d13d81c83","target":"graph","created_at":"2026-07-05T00:20:34Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1911.08607/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A robust adaptive model predictive control (MPC) algorithm is presented for linear, time invariant systems with unknown dynamics and subject to bounded measurement noise. The system is characterized by an impulse response model, which is assumed to lie within a bounded set called the feasible system set. Online set-membership identification is used to reduce uncertainty in the impulse response. In the MPC scheme, robust constraints are enforced to ensure constraint satisfaction for all the models in the feasible set. The performance objective is formulated as a worst-case cost with respect to ","authors_text":"Andrea Iannelli, Anilkumar Parsi, Mingzhou Yin, Mohammad Khosravi, Roy S. Smith","cross_cats":["cs.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-11-19T21:56:33Z","title":"Robust Adaptive Model Predictive Control with Worst-Case Cost"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.08607","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:cd8639998cadfc2c6775ca96ac720843623af1a0b5d004716bbe2584dd5ac07e","target":"record","created_at":"2026-07-05T00:20:34Z","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":"09b6ae748dc4cfc03313a83a7fcda45a8dd4d91f4bd07388823bdd47ce447bd5","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2019-11-19T21:56:33Z","title_canon_sha256":"98416da18ddf1ed7d643bd315c2a77b4ca7830f1527d062fdcebf5718a181bd0"},"schema_version":"1.0","source":{"id":"1911.08607","kind":"arxiv","version":1}},"canonical_sha256":"4bceb1f54819147c065ae2406da9d98cd9557b485eb29602362e7e80027e1b10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4bceb1f54819147c065ae2406da9d98cd9557b485eb29602362e7e80027e1b10","first_computed_at":"2026-07-05T00:20:34.060877Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:20:34.060877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G9nee+05xHmz1G4ppzxkxIAvsg5zVzicWhj7KGLQd3npRe33MtmozKNinJqS6hx9pwNG1SuJ4pYGLKGgukVYDg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:20:34.061199Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.08607","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd8639998cadfc2c6775ca96ac720843623af1a0b5d004716bbe2584dd5ac07e","sha256:385b7762d9d17768a9f6a953fe7196ffe123a02bfe61e488232e9f6d13d81c83"],"state_sha256":"02c3931596caca62e3e6592c179e37e5c7db0ae3765b2b1454b05d01d2859a9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8fU6De6a/vicUvvvMlZeNOhdeIRsDMaxOwSm71tGYPQEg/8i9pFuOk0XWUCpn7t93M1XM8JdQM1OeeX/PH8AAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T20:36:58.715616Z","bundle_sha256":"21b1366f2d4a65eff3a37254f58ab07403c11d6ac949e2ce52b677da6cd9fb1b"}}