{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:YQJT47VJJOEATCU3MNIPJDDART","short_pith_number":"pith:YQJT47VJ","schema_version":"1.0","canonical_sha256":"c4133e7ea94b88098a9b6350f48c608cd3f39d83dfa947a4ffe70c7320800f98","source":{"kind":"arxiv","id":"1005.2012","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1005.2012","created_at":"2026-05-18T02:24:08.108349+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.2012v3","created_at":"2026-05-18T02:24:08.108349+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.2012","created_at":"2026-05-18T02:24:08.108349+00:00"},{"alias_kind":"pith_short_12","alias_value":"YQJT47VJJOEA","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"YQJT47VJJOEATCU3","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"YQJT47VJ","created_at":"2026-05-18T12:26:17.028572+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/YQJT47VJJOEATCU3MNIPJDDART","json":"https://pith.science/pith/YQJT47VJJOEATCU3MNIPJDDART.json","graph_json":"https://pith.science/api/pith-number/YQJT47VJJOEATCU3MNIPJDDART/graph.json","events_json":"https://pith.science/api/pith-number/YQJT47VJJOEATCU3MNIPJDDART/events.json","paper":"https://pith.science/paper/YQJT47VJ"},"agent_actions":{"view_html":"https://pith.science/pith/YQJT47VJJOEATCU3MNIPJDDART","download_json":"https://pith.science/pith/YQJT47VJJOEATCU3MNIPJDDART.json","view_paper":"https://pith.science/paper/YQJT47VJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.2012&json=true","fetch_graph":"https://pith.science/api/pith-number/YQJT47VJJOEATCU3MNIPJDDART/graph.json","fetch_events":"https://pith.science/api/pith-number/YQJT47VJJOEATCU3MNIPJDDART/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YQJT47VJJOEATCU3MNIPJDDART/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YQJT47VJJOEATCU3MNIPJDDART/action/storage_attestation","attest_author":"https://pith.science/pith/YQJT47VJJOEATCU3MNIPJDDART/action/author_attestation","sign_citation":"https://pith.science/pith/YQJT47VJJOEATCU3MNIPJDDART/action/citation_signature","submit_replication":"https://pith.science/pith/YQJT47VJJOEATCU3MNIPJDDART/action/replication_record"}},"created_at":"2026-05-18T02:24:08.108349+00:00","updated_at":"2026-05-18T02:24:08.108349+00:00"}