{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:FRFLYW4C4FA4GG6KPTNB3EMPN6","short_pith_number":"pith:FRFLYW4C","canonical_record":{"source":{"id":"1702.08704","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-28T09:09:04Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7608d5e29b17bb32a80e56fee1699a2b3ab72513a2ecd77cf725410a809709f1","abstract_canon_sha256":"fd920591ac552cac7ecaa1019620b01303df37952306dcd78439b50ec38f0a73"},"schema_version":"1.0"},"canonical_sha256":"2c4abc5b82e141c31bca7cda1d918f6f97b29f54c097547e608d2bd2ce748b20","source":{"kind":"arxiv","id":"1702.08704","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08704","created_at":"2026-05-18T00:46:51Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08704v2","created_at":"2026-05-18T00:46:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08704","created_at":"2026-05-18T00:46:51Z"},{"alias_kind":"pith_short_12","alias_value":"FRFLYW4C4FA4","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FRFLYW4C4FA4GG6K","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FRFLYW4C","created_at":"2026-05-18T12:31:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:FRFLYW4C4FA4GG6KPTNB3EMPN6","target":"record","payload":{"canonical_record":{"source":{"id":"1702.08704","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-28T09:09:04Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7608d5e29b17bb32a80e56fee1699a2b3ab72513a2ecd77cf725410a809709f1","abstract_canon_sha256":"fd920591ac552cac7ecaa1019620b01303df37952306dcd78439b50ec38f0a73"},"schema_version":"1.0"},"canonical_sha256":"2c4abc5b82e141c31bca7cda1d918f6f97b29f54c097547e608d2bd2ce748b20","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:51.270293Z","signature_b64":"9c5CgRc6z1hhGBqTXOzqtxSnoPISLG1rMe87R1pdxiup5v6/r6SzVhTsBjpT2UZvTFkH2O8RmLjlUVrKbQ/JAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c4abc5b82e141c31bca7cda1d918f6f97b29f54c097547e608d2bd2ce748b20","last_reissued_at":"2026-05-18T00:46:51.269737Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:51.269737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.08704","source_version":2,"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-18T00:46:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rvFavIw2MGwWLYwir07lmgJDoE+pQ79qsDAeYqHO7/4rG2NPlDG7pks5NZWmeDnOoabFk8jGtZKf5A0Q13W3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:09:37.030545Z"},"content_sha256":"d445d4703e6e7ac10b5ffa6cbe1817824749b398e539d716c68cd3729acabf74","schema_version":"1.0","event_id":"sha256:d445d4703e6e7ac10b5ffa6cbe1817824749b398e539d716c68cd3729acabf74"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:FRFLYW4C4FA4GG6KPTNB3EMPN6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal algorithms for smooth and strongly convex distributed optimization in networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Francis Bach (SIERRA), Kevin Scaman (MSR - INRIA), Laurent Massouli\\'e (MSR - INRIA), S\\'ebastien Bubeck, Yin Tat Lee","submitted_at":"2017-02-28T09:09:04Z","abstract_excerpt":"In this paper, we determine the optimal convergence rates for strongly convex and smooth distributed optimization in two settings: centralized and decentralized communications over a network. For centralized (i.e. master/slave) algorithms, we show that distributing Nesterov's accelerated gradient descent is optimal and achieves a precision $\\varepsilon > 0$ in time $O(\\sqrt{\\kappa_g}(1+\\Delta\\tau)\\ln(1/\\varepsilon))$, where $\\kappa_g$ is the condition number of the (global) function to optimize, $\\Delta$ is the diameter of the network, and $\\tau$ (resp. $1$) is the time needed to communicate v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08704","kind":"arxiv","version":2},"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-18T00:46:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dG4V0LvndjAWFQgmbQ7igtgJ/d3TURLZd6U+CtsYB6zDadfBq3VSsaCbOh5n9idY6KrKzETx6QY1xQsQcsR5Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:09:37.030898Z"},"content_sha256":"71e03d85343b640946ada179d9f0d01c17ab0d7dd46dbba4932e94c624106548","schema_version":"1.0","event_id":"sha256:71e03d85343b640946ada179d9f0d01c17ab0d7dd46dbba4932e94c624106548"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FRFLYW4C4FA4GG6KPTNB3EMPN6/bundle.json","state_url":"https://pith.science/pith/FRFLYW4C4FA4GG6KPTNB3EMPN6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FRFLYW4C4FA4GG6KPTNB3EMPN6/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-28T11:09:37Z","links":{"resolver":"https://pith.science/pith/FRFLYW4C4FA4GG6KPTNB3EMPN6","bundle":"https://pith.science/pith/FRFLYW4C4FA4GG6KPTNB3EMPN6/bundle.json","state":"https://pith.science/pith/FRFLYW4C4FA4GG6KPTNB3EMPN6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FRFLYW4C4FA4GG6KPTNB3EMPN6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FRFLYW4C4FA4GG6KPTNB3EMPN6","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":"fd920591ac552cac7ecaa1019620b01303df37952306dcd78439b50ec38f0a73","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-28T09:09:04Z","title_canon_sha256":"7608d5e29b17bb32a80e56fee1699a2b3ab72513a2ecd77cf725410a809709f1"},"schema_version":"1.0","source":{"id":"1702.08704","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.08704","created_at":"2026-05-18T00:46:51Z"},{"alias_kind":"arxiv_version","alias_value":"1702.08704v2","created_at":"2026-05-18T00:46:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08704","created_at":"2026-05-18T00:46:51Z"},{"alias_kind":"pith_short_12","alias_value":"FRFLYW4C4FA4","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FRFLYW4C4FA4GG6K","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FRFLYW4C","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:71e03d85343b640946ada179d9f0d01c17ab0d7dd46dbba4932e94c624106548","target":"graph","created_at":"2026-05-18T00:46:51Z","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":"In this paper, we determine the optimal convergence rates for strongly convex and smooth distributed optimization in two settings: centralized and decentralized communications over a network. For centralized (i.e. master/slave) algorithms, we show that distributing Nesterov's accelerated gradient descent is optimal and achieves a precision $\\varepsilon > 0$ in time $O(\\sqrt{\\kappa_g}(1+\\Delta\\tau)\\ln(1/\\varepsilon))$, where $\\kappa_g$ is the condition number of the (global) function to optimize, $\\Delta$ is the diameter of the network, and $\\tau$ (resp. $1$) is the time needed to communicate v","authors_text":"Francis Bach (SIERRA), Kevin Scaman (MSR - INRIA), Laurent Massouli\\'e (MSR - INRIA), S\\'ebastien Bubeck, Yin Tat Lee","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-28T09:09:04Z","title":"Optimal algorithms for smooth and strongly convex distributed optimization in networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08704","kind":"arxiv","version":2},"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:d445d4703e6e7ac10b5ffa6cbe1817824749b398e539d716c68cd3729acabf74","target":"record","created_at":"2026-05-18T00:46:51Z","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":"fd920591ac552cac7ecaa1019620b01303df37952306dcd78439b50ec38f0a73","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-28T09:09:04Z","title_canon_sha256":"7608d5e29b17bb32a80e56fee1699a2b3ab72513a2ecd77cf725410a809709f1"},"schema_version":"1.0","source":{"id":"1702.08704","kind":"arxiv","version":2}},"canonical_sha256":"2c4abc5b82e141c31bca7cda1d918f6f97b29f54c097547e608d2bd2ce748b20","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c4abc5b82e141c31bca7cda1d918f6f97b29f54c097547e608d2bd2ce748b20","first_computed_at":"2026-05-18T00:46:51.269737Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:51.269737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9c5CgRc6z1hhGBqTXOzqtxSnoPISLG1rMe87R1pdxiup5v6/r6SzVhTsBjpT2UZvTFkH2O8RmLjlUVrKbQ/JAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:51.270293Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.08704","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d445d4703e6e7ac10b5ffa6cbe1817824749b398e539d716c68cd3729acabf74","sha256:71e03d85343b640946ada179d9f0d01c17ab0d7dd46dbba4932e94c624106548"],"state_sha256":"90580de8e4e67fd822b0bfdf6bb8f3f06e1f1dde4faf31860adffd3bd64cf701"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S1zfsZxfmAREPpXpv6SeV2TL7RuixV2vfVyo7fE+YY3eZjTaRoOLb7j1XbKQKXZotvAvZUK4hDN25WafoUUJCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:09:37.032861Z","bundle_sha256":"c7f978aaadc15878b778138a1bde650212d916986ad93acc757a6cac89bfc489"}}