{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:XQZZ5VRFVVZ6FKE6RDP2QGAPRH","short_pith_number":"pith:XQZZ5VRF","canonical_record":{"source":{"id":"2501.13270","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-01-22T23:27:35Z","cross_cats_sorted":[],"title_canon_sha256":"5d0321b08c5b89807b585fc465f39ee238d6827585d73cf9af9060dd4518f87a","abstract_canon_sha256":"562e4b562a68658efa3ae0666143193b454f94d409825297eb3c08173b3aae3b"},"schema_version":"1.0"},"canonical_sha256":"bc339ed625ad73e2a89e88dfa8180f89f0fa8e27520112c38c60c5ad75365f0e","source":{"kind":"arxiv","id":"2501.13270","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.13270","created_at":"2026-07-05T10:04:25Z"},{"alias_kind":"arxiv_version","alias_value":"2501.13270v1","created_at":"2026-07-05T10:04:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.13270","created_at":"2026-07-05T10:04:25Z"},{"alias_kind":"pith_short_12","alias_value":"XQZZ5VRFVVZ6","created_at":"2026-07-05T10:04:25Z"},{"alias_kind":"pith_short_16","alias_value":"XQZZ5VRFVVZ6FKE6","created_at":"2026-07-05T10:04:25Z"},{"alias_kind":"pith_short_8","alias_value":"XQZZ5VRF","created_at":"2026-07-05T10:04:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:XQZZ5VRFVVZ6FKE6RDP2QGAPRH","target":"record","payload":{"canonical_record":{"source":{"id":"2501.13270","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-01-22T23:27:35Z","cross_cats_sorted":[],"title_canon_sha256":"5d0321b08c5b89807b585fc465f39ee238d6827585d73cf9af9060dd4518f87a","abstract_canon_sha256":"562e4b562a68658efa3ae0666143193b454f94d409825297eb3c08173b3aae3b"},"schema_version":"1.0"},"canonical_sha256":"bc339ed625ad73e2a89e88dfa8180f89f0fa8e27520112c38c60c5ad75365f0e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:04:25.981586Z","signature_b64":"KYsV9XPWg3JsTTCmT/dZdIcAfzukekrbvXSp7Ys+gLzYJFxDAp9/DzGR+Iu4iAfrk8Wbxc+oT5W7lW/BCZrUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bc339ed625ad73e2a89e88dfa8180f89f0fa8e27520112c38c60c5ad75365f0e","last_reissued_at":"2026-07-05T10:04:25.981135Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:04:25.981135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.13270","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-05T10:04:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y68zKBmhEssMpeAwQTbb98bxndRWoJfqqS5cbamKfW57U5OCDM793RMtVlX/REMbSlGRNuYkyiTFtDfrnoqYBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T01:04:34.086167Z"},"content_sha256":"df05a5f2356663948ea6d4050df013867be0e94da3675f1e2f755bd763a75662","schema_version":"1.0","event_id":"sha256:df05a5f2356663948ea6d4050df013867be0e94da3675f1e2f755bd763a75662"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:XQZZ5VRFVVZ6FKE6RDP2QGAPRH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Practical Considerations for Implementing Robust-to-Early Termination Model Predictive Control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Mehdi Hosseinzadeh, Mohsen Amiri","submitted_at":"2025-01-22T23:27:35Z","abstract_excerpt":"Model Predictive Control (MPC) is widely used to achieve performance objectives, while enforcing operational and safety constraints. Despite its high performance, MPC often demands significant computational resources, making it challenging to implement in systems with limited computing capacity. A recent approach to address this challenge is to use the Robust-to-Early Termination (REAP) strategy. At any time instant, REAP converts the MPC problem into the evolution of a virtual dynamical system whose trajectory converges to the optimal solution, and provides guaranteed sub-optimal and feasible"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.13270","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/2501.13270/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-05T10:04:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nr1LnITcb+eQbPltLiKsdXDUKOc3SmjtWYRpoa3TEpbUbovp+H8uCl9ahK4CNXjAFXTdx59iEy/AvEcAVnmUCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T01:04:34.086762Z"},"content_sha256":"6e2c696196b1aa11c51c48f975bfd450d16e2efe6c2b010894e9136aabc81700","schema_version":"1.0","event_id":"sha256:6e2c696196b1aa11c51c48f975bfd450d16e2efe6c2b010894e9136aabc81700"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XQZZ5VRFVVZ6FKE6RDP2QGAPRH/bundle.json","state_url":"https://pith.science/pith/XQZZ5VRFVVZ6FKE6RDP2QGAPRH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XQZZ5VRFVVZ6FKE6RDP2QGAPRH/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-11T01:04:34Z","links":{"resolver":"https://pith.science/pith/XQZZ5VRFVVZ6FKE6RDP2QGAPRH","bundle":"https://pith.science/pith/XQZZ5VRFVVZ6FKE6RDP2QGAPRH/bundle.json","state":"https://pith.science/pith/XQZZ5VRFVVZ6FKE6RDP2QGAPRH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XQZZ5VRFVVZ6FKE6RDP2QGAPRH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:XQZZ5VRFVVZ6FKE6RDP2QGAPRH","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":"562e4b562a68658efa3ae0666143193b454f94d409825297eb3c08173b3aae3b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-01-22T23:27:35Z","title_canon_sha256":"5d0321b08c5b89807b585fc465f39ee238d6827585d73cf9af9060dd4518f87a"},"schema_version":"1.0","source":{"id":"2501.13270","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.13270","created_at":"2026-07-05T10:04:25Z"},{"alias_kind":"arxiv_version","alias_value":"2501.13270v1","created_at":"2026-07-05T10:04:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.13270","created_at":"2026-07-05T10:04:25Z"},{"alias_kind":"pith_short_12","alias_value":"XQZZ5VRFVVZ6","created_at":"2026-07-05T10:04:25Z"},{"alias_kind":"pith_short_16","alias_value":"XQZZ5VRFVVZ6FKE6","created_at":"2026-07-05T10:04:25Z"},{"alias_kind":"pith_short_8","alias_value":"XQZZ5VRF","created_at":"2026-07-05T10:04:25Z"}],"graph_snapshots":[{"event_id":"sha256:6e2c696196b1aa11c51c48f975bfd450d16e2efe6c2b010894e9136aabc81700","target":"graph","created_at":"2026-07-05T10:04:25Z","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/2501.13270/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Model Predictive Control (MPC) is widely used to achieve performance objectives, while enforcing operational and safety constraints. Despite its high performance, MPC often demands significant computational resources, making it challenging to implement in systems with limited computing capacity. A recent approach to address this challenge is to use the Robust-to-Early Termination (REAP) strategy. At any time instant, REAP converts the MPC problem into the evolution of a virtual dynamical system whose trajectory converges to the optimal solution, and provides guaranteed sub-optimal and feasible","authors_text":"Mehdi Hosseinzadeh, Mohsen Amiri","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-01-22T23:27:35Z","title":"Practical Considerations for Implementing Robust-to-Early Termination Model Predictive Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.13270","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:df05a5f2356663948ea6d4050df013867be0e94da3675f1e2f755bd763a75662","target":"record","created_at":"2026-07-05T10:04:25Z","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":"562e4b562a68658efa3ae0666143193b454f94d409825297eb3c08173b3aae3b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-01-22T23:27:35Z","title_canon_sha256":"5d0321b08c5b89807b585fc465f39ee238d6827585d73cf9af9060dd4518f87a"},"schema_version":"1.0","source":{"id":"2501.13270","kind":"arxiv","version":1}},"canonical_sha256":"bc339ed625ad73e2a89e88dfa8180f89f0fa8e27520112c38c60c5ad75365f0e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bc339ed625ad73e2a89e88dfa8180f89f0fa8e27520112c38c60c5ad75365f0e","first_computed_at":"2026-07-05T10:04:25.981135Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:04:25.981135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KYsV9XPWg3JsTTCmT/dZdIcAfzukekrbvXSp7Ys+gLzYJFxDAp9/DzGR+Iu4iAfrk8Wbxc+oT5W7lW/BCZrUDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:04:25.981586Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.13270","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df05a5f2356663948ea6d4050df013867be0e94da3675f1e2f755bd763a75662","sha256:6e2c696196b1aa11c51c48f975bfd450d16e2efe6c2b010894e9136aabc81700"],"state_sha256":"7748fb9ec5e6a3f41bcb4b47eae3b3f14eeb2c41ac6605765dcb3a053f6df5f9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jpD8ChwfbaVmIYFduNEuE7lJfmepsSnhtMp5ZGTCPyU4bU622U8Yg+b2qUYWfl6/ecL461lpWwBlqMgJb+XhAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T01:04:34.092299Z","bundle_sha256":"b72e0cde66107fc09a753d29e513814c94bd3747e127b9d8e90cb574ff892416"}}