{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:DNOMCVX5FPFAIMV6DWGRXEICNZ","short_pith_number":"pith:DNOMCVX5","canonical_record":{"source":{"id":"1207.0788","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-07-03T19:14:43Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"8aad77c735648cfbd50f441b6e4f88cec9c5ab0640e7f3912df56691f3138544","abstract_canon_sha256":"9235e569e05291ecfb21da1b42962d16ed4c8370e5295c0f491e0838f59d8de5"},"schema_version":"1.0"},"canonical_sha256":"1b5cc156fd2bca0432be1d8d1b91026e47c03e737add16f5d9e796b9a8e7145e","source":{"kind":"arxiv","id":"1207.0788","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0788","created_at":"2026-05-18T03:18:31Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0788v2","created_at":"2026-05-18T03:18:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0788","created_at":"2026-05-18T03:18:31Z"},{"alias_kind":"pith_short_12","alias_value":"DNOMCVX5FPFA","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DNOMCVX5FPFAIMV6","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DNOMCVX5","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:DNOMCVX5FPFAIMV6DWGRXEICNZ","target":"record","payload":{"canonical_record":{"source":{"id":"1207.0788","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-07-03T19:14:43Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"8aad77c735648cfbd50f441b6e4f88cec9c5ab0640e7f3912df56691f3138544","abstract_canon_sha256":"9235e569e05291ecfb21da1b42962d16ed4c8370e5295c0f491e0838f59d8de5"},"schema_version":"1.0"},"canonical_sha256":"1b5cc156fd2bca0432be1d8d1b91026e47c03e737add16f5d9e796b9a8e7145e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:31.773955Z","signature_b64":"QX5q/HM7SpFA6LWqU9Zh0PM99atjpqfpHbCuBAC7C27a++WTVbKXRYk9SgMsPUVwqwloCbWhuSOkRekgvSbBBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b5cc156fd2bca0432be1d8d1b91026e47c03e737add16f5d9e796b9a8e7145e","last_reissued_at":"2026-05-18T03:18:31.773230Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:31.773230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.0788","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-18T03:18:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ezQ/tCUGFELtxIsqMVVcsj+3femc1FUYFnL+NjEbYk6ZF3o+ylchi9BilXDP8tpGiRFzTZSTzpX0DA7rxle1Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:10:03.565157Z"},"content_sha256":"1cf8216902096b5e0cde7a3831beceeeb6c9d7853d4c0cfe439dc2c7778c4680","schema_version":"1.0","event_id":"sha256:1cf8216902096b5e0cde7a3831beceeeb6c9d7853d4c0cfe439dc2c7778c4680"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:DNOMCVX5FPFAIMV6DWGRXEICNZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On generalized terminal state constraints for model predictive control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.SY","authors_text":"Andrew R. Teel, Lorenzo Fagiano","submitted_at":"2012-07-03T19:14:43Z","abstract_excerpt":"This manuscript contains technical results related to a particular approach for the design of Model Predictive Control (MPC) laws. The approach, named \"generalized\" terminal state constraint, induces the recursive feasibility of the underlying optimization problem and recursive satisfaction of state and input constraints, and it can be used for both tracking MPC (i.e. when the objective is to track a given steady state) and economic MPC (i.e. when the objective is to minimize a cost function which does not necessarily attains its minimum at a steady state). It is shown that the proposed techni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0788","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-18T03:18:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sskmIoQ+pjHavB6iWK+n9LO2q07OaO2n6jh5IghXidE/a9ubzqCmyl3MGQyPwiVmVHr+ZJfgOB4Wz1XGP0pJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T22:10:03.565518Z"},"content_sha256":"0ad9daaa06e8eb2f0d94985c12e2aa0973e0da5cf6c54997422f644c6d1436b5","schema_version":"1.0","event_id":"sha256:0ad9daaa06e8eb2f0d94985c12e2aa0973e0da5cf6c54997422f644c6d1436b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DNOMCVX5FPFAIMV6DWGRXEICNZ/bundle.json","state_url":"https://pith.science/pith/DNOMCVX5FPFAIMV6DWGRXEICNZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DNOMCVX5FPFAIMV6DWGRXEICNZ/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-21T22:10:03Z","links":{"resolver":"https://pith.science/pith/DNOMCVX5FPFAIMV6DWGRXEICNZ","bundle":"https://pith.science/pith/DNOMCVX5FPFAIMV6DWGRXEICNZ/bundle.json","state":"https://pith.science/pith/DNOMCVX5FPFAIMV6DWGRXEICNZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DNOMCVX5FPFAIMV6DWGRXEICNZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:DNOMCVX5FPFAIMV6DWGRXEICNZ","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":"9235e569e05291ecfb21da1b42962d16ed4c8370e5295c0f491e0838f59d8de5","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-07-03T19:14:43Z","title_canon_sha256":"8aad77c735648cfbd50f441b6e4f88cec9c5ab0640e7f3912df56691f3138544"},"schema_version":"1.0","source":{"id":"1207.0788","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.0788","created_at":"2026-05-18T03:18:31Z"},{"alias_kind":"arxiv_version","alias_value":"1207.0788v2","created_at":"2026-05-18T03:18:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.0788","created_at":"2026-05-18T03:18:31Z"},{"alias_kind":"pith_short_12","alias_value":"DNOMCVX5FPFA","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"DNOMCVX5FPFAIMV6","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"DNOMCVX5","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:0ad9daaa06e8eb2f0d94985c12e2aa0973e0da5cf6c54997422f644c6d1436b5","target":"graph","created_at":"2026-05-18T03:18:31Z","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":"This manuscript contains technical results related to a particular approach for the design of Model Predictive Control (MPC) laws. The approach, named \"generalized\" terminal state constraint, induces the recursive feasibility of the underlying optimization problem and recursive satisfaction of state and input constraints, and it can be used for both tracking MPC (i.e. when the objective is to track a given steady state) and economic MPC (i.e. when the objective is to minimize a cost function which does not necessarily attains its minimum at a steady state). It is shown that the proposed techni","authors_text":"Andrew R. Teel, Lorenzo Fagiano","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-07-03T19:14:43Z","title":"On generalized terminal state constraints for model predictive control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.0788","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:1cf8216902096b5e0cde7a3831beceeeb6c9d7853d4c0cfe439dc2c7778c4680","target":"record","created_at":"2026-05-18T03:18:31Z","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":"9235e569e05291ecfb21da1b42962d16ed4c8370e5295c0f491e0838f59d8de5","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2012-07-03T19:14:43Z","title_canon_sha256":"8aad77c735648cfbd50f441b6e4f88cec9c5ab0640e7f3912df56691f3138544"},"schema_version":"1.0","source":{"id":"1207.0788","kind":"arxiv","version":2}},"canonical_sha256":"1b5cc156fd2bca0432be1d8d1b91026e47c03e737add16f5d9e796b9a8e7145e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b5cc156fd2bca0432be1d8d1b91026e47c03e737add16f5d9e796b9a8e7145e","first_computed_at":"2026-05-18T03:18:31.773230Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:31.773230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QX5q/HM7SpFA6LWqU9Zh0PM99atjpqfpHbCuBAC7C27a++WTVbKXRYk9SgMsPUVwqwloCbWhuSOkRekgvSbBBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:31.773955Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.0788","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1cf8216902096b5e0cde7a3831beceeeb6c9d7853d4c0cfe439dc2c7778c4680","sha256:0ad9daaa06e8eb2f0d94985c12e2aa0973e0da5cf6c54997422f644c6d1436b5"],"state_sha256":"9c97670de265da71d96549b4a9188ae1042ba7258a20390a8535b75c592d1a77"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KXE0eA6tRzBRUQFmbm30Nwbwnq0yWgNdYJCmwRvBhOu1fvuscc3/pwM7uDfRCToUt9ij3ChRztD9D7hxvvfSAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T22:10:03.568226Z","bundle_sha256":"5ae7c3295825518f8d161e8f969751bc8732f87410bf03f8dd3f3860b55626cf"}}