{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:CGICBUKJCGBKOHSWGFJLYJ43QQ","short_pith_number":"pith:CGICBUKJ","canonical_record":{"source":{"id":"1905.11394","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-27T11:16:01Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"febba670b569a6571172bd3b50c9bdfae59a01440920b0cdca1e89193afc2e98","abstract_canon_sha256":"c4c3bff2e06e3ba89dd776901d3f7ca5ee8ccbe13e8c87927f73e504737ec22a"},"schema_version":"1.0"},"canonical_sha256":"119020d1491182a71e563152bc279b8415a6122862bed0771d38a8542cd9f8c7","source":{"kind":"arxiv","id":"1905.11394","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11394","created_at":"2026-05-17T23:43:32Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11394v2","created_at":"2026-05-17T23:43:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11394","created_at":"2026-05-17T23:43:32Z"},{"alias_kind":"pith_short_12","alias_value":"CGICBUKJCGBK","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"CGICBUKJCGBKOHSW","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"CGICBUKJ","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:CGICBUKJCGBKOHSWGFJLYJ43QQ","target":"record","payload":{"canonical_record":{"source":{"id":"1905.11394","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-27T11:16:01Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"febba670b569a6571172bd3b50c9bdfae59a01440920b0cdca1e89193afc2e98","abstract_canon_sha256":"c4c3bff2e06e3ba89dd776901d3f7ca5ee8ccbe13e8c87927f73e504737ec22a"},"schema_version":"1.0"},"canonical_sha256":"119020d1491182a71e563152bc279b8415a6122862bed0771d38a8542cd9f8c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:32.573763Z","signature_b64":"Y/nnb7fgZ1n1IzZxbTeiCWgA+MeUd/sDSMMSQt+/t7IUurM7iidmRDd87bzVdul5ctbcysIMclDujnpkT/MhDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"119020d1491182a71e563152bc279b8415a6122862bed0771d38a8542cd9f8c7","last_reissued_at":"2026-05-17T23:43:32.573387Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:32.573387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.11394","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-17T23:43:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HneUavI2laeRa6ZmQzaKV2WbpI6ukZNezN9+hkwosSTCIjqMBgesVvLMj0q52KkNsjUuuVwM5wLvTZjpPyULAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:47:13.713403Z"},"content_sha256":"bbc52116ffce050fc13bc2cffda7198775367c77159064a4e658f974826a0d64","schema_version":"1.0","event_id":"sha256:bbc52116ffce050fc13bc2cffda7198775367c77159064a4e658f974826a0d64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:CGICBUKJCGBKOHSWGFJLYJ43QQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Accelerated Decentralized Stochastic Proximal Algorithm for 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 Massoulie","submitted_at":"2019-05-27T11:16:01Z","abstract_excerpt":"Modern large-scale finite-sum optimization relies on two key aspects: distribution and stochastic updates. For smooth and strongly convex problems, existing decentralized algorithms are slower than modern accelerated variance-reduced stochastic algorithms when run on a single machine, and are therefore not efficient. Centralized algorithms are fast, but their scaling is limited by global aggregation steps that result in communication bottlenecks. In this work, we propose an efficient \\textbf{A}ccelerated \\textbf{D}ecentralized stochastic algorithm for \\textbf{F}inite \\textbf{S}ums named ADFS, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11394","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-17T23:43:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O5L/7UzjlG519IqbymMtX/XRM+GcXcikfBgxz9yBbJ5Z9u6ZFMC+8fqh5Nk/OsOuWwztricaBBxdtGRKt7rLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T22:47:13.713954Z"},"content_sha256":"e93b7034fc4367f65f0527ed9c314e0c05121acfe02e80d0c2eddb6b5b457d44","schema_version":"1.0","event_id":"sha256:e93b7034fc4367f65f0527ed9c314e0c05121acfe02e80d0c2eddb6b5b457d44"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CGICBUKJCGBKOHSWGFJLYJ43QQ/bundle.json","state_url":"https://pith.science/pith/CGICBUKJCGBKOHSWGFJLYJ43QQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CGICBUKJCGBKOHSWGFJLYJ43QQ/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-06-08T22:47:13Z","links":{"resolver":"https://pith.science/pith/CGICBUKJCGBKOHSWGFJLYJ43QQ","bundle":"https://pith.science/pith/CGICBUKJCGBKOHSWGFJLYJ43QQ/bundle.json","state":"https://pith.science/pith/CGICBUKJCGBKOHSWGFJLYJ43QQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CGICBUKJCGBKOHSWGFJLYJ43QQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:CGICBUKJCGBKOHSWGFJLYJ43QQ","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":"c4c3bff2e06e3ba89dd776901d3f7ca5ee8ccbe13e8c87927f73e504737ec22a","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-27T11:16:01Z","title_canon_sha256":"febba670b569a6571172bd3b50c9bdfae59a01440920b0cdca1e89193afc2e98"},"schema_version":"1.0","source":{"id":"1905.11394","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11394","created_at":"2026-05-17T23:43:32Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11394v2","created_at":"2026-05-17T23:43:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11394","created_at":"2026-05-17T23:43:32Z"},{"alias_kind":"pith_short_12","alias_value":"CGICBUKJCGBK","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"CGICBUKJCGBKOHSW","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"CGICBUKJ","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:e93b7034fc4367f65f0527ed9c314e0c05121acfe02e80d0c2eddb6b5b457d44","target":"graph","created_at":"2026-05-17T23:43:32Z","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":"Modern large-scale finite-sum optimization relies on two key aspects: distribution and stochastic updates. For smooth and strongly convex problems, existing decentralized algorithms are slower than modern accelerated variance-reduced stochastic algorithms when run on a single machine, and are therefore not efficient. Centralized algorithms are fast, but their scaling is limited by global aggregation steps that result in communication bottlenecks. In this work, we propose an efficient \\textbf{A}ccelerated \\textbf{D}ecentralized stochastic algorithm for \\textbf{F}inite \\textbf{S}ums named ADFS, ","authors_text":"Francis Bach, Hadrien Hendrikx, Laurent Massoulie","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-27T11:16:01Z","title":"An Accelerated Decentralized Stochastic Proximal Algorithm for Finite Sums"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11394","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:bbc52116ffce050fc13bc2cffda7198775367c77159064a4e658f974826a0d64","target":"record","created_at":"2026-05-17T23:43:32Z","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":"c4c3bff2e06e3ba89dd776901d3f7ca5ee8ccbe13e8c87927f73e504737ec22a","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-05-27T11:16:01Z","title_canon_sha256":"febba670b569a6571172bd3b50c9bdfae59a01440920b0cdca1e89193afc2e98"},"schema_version":"1.0","source":{"id":"1905.11394","kind":"arxiv","version":2}},"canonical_sha256":"119020d1491182a71e563152bc279b8415a6122862bed0771d38a8542cd9f8c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"119020d1491182a71e563152bc279b8415a6122862bed0771d38a8542cd9f8c7","first_computed_at":"2026-05-17T23:43:32.573387Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:32.573387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y/nnb7fgZ1n1IzZxbTeiCWgA+MeUd/sDSMMSQt+/t7IUurM7iidmRDd87bzVdul5ctbcysIMclDujnpkT/MhDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:32.573763Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.11394","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbc52116ffce050fc13bc2cffda7198775367c77159064a4e658f974826a0d64","sha256:e93b7034fc4367f65f0527ed9c314e0c05121acfe02e80d0c2eddb6b5b457d44"],"state_sha256":"66502441a4b1ec8035890ce3f05324dff1c4eec592b1434c3a1806df709b4dcd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6SO/qd+R9e527Z5Z5irXT63LkKCsZQjqYdtFwBEEpT0I2jPvDqQbjdyy6otQ8cEMzRXj5fYtU+YBM5/dGpauAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T22:47:13.716584Z","bundle_sha256":"7e8f27b3cd6b57a661e02b399264f08b8e075cec920bf195f00c87ed282f6272"}}