{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7FOZAVUS62RNX7E6QUV55Q5KTG","short_pith_number":"pith:7FOZAVUS","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"},"canonical_sha256":"f95d905692f6a2dbfc9e852bdec3aa99922f51fa79ee7402c2ff7c6d12320966","source":{"kind":"arxiv","id":"1705.07176","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07176","created_at":"2026-07-05T01:06:45Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07176v4","created_at":"2026-07-05T01:06:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07176","created_at":"2026-07-05T01:06:45Z"},{"alias_kind":"pith_short_12","alias_value":"7FOZAVUS62RN","created_at":"2026-07-05T01:06:45Z"},{"alias_kind":"pith_short_16","alias_value":"7FOZAVUS62RNX7E6","created_at":"2026-07-05T01:06:45Z"},{"alias_kind":"pith_short_8","alias_value":"7FOZAVUS","created_at":"2026-07-05T01:06:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7FOZAVUS62RNX7E6QUV55Q5KTG","target":"record","payload":{"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"},"canonical_sha256":"f95d905692f6a2dbfc9e852bdec3aa99922f51fa79ee7402c2ff7c6d12320966","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"},"source_kind":"arxiv","source_id":"1705.07176","source_version":4,"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-07-05T01:06:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gk1oD8W9caCnj31YeLbb70CzLj4NbNefinSzwgaxaDBZV/zltTvGojya8+is6XG1wn3Sc/pcQkVVcPNWo8gbCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T06:08:48.205162Z"},"content_sha256":"9706726d0c760db48fff5df972709958d82b6d839850673500ac5e9b0c7e425e","schema_version":"1.0","event_id":"sha256:9706726d0c760db48fff5df972709958d82b6d839850673500ac5e9b0c7e425e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7FOZAVUS62RNX7E6QUV55Q5KTG","target":"graph","payload":{"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"},"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-07-05T01:06:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GnitGTNOTssprXL+/ne8xRc7KEVTrZYAUCdjF8E8gMKiHbZ5ei4cif7nhGSNRJjSR0bap4HlXW2dOwP6ZFs1AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T06:08:48.205737Z"},"content_sha256":"2c37c289b03be57154b6fe01ecb88702510bac900aa62bccff615b29e32cef15","schema_version":"1.0","event_id":"sha256:2c37c289b03be57154b6fe01ecb88702510bac900aa62bccff615b29e32cef15"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7FOZAVUS62RNX7E6QUV55Q5KTG/bundle.json","state_url":"https://pith.science/pith/7FOZAVUS62RNX7E6QUV55Q5KTG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7FOZAVUS62RNX7E6QUV55Q5KTG/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-08-23T06:08:48Z","links":{"resolver":"https://pith.science/pith/7FOZAVUS62RNX7E6QUV55Q5KTG","bundle":"https://pith.science/pith/7FOZAVUS62RNX7E6QUV55Q5KTG/bundle.json","state":"https://pith.science/pith/7FOZAVUS62RNX7E6QUV55Q5KTG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7FOZAVUS62RNX7E6QUV55Q5KTG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7FOZAVUS62RNX7E6QUV55Q5KTG","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":"bc9b02c91d6dbf8506067a25a99a2f9db4f7e4c66cf3f395d1e67e1acd06b27d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-19T20:33:08Z","title_canon_sha256":"477859c68110b75e2178e58f6016d4ba52b74f690c0bc3f93a654fc948cdb958"},"schema_version":"1.0","source":{"id":"1705.07176","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07176","created_at":"2026-07-05T01:06:45Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07176v4","created_at":"2026-07-05T01:06:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07176","created_at":"2026-07-05T01:06:45Z"},{"alias_kind":"pith_short_12","alias_value":"7FOZAVUS62RN","created_at":"2026-07-05T01:06:45Z"},{"alias_kind":"pith_short_16","alias_value":"7FOZAVUS62RNX7E6","created_at":"2026-07-05T01:06:45Z"},{"alias_kind":"pith_short_8","alias_value":"7FOZAVUS","created_at":"2026-07-05T01:06:45Z"}],"graph_snapshots":[{"event_id":"sha256:2c37c289b03be57154b6fe01ecb88702510bac900aa62bccff615b29e32cef15","target":"graph","created_at":"2026-07-05T01:06:45Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1705.07176/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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-","authors_text":"Guannan Qu, Na Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-19T20:33:08Z","title":"Accelerated Distributed Nesterov Gradient Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07176","kind":"arxiv","version":4},"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:9706726d0c760db48fff5df972709958d82b6d839850673500ac5e9b0c7e425e","target":"record","created_at":"2026-07-05T01:06:45Z","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":"bc9b02c91d6dbf8506067a25a99a2f9db4f7e4c66cf3f395d1e67e1acd06b27d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-19T20:33:08Z","title_canon_sha256":"477859c68110b75e2178e58f6016d4ba52b74f690c0bc3f93a654fc948cdb958"},"schema_version":"1.0","source":{"id":"1705.07176","kind":"arxiv","version":4}},"canonical_sha256":"f95d905692f6a2dbfc9e852bdec3aa99922f51fa79ee7402c2ff7c6d12320966","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f95d905692f6a2dbfc9e852bdec3aa99922f51fa79ee7402c2ff7c6d12320966","first_computed_at":"2026-07-05T01:06:45.156338Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:06:45.156338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pRrv7WGuRZpQ+odNIZUhF9it9uwVsxKL4QN1bLyXYomErgVZnxuPUDZqTpxwOnlIq/weSKg22o4BiOQ723s5Aw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:06:45.156766Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07176","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9706726d0c760db48fff5df972709958d82b6d839850673500ac5e9b0c7e425e","sha256:2c37c289b03be57154b6fe01ecb88702510bac900aa62bccff615b29e32cef15"],"state_sha256":"f3ace020c4d78f28295032d2e91c2970f2aada130e5d141af3bfdbe7146ea031"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jbzMD5k6AuFgCp2FhYn6eEBPkzQxc1hT4Do3qv+NF4aa6XG1HF9HLZh29zwaxb24aqfFTXbNXV7xmZtulcxBAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T06:08:48.210441Z","bundle_sha256":"1065b5a9d7580e6b744358da504124119426d5880e3fb5b4b71080cd601f3545"}}