{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:HHKTBFXT6OH7LAHWO56K4YATPX","short_pith_number":"pith:HHKTBFXT","schema_version":"1.0","canonical_sha256":"39d53096f3f38ff580f6777cae60137dc7c602efe6169dbb21cf4d54e313c9ab","source":{"kind":"arxiv","id":"1112.2972","version":4},"attestation_state":"computed","paper":{"title":"Fast Distributed Gradient Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dusan Jakovetic, Joao Xavier, Jose M. F. Moura","submitted_at":"2011-12-13T17:33:27Z","abstract_excerpt":"We study distributed optimization problems when $N$ nodes minimize the sum of their individual costs subject to a common vector variable. The costs are convex, have Lipschitz continuous gradient (with constant $L$), and bounded gradient. We propose two fast distributed gradient algorithms based on the centralized Nesterov gradient algorithm and establish their convergence rates in terms of the per-node communications $\\mathcal{K}$ and the per-node gradient evaluations $k$. Our first method, Distributed Nesterov Gradient, achieves rates $O\\left({\\log \\mathcal{K}}/{\\mathcal{K}}\\right)$ and $O\\le"},"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":"1112.2972","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-12-13T17:33:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"157498e92f16f2c343dc37a9f37b293dc234151d0f1d1f9e0fa5a2b92cd91607","abstract_canon_sha256":"4d739c87fba44a663e654d8c87613b51e670c8f11e920e0bd8c7d2145c85a427"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:21.839168Z","signature_b64":"E8R4nAemDs5axbUguFqkza+KrnvARQP6quO46SjgeUkU7noyUaiz/o+6tOKrFzXs2o984qkwNqvfJsHu5fvFCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39d53096f3f38ff580f6777cae60137dc7c602efe6169dbb21cf4d54e313c9ab","last_reissued_at":"2026-05-18T02:54:21.838777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:21.838777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Distributed Gradient Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dusan Jakovetic, Joao Xavier, Jose M. F. Moura","submitted_at":"2011-12-13T17:33:27Z","abstract_excerpt":"We study distributed optimization problems when $N$ nodes minimize the sum of their individual costs subject to a common vector variable. The costs are convex, have Lipschitz continuous gradient (with constant $L$), and bounded gradient. We propose two fast distributed gradient algorithms based on the centralized Nesterov gradient algorithm and establish their convergence rates in terms of the per-node communications $\\mathcal{K}$ and the per-node gradient evaluations $k$. Our first method, Distributed Nesterov Gradient, achieves rates $O\\left({\\log \\mathcal{K}}/{\\mathcal{K}}\\right)$ and $O\\le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2972","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1112.2972","created_at":"2026-05-18T02:54:21.838839+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.2972v4","created_at":"2026-05-18T02:54:21.838839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.2972","created_at":"2026-05-18T02:54:21.838839+00:00"},{"alias_kind":"pith_short_12","alias_value":"HHKTBFXT6OH7","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"HHKTBFXT6OH7LAHW","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"HHKTBFXT","created_at":"2026-05-18T12:26:30.835961+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/HHKTBFXT6OH7LAHWO56K4YATPX","json":"https://pith.science/pith/HHKTBFXT6OH7LAHWO56K4YATPX.json","graph_json":"https://pith.science/api/pith-number/HHKTBFXT6OH7LAHWO56K4YATPX/graph.json","events_json":"https://pith.science/api/pith-number/HHKTBFXT6OH7LAHWO56K4YATPX/events.json","paper":"https://pith.science/paper/HHKTBFXT"},"agent_actions":{"view_html":"https://pith.science/pith/HHKTBFXT6OH7LAHWO56K4YATPX","download_json":"https://pith.science/pith/HHKTBFXT6OH7LAHWO56K4YATPX.json","view_paper":"https://pith.science/paper/HHKTBFXT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.2972&json=true","fetch_graph":"https://pith.science/api/pith-number/HHKTBFXT6OH7LAHWO56K4YATPX/graph.json","fetch_events":"https://pith.science/api/pith-number/HHKTBFXT6OH7LAHWO56K4YATPX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HHKTBFXT6OH7LAHWO56K4YATPX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HHKTBFXT6OH7LAHWO56K4YATPX/action/storage_attestation","attest_author":"https://pith.science/pith/HHKTBFXT6OH7LAHWO56K4YATPX/action/author_attestation","sign_citation":"https://pith.science/pith/HHKTBFXT6OH7LAHWO56K4YATPX/action/citation_signature","submit_replication":"https://pith.science/pith/HHKTBFXT6OH7LAHWO56K4YATPX/action/replication_record"}},"created_at":"2026-05-18T02:54:21.838839+00:00","updated_at":"2026-05-18T02:54:21.838839+00:00"}