{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UWWOUVLFEON3YTDS2D7UMWWPHB","short_pith_number":"pith:UWWOUVLF","canonical_record":{"source":{"id":"1802.09767","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-02-27T08:25:01Z","cross_cats_sorted":["math.DS","math.OC"],"title_canon_sha256":"3dc5117bcee984b8ff3ab8336bef5701a426697ed4db4998d0e929cddadf1346","abstract_canon_sha256":"d93590985134cc9ee3e5ea6dd8d0e69588ee1a88f9933fce6fb0958581c594a1"},"schema_version":"1.0"},"canonical_sha256":"a5acea5565239bbc4c72d0ff465acf386c533f844f06267f57333467ffad2b60","source":{"kind":"arxiv","id":"1802.09767","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09767","created_at":"2026-05-18T00:22:22Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09767v1","created_at":"2026-05-18T00:22:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09767","created_at":"2026-05-18T00:22:22Z"},{"alias_kind":"pith_short_12","alias_value":"UWWOUVLFEON3","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UWWOUVLFEON3YTDS","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UWWOUVLF","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UWWOUVLFEON3YTDS2D7UMWWPHB","target":"record","payload":{"canonical_record":{"source":{"id":"1802.09767","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-02-27T08:25:01Z","cross_cats_sorted":["math.DS","math.OC"],"title_canon_sha256":"3dc5117bcee984b8ff3ab8336bef5701a426697ed4db4998d0e929cddadf1346","abstract_canon_sha256":"d93590985134cc9ee3e5ea6dd8d0e69588ee1a88f9933fce6fb0958581c594a1"},"schema_version":"1.0"},"canonical_sha256":"a5acea5565239bbc4c72d0ff465acf386c533f844f06267f57333467ffad2b60","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:22.293868Z","signature_b64":"Qa5H49eqgpuMK3oclnNn2N3jOdFSSCm4AePyIn5hpjP9XjbkwqJaL3mQn4OurZcxuf7v5bupYdqMSxuIKqlwDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a5acea5565239bbc4c72d0ff465acf386c533f844f06267f57333467ffad2b60","last_reissued_at":"2026-05-18T00:22:22.293224Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:22.293224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.09767","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:22:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WOG5FRJUKI9gjfZuBxlQdBF0boYViIccTyHjaZSVPcnllsMWl+asjtrO+WaC6spH0aiIiLU7gTwzS8WEU6/sBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T18:20:00.370844Z"},"content_sha256":"3a745030ed4720bc88146550ccba64aab08fe808308b580745e9275c11f6af3b","schema_version":"1.0","event_id":"sha256:3a745030ed4720bc88146550ccba64aab08fe808308b580745e9275c11f6af3b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UWWOUVLFEON3YTDS2D7UMWWPHB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On multi-step prediction models for receding horizon control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.DS","math.OC"],"primary_cat":"cs.SY","authors_text":"Enrico Terzi, Lorenzo Fagiano, Marcello Farina, Riccardo Scattolini","submitted_at":"2018-02-27T08:25:01Z","abstract_excerpt":"The derivation of multi-step-ahead prediction models from sampled data of a linear system is considered. A dedicated prediction model is built for each future time step of interest. In addition to a nominal model, the set of all models consistent with data and prior information is derived as well, making the approach suitable for robust control design within a Model Predictive Control framework. The resulting parameter identification problem is solved through a sequence of convex programs, overcoming the non-convexity arising when identifying 1-step prediction models with an output-error crite"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09767","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:22:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eIcnlTU/9ahkUjt6dE/Bx6EDHibe65AT0XIRp1cesrI1KdU+34FVvttXA+ZF6PtvsLw8IlYcJ7khx5gfsDMQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T18:20:00.371563Z"},"content_sha256":"5266307f1050fc09894afd81849a13d2532651997f5396ec4543a9ced7f9b455","schema_version":"1.0","event_id":"sha256:5266307f1050fc09894afd81849a13d2532651997f5396ec4543a9ced7f9b455"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UWWOUVLFEON3YTDS2D7UMWWPHB/bundle.json","state_url":"https://pith.science/pith/UWWOUVLFEON3YTDS2D7UMWWPHB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UWWOUVLFEON3YTDS2D7UMWWPHB/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-29T18:20:00Z","links":{"resolver":"https://pith.science/pith/UWWOUVLFEON3YTDS2D7UMWWPHB","bundle":"https://pith.science/pith/UWWOUVLFEON3YTDS2D7UMWWPHB/bundle.json","state":"https://pith.science/pith/UWWOUVLFEON3YTDS2D7UMWWPHB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UWWOUVLFEON3YTDS2D7UMWWPHB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UWWOUVLFEON3YTDS2D7UMWWPHB","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":"d93590985134cc9ee3e5ea6dd8d0e69588ee1a88f9933fce6fb0958581c594a1","cross_cats_sorted":["math.DS","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-02-27T08:25:01Z","title_canon_sha256":"3dc5117bcee984b8ff3ab8336bef5701a426697ed4db4998d0e929cddadf1346"},"schema_version":"1.0","source":{"id":"1802.09767","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09767","created_at":"2026-05-18T00:22:22Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09767v1","created_at":"2026-05-18T00:22:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09767","created_at":"2026-05-18T00:22:22Z"},{"alias_kind":"pith_short_12","alias_value":"UWWOUVLFEON3","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UWWOUVLFEON3YTDS","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UWWOUVLF","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:5266307f1050fc09894afd81849a13d2532651997f5396ec4543a9ced7f9b455","target":"graph","created_at":"2026-05-18T00:22:22Z","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 derivation of multi-step-ahead prediction models from sampled data of a linear system is considered. A dedicated prediction model is built for each future time step of interest. In addition to a nominal model, the set of all models consistent with data and prior information is derived as well, making the approach suitable for robust control design within a Model Predictive Control framework. The resulting parameter identification problem is solved through a sequence of convex programs, overcoming the non-convexity arising when identifying 1-step prediction models with an output-error crite","authors_text":"Enrico Terzi, Lorenzo Fagiano, Marcello Farina, Riccardo Scattolini","cross_cats":["math.DS","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-02-27T08:25:01Z","title":"On multi-step prediction models for receding horizon control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09767","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:3a745030ed4720bc88146550ccba64aab08fe808308b580745e9275c11f6af3b","target":"record","created_at":"2026-05-18T00:22:22Z","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":"d93590985134cc9ee3e5ea6dd8d0e69588ee1a88f9933fce6fb0958581c594a1","cross_cats_sorted":["math.DS","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-02-27T08:25:01Z","title_canon_sha256":"3dc5117bcee984b8ff3ab8336bef5701a426697ed4db4998d0e929cddadf1346"},"schema_version":"1.0","source":{"id":"1802.09767","kind":"arxiv","version":1}},"canonical_sha256":"a5acea5565239bbc4c72d0ff465acf386c533f844f06267f57333467ffad2b60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a5acea5565239bbc4c72d0ff465acf386c533f844f06267f57333467ffad2b60","first_computed_at":"2026-05-18T00:22:22.293224Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:22.293224Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Qa5H49eqgpuMK3oclnNn2N3jOdFSSCm4AePyIn5hpjP9XjbkwqJaL3mQn4OurZcxuf7v5bupYdqMSxuIKqlwDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:22.293868Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.09767","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a745030ed4720bc88146550ccba64aab08fe808308b580745e9275c11f6af3b","sha256:5266307f1050fc09894afd81849a13d2532651997f5396ec4543a9ced7f9b455"],"state_sha256":"0a696294d6e92184fee6e696ddb01fc99028c3f17cd88d277afd59a7f49158d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kL4V6Mx6019kf6LvpraQWBK6lm0o7db8O8NlklgWWPqCa4ld027z+7v2qYjl0gzi2WEbi34ENjjeJU6pHEB6Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T18:20:00.375336Z","bundle_sha256":"6ad04273b0ff74134c6a2e76b12b38dc5639377c6471cad18d51b41904b99469"}}