{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:D4LTQAYBHWIYFEI6UK5N2PADRP","short_pith_number":"pith:D4LTQAYB","canonical_record":{"source":{"id":"1312.1085","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-04T09:53:48Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"d86e6892f1b10159536f0d0aca06cd0e5b6a368b49e7346f6a29666800467c84","abstract_canon_sha256":"a990d7559abbdd0df84093ccb26596b51ea3d7b9eac508cfdbb614693fee0e87"},"schema_version":"1.0"},"canonical_sha256":"1f173803013d9182911ea2badd3c038bece4949323ef72de0e0fed370e196b50","source":{"kind":"arxiv","id":"1312.1085","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1085","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1085v3","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1085","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"pith_short_12","alias_value":"D4LTQAYBHWIY","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"D4LTQAYBHWIYFEI6","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"D4LTQAYB","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:D4LTQAYBHWIYFEI6UK5N2PADRP","target":"record","payload":{"canonical_record":{"source":{"id":"1312.1085","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-04T09:53:48Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"d86e6892f1b10159536f0d0aca06cd0e5b6a368b49e7346f6a29666800467c84","abstract_canon_sha256":"a990d7559abbdd0df84093ccb26596b51ea3d7b9eac508cfdbb614693fee0e87"},"schema_version":"1.0"},"canonical_sha256":"1f173803013d9182911ea2badd3c038bece4949323ef72de0e0fed370e196b50","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:32.399199Z","signature_b64":"wXvmoqqkTaFDfVRX2xkQDw6BtEByl9lmG0kU6eVWjRcNKgMT5gpHPEVHGYv6QREMQLEgy6j8QeMoKZnFfDsNBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f173803013d9182911ea2badd3c038bece4949323ef72de0e0fed370e196b50","last_reissued_at":"2026-05-18T02:30:32.398754Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:32.398754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.1085","source_version":3,"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:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3i0eB9VVf55bn+ZYCoWnKq+hISuK9agWGKGcl7skmE7u3TZj1wEBxtQ+TkEMpbDKZgcJDg9yKcxY63AMEfaVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:04:18.420725Z"},"content_sha256":"53bfab96a3879d51f8c8fe8b65d894a192ce5cc5ac4395cb8e99dc91b0d98933","schema_version":"1.0","event_id":"sha256:53bfab96a3879d51f8c8fe8b65d894a192ce5cc5ac4395cb8e99dc91b0d98933"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:D4LTQAYBHWIYFEI6UK5N2PADRP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Explicit Convergence Rate of a Distributed Alternating Direction Method of Multipliers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DC","authors_text":"Franck Iutzeler, Pascal Bianchi, Philippe Ciblat, Walid Hachem","submitted_at":"2013-12-04T09:53:48Z","abstract_excerpt":"Consider a set of N agents seeking to solve distributively the minimization problem $\\inf_{x} \\sum_{n = 1}^N f_n(x)$ where the convex functions $f_n$ are local to the agents. The popular Alternating Direction Method of Multipliers has the potential to handle distributed optimization problems of this kind. We provide a general reformulation of the problem and obtain a class of distributed algorithms which encompass various network architectures. The rate of convergence of our method is considered. It is assumed that the infimum of the problem is reached at a point $x_\\star$, the functions $f_n$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1085","kind":"arxiv","version":3},"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:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ENVTYuqIq/989QvIRiKxH+gGN4l35o0cR6MVMsVVgXy80AWuFSbAneH4X2TpHhd1CNblhDT/Zlr97gQJadDpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:04:18.421077Z"},"content_sha256":"88fb3eff9f627ec7db90e70a44b762ab20c2f8572eb526a6b48652fecaf10172","schema_version":"1.0","event_id":"sha256:88fb3eff9f627ec7db90e70a44b762ab20c2f8572eb526a6b48652fecaf10172"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D4LTQAYBHWIYFEI6UK5N2PADRP/bundle.json","state_url":"https://pith.science/pith/D4LTQAYBHWIYFEI6UK5N2PADRP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D4LTQAYBHWIYFEI6UK5N2PADRP/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-03T06:04:18Z","links":{"resolver":"https://pith.science/pith/D4LTQAYBHWIYFEI6UK5N2PADRP","bundle":"https://pith.science/pith/D4LTQAYBHWIYFEI6UK5N2PADRP/bundle.json","state":"https://pith.science/pith/D4LTQAYBHWIYFEI6UK5N2PADRP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D4LTQAYBHWIYFEI6UK5N2PADRP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:D4LTQAYBHWIYFEI6UK5N2PADRP","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":"a990d7559abbdd0df84093ccb26596b51ea3d7b9eac508cfdbb614693fee0e87","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-04T09:53:48Z","title_canon_sha256":"d86e6892f1b10159536f0d0aca06cd0e5b6a368b49e7346f6a29666800467c84"},"schema_version":"1.0","source":{"id":"1312.1085","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1085","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1085v3","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1085","created_at":"2026-05-18T02:30:32Z"},{"alias_kind":"pith_short_12","alias_value":"D4LTQAYBHWIY","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"D4LTQAYBHWIYFEI6","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"D4LTQAYB","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:88fb3eff9f627ec7db90e70a44b762ab20c2f8572eb526a6b48652fecaf10172","target":"graph","created_at":"2026-05-18T02:30:32Z","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":"Consider a set of N agents seeking to solve distributively the minimization problem $\\inf_{x} \\sum_{n = 1}^N f_n(x)$ where the convex functions $f_n$ are local to the agents. The popular Alternating Direction Method of Multipliers has the potential to handle distributed optimization problems of this kind. We provide a general reformulation of the problem and obtain a class of distributed algorithms which encompass various network architectures. The rate of convergence of our method is considered. It is assumed that the infimum of the problem is reached at a point $x_\\star$, the functions $f_n$","authors_text":"Franck Iutzeler, Pascal Bianchi, Philippe Ciblat, Walid Hachem","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-04T09:53:48Z","title":"Explicit Convergence Rate of a Distributed Alternating Direction Method of Multipliers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1085","kind":"arxiv","version":3},"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:53bfab96a3879d51f8c8fe8b65d894a192ce5cc5ac4395cb8e99dc91b0d98933","target":"record","created_at":"2026-05-18T02:30:32Z","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":"a990d7559abbdd0df84093ccb26596b51ea3d7b9eac508cfdbb614693fee0e87","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-04T09:53:48Z","title_canon_sha256":"d86e6892f1b10159536f0d0aca06cd0e5b6a368b49e7346f6a29666800467c84"},"schema_version":"1.0","source":{"id":"1312.1085","kind":"arxiv","version":3}},"canonical_sha256":"1f173803013d9182911ea2badd3c038bece4949323ef72de0e0fed370e196b50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f173803013d9182911ea2badd3c038bece4949323ef72de0e0fed370e196b50","first_computed_at":"2026-05-18T02:30:32.398754Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:32.398754Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wXvmoqqkTaFDfVRX2xkQDw6BtEByl9lmG0kU6eVWjRcNKgMT5gpHPEVHGYv6QREMQLEgy6j8QeMoKZnFfDsNBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:32.399199Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.1085","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:53bfab96a3879d51f8c8fe8b65d894a192ce5cc5ac4395cb8e99dc91b0d98933","sha256:88fb3eff9f627ec7db90e70a44b762ab20c2f8572eb526a6b48652fecaf10172"],"state_sha256":"01aa9c51a337a40290409ce2413d0eb3888735a5986593d9194fd7fdc3faf6e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cf/5hpEveIrD8tK+SHoxMkkImb5+YWYRwrsINJTBFb5nCcrAsk/45AXtbUE+jOr9tTZpiVx0aOsmWq+bj/qeAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:04:18.423062Z","bundle_sha256":"0227972980d4539da80c72bdead070b35fbc5df41f7751c27a0240f5aab64e1f"}}