{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:L4VPYV3HKRGZKAYQNVO7UU5CKW","short_pith_number":"pith:L4VPYV3H","canonical_record":{"source":{"id":"1503.06330","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-21T17:42:56Z","cross_cats_sorted":[],"title_canon_sha256":"242b5e8ef83847460e45592aa6f4c84666e1afb9ba533bac0244079876e83789","abstract_canon_sha256":"4370d38ae712ef59a8c463aaadfe6fb1148f42aa12ffa06dfcb26f54eaea4708"},"schema_version":"1.0"},"canonical_sha256":"5f2afc5767544d9503106d5dfa53a255a581117a88aa0f4617f8ed34edaa64c4","source":{"kind":"arxiv","id":"1503.06330","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.06330","created_at":"2026-05-18T02:20:38Z"},{"alias_kind":"arxiv_version","alias_value":"1503.06330v1","created_at":"2026-05-18T02:20:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06330","created_at":"2026-05-18T02:20:38Z"},{"alias_kind":"pith_short_12","alias_value":"L4VPYV3HKRGZ","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"L4VPYV3HKRGZKAYQ","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"L4VPYV3H","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:L4VPYV3HKRGZKAYQNVO7UU5CKW","target":"record","payload":{"canonical_record":{"source":{"id":"1503.06330","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-21T17:42:56Z","cross_cats_sorted":[],"title_canon_sha256":"242b5e8ef83847460e45592aa6f4c84666e1afb9ba533bac0244079876e83789","abstract_canon_sha256":"4370d38ae712ef59a8c463aaadfe6fb1148f42aa12ffa06dfcb26f54eaea4708"},"schema_version":"1.0"},"canonical_sha256":"5f2afc5767544d9503106d5dfa53a255a581117a88aa0f4617f8ed34edaa64c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:20:38.703565Z","signature_b64":"irPOGvz1iVtKb3QooVuO8jdrMCoQ3Fpa4FjqOrXQLwL6C889iCKPiU07Tj/RD6DWpJp4OlLAnXC/rGN6PQkwBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f2afc5767544d9503106d5dfa53a255a581117a88aa0f4617f8ed34edaa64c4","last_reissued_at":"2026-05-18T02:20:38.702787Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:20:38.702787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.06330","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-18T02:20:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nMuEH2I70jyLmmdmpHcffB6P7A19sbWzsDR1M2NsWwIJ92k+Yn9HxCqvIHBUhXF24p8fOe1NjKr3Ju2MG91yAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:43:13.100884Z"},"content_sha256":"b881e695a06ce1417981c2d4b9950b6f78e5e35e61e96e070732fc49077b09bd","schema_version":"1.0","event_id":"sha256:b881e695a06ce1417981c2d4b9950b6f78e5e35e61e96e070732fc49077b09bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:L4VPYV3HKRGZKAYQNVO7UU5CKW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Parallel Dual Fast Gradient Method for MPC Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Laura Ferranti, Tamas Keviczky","submitted_at":"2015-03-21T17:42:56Z","abstract_excerpt":"We propose a parallel adaptive constraint-tightening approach to solve a linear model predictive control problem for discrete-time systems, based on inexact numerical optimization algorithms and operator splitting methods. The underlying algorithm first splits the original problem in as many independent subproblems as the length of the prediction horizon. Then, our algorithm computes a solution for these subproblems in parallel by exploiting auxiliary tightened subproblems in order to certify the control law in terms of suboptimality and recursive feasibility, along with closed-loop stability "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06330","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-18T02:20:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4Fw5KjfQtzk8IAowhF2ciQo12GG9/F82F8bQnMne0f61NnGSu+s87G9S74KLZVmXMOuctx8RO+EI88nPOfccDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:43:13.101330Z"},"content_sha256":"2fec8e4bb465ca2fc68c832c8b2243f2f998847f5381d15f80e5b3e3989ba779","schema_version":"1.0","event_id":"sha256:2fec8e4bb465ca2fc68c832c8b2243f2f998847f5381d15f80e5b3e3989ba779"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L4VPYV3HKRGZKAYQNVO7UU5CKW/bundle.json","state_url":"https://pith.science/pith/L4VPYV3HKRGZKAYQNVO7UU5CKW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L4VPYV3HKRGZKAYQNVO7UU5CKW/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-31T11:43:13Z","links":{"resolver":"https://pith.science/pith/L4VPYV3HKRGZKAYQNVO7UU5CKW","bundle":"https://pith.science/pith/L4VPYV3HKRGZKAYQNVO7UU5CKW/bundle.json","state":"https://pith.science/pith/L4VPYV3HKRGZKAYQNVO7UU5CKW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L4VPYV3HKRGZKAYQNVO7UU5CKW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:L4VPYV3HKRGZKAYQNVO7UU5CKW","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":"4370d38ae712ef59a8c463aaadfe6fb1148f42aa12ffa06dfcb26f54eaea4708","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-21T17:42:56Z","title_canon_sha256":"242b5e8ef83847460e45592aa6f4c84666e1afb9ba533bac0244079876e83789"},"schema_version":"1.0","source":{"id":"1503.06330","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.06330","created_at":"2026-05-18T02:20:38Z"},{"alias_kind":"arxiv_version","alias_value":"1503.06330v1","created_at":"2026-05-18T02:20:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.06330","created_at":"2026-05-18T02:20:38Z"},{"alias_kind":"pith_short_12","alias_value":"L4VPYV3HKRGZ","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"L4VPYV3HKRGZKAYQ","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"L4VPYV3H","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:2fec8e4bb465ca2fc68c832c8b2243f2f998847f5381d15f80e5b3e3989ba779","target":"graph","created_at":"2026-05-18T02:20:38Z","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":"We propose a parallel adaptive constraint-tightening approach to solve a linear model predictive control problem for discrete-time systems, based on inexact numerical optimization algorithms and operator splitting methods. The underlying algorithm first splits the original problem in as many independent subproblems as the length of the prediction horizon. Then, our algorithm computes a solution for these subproblems in parallel by exploiting auxiliary tightened subproblems in order to certify the control law in terms of suboptimality and recursive feasibility, along with closed-loop stability ","authors_text":"Laura Ferranti, Tamas Keviczky","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-21T17:42:56Z","title":"A Parallel Dual Fast Gradient Method for MPC Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.06330","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:b881e695a06ce1417981c2d4b9950b6f78e5e35e61e96e070732fc49077b09bd","target":"record","created_at":"2026-05-18T02:20:38Z","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":"4370d38ae712ef59a8c463aaadfe6fb1148f42aa12ffa06dfcb26f54eaea4708","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-21T17:42:56Z","title_canon_sha256":"242b5e8ef83847460e45592aa6f4c84666e1afb9ba533bac0244079876e83789"},"schema_version":"1.0","source":{"id":"1503.06330","kind":"arxiv","version":1}},"canonical_sha256":"5f2afc5767544d9503106d5dfa53a255a581117a88aa0f4617f8ed34edaa64c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f2afc5767544d9503106d5dfa53a255a581117a88aa0f4617f8ed34edaa64c4","first_computed_at":"2026-05-18T02:20:38.702787Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:20:38.702787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"irPOGvz1iVtKb3QooVuO8jdrMCoQ3Fpa4FjqOrXQLwL6C889iCKPiU07Tj/RD6DWpJp4OlLAnXC/rGN6PQkwBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:20:38.703565Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.06330","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b881e695a06ce1417981c2d4b9950b6f78e5e35e61e96e070732fc49077b09bd","sha256:2fec8e4bb465ca2fc68c832c8b2243f2f998847f5381d15f80e5b3e3989ba779"],"state_sha256":"aae18b3a7478db56c011ea2fbfa49fc427e1ee4d7ec6e4aa64ac97bf332b3eee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GQrWZ8Ynp9UqORZzgNtI2KkR7ISYaUNAlSRJqgxwUdKZmfYd0cL8GGLU+xMaD9TpCfye1lmsOjT5rrFBOLo9BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:43:13.103982Z","bundle_sha256":"cb0efb981365410674b963749ee1ca492257009a710a806b6853fbae8fb7c11b"}}