{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:U7GTTSL576PAVE6HKKSJFXZ662","short_pith_number":"pith:U7GTTSL5","canonical_record":{"source":{"id":"1609.05801","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-19T15:54:13Z","cross_cats_sorted":[],"title_canon_sha256":"923032600a0ab125555760f874be4fc9cbd3a3eb96f6591fc80765a8cd01d2f1","abstract_canon_sha256":"a8b80da9d7586eda0559f368131028e3be78a60d3cc1156b216537ad006ba015"},"schema_version":"1.0"},"canonical_sha256":"a7cd39c97dff9e0a93c752a492df3ef6816de6ff41793394c8e099a09445c797","source":{"kind":"arxiv","id":"1609.05801","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05801","created_at":"2026-05-18T01:04:25Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05801v1","created_at":"2026-05-18T01:04:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05801","created_at":"2026-05-18T01:04:25Z"},{"alias_kind":"pith_short_12","alias_value":"U7GTTSL576PA","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"U7GTTSL576PAVE6H","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"U7GTTSL5","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:U7GTTSL576PAVE6HKKSJFXZ662","target":"record","payload":{"canonical_record":{"source":{"id":"1609.05801","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-19T15:54:13Z","cross_cats_sorted":[],"title_canon_sha256":"923032600a0ab125555760f874be4fc9cbd3a3eb96f6591fc80765a8cd01d2f1","abstract_canon_sha256":"a8b80da9d7586eda0559f368131028e3be78a60d3cc1156b216537ad006ba015"},"schema_version":"1.0"},"canonical_sha256":"a7cd39c97dff9e0a93c752a492df3ef6816de6ff41793394c8e099a09445c797","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:25.272268Z","signature_b64":"1+NfHDg7M1GWUKgtv/w5kd67QFWKqUFPOB3v/4BKB0SH8vfi3ZagLxx1a1R0bGXzD0Pl6cm6HM4aykWpFdYXCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7cd39c97dff9e0a93c752a492df3ef6816de6ff41793394c8e099a09445c797","last_reissued_at":"2026-05-18T01:04:25.271636Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:25.271636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.05801","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-18T01: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":"xIoPqU+j6dC0ibsSF2pNE5DJ5ToemrSi/XGXuwvKOVjaSgOnGIxGft6W/yLGOW4eiI21/9R+RpfNVNTGnENzCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:08:34.518519Z"},"content_sha256":"bc01ee904731f80a40d9875369483d13fde57330f93c94bf0fb2303c345c5fbb","schema_version":"1.0","event_id":"sha256:bc01ee904731f80a40d9875369483d13fde57330f93c94bf0fb2303c345c5fbb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:U7GTTSL576PAVE6HKKSJFXZ662","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asynchronous Splitting Design for Model Predictive Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Colin N. Jones, Laura Ferranti, Tamas Keviczky, Ye Pu","submitted_at":"2016-09-19T15:54:13Z","abstract_excerpt":"This paper focuses on the design of an asynchronous dual solver suitable for embedded model predictive control (MPC) applications. The proposed solver relies on a state-of-the-art variance reduction (VR) scheme, previously used in the context of stochastic proximal gradient methods, and on the alternating minimization algorithm (AMA). The resultant algorithm, a stochastic AMA with VR, shows geometric convergence (in the expectation) to a suboptimal solution of the MPC problem and, compared to other state-of-the-art dual asynchronous algorithms, allows to tune the probability of the asynchronou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05801","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-18T01: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":"Zpwvr2S1QoNsRKHBwYmYif07mFITmabvaN92fdP4v1+2LwgqcHvi1pnnC/1rjwOQhUjw0nZTdVUbxxXAHtAHDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:08:34.518860Z"},"content_sha256":"9b1398977ae14be7253c90e1f1d52bd855e0be8f78f43404c0e97a85ec69c8dd","schema_version":"1.0","event_id":"sha256:9b1398977ae14be7253c90e1f1d52bd855e0be8f78f43404c0e97a85ec69c8dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U7GTTSL576PAVE6HKKSJFXZ662/bundle.json","state_url":"https://pith.science/pith/U7GTTSL576PAVE6HKKSJFXZ662/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U7GTTSL576PAVE6HKKSJFXZ662/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-03T22:08:34Z","links":{"resolver":"https://pith.science/pith/U7GTTSL576PAVE6HKKSJFXZ662","bundle":"https://pith.science/pith/U7GTTSL576PAVE6HKKSJFXZ662/bundle.json","state":"https://pith.science/pith/U7GTTSL576PAVE6HKKSJFXZ662/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U7GTTSL576PAVE6HKKSJFXZ662/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:U7GTTSL576PAVE6HKKSJFXZ662","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":"a8b80da9d7586eda0559f368131028e3be78a60d3cc1156b216537ad006ba015","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-19T15:54:13Z","title_canon_sha256":"923032600a0ab125555760f874be4fc9cbd3a3eb96f6591fc80765a8cd01d2f1"},"schema_version":"1.0","source":{"id":"1609.05801","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05801","created_at":"2026-05-18T01:04:25Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05801v1","created_at":"2026-05-18T01:04:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05801","created_at":"2026-05-18T01:04:25Z"},{"alias_kind":"pith_short_12","alias_value":"U7GTTSL576PA","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"U7GTTSL576PAVE6H","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"U7GTTSL5","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:9b1398977ae14be7253c90e1f1d52bd855e0be8f78f43404c0e97a85ec69c8dd","target":"graph","created_at":"2026-05-18T01: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"},"paper":{"abstract_excerpt":"This paper focuses on the design of an asynchronous dual solver suitable for embedded model predictive control (MPC) applications. The proposed solver relies on a state-of-the-art variance reduction (VR) scheme, previously used in the context of stochastic proximal gradient methods, and on the alternating minimization algorithm (AMA). The resultant algorithm, a stochastic AMA with VR, shows geometric convergence (in the expectation) to a suboptimal solution of the MPC problem and, compared to other state-of-the-art dual asynchronous algorithms, allows to tune the probability of the asynchronou","authors_text":"Colin N. Jones, Laura Ferranti, Tamas Keviczky, Ye Pu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-19T15:54:13Z","title":"Asynchronous Splitting Design for Model Predictive Control"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05801","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:bc01ee904731f80a40d9875369483d13fde57330f93c94bf0fb2303c345c5fbb","target":"record","created_at":"2026-05-18T01: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":"a8b80da9d7586eda0559f368131028e3be78a60d3cc1156b216537ad006ba015","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-19T15:54:13Z","title_canon_sha256":"923032600a0ab125555760f874be4fc9cbd3a3eb96f6591fc80765a8cd01d2f1"},"schema_version":"1.0","source":{"id":"1609.05801","kind":"arxiv","version":1}},"canonical_sha256":"a7cd39c97dff9e0a93c752a492df3ef6816de6ff41793394c8e099a09445c797","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7cd39c97dff9e0a93c752a492df3ef6816de6ff41793394c8e099a09445c797","first_computed_at":"2026-05-18T01:04:25.271636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:25.271636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1+NfHDg7M1GWUKgtv/w5kd67QFWKqUFPOB3v/4BKB0SH8vfi3ZagLxx1a1R0bGXzD0Pl6cm6HM4aykWpFdYXCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:25.272268Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.05801","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc01ee904731f80a40d9875369483d13fde57330f93c94bf0fb2303c345c5fbb","sha256:9b1398977ae14be7253c90e1f1d52bd855e0be8f78f43404c0e97a85ec69c8dd"],"state_sha256":"f8dc6159328c65ed98aaf515464eec5ae4eaad16c21b9e922512568d4cb041c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SUOgYZvvYvt/+hwjhr0CgFx/ZSAnxShR51lMety3nzyuEZ8K8o3Sc7G8vvbsAhi3GfAE164d5oTFSaIDHq8lBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:08:34.520789Z","bundle_sha256":"053b8915e7a0017694be8328e52dadd6ba825ee882628d31765bfd39829e1450"}}