{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VZHTK65NXONVH6JT35N4Q7EV46","short_pith_number":"pith:VZHTK65N","canonical_record":{"source":{"id":"1605.01986","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-06T16:06:01Z","cross_cats_sorted":[],"title_canon_sha256":"3c521e4ddfd35becb69c186794f6b131fe8166b43150251a7141d856bc5d5692","abstract_canon_sha256":"b623979032c5987f809d448dbfb0aff8e74e8af03f05b598bb95ce62f9b6a0ad"},"schema_version":"1.0"},"canonical_sha256":"ae4f357badbb9b53f933df5bc87c95e7a9d8d51a430478f0a762b749b9ab5665","source":{"kind":"arxiv","id":"1605.01986","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01986","created_at":"2026-05-18T00:48:54Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01986v3","created_at":"2026-05-18T00:48:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01986","created_at":"2026-05-18T00:48:54Z"},{"alias_kind":"pith_short_12","alias_value":"VZHTK65NXONV","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VZHTK65NXONVH6JT","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VZHTK65N","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VZHTK65NXONVH6JT35N4Q7EV46","target":"record","payload":{"canonical_record":{"source":{"id":"1605.01986","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-06T16:06:01Z","cross_cats_sorted":[],"title_canon_sha256":"3c521e4ddfd35becb69c186794f6b131fe8166b43150251a7141d856bc5d5692","abstract_canon_sha256":"b623979032c5987f809d448dbfb0aff8e74e8af03f05b598bb95ce62f9b6a0ad"},"schema_version":"1.0"},"canonical_sha256":"ae4f357badbb9b53f933df5bc87c95e7a9d8d51a430478f0a762b749b9ab5665","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:54.583133Z","signature_b64":"CduCnDYLMVcAxftXV9MzQ3yis2jrBqjOuv1iu94aXUl/A1aj+Cqi1iarPEkD8qBvqZivznK8OQqclcVxu5b/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae4f357badbb9b53f933df5bc87c95e7a9d8d51a430478f0a762b749b9ab5665","last_reissued_at":"2026-05-18T00:48:54.582406Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:54.582406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.01986","source_version":3,"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:48:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UmRehH2g/o3Cwb7WRmmqhHeZAy+ZSOdzj5UhOx+1NKjCLd9rv1nP+kfHfKt7C3spDca+M4WBzR/iv43s0YuWBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:40:25.253768Z"},"content_sha256":"1a8e6ebc6caf578b4e14a6d9eb701ee3831640eb95c95c8da74fb926084d7ccb","schema_version":"1.0","event_id":"sha256:1a8e6ebc6caf578b4e14a6d9eb701ee3831640eb95c95c8da74fb926084d7ccb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VZHTK65NXONVH6JT35N4Q7EV46","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Primal-Dual Proximal Algorithm for Distributed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Lorenzo Stella, Panagiotis Patrinos, Puya Latafat","submitted_at":"2016-05-06T16:06:01Z","abstract_excerpt":"We consider a network of agents, each with its own private cost consisting of the sum of two possibly nonsmooth convex functions, one of which is composed with a linear operator. At every iteration each agent performs local calculations and can only communicate with its neighbors. The goal is to minimize the aggregate of the private cost functions and reach a consensus over a graph. We propose a primal-dual algorithm based on \\emph{Asymmetric Forward-Backward-Adjoint} (AFBA), a new operator splitting technique introduced recently by two of the authors. Our algorithm includes the method of Cham"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01986","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"},"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:48:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GhpIAcob+N0tacfccmtX0qBS+PhmQBJzFdnbqqupUmXodVyUDc0vJuvCF1oW125rnePdY9Y7VPSxrHp6fD1iAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T16:40:25.254440Z"},"content_sha256":"b3442e1d0137cf3d8267ec4dc7d97911543825046972a3f7828e545647e79a15","schema_version":"1.0","event_id":"sha256:b3442e1d0137cf3d8267ec4dc7d97911543825046972a3f7828e545647e79a15"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VZHTK65NXONVH6JT35N4Q7EV46/bundle.json","state_url":"https://pith.science/pith/VZHTK65NXONVH6JT35N4Q7EV46/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VZHTK65NXONVH6JT35N4Q7EV46/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-26T16:40:25Z","links":{"resolver":"https://pith.science/pith/VZHTK65NXONVH6JT35N4Q7EV46","bundle":"https://pith.science/pith/VZHTK65NXONVH6JT35N4Q7EV46/bundle.json","state":"https://pith.science/pith/VZHTK65NXONVH6JT35N4Q7EV46/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VZHTK65NXONVH6JT35N4Q7EV46/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VZHTK65NXONVH6JT35N4Q7EV46","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":"b623979032c5987f809d448dbfb0aff8e74e8af03f05b598bb95ce62f9b6a0ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-06T16:06:01Z","title_canon_sha256":"3c521e4ddfd35becb69c186794f6b131fe8166b43150251a7141d856bc5d5692"},"schema_version":"1.0","source":{"id":"1605.01986","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01986","created_at":"2026-05-18T00:48:54Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01986v3","created_at":"2026-05-18T00:48:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01986","created_at":"2026-05-18T00:48:54Z"},{"alias_kind":"pith_short_12","alias_value":"VZHTK65NXONV","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VZHTK65NXONVH6JT","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VZHTK65N","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:b3442e1d0137cf3d8267ec4dc7d97911543825046972a3f7828e545647e79a15","target":"graph","created_at":"2026-05-18T00:48:54Z","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":"We consider a network of agents, each with its own private cost consisting of the sum of two possibly nonsmooth convex functions, one of which is composed with a linear operator. At every iteration each agent performs local calculations and can only communicate with its neighbors. The goal is to minimize the aggregate of the private cost functions and reach a consensus over a graph. We propose a primal-dual algorithm based on \\emph{Asymmetric Forward-Backward-Adjoint} (AFBA), a new operator splitting technique introduced recently by two of the authors. Our algorithm includes the method of Cham","authors_text":"Lorenzo Stella, Panagiotis Patrinos, Puya Latafat","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-06T16:06:01Z","title":"New Primal-Dual Proximal Algorithm for Distributed Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01986","kind":"arxiv","version":3},"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:1a8e6ebc6caf578b4e14a6d9eb701ee3831640eb95c95c8da74fb926084d7ccb","target":"record","created_at":"2026-05-18T00:48:54Z","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":"b623979032c5987f809d448dbfb0aff8e74e8af03f05b598bb95ce62f9b6a0ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-06T16:06:01Z","title_canon_sha256":"3c521e4ddfd35becb69c186794f6b131fe8166b43150251a7141d856bc5d5692"},"schema_version":"1.0","source":{"id":"1605.01986","kind":"arxiv","version":3}},"canonical_sha256":"ae4f357badbb9b53f933df5bc87c95e7a9d8d51a430478f0a762b749b9ab5665","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae4f357badbb9b53f933df5bc87c95e7a9d8d51a430478f0a762b749b9ab5665","first_computed_at":"2026-05-18T00:48:54.582406Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:54.582406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CduCnDYLMVcAxftXV9MzQ3yis2jrBqjOuv1iu94aXUl/A1aj+Cqi1iarPEkD8qBvqZivznK8OQqclcVxu5b/Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:54.583133Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.01986","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a8e6ebc6caf578b4e14a6d9eb701ee3831640eb95c95c8da74fb926084d7ccb","sha256:b3442e1d0137cf3d8267ec4dc7d97911543825046972a3f7828e545647e79a15"],"state_sha256":"ab0454fd04e664cc5426190f639714c1bee716506ac357ef6b9c17c17feeb2f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zMEHYTKOme3rPTxIAqx9uflSUkiIMa6g93uFNCw06ezkF84jjH/xEffBt6OPBSsfLfF/RxhX42DlU+zY4XiiDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T16:40:25.257391Z","bundle_sha256":"35af78ae8c948c1783b10e85aed3af2be4d2d33fa039222c8beff0e535e91c0d"}}