{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:D4LTQAYBHWIYFEI6UK5N2PADRP","short_pith_number":"pith:D4LTQAYB","schema_version":"1.0","canonical_sha256":"1f173803013d9182911ea2badd3c038bece4949323ef72de0e0fed370e196b50","source":{"kind":"arxiv","id":"1312.1085","version":3},"attestation_state":"computed","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$"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.1085","created_at":"2026-05-18T02:30:32.398822+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.1085v3","created_at":"2026-05-18T02:30:32.398822+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1085","created_at":"2026-05-18T02:30:32.398822+00:00"},{"alias_kind":"pith_short_12","alias_value":"D4LTQAYBHWIY","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"D4LTQAYBHWIYFEI6","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"D4LTQAYB","created_at":"2026-05-18T12:27:40.988391+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D4LTQAYBHWIYFEI6UK5N2PADRP","json":"https://pith.science/pith/D4LTQAYBHWIYFEI6UK5N2PADRP.json","graph_json":"https://pith.science/api/pith-number/D4LTQAYBHWIYFEI6UK5N2PADRP/graph.json","events_json":"https://pith.science/api/pith-number/D4LTQAYBHWIYFEI6UK5N2PADRP/events.json","paper":"https://pith.science/paper/D4LTQAYB"},"agent_actions":{"view_html":"https://pith.science/pith/D4LTQAYBHWIYFEI6UK5N2PADRP","download_json":"https://pith.science/pith/D4LTQAYBHWIYFEI6UK5N2PADRP.json","view_paper":"https://pith.science/paper/D4LTQAYB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.1085&json=true","fetch_graph":"https://pith.science/api/pith-number/D4LTQAYBHWIYFEI6UK5N2PADRP/graph.json","fetch_events":"https://pith.science/api/pith-number/D4LTQAYBHWIYFEI6UK5N2PADRP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D4LTQAYBHWIYFEI6UK5N2PADRP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D4LTQAYBHWIYFEI6UK5N2PADRP/action/storage_attestation","attest_author":"https://pith.science/pith/D4LTQAYBHWIYFEI6UK5N2PADRP/action/author_attestation","sign_citation":"https://pith.science/pith/D4LTQAYBHWIYFEI6UK5N2PADRP/action/citation_signature","submit_replication":"https://pith.science/pith/D4LTQAYBHWIYFEI6UK5N2PADRP/action/replication_record"}},"created_at":"2026-05-18T02:30:32.398822+00:00","updated_at":"2026-05-18T02:30:32.398822+00:00"}