{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:Y2Q3M7AKGSCU3MDVKQ33GXH23N","short_pith_number":"pith:Y2Q3M7AK","canonical_record":{"source":{"id":"1409.8547","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-30T13:50:22Z","cross_cats_sorted":[],"title_canon_sha256":"3434c17ab6d12fa962b6d530e5fd3671bdefb3d4c061a78ca1e5dc38a6b981bb","abstract_canon_sha256":"8c551f610ffb3eddfb90b3fdd1b9df1fa4f64608e443a355bda7fc57bed72c22"},"schema_version":"1.0"},"canonical_sha256":"c6a1b67c0a34854db0755437b35cfadb7f4d5c4ee85eac481995577a239d5330","source":{"kind":"arxiv","id":"1409.8547","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.8547","created_at":"2026-05-18T02:16:20Z"},{"alias_kind":"arxiv_version","alias_value":"1409.8547v2","created_at":"2026-05-18T02:16:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8547","created_at":"2026-05-18T02:16:20Z"},{"alias_kind":"pith_short_12","alias_value":"Y2Q3M7AKGSCU","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"Y2Q3M7AKGSCU3MDV","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"Y2Q3M7AK","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:Y2Q3M7AKGSCU3MDVKQ33GXH23N","target":"record","payload":{"canonical_record":{"source":{"id":"1409.8547","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-30T13:50:22Z","cross_cats_sorted":[],"title_canon_sha256":"3434c17ab6d12fa962b6d530e5fd3671bdefb3d4c061a78ca1e5dc38a6b981bb","abstract_canon_sha256":"8c551f610ffb3eddfb90b3fdd1b9df1fa4f64608e443a355bda7fc57bed72c22"},"schema_version":"1.0"},"canonical_sha256":"c6a1b67c0a34854db0755437b35cfadb7f4d5c4ee85eac481995577a239d5330","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:20.827148Z","signature_b64":"caSvrBNyAezWrRYQGqe1ByzEW6GjluD8Mkvff+1knF4F2YqGE1M9j4vrIHN+S5yep7vLeKVAUIxXQTqPfHnPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6a1b67c0a34854db0755437b35cfadb7f4d5c4ee85eac481995577a239d5330","last_reissued_at":"2026-05-18T02:16:20.826543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:20.826543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.8547","source_version":2,"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-18T02:16:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yputK+OwzP4hpM94olbREprp4w2ZlJua8ns3ke9xCvT7GQum/GvFrjS51L8MLfBFgoJuCO9IcVABduwjSN08Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:56:29.031235Z"},"content_sha256":"c448d6c5b53193102a13bd1f62cba2dd842bec3c2d23f22ef14e705e8fab9910","schema_version":"1.0","event_id":"sha256:c448d6c5b53193102a13bd1f62cba2dd842bec3c2d23f22ef14e705e8fab9910"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:Y2Q3M7AKGSCU3MDVKQ33GXH23N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Asynchronous Distributed Proximal Gradient Method for Composite Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Garud Iyengar, Necdet Serhat Aybat, Zi Wang","submitted_at":"2014-09-30T13:50:22Z","abstract_excerpt":"We propose a distributed first-order augmented Lagrangian (DFAL) algorithm to minimize the sum of composite convex functions, where each term in the sum is a private cost function belonging to a node, and only nodes connected by an edge can directly communicate with each other. This optimization model abstracts a number of applications in distributed sensing and machine learning. We show that any limit point of DFAL iterates is optimal; and for any $\\epsilon>0$, an $\\epsilon$-optimal and $\\epsilon$-feasible solution can be computed within $\\mathcal{O}(\\log(\\epsilon^{-1}))$ DFAL iterations, whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8547","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"},"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-18T02:16:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vJXlpbB1SCh8SXhEbdKEjUjgMlVWCT+ZsjFCFiAURwsfh0J6Z/+4WoRNUFM6DAvjuJiH8kT1T2zTYVTjv5LVAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T17:56:29.031595Z"},"content_sha256":"d85d5679e427a86b04698311d202d382165b337a43e9906158ba514e0a6d1da5","schema_version":"1.0","event_id":"sha256:d85d5679e427a86b04698311d202d382165b337a43e9906158ba514e0a6d1da5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y2Q3M7AKGSCU3MDVKQ33GXH23N/bundle.json","state_url":"https://pith.science/pith/Y2Q3M7AKGSCU3MDVKQ33GXH23N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y2Q3M7AKGSCU3MDVKQ33GXH23N/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-28T17:56:29Z","links":{"resolver":"https://pith.science/pith/Y2Q3M7AKGSCU3MDVKQ33GXH23N","bundle":"https://pith.science/pith/Y2Q3M7AKGSCU3MDVKQ33GXH23N/bundle.json","state":"https://pith.science/pith/Y2Q3M7AKGSCU3MDVKQ33GXH23N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y2Q3M7AKGSCU3MDVKQ33GXH23N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:Y2Q3M7AKGSCU3MDVKQ33GXH23N","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":"8c551f610ffb3eddfb90b3fdd1b9df1fa4f64608e443a355bda7fc57bed72c22","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-30T13:50:22Z","title_canon_sha256":"3434c17ab6d12fa962b6d530e5fd3671bdefb3d4c061a78ca1e5dc38a6b981bb"},"schema_version":"1.0","source":{"id":"1409.8547","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.8547","created_at":"2026-05-18T02:16:20Z"},{"alias_kind":"arxiv_version","alias_value":"1409.8547v2","created_at":"2026-05-18T02:16:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8547","created_at":"2026-05-18T02:16:20Z"},{"alias_kind":"pith_short_12","alias_value":"Y2Q3M7AKGSCU","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"Y2Q3M7AKGSCU3MDV","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"Y2Q3M7AK","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:d85d5679e427a86b04698311d202d382165b337a43e9906158ba514e0a6d1da5","target":"graph","created_at":"2026-05-18T02:16:20Z","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 propose a distributed first-order augmented Lagrangian (DFAL) algorithm to minimize the sum of composite convex functions, where each term in the sum is a private cost function belonging to a node, and only nodes connected by an edge can directly communicate with each other. This optimization model abstracts a number of applications in distributed sensing and machine learning. We show that any limit point of DFAL iterates is optimal; and for any $\\epsilon>0$, an $\\epsilon$-optimal and $\\epsilon$-feasible solution can be computed within $\\mathcal{O}(\\log(\\epsilon^{-1}))$ DFAL iterations, whi","authors_text":"Garud Iyengar, Necdet Serhat Aybat, Zi Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-30T13:50:22Z","title":"An Asynchronous Distributed Proximal Gradient Method for Composite Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8547","kind":"arxiv","version":2},"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:c448d6c5b53193102a13bd1f62cba2dd842bec3c2d23f22ef14e705e8fab9910","target":"record","created_at":"2026-05-18T02:16:20Z","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":"8c551f610ffb3eddfb90b3fdd1b9df1fa4f64608e443a355bda7fc57bed72c22","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-09-30T13:50:22Z","title_canon_sha256":"3434c17ab6d12fa962b6d530e5fd3671bdefb3d4c061a78ca1e5dc38a6b981bb"},"schema_version":"1.0","source":{"id":"1409.8547","kind":"arxiv","version":2}},"canonical_sha256":"c6a1b67c0a34854db0755437b35cfadb7f4d5c4ee85eac481995577a239d5330","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6a1b67c0a34854db0755437b35cfadb7f4d5c4ee85eac481995577a239d5330","first_computed_at":"2026-05-18T02:16:20.826543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:20.826543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"caSvrBNyAezWrRYQGqe1ByzEW6GjluD8Mkvff+1knF4F2YqGE1M9j4vrIHN+S5yep7vLeKVAUIxXQTqPfHnPAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:20.827148Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.8547","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c448d6c5b53193102a13bd1f62cba2dd842bec3c2d23f22ef14e705e8fab9910","sha256:d85d5679e427a86b04698311d202d382165b337a43e9906158ba514e0a6d1da5"],"state_sha256":"797239783e16d688498a59199a4dcb3528d7578ba2f5cc7128360c7c437c488f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/p/wZBHBvKx/y4/ya/b5c/ox1gwl8eIxsW6KrxZgvUgAIBJW+er/Mqxe2SvNtzY10F3d22Cu4bznFa2ptghdBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T17:56:29.033607Z","bundle_sha256":"a89a5e1d5073cc842262a9b35da93a4123b1f419b6b90b754cf8b4c99771f448"}}