{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7FOZAVUS62RNX7E6QUV55Q5KTG","short_pith_number":"pith:7FOZAVUS","schema_version":"1.0","canonical_sha256":"f95d905692f6a2dbfc9e852bdec3aa99922f51fa79ee7402c2ff7c6d12320966","source":{"kind":"arxiv","id":"1705.07176","version":4},"attestation_state":"computed","paper":{"title":"Accelerated Distributed Nesterov Gradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Guannan Qu, Na Li","submitted_at":"2017-05-19T20:33:08Z","abstract_excerpt":"This paper considers the distributed optimization problem over a network, where the objective is to optimize a global function formed by a sum of local functions, using only local computation and communication. We develop an Accelerated Distributed Nesterov Gradient Descent (Acc-DNGD) method. When the objective function is convex and $L$-smooth, we show that it achieves a $O(\\frac{1}{t^{1.4-\\epsilon}})$ convergence rate for all $\\epsilon\\in(0,1.4)$. We also show the convergence rate can be improved to $O(\\frac{1}{t^2})$ if the objective function is a composition of a linear map and a strongly-"},"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":"1705.07176","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-19T20:33:08Z","cross_cats_sorted":[],"title_canon_sha256":"477859c68110b75e2178e58f6016d4ba52b74f690c0bc3f93a654fc948cdb958","abstract_canon_sha256":"bc9b02c91d6dbf8506067a25a99a2f9db4f7e4c66cf3f395d1e67e1acd06b27d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:06:45.156766Z","signature_b64":"pRrv7WGuRZpQ+odNIZUhF9it9uwVsxKL4QN1bLyXYomErgVZnxuPUDZqTpxwOnlIq/weSKg22o4BiOQ723s5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f95d905692f6a2dbfc9e852bdec3aa99922f51fa79ee7402c2ff7c6d12320966","last_reissued_at":"2026-07-05T01:06:45.156338Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:06:45.156338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerated Distributed Nesterov Gradient Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Guannan Qu, Na Li","submitted_at":"2017-05-19T20:33:08Z","abstract_excerpt":"This paper considers the distributed optimization problem over a network, where the objective is to optimize a global function formed by a sum of local functions, using only local computation and communication. We develop an Accelerated Distributed Nesterov Gradient Descent (Acc-DNGD) method. When the objective function is convex and $L$-smooth, we show that it achieves a $O(\\frac{1}{t^{1.4-\\epsilon}})$ convergence rate for all $\\epsilon\\in(0,1.4)$. We also show the convergence rate can be improved to $O(\\frac{1}{t^2})$ if the objective function is a composition of a linear map and a strongly-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07176","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1705.07176/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1705.07176","created_at":"2026-07-05T01:06:45.156391+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.07176v4","created_at":"2026-07-05T01:06:45.156391+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07176","created_at":"2026-07-05T01:06:45.156391+00:00"},{"alias_kind":"pith_short_12","alias_value":"7FOZAVUS62RN","created_at":"2026-07-05T01:06:45.156391+00:00"},{"alias_kind":"pith_short_16","alias_value":"7FOZAVUS62RNX7E6","created_at":"2026-07-05T01:06:45.156391+00:00"},{"alias_kind":"pith_short_8","alias_value":"7FOZAVUS","created_at":"2026-07-05T01:06:45.156391+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1907.07144","citing_title":"Geometric Convergence of Distributed Gradient Play in Games with Unconstrained Action Sets","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7FOZAVUS62RNX7E6QUV55Q5KTG","json":"https://pith.science/pith/7FOZAVUS62RNX7E6QUV55Q5KTG.json","graph_json":"https://pith.science/api/pith-number/7FOZAVUS62RNX7E6QUV55Q5KTG/graph.json","events_json":"https://pith.science/api/pith-number/7FOZAVUS62RNX7E6QUV55Q5KTG/events.json","paper":"https://pith.science/paper/7FOZAVUS"},"agent_actions":{"view_html":"https://pith.science/pith/7FOZAVUS62RNX7E6QUV55Q5KTG","download_json":"https://pith.science/pith/7FOZAVUS62RNX7E6QUV55Q5KTG.json","view_paper":"https://pith.science/paper/7FOZAVUS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.07176&json=true","fetch_graph":"https://pith.science/api/pith-number/7FOZAVUS62RNX7E6QUV55Q5KTG/graph.json","fetch_events":"https://pith.science/api/pith-number/7FOZAVUS62RNX7E6QUV55Q5KTG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7FOZAVUS62RNX7E6QUV55Q5KTG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7FOZAVUS62RNX7E6QUV55Q5KTG/action/storage_attestation","attest_author":"https://pith.science/pith/7FOZAVUS62RNX7E6QUV55Q5KTG/action/author_attestation","sign_citation":"https://pith.science/pith/7FOZAVUS62RNX7E6QUV55Q5KTG/action/citation_signature","submit_replication":"https://pith.science/pith/7FOZAVUS62RNX7E6QUV55Q5KTG/action/replication_record"}},"created_at":"2026-07-05T01:06:45.156391+00:00","updated_at":"2026-07-05T01:06:45.156391+00:00"}