{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:MLE733QQFHBDSDTUXKWTCMZ3T5","short_pith_number":"pith:MLE733QQ","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"},"canonical_sha256":"62c9fdee1029c2390e74baad31333b9f484f406b817911cd147f3a5d59256334","source":{"kind":"arxiv","id":"1512.08122","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.08122","created_at":"2026-05-18T00:53:40Z"},{"alias_kind":"arxiv_version","alias_value":"1512.08122v4","created_at":"2026-05-18T00:53:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08122","created_at":"2026-05-18T00:53:40Z"},{"alias_kind":"pith_short_12","alias_value":"MLE733QQFHBD","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MLE733QQFHBDSDTU","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MLE733QQ","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:MLE733QQFHBDSDTUXKWTCMZ3T5","target":"record","payload":{"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"},"canonical_sha256":"62c9fdee1029c2390e74baad31333b9f484f406b817911cd147f3a5d59256334","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"},"source_kind":"arxiv","source_id":"1512.08122","source_version":4,"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-18T00:53:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WGyhSu8TdvgZw2h3IQBTuX2JHMs2RWJ4URSGcPbieDZTIHMB/HFUEfW+RGvIOQngl/RxbyEVeIcsgaoKrPzJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T18:17:51.181377Z"},"content_sha256":"d7f2b7a45c34a05b17caef7a217f15a606d24f8384243f91e8f9fcd29b8d6b0a","schema_version":"1.0","event_id":"sha256:d7f2b7a45c34a05b17caef7a217f15a606d24f8384243f91e8f9fcd29b8d6b0a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:MLE733QQFHBDSDTUXKWTCMZ3T5","target":"graph","payload":{"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"},"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-18T00:53:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tDtCBi1mU2aNindSP+687QrmYngAKldW2CC0MirbHgmRH9nGA/TxtrybfOd/8SE2kwsWo67vNs5hnxDGASYUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T18:17:51.181742Z"},"content_sha256":"e3d4e35946b454769697ec1a36b4560d92fe06b572cce291f2eb61571a87363a","schema_version":"1.0","event_id":"sha256:e3d4e35946b454769697ec1a36b4560d92fe06b572cce291f2eb61571a87363a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MLE733QQFHBDSDTUXKWTCMZ3T5/bundle.json","state_url":"https://pith.science/pith/MLE733QQFHBDSDTUXKWTCMZ3T5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MLE733QQFHBDSDTUXKWTCMZ3T5/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-05-22T18:17:51Z","links":{"resolver":"https://pith.science/pith/MLE733QQFHBDSDTUXKWTCMZ3T5","bundle":"https://pith.science/pith/MLE733QQFHBDSDTUXKWTCMZ3T5/bundle.json","state":"https://pith.science/pith/MLE733QQFHBDSDTUXKWTCMZ3T5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MLE733QQFHBDSDTUXKWTCMZ3T5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:MLE733QQFHBDSDTUXKWTCMZ3T5","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":"ef0381e92198258794578dfe0134b4ce44380e7eed624a16997d5e222878f602","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-26T16:15:30Z","title_canon_sha256":"330eea1ecf9a2ebb98eca92d904d48b71a4621dc2ed5bf9a7ad4fab028b2f65c"},"schema_version":"1.0","source":{"id":"1512.08122","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.08122","created_at":"2026-05-18T00:53:40Z"},{"alias_kind":"arxiv_version","alias_value":"1512.08122v4","created_at":"2026-05-18T00:53:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08122","created_at":"2026-05-18T00:53:40Z"},{"alias_kind":"pith_short_12","alias_value":"MLE733QQFHBD","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"MLE733QQFHBDSDTU","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"MLE733QQ","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:e3d4e35946b454769697ec1a36b4560d92fe06b572cce291f2eb61571a87363a","target":"graph","created_at":"2026-05-18T00:53:40Z","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":"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 ","authors_text":"Necdet Serhat Aybat, Shiqian Ma, Tianyi Lin, Zi Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-26T16:15:30Z","title":"Distributed Linearized Alternating Direction Method of Multipliers for Composite Convex Consensus Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.08122","kind":"arxiv","version":4},"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:d7f2b7a45c34a05b17caef7a217f15a606d24f8384243f91e8f9fcd29b8d6b0a","target":"record","created_at":"2026-05-18T00:53:40Z","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":"ef0381e92198258794578dfe0134b4ce44380e7eed624a16997d5e222878f602","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-12-26T16:15:30Z","title_canon_sha256":"330eea1ecf9a2ebb98eca92d904d48b71a4621dc2ed5bf9a7ad4fab028b2f65c"},"schema_version":"1.0","source":{"id":"1512.08122","kind":"arxiv","version":4}},"canonical_sha256":"62c9fdee1029c2390e74baad31333b9f484f406b817911cd147f3a5d59256334","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62c9fdee1029c2390e74baad31333b9f484f406b817911cd147f3a5d59256334","first_computed_at":"2026-05-18T00:53:40.439362Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:40.439362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IjVq+SjR3lHBOCiBuzeBQ3hc/xup+RlGEK2aoco9pTl6uNC7E7JT6Z5gJsAjTCyv+IyhliDtFi3tSxG5vcjgBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:40.439763Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.08122","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7f2b7a45c34a05b17caef7a217f15a606d24f8384243f91e8f9fcd29b8d6b0a","sha256:e3d4e35946b454769697ec1a36b4560d92fe06b572cce291f2eb61571a87363a"],"state_sha256":"1f8e632e41bb9525a9e640410bfb98ac146acfa5026e37992510968b3d5c0d7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8hqFYwXz8wuJuWG3ekMI2I8G1ouRLQRc7Ako3eWKLSEnGqvFCBc+y0oPmwzg5XUkNwvbmo0Kgt2RWjf/I0knCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T18:17:51.183641Z","bundle_sha256":"9c6c43f6866bfa82b10dfb65c04f43c4591d5e30b1621261c4bffa240da16c9e"}}