{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:L4JNWGGAGDVCRFWCDH44PSDF2G","short_pith_number":"pith:L4JNWGGA","canonical_record":{"source":{"id":"1207.3178","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-13T09:23:01Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"6f17a3eee13ac4c7ad1ec59d4b48911dd49fc771ddab46bcc82a681c305f3961","abstract_canon_sha256":"9c0fc0cae8273fd9a393084bf7067779f40ed77f1f291cad8544e4b3a35c851c"},"schema_version":"1.0"},"canonical_sha256":"5f12db18c030ea2896c219f9c7c865d1bea50db0bc06274e20e0d00143db5889","source":{"kind":"arxiv","id":"1207.3178","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3178","created_at":"2026-05-18T02:25:10Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3178v2","created_at":"2026-05-18T02:25:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3178","created_at":"2026-05-18T02:25:10Z"},{"alias_kind":"pith_short_12","alias_value":"L4JNWGGAGDVC","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"L4JNWGGAGDVCRFWC","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"L4JNWGGA","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:L4JNWGGAGDVCRFWCDH44PSDF2G","target":"record","payload":{"canonical_record":{"source":{"id":"1207.3178","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-13T09:23:01Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"6f17a3eee13ac4c7ad1ec59d4b48911dd49fc771ddab46bcc82a681c305f3961","abstract_canon_sha256":"9c0fc0cae8273fd9a393084bf7067779f40ed77f1f291cad8544e4b3a35c851c"},"schema_version":"1.0"},"canonical_sha256":"5f12db18c030ea2896c219f9c7c865d1bea50db0bc06274e20e0d00143db5889","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:10.662476Z","signature_b64":"7sEzVPd/g8nlfINYKxcFvVP9xv5T1s1OBld9CZUjSHN/Lk60HAW1bKiQn7BVzs3juMgM89Av68hGHDO3H61gDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f12db18c030ea2896c219f9c7c865d1bea50db0bc06274e20e0d00143db5889","last_reissued_at":"2026-05-18T02:25:10.662075Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:10.662075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.3178","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:25:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VJt4akWtnyf7N8mi0+QqhNWOzGGnubKNu0A4oUTUSV+fXng+tD2ASa0CkyJX2UAyDJoPfuUzkTW64o70ERKWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:57:05.059553Z"},"content_sha256":"f461d8c3bf8ab0b6cbf0400d706a72aa03526fe772b52176e54f8dba1fb049e1","schema_version":"1.0","event_id":"sha256:f461d8c3bf8ab0b6cbf0400d706a72aa03526fe772b52176e54f8dba1fb049e1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:L4JNWGGAGDVCRFWCDH44PSDF2G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed MPC Via Dual Decomposition and Alternating Direction Method of Multipliers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Farhad Farokhi, Iman Shames, Karl H. Johansson","submitted_at":"2012-07-13T09:23:01Z","abstract_excerpt":"A conventional way to handle model predictive control (MPC) problems distributedly is to solve them via dual decomposition and gradient ascent. However, at each time-step, it might not be feasible to wait for the dual algorithm to converge. As a result, the algorithm might be needed to be terminated prematurely. One is then interested to see if the solution at the point of termination is close to the optimal solution and when one should terminate the algorithm if a certain distance to optimality is to be guaranteed. In this chapter, we look at this problem for distributed systems under general"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3178","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:25:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vhlsDfjYrA43JXFpFJ+tFNNHGYSpDHHyoq+jfnItjLg3Ylpco8qkuUmQj7kVhHbj1pivWTy2+5aa+QGpaPg3Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:57:05.059904Z"},"content_sha256":"52bc7f6a41ca3417f4989172531b5ab41d6c02f085bba972010e31f88f34ada6","schema_version":"1.0","event_id":"sha256:52bc7f6a41ca3417f4989172531b5ab41d6c02f085bba972010e31f88f34ada6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/L4JNWGGAGDVCRFWCDH44PSDF2G/bundle.json","state_url":"https://pith.science/pith/L4JNWGGAGDVCRFWCDH44PSDF2G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/L4JNWGGAGDVCRFWCDH44PSDF2G/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-02T22:57:05Z","links":{"resolver":"https://pith.science/pith/L4JNWGGAGDVCRFWCDH44PSDF2G","bundle":"https://pith.science/pith/L4JNWGGAGDVCRFWCDH44PSDF2G/bundle.json","state":"https://pith.science/pith/L4JNWGGAGDVCRFWCDH44PSDF2G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/L4JNWGGAGDVCRFWCDH44PSDF2G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:L4JNWGGAGDVCRFWCDH44PSDF2G","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":"9c0fc0cae8273fd9a393084bf7067779f40ed77f1f291cad8544e4b3a35c851c","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-13T09:23:01Z","title_canon_sha256":"6f17a3eee13ac4c7ad1ec59d4b48911dd49fc771ddab46bcc82a681c305f3961"},"schema_version":"1.0","source":{"id":"1207.3178","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.3178","created_at":"2026-05-18T02:25:10Z"},{"alias_kind":"arxiv_version","alias_value":"1207.3178v2","created_at":"2026-05-18T02:25:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.3178","created_at":"2026-05-18T02:25:10Z"},{"alias_kind":"pith_short_12","alias_value":"L4JNWGGAGDVC","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"L4JNWGGAGDVCRFWC","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"L4JNWGGA","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:52bc7f6a41ca3417f4989172531b5ab41d6c02f085bba972010e31f88f34ada6","target":"graph","created_at":"2026-05-18T02:25:10Z","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 conventional way to handle model predictive control (MPC) problems distributedly is to solve them via dual decomposition and gradient ascent. However, at each time-step, it might not be feasible to wait for the dual algorithm to converge. As a result, the algorithm might be needed to be terminated prematurely. One is then interested to see if the solution at the point of termination is close to the optimal solution and when one should terminate the algorithm if a certain distance to optimality is to be guaranteed. In this chapter, we look at this problem for distributed systems under general","authors_text":"Farhad Farokhi, Iman Shames, Karl H. Johansson","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-13T09:23:01Z","title":"Distributed MPC Via Dual Decomposition and Alternating Direction Method of Multipliers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.3178","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:f461d8c3bf8ab0b6cbf0400d706a72aa03526fe772b52176e54f8dba1fb049e1","target":"record","created_at":"2026-05-18T02:25:10Z","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":"9c0fc0cae8273fd9a393084bf7067779f40ed77f1f291cad8544e4b3a35c851c","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-07-13T09:23:01Z","title_canon_sha256":"6f17a3eee13ac4c7ad1ec59d4b48911dd49fc771ddab46bcc82a681c305f3961"},"schema_version":"1.0","source":{"id":"1207.3178","kind":"arxiv","version":2}},"canonical_sha256":"5f12db18c030ea2896c219f9c7c865d1bea50db0bc06274e20e0d00143db5889","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5f12db18c030ea2896c219f9c7c865d1bea50db0bc06274e20e0d00143db5889","first_computed_at":"2026-05-18T02:25:10.662075Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:10.662075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7sEzVPd/g8nlfINYKxcFvVP9xv5T1s1OBld9CZUjSHN/Lk60HAW1bKiQn7BVzs3juMgM89Av68hGHDO3H61gDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:10.662476Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.3178","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f461d8c3bf8ab0b6cbf0400d706a72aa03526fe772b52176e54f8dba1fb049e1","sha256:52bc7f6a41ca3417f4989172531b5ab41d6c02f085bba972010e31f88f34ada6"],"state_sha256":"791c78b14ec80dd8acd9abf6b0b2e5a2607775a4e7704b8da52b50887cf88485"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lhV2LPtMRfPiJACxw2mzfZfJLqXWM25ZkPnMTy+G6P0qK/e824TfItTzEa0ae1m9+YUwU1xJl4n3pIpCweU8AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:57:05.061844Z","bundle_sha256":"8563bbd865015277b1e40211338a24e6586a6e70f47adb1a3fe15a8dfc6bd754"}}