{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:MLE733QQFHBDSDTUXKWTCMZ3T5","short_pith_number":"pith:MLE733QQ","schema_version":"1.0","canonical_sha256":"62c9fdee1029c2390e74baad31333b9f484f406b817911cd147f3a5d59256334","source":{"kind":"arxiv","id":"1512.08122","version":4},"attestation_state":"computed","paper":{"title":"Distributed Linearized Alternating Direction Method of Multipliers for Composite Convex Consensus Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Necdet Serhat Aybat, Shiqian Ma, Tianyi Lin, Zi Wang","submitted_at":"2015-12-26T16:15:30Z","abstract_excerpt":"Given an undirected graph $\\mathcal{G}=(\\mathcal{N},\\mathcal{E})$ of agents $\\mathcal{N}=\\{1,\\ldots,N\\}$ connected with edges in $\\mathcal{E}$, we study how to compute an optimal decision on which there is consensus among agents and that minimizes the sum of agent-specific private convex composite functions $\\{\\Phi_i\\}_{i\\in\\mathcal{N}}$ while respecting privacy requirements, where $\\Phi_i\\triangleq \\xi_i + f_i$ belongs to agent-$i$. Assuming only agents connected by an edge can communicate, we propose a distributed proximal gradient method DPGA for consensus optimization over both unweighted "},"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":"1512.08122","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-26T16:15:30Z","cross_cats_sorted":[],"title_canon_sha256":"330eea1ecf9a2ebb98eca92d904d48b71a4621dc2ed5bf9a7ad4fab028b2f65c","abstract_canon_sha256":"ef0381e92198258794578dfe0134b4ce44380e7eed624a16997d5e222878f602"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:40.439763Z","signature_b64":"IjVq+SjR3lHBOCiBuzeBQ3hc/xup+RlGEK2aoco9pTl6uNC7E7JT6Z5gJsAjTCyv+IyhliDtFi3tSxG5vcjgBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62c9fdee1029c2390e74baad31333b9f484f406b817911cd147f3a5d59256334","last_reissued_at":"2026-05-18T00:53:40.439362Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:40.439362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Linearized Alternating Direction Method of Multipliers for Composite Convex Consensus Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Necdet Serhat Aybat, Shiqian Ma, Tianyi Lin, Zi Wang","submitted_at":"2015-12-26T16:15:30Z","abstract_excerpt":"Given an undirected graph $\\mathcal{G}=(\\mathcal{N},\\mathcal{E})$ of agents $\\mathcal{N}=\\{1,\\ldots,N\\}$ connected with edges in $\\mathcal{E}$, we study how to compute an optimal decision on which there is consensus among agents and that minimizes the sum of agent-specific private convex composite functions $\\{\\Phi_i\\}_{i\\in\\mathcal{N}}$ while respecting privacy requirements, where $\\Phi_i\\triangleq \\xi_i + f_i$ belongs to agent-$i$. Assuming only agents connected by an edge can communicate, we propose a distributed proximal gradient method DPGA for consensus optimization over both unweighted "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.08122","kind":"arxiv","version":4},"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":"1512.08122","created_at":"2026-05-18T00:53:40.439423+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.08122v4","created_at":"2026-05-18T00:53:40.439423+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08122","created_at":"2026-05-18T00:53:40.439423+00:00"},{"alias_kind":"pith_short_12","alias_value":"MLE733QQFHBD","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"MLE733QQFHBDSDTU","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"MLE733QQ","created_at":"2026-05-18T12:29:32.376354+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/MLE733QQFHBDSDTUXKWTCMZ3T5","json":"https://pith.science/pith/MLE733QQFHBDSDTUXKWTCMZ3T5.json","graph_json":"https://pith.science/api/pith-number/MLE733QQFHBDSDTUXKWTCMZ3T5/graph.json","events_json":"https://pith.science/api/pith-number/MLE733QQFHBDSDTUXKWTCMZ3T5/events.json","paper":"https://pith.science/paper/MLE733QQ"},"agent_actions":{"view_html":"https://pith.science/pith/MLE733QQFHBDSDTUXKWTCMZ3T5","download_json":"https://pith.science/pith/MLE733QQFHBDSDTUXKWTCMZ3T5.json","view_paper":"https://pith.science/paper/MLE733QQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.08122&json=true","fetch_graph":"https://pith.science/api/pith-number/MLE733QQFHBDSDTUXKWTCMZ3T5/graph.json","fetch_events":"https://pith.science/api/pith-number/MLE733QQFHBDSDTUXKWTCMZ3T5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MLE733QQFHBDSDTUXKWTCMZ3T5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MLE733QQFHBDSDTUXKWTCMZ3T5/action/storage_attestation","attest_author":"https://pith.science/pith/MLE733QQFHBDSDTUXKWTCMZ3T5/action/author_attestation","sign_citation":"https://pith.science/pith/MLE733QQFHBDSDTUXKWTCMZ3T5/action/citation_signature","submit_replication":"https://pith.science/pith/MLE733QQFHBDSDTUXKWTCMZ3T5/action/replication_record"}},"created_at":"2026-05-18T00:53:40.439423+00:00","updated_at":"2026-05-18T00:53:40.439423+00:00"}