{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:QSXC5XZX4JVSPIWBGONYDF3ZIR","short_pith_number":"pith:QSXC5XZX","schema_version":"1.0","canonical_sha256":"84ae2edf37e26b27a2c1339b8197794468396bb8e21cf71659901dc81a420e91","source":{"kind":"arxiv","id":"1202.2805","version":2},"attestation_state":"computed","paper":{"title":"D-ADMM: A Communication-Efficient Distributed Algorithm For Separable Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jo\\~ao F. C. Mota, Jo\\~ao M. F. Xavier, Markus P\\\"uschel, Pedro M. Q. Aguiar","submitted_at":"2012-02-13T18:01:59Z","abstract_excerpt":"We propose a distributed algorithm, named Distributed Alternating Direction Method of Multipliers (D-ADMM), for solving separable optimization problems in networks of interconnected nodes or agents. In a separable optimization problem there is a private cost function and a private constraint set at each node. The goal is to minimize the sum of all the cost functions, constraining the solution to be in the intersection of all the constraint sets. D-ADMM is proven to converge when the network is bipartite or when all the functions are strongly convex, although in practice, convergence is observe"},"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":"1202.2805","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-02-13T18:01:59Z","cross_cats_sorted":[],"title_canon_sha256":"81750094a323319c1a420a60caaa35e53fec458a23d506e72d429afb400fc610","abstract_canon_sha256":"f28f591052955a36e330efcbf3d090832f13850f5fe74fde915d5e7b1845732c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:11.519684Z","signature_b64":"I/3JcNUbNnohRKZrKt3aftq3YtpVB9Fvsijvh+AJqsqkTWdKA+wlNUMI4LltHTNjPTjQyV/me6JEyHKGMzx5CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84ae2edf37e26b27a2c1339b8197794468396bb8e21cf71659901dc81a420e91","last_reissued_at":"2026-05-18T03:27:11.519087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:11.519087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"D-ADMM: A Communication-Efficient Distributed Algorithm For Separable Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jo\\~ao F. C. Mota, Jo\\~ao M. F. Xavier, Markus P\\\"uschel, Pedro M. Q. Aguiar","submitted_at":"2012-02-13T18:01:59Z","abstract_excerpt":"We propose a distributed algorithm, named Distributed Alternating Direction Method of Multipliers (D-ADMM), for solving separable optimization problems in networks of interconnected nodes or agents. In a separable optimization problem there is a private cost function and a private constraint set at each node. The goal is to minimize the sum of all the cost functions, constraining the solution to be in the intersection of all the constraint sets. D-ADMM is proven to converge when the network is bipartite or when all the functions are strongly convex, although in practice, convergence is observe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2805","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":"1202.2805","created_at":"2026-05-18T03:27:11.519185+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.2805v2","created_at":"2026-05-18T03:27:11.519185+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2805","created_at":"2026-05-18T03:27:11.519185+00:00"},{"alias_kind":"pith_short_12","alias_value":"QSXC5XZX4JVS","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"QSXC5XZX4JVSPIWB","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"QSXC5XZX","created_at":"2026-05-18T12:27:18.751474+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/QSXC5XZX4JVSPIWBGONYDF3ZIR","json":"https://pith.science/pith/QSXC5XZX4JVSPIWBGONYDF3ZIR.json","graph_json":"https://pith.science/api/pith-number/QSXC5XZX4JVSPIWBGONYDF3ZIR/graph.json","events_json":"https://pith.science/api/pith-number/QSXC5XZX4JVSPIWBGONYDF3ZIR/events.json","paper":"https://pith.science/paper/QSXC5XZX"},"agent_actions":{"view_html":"https://pith.science/pith/QSXC5XZX4JVSPIWBGONYDF3ZIR","download_json":"https://pith.science/pith/QSXC5XZX4JVSPIWBGONYDF3ZIR.json","view_paper":"https://pith.science/paper/QSXC5XZX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.2805&json=true","fetch_graph":"https://pith.science/api/pith-number/QSXC5XZX4JVSPIWBGONYDF3ZIR/graph.json","fetch_events":"https://pith.science/api/pith-number/QSXC5XZX4JVSPIWBGONYDF3ZIR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QSXC5XZX4JVSPIWBGONYDF3ZIR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QSXC5XZX4JVSPIWBGONYDF3ZIR/action/storage_attestation","attest_author":"https://pith.science/pith/QSXC5XZX4JVSPIWBGONYDF3ZIR/action/author_attestation","sign_citation":"https://pith.science/pith/QSXC5XZX4JVSPIWBGONYDF3ZIR/action/citation_signature","submit_replication":"https://pith.science/pith/QSXC5XZX4JVSPIWBGONYDF3ZIR/action/replication_record"}},"created_at":"2026-05-18T03:27:11.519185+00:00","updated_at":"2026-05-18T03:27:11.519185+00:00"}