{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2A6WDM4LKCFUOV3OIT77ZM2JEM","short_pith_number":"pith:2A6WDM4L","schema_version":"1.0","canonical_sha256":"d03d61b38b508b47576e44fffcb349233fa7106d6c09171b18d8d1067d7474be","source":{"kind":"arxiv","id":"1312.3040","version":2},"attestation_state":"computed","paper":{"title":"Parallel Multi-Block ADMM with o(1/k) Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ming-Jun Lai, Wei Deng, Wotao Yin, Zhimin Peng","submitted_at":"2013-12-11T05:59:09Z","abstract_excerpt":"This paper introduces a parallel and distributed extension to the alternating direction method of multipliers (ADMM) for solving convex problem: minimize $\\sum_{i=1}^N f_i(x_i)$ subject to $\\sum_{i=1}^N A_i x_i=c, x_i\\in \\mathcal{X}_i$. The algorithm decomposes the original problem into N smaller subproblems and solves them in parallel at each iteration. This Jacobian-type algorithm is well suited for distributed computing and is particularly attractive for solving certain large-scale problems.\n  This paper introduces a few novel results. Firstly, it shows that extending ADMM straightforwardly"},"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.3040","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-11T05:59:09Z","cross_cats_sorted":[],"title_canon_sha256":"88e6feb709b5220e8bb1dfacde59cebc3a75e0bd08269f4de9e1b26f88c5cbc8","abstract_canon_sha256":"d410d8077e5eefae024d730f22ae0375ba9dd8bd4942e22cdbfd8960b945383c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:04.990054Z","signature_b64":"BE4BffBrZYtiWMsXgyeKdqb+amM74O8HBK/8/k7htwR1o70yWAlkimuvnCJJmLep7iMmPD8x5rqOTqkLvTgJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d03d61b38b508b47576e44fffcb349233fa7106d6c09171b18d8d1067d7474be","last_reissued_at":"2026-05-18T02:56:04.989620Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:04.989620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Multi-Block ADMM with o(1/k) Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ming-Jun Lai, Wei Deng, Wotao Yin, Zhimin Peng","submitted_at":"2013-12-11T05:59:09Z","abstract_excerpt":"This paper introduces a parallel and distributed extension to the alternating direction method of multipliers (ADMM) for solving convex problem: minimize $\\sum_{i=1}^N f_i(x_i)$ subject to $\\sum_{i=1}^N A_i x_i=c, x_i\\in \\mathcal{X}_i$. The algorithm decomposes the original problem into N smaller subproblems and solves them in parallel at each iteration. This Jacobian-type algorithm is well suited for distributed computing and is particularly attractive for solving certain large-scale problems.\n  This paper introduces a few novel results. Firstly, it shows that extending ADMM straightforwardly"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3040","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.3040","created_at":"2026-05-18T02:56:04.989679+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.3040v2","created_at":"2026-05-18T02:56:04.989679+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3040","created_at":"2026-05-18T02:56:04.989679+00:00"},{"alias_kind":"pith_short_12","alias_value":"2A6WDM4LKCFU","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_16","alias_value":"2A6WDM4LKCFUOV3O","created_at":"2026-05-18T12:27:30.460161+00:00"},{"alias_kind":"pith_short_8","alias_value":"2A6WDM4L","created_at":"2026-05-18T12:27:30.460161+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.06227","citing_title":"Designing Unimodular Sequences with Optimized Auto/cross-correlation Properties via Consensus-ADMM/PDMM Approaches","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2A6WDM4LKCFUOV3OIT77ZM2JEM","json":"https://pith.science/pith/2A6WDM4LKCFUOV3OIT77ZM2JEM.json","graph_json":"https://pith.science/api/pith-number/2A6WDM4LKCFUOV3OIT77ZM2JEM/graph.json","events_json":"https://pith.science/api/pith-number/2A6WDM4LKCFUOV3OIT77ZM2JEM/events.json","paper":"https://pith.science/paper/2A6WDM4L"},"agent_actions":{"view_html":"https://pith.science/pith/2A6WDM4LKCFUOV3OIT77ZM2JEM","download_json":"https://pith.science/pith/2A6WDM4LKCFUOV3OIT77ZM2JEM.json","view_paper":"https://pith.science/paper/2A6WDM4L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.3040&json=true","fetch_graph":"https://pith.science/api/pith-number/2A6WDM4LKCFUOV3OIT77ZM2JEM/graph.json","fetch_events":"https://pith.science/api/pith-number/2A6WDM4LKCFUOV3OIT77ZM2JEM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2A6WDM4LKCFUOV3OIT77ZM2JEM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2A6WDM4LKCFUOV3OIT77ZM2JEM/action/storage_attestation","attest_author":"https://pith.science/pith/2A6WDM4LKCFUOV3OIT77ZM2JEM/action/author_attestation","sign_citation":"https://pith.science/pith/2A6WDM4LKCFUOV3OIT77ZM2JEM/action/citation_signature","submit_replication":"https://pith.science/pith/2A6WDM4LKCFUOV3OIT77ZM2JEM/action/replication_record"}},"created_at":"2026-05-18T02:56:04.989679+00:00","updated_at":"2026-05-18T02:56:04.989679+00:00"}