{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:25UHMCGDSECCPUY4LHE4ON7CTK","short_pith_number":"pith:25UHMCGD","canonical_record":{"source":{"id":"1901.09865","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-28T18:12:37Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"53f395886ebcb1300433a96b728886e0cdf7439d27c0c947555d92b754881d24","abstract_canon_sha256":"f6c50292393982206929e811bf99065c9482f411e05c444f6f812b45f8055167"},"schema_version":"1.0"},"canonical_sha256":"d7687608c3910427d31c59c9c737e29a8b67b73bf21ab6bf0a3a95657c3d904b","source":{"kind":"arxiv","id":"1901.09865","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09865","created_at":"2026-05-17T23:40:23Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09865v3","created_at":"2026-05-17T23:40:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09865","created_at":"2026-05-17T23:40:23Z"},{"alias_kind":"pith_short_12","alias_value":"25UHMCGDSECC","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"25UHMCGDSECCPUY4","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"25UHMCGD","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:25UHMCGDSECCPUY4LHE4ON7CTK","target":"record","payload":{"canonical_record":{"source":{"id":"1901.09865","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-28T18:12:37Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"53f395886ebcb1300433a96b728886e0cdf7439d27c0c947555d92b754881d24","abstract_canon_sha256":"f6c50292393982206929e811bf99065c9482f411e05c444f6f812b45f8055167"},"schema_version":"1.0"},"canonical_sha256":"d7687608c3910427d31c59c9c737e29a8b67b73bf21ab6bf0a3a95657c3d904b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:23.708641Z","signature_b64":"lGiCJl13HXMvVH3USJb6qD1jrTP+guQHeXWkKJNySLWw28Toh8rhjaIQHWsqPBAAIg4ahIcF2+E2KA5d3+zaBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d7687608c3910427d31c59c9c737e29a8b67b73bf21ab6bf0a3a95657c3d904b","last_reissued_at":"2026-05-17T23:40:23.707974Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:23.707974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.09865","source_version":3,"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-17T23:40:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ghWXiaL1sKi3J7P8C7tKPqT96G/HSWm/pEehETIlCMksJHjRgfnOEO6P30YmxvJCOk3H7r95ICDqjwKbTGYKAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:23:13.911156Z"},"content_sha256":"674671658d0cfa233b17f8940d7b2e2a0c7ad185578370ff7b54ad05695da814","schema_version":"1.0","event_id":"sha256:674671658d0cfa233b17f8940d7b2e2a0c7ad185578370ff7b54ad05695da814"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:25UHMCGDSECCPUY4LHE4ON7CTK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asynchronous Accelerated Proximal Stochastic Gradient for Strongly Convex Distributed Finite Sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"math.OC","authors_text":"Francis Bach, Hadrien Hendrikx, Laurent Massouli\\'e","submitted_at":"2019-01-28T18:12:37Z","abstract_excerpt":"In this work, we study the problem of minimizing the sum of strongly convex functions split over a network of $n$ nodes. We propose the decentralized and asynchronous algorithm ADFS to tackle the case when local functions are themselves finite sums with $m$ components. ADFS converges linearly when local functions are smooth, and matches the rates of the best known finite sum algorithms when executed on a single machine. On several machines, ADFS enjoys a $O (\\sqrt{n})$ or $O(n)$ speed-up depending on the leading complexity term as long as the diameter of the network is not too big with respect"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09865","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"},"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-17T23:40:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GMwby+hzIaX+NW7b5sY+jgFWbHnH56gEwQ7ApzTQIQsVUTGOrPCM0pJ4/TsYbf/8u5WPYC/K4Mgk/LhGpi3FBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:23:13.911842Z"},"content_sha256":"8566d98e66023f5694557ea324171ad71e5a620675d12c1d5900a8ea8c1b037a","schema_version":"1.0","event_id":"sha256:8566d98e66023f5694557ea324171ad71e5a620675d12c1d5900a8ea8c1b037a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/25UHMCGDSECCPUY4LHE4ON7CTK/bundle.json","state_url":"https://pith.science/pith/25UHMCGDSECCPUY4LHE4ON7CTK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/25UHMCGDSECCPUY4LHE4ON7CTK/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-30T08:23:13Z","links":{"resolver":"https://pith.science/pith/25UHMCGDSECCPUY4LHE4ON7CTK","bundle":"https://pith.science/pith/25UHMCGDSECCPUY4LHE4ON7CTK/bundle.json","state":"https://pith.science/pith/25UHMCGDSECCPUY4LHE4ON7CTK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/25UHMCGDSECCPUY4LHE4ON7CTK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:25UHMCGDSECCPUY4LHE4ON7CTK","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":"f6c50292393982206929e811bf99065c9482f411e05c444f6f812b45f8055167","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-28T18:12:37Z","title_canon_sha256":"53f395886ebcb1300433a96b728886e0cdf7439d27c0c947555d92b754881d24"},"schema_version":"1.0","source":{"id":"1901.09865","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.09865","created_at":"2026-05-17T23:40:23Z"},{"alias_kind":"arxiv_version","alias_value":"1901.09865v3","created_at":"2026-05-17T23:40:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.09865","created_at":"2026-05-17T23:40:23Z"},{"alias_kind":"pith_short_12","alias_value":"25UHMCGDSECC","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"25UHMCGDSECCPUY4","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"25UHMCGD","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:8566d98e66023f5694557ea324171ad71e5a620675d12c1d5900a8ea8c1b037a","target":"graph","created_at":"2026-05-17T23:40:23Z","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 work, we study the problem of minimizing the sum of strongly convex functions split over a network of $n$ nodes. We propose the decentralized and asynchronous algorithm ADFS to tackle the case when local functions are themselves finite sums with $m$ components. ADFS converges linearly when local functions are smooth, and matches the rates of the best known finite sum algorithms when executed on a single machine. On several machines, ADFS enjoys a $O (\\sqrt{n})$ or $O(n)$ speed-up depending on the leading complexity term as long as the diameter of the network is not too big with respect","authors_text":"Francis Bach, Hadrien Hendrikx, Laurent Massouli\\'e","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-28T18:12:37Z","title":"Asynchronous Accelerated Proximal Stochastic Gradient for Strongly Convex Distributed Finite Sums"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.09865","kind":"arxiv","version":3},"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:674671658d0cfa233b17f8940d7b2e2a0c7ad185578370ff7b54ad05695da814","target":"record","created_at":"2026-05-17T23:40:23Z","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":"f6c50292393982206929e811bf99065c9482f411e05c444f6f812b45f8055167","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-28T18:12:37Z","title_canon_sha256":"53f395886ebcb1300433a96b728886e0cdf7439d27c0c947555d92b754881d24"},"schema_version":"1.0","source":{"id":"1901.09865","kind":"arxiv","version":3}},"canonical_sha256":"d7687608c3910427d31c59c9c737e29a8b67b73bf21ab6bf0a3a95657c3d904b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d7687608c3910427d31c59c9c737e29a8b67b73bf21ab6bf0a3a95657c3d904b","first_computed_at":"2026-05-17T23:40:23.707974Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:23.707974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lGiCJl13HXMvVH3USJb6qD1jrTP+guQHeXWkKJNySLWw28Toh8rhjaIQHWsqPBAAIg4ahIcF2+E2KA5d3+zaBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:23.708641Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.09865","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:674671658d0cfa233b17f8940d7b2e2a0c7ad185578370ff7b54ad05695da814","sha256:8566d98e66023f5694557ea324171ad71e5a620675d12c1d5900a8ea8c1b037a"],"state_sha256":"2a838f7b78aae266b3845eb328dafc0c273f3b0aaadbc182a1172089d36cc24b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"onyecC2mhJUfE92du9N78lsqrH+qTJrsy3XSHWRwI0/r0ThEeddG4+tF6ABWC4eq4t6UPGtd0F6lwc/LO0yZDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:23:13.915557Z","bundle_sha256":"dc0f07c03e44e21fa7a99766b7a1f9e5d046e735352ca4a00816e770f6ec5599"}}