{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:YQJT47VJJOEATCU3MNIPJDDART","short_pith_number":"pith:YQJT47VJ","canonical_record":{"source":{"id":"1005.2012","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-05-12T07:44:49Z","cross_cats_sorted":["cs.SY","stat.ML"],"title_canon_sha256":"92aad160ccf51199b5c278cc98510667cfc97796f238ac0edd1fe3d76ae50092","abstract_canon_sha256":"3ce4625c42bf96e6d1297b67a600650ee989a6cc7dff9e76cf890d7afe769d20"},"schema_version":"1.0"},"canonical_sha256":"c4133e7ea94b88098a9b6350f48c608cd3f39d83dfa947a4ffe70c7320800f98","source":{"kind":"arxiv","id":"1005.2012","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.2012","created_at":"2026-05-18T02:24:08Z"},{"alias_kind":"arxiv_version","alias_value":"1005.2012v3","created_at":"2026-05-18T02:24:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.2012","created_at":"2026-05-18T02:24:08Z"},{"alias_kind":"pith_short_12","alias_value":"YQJT47VJJOEA","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"YQJT47VJJOEATCU3","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"YQJT47VJ","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:YQJT47VJJOEATCU3MNIPJDDART","target":"record","payload":{"canonical_record":{"source":{"id":"1005.2012","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-05-12T07:44:49Z","cross_cats_sorted":["cs.SY","stat.ML"],"title_canon_sha256":"92aad160ccf51199b5c278cc98510667cfc97796f238ac0edd1fe3d76ae50092","abstract_canon_sha256":"3ce4625c42bf96e6d1297b67a600650ee989a6cc7dff9e76cf890d7afe769d20"},"schema_version":"1.0"},"canonical_sha256":"c4133e7ea94b88098a9b6350f48c608cd3f39d83dfa947a4ffe70c7320800f98","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:08.108984Z","signature_b64":"kuxlKNp+G8a2eeNmrQKh2pYP5LUZj1JoDkBAFSq5bA64Y++o8C+OcFnvFHDZPQS3VNFrpyD2LFWZtcUjkmYEDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4133e7ea94b88098a9b6350f48c608cd3f39d83dfa947a4ffe70c7320800f98","last_reissued_at":"2026-05-18T02:24:08.108231Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:08.108231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1005.2012","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-18T02:24:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I47FV7ULEJb3tsu4BvjhhsT7dEiCHrrZnVrsxfw9Wa5HCqfIBPr21eGNIF2UbemQK2OqU0PM4ZzHxAY5T9bZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:17:44.406781Z"},"content_sha256":"de6816113e83c6966dcd14ead0800942101c2c2e5478df04b748efa2386e56db","schema_version":"1.0","event_id":"sha256:de6816113e83c6966dcd14ead0800942101c2c2e5478df04b748efa2386e56db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:YQJT47VJJOEATCU3MNIPJDDART","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","stat.ML"],"primary_cat":"math.OC","authors_text":"Alekh Agarwal, John Duchi, Martin Wainwright","submitted_at":"2010-05-12T07:44:49Z","abstract_excerpt":"The goal of decentralized optimization over a network is to optimize a global objective formed by a sum of local (possibly nonsmooth) convex functions using only local computation and communication. It arises in various application domains, including distributed tracking and localization, multi-agent co-ordination, estimation in sensor networks, and large-scale optimization in machine learning. We develop and analyze distributed algorithms based on dual averaging of subgradients, and we provide sharp bounds on their convergence rates as a function of the network size and topology. Our method o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.2012","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-18T02:24:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SS6iwgG828udPOzpNYlsTN9FN1qNdTf9DHuK08W0x1CEym2ZPeFmZbkkgzredcHlC2fEonnNUc5R88uSHpgnCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:17:44.407444Z"},"content_sha256":"30344f5ceeb836081eac93305b21843078af711f3a72c3220726142a1de8ffe2","schema_version":"1.0","event_id":"sha256:30344f5ceeb836081eac93305b21843078af711f3a72c3220726142a1de8ffe2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YQJT47VJJOEATCU3MNIPJDDART/bundle.json","state_url":"https://pith.science/pith/YQJT47VJJOEATCU3MNIPJDDART/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YQJT47VJJOEATCU3MNIPJDDART/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-27T03:17:44Z","links":{"resolver":"https://pith.science/pith/YQJT47VJJOEATCU3MNIPJDDART","bundle":"https://pith.science/pith/YQJT47VJJOEATCU3MNIPJDDART/bundle.json","state":"https://pith.science/pith/YQJT47VJJOEATCU3MNIPJDDART/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YQJT47VJJOEATCU3MNIPJDDART/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:YQJT47VJJOEATCU3MNIPJDDART","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":"3ce4625c42bf96e6d1297b67a600650ee989a6cc7dff9e76cf890d7afe769d20","cross_cats_sorted":["cs.SY","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-05-12T07:44:49Z","title_canon_sha256":"92aad160ccf51199b5c278cc98510667cfc97796f238ac0edd1fe3d76ae50092"},"schema_version":"1.0","source":{"id":"1005.2012","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.2012","created_at":"2026-05-18T02:24:08Z"},{"alias_kind":"arxiv_version","alias_value":"1005.2012v3","created_at":"2026-05-18T02:24:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.2012","created_at":"2026-05-18T02:24:08Z"},{"alias_kind":"pith_short_12","alias_value":"YQJT47VJJOEA","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"YQJT47VJJOEATCU3","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"YQJT47VJ","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:30344f5ceeb836081eac93305b21843078af711f3a72c3220726142a1de8ffe2","target":"graph","created_at":"2026-05-18T02:24:08Z","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":"The goal of decentralized optimization over a network is to optimize a global objective formed by a sum of local (possibly nonsmooth) convex functions using only local computation and communication. It arises in various application domains, including distributed tracking and localization, multi-agent co-ordination, estimation in sensor networks, and large-scale optimization in machine learning. We develop and analyze distributed algorithms based on dual averaging of subgradients, and we provide sharp bounds on their convergence rates as a function of the network size and topology. Our method o","authors_text":"Alekh Agarwal, John Duchi, Martin Wainwright","cross_cats":["cs.SY","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-05-12T07:44:49Z","title":"Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.2012","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:de6816113e83c6966dcd14ead0800942101c2c2e5478df04b748efa2386e56db","target":"record","created_at":"2026-05-18T02:24:08Z","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":"3ce4625c42bf96e6d1297b67a600650ee989a6cc7dff9e76cf890d7afe769d20","cross_cats_sorted":["cs.SY","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-05-12T07:44:49Z","title_canon_sha256":"92aad160ccf51199b5c278cc98510667cfc97796f238ac0edd1fe3d76ae50092"},"schema_version":"1.0","source":{"id":"1005.2012","kind":"arxiv","version":3}},"canonical_sha256":"c4133e7ea94b88098a9b6350f48c608cd3f39d83dfa947a4ffe70c7320800f98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4133e7ea94b88098a9b6350f48c608cd3f39d83dfa947a4ffe70c7320800f98","first_computed_at":"2026-05-18T02:24:08.108231Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:08.108231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kuxlKNp+G8a2eeNmrQKh2pYP5LUZj1JoDkBAFSq5bA64Y++o8C+OcFnvFHDZPQS3VNFrpyD2LFWZtcUjkmYEDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:08.108984Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.2012","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de6816113e83c6966dcd14ead0800942101c2c2e5478df04b748efa2386e56db","sha256:30344f5ceeb836081eac93305b21843078af711f3a72c3220726142a1de8ffe2"],"state_sha256":"b9d132074a8f29c0d0d17c3e3ed37449b219edcbf9bc7966740ca02c51e925aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MnTGkTVjfx9Tbj2nLm+/28hcZz4yfYIFIBNGtlPd3pD0gKusOnuBmfId96NL3zBj6XDpceB0dp/pi8uAo/tFBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:17:44.410799Z","bundle_sha256":"4a9b4affea16e595fb48cd0e676525e71528f5cfca3a82be71e5348ee8bb08bb"}}