{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:TUKNO65VWERKZODCGDIAQCRNOZ","short_pith_number":"pith:TUKNO65V","canonical_record":{"source":{"id":"1408.5120","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-21T19:49:05Z","cross_cats_sorted":[],"title_canon_sha256":"2c9e4c35ce00d0cc4516d46db80874686d7d951db99e32c11628328378b7c174","abstract_canon_sha256":"6075f188d42649d701a13a9c02687945e86083c02a2878dc0f48708653d8e964"},"schema_version":"1.0"},"canonical_sha256":"9d14d77bb5b122acb86230d0080a2d764e238931c42574d56c56d5028be02411","source":{"kind":"arxiv","id":"1408.5120","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5120","created_at":"2026-05-18T02:30:33Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5120v2","created_at":"2026-05-18T02:30:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5120","created_at":"2026-05-18T02:30:33Z"},{"alias_kind":"pith_short_12","alias_value":"TUKNO65VWERK","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TUKNO65VWERKZODC","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TUKNO65V","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:TUKNO65VWERKZODCGDIAQCRNOZ","target":"record","payload":{"canonical_record":{"source":{"id":"1408.5120","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-21T19:49:05Z","cross_cats_sorted":[],"title_canon_sha256":"2c9e4c35ce00d0cc4516d46db80874686d7d951db99e32c11628328378b7c174","abstract_canon_sha256":"6075f188d42649d701a13a9c02687945e86083c02a2878dc0f48708653d8e964"},"schema_version":"1.0"},"canonical_sha256":"9d14d77bb5b122acb86230d0080a2d764e238931c42574d56c56d5028be02411","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:33.734275Z","signature_b64":"ebJYmFFxluBiia2h4ohLIR3yi5uRs3aym79D6+45voeBmbxDsbvJiAgcLhk5uPw+55zQ5lZyKjK2SEdSkENTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d14d77bb5b122acb86230d0080a2d764e238931c42574d56c56d5028be02411","last_reissued_at":"2026-05-18T02:30:33.733853Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:33.733853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.5120","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-18T02:30:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tWQUAr0NDQF5ddg2GMgZrMo4fG479T/AgI8zB5U5GkB5G4mOu9vMbnh3c65xLR/E/8xP5je68h3cI7ZLgxP7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:31:23.488262Z"},"content_sha256":"84c4d242e343991c3ca6a0cfae2425320c017b64cc48d5f7b7bdd4e04c0807be","schema_version":"1.0","event_id":"sha256:84c4d242e343991c3ca6a0cfae2425320c017b64cc48d5f7b7bdd4e04c0807be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:TUKNO65VWERKZODCGDIAQCRNOZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Parametric Non-Convex Decomposition Algorithm for Real-Time and Distributed NMPC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Colin N. Jones, Jean-Hubert Hours","submitted_at":"2014-08-21T19:49:05Z","abstract_excerpt":"A novel decomposition scheme to solve parametric non-convex programs as they arise in Nonlinear Model Predictive Control (NMPC) is presented. It consists of a fixed number of alternating proximal gradient steps and a dual update per time step. Hence, the proposed approach is attractive in a real-time distributed context. Assuming that the Nonlinear Program (NLP) is semi-algebraic and that its critical points are strongly regular, contraction of the sequence of primal-dual iterates is proven, implying stability of the sub-optimality error, under some mild assumptions. Moreover, it is shown that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5120","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-18T02:30:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fnecM1c5RFBqZSj2pLnAQF/nVRlZzMUhLvYNH82N3dtAbCKaODsNDy5VeDB45FN0wCBST/80rSgYRSk+GLH0Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:31:23.488632Z"},"content_sha256":"836477dedad1b4bfc3aa072d8c127e805028ec33374ddfdd90ffc2fa87073899","schema_version":"1.0","event_id":"sha256:836477dedad1b4bfc3aa072d8c127e805028ec33374ddfdd90ffc2fa87073899"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TUKNO65VWERKZODCGDIAQCRNOZ/bundle.json","state_url":"https://pith.science/pith/TUKNO65VWERKZODCGDIAQCRNOZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TUKNO65VWERKZODCGDIAQCRNOZ/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-02T00:31:23Z","links":{"resolver":"https://pith.science/pith/TUKNO65VWERKZODCGDIAQCRNOZ","bundle":"https://pith.science/pith/TUKNO65VWERKZODCGDIAQCRNOZ/bundle.json","state":"https://pith.science/pith/TUKNO65VWERKZODCGDIAQCRNOZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TUKNO65VWERKZODCGDIAQCRNOZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:TUKNO65VWERKZODCGDIAQCRNOZ","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":"6075f188d42649d701a13a9c02687945e86083c02a2878dc0f48708653d8e964","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-21T19:49:05Z","title_canon_sha256":"2c9e4c35ce00d0cc4516d46db80874686d7d951db99e32c11628328378b7c174"},"schema_version":"1.0","source":{"id":"1408.5120","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5120","created_at":"2026-05-18T02:30:33Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5120v2","created_at":"2026-05-18T02:30:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5120","created_at":"2026-05-18T02:30:33Z"},{"alias_kind":"pith_short_12","alias_value":"TUKNO65VWERK","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"TUKNO65VWERKZODC","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"TUKNO65V","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:836477dedad1b4bfc3aa072d8c127e805028ec33374ddfdd90ffc2fa87073899","target":"graph","created_at":"2026-05-18T02:30:33Z","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":"A novel decomposition scheme to solve parametric non-convex programs as they arise in Nonlinear Model Predictive Control (NMPC) is presented. It consists of a fixed number of alternating proximal gradient steps and a dual update per time step. Hence, the proposed approach is attractive in a real-time distributed context. Assuming that the Nonlinear Program (NLP) is semi-algebraic and that its critical points are strongly regular, contraction of the sequence of primal-dual iterates is proven, implying stability of the sub-optimality error, under some mild assumptions. Moreover, it is shown that","authors_text":"Colin N. Jones, Jean-Hubert Hours","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-21T19:49:05Z","title":"A Parametric Non-Convex Decomposition Algorithm for Real-Time and Distributed NMPC"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5120","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:84c4d242e343991c3ca6a0cfae2425320c017b64cc48d5f7b7bdd4e04c0807be","target":"record","created_at":"2026-05-18T02:30:33Z","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":"6075f188d42649d701a13a9c02687945e86083c02a2878dc0f48708653d8e964","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-08-21T19:49:05Z","title_canon_sha256":"2c9e4c35ce00d0cc4516d46db80874686d7d951db99e32c11628328378b7c174"},"schema_version":"1.0","source":{"id":"1408.5120","kind":"arxiv","version":2}},"canonical_sha256":"9d14d77bb5b122acb86230d0080a2d764e238931c42574d56c56d5028be02411","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d14d77bb5b122acb86230d0080a2d764e238931c42574d56c56d5028be02411","first_computed_at":"2026-05-18T02:30:33.733853Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:33.733853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ebJYmFFxluBiia2h4ohLIR3yi5uRs3aym79D6+45voeBmbxDsbvJiAgcLhk5uPw+55zQ5lZyKjK2SEdSkENTBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:33.734275Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.5120","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84c4d242e343991c3ca6a0cfae2425320c017b64cc48d5f7b7bdd4e04c0807be","sha256:836477dedad1b4bfc3aa072d8c127e805028ec33374ddfdd90ffc2fa87073899"],"state_sha256":"aa50680b695b032902495efff950884bb0c3ac26461d1c227a7cafd1c3c8014e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qYvmaMcYbCcx8xq4mZFZ5h/6AdVo38gjaYpqgCVwSN43fxD03MyJedqWGJaH/RfN4HCQHdyyxIg45rTkIXE4CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T00:31:23.490632Z","bundle_sha256":"8265a681c356d8516de4fd5514dd6c05a052e3abbdb5bf060f5fc2ee4529305a"}}