{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3PS24SKDTFXHB3ECVSQW4L6CQV","short_pith_number":"pith:3PS24SKD","canonical_record":{"source":{"id":"1707.01155","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-04T21:15:14Z","cross_cats_sorted":[],"title_canon_sha256":"2186c5a5609b06b1e5b7a33bfa0c4b9c988a9bcafb0baa159fb01ce0db94d1f7","abstract_canon_sha256":"bcd9ab7b1713785eabe8ae919cc5035dc0b02825230026d1e52cd96379360342"},"schema_version":"1.0"},"canonical_sha256":"dbe5ae4943996e70ec82aca16e2fc28576dcd0aadaed0556eedb3d8fa95921bf","source":{"kind":"arxiv","id":"1707.01155","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01155","created_at":"2026-05-18T00:40:53Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01155v1","created_at":"2026-05-18T00:40:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01155","created_at":"2026-05-18T00:40:53Z"},{"alias_kind":"pith_short_12","alias_value":"3PS24SKDTFXH","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3PS24SKDTFXHB3EC","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3PS24SKD","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3PS24SKDTFXHB3ECVSQW4L6CQV","target":"record","payload":{"canonical_record":{"source":{"id":"1707.01155","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-04T21:15:14Z","cross_cats_sorted":[],"title_canon_sha256":"2186c5a5609b06b1e5b7a33bfa0c4b9c988a9bcafb0baa159fb01ce0db94d1f7","abstract_canon_sha256":"bcd9ab7b1713785eabe8ae919cc5035dc0b02825230026d1e52cd96379360342"},"schema_version":"1.0"},"canonical_sha256":"dbe5ae4943996e70ec82aca16e2fc28576dcd0aadaed0556eedb3d8fa95921bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:53.536344Z","signature_b64":"jV5G3FlUmyAShtuBK3vZpwUMqEUKCTCBgDbeMF3qxTBJG/r4wfW+shKp2WuEO+yUGRlGCTemAT92Omsh0jbyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbe5ae4943996e70ec82aca16e2fc28576dcd0aadaed0556eedb3d8fa95921bf","last_reissued_at":"2026-05-18T00:40:53.535843Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:53.535843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.01155","source_version":1,"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:40:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a5+2euzsDLsu9Yj9wKaj9qQkydi5+GPOtPzLJVPlsLk4wiIdA5MgW351avcIpAqT54pbcDlhyoAs5+SCUvgoBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:28:07.791196Z"},"content_sha256":"335ca02fff390900541c91951edcb81cb1d8f670950bab66a110466bec76ed5d","schema_version":"1.0","event_id":"sha256:335ca02fff390900541c91951edcb81cb1d8f670950bab66a110466bec76ed5d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3PS24SKDTFXHB3ECVSQW4L6CQV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic, Distributed and Federated Optimization for Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jakub Kone\\v{c}n\\'y","submitted_at":"2017-07-04T21:15:14Z","abstract_excerpt":"We study optimization algorithms for the finite sum problems frequently arising in machine learning applications. First, we propose novel variants of stochastic gradient descent with a variance reduction property that enables linear convergence for strongly convex objectives. Second, we study distributed setting, in which the data describing the optimization problem does not fit into a single computing node. In this case, traditional methods are inefficient, as the communication costs inherent in distributed optimization become the bottleneck. We propose a communication-efficient framework whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01155","kind":"arxiv","version":1},"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:40:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vv80iKZqpdV9vm9muVIxg1aUeFQTwiQ4FMGglRAzIQDrIt1mvBoLMeUJoL+uKh6q7nZqqPgYkPSuVmZE2Y6CDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T20:28:07.791864Z"},"content_sha256":"597a92739167a7dc1ac8fed6ae68174d6dc69b787943a1baef256b9838104e24","schema_version":"1.0","event_id":"sha256:597a92739167a7dc1ac8fed6ae68174d6dc69b787943a1baef256b9838104e24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3PS24SKDTFXHB3ECVSQW4L6CQV/bundle.json","state_url":"https://pith.science/pith/3PS24SKDTFXHB3ECVSQW4L6CQV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3PS24SKDTFXHB3ECVSQW4L6CQV/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-06T20:28:07Z","links":{"resolver":"https://pith.science/pith/3PS24SKDTFXHB3ECVSQW4L6CQV","bundle":"https://pith.science/pith/3PS24SKDTFXHB3ECVSQW4L6CQV/bundle.json","state":"https://pith.science/pith/3PS24SKDTFXHB3ECVSQW4L6CQV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3PS24SKDTFXHB3ECVSQW4L6CQV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3PS24SKDTFXHB3ECVSQW4L6CQV","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":"bcd9ab7b1713785eabe8ae919cc5035dc0b02825230026d1e52cd96379360342","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-04T21:15:14Z","title_canon_sha256":"2186c5a5609b06b1e5b7a33bfa0c4b9c988a9bcafb0baa159fb01ce0db94d1f7"},"schema_version":"1.0","source":{"id":"1707.01155","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.01155","created_at":"2026-05-18T00:40:53Z"},{"alias_kind":"arxiv_version","alias_value":"1707.01155v1","created_at":"2026-05-18T00:40:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01155","created_at":"2026-05-18T00:40:53Z"},{"alias_kind":"pith_short_12","alias_value":"3PS24SKDTFXH","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3PS24SKDTFXHB3EC","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3PS24SKD","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:597a92739167a7dc1ac8fed6ae68174d6dc69b787943a1baef256b9838104e24","target":"graph","created_at":"2026-05-18T00:40:53Z","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":"We study optimization algorithms for the finite sum problems frequently arising in machine learning applications. First, we propose novel variants of stochastic gradient descent with a variance reduction property that enables linear convergence for strongly convex objectives. Second, we study distributed setting, in which the data describing the optimization problem does not fit into a single computing node. In this case, traditional methods are inefficient, as the communication costs inherent in distributed optimization become the bottleneck. We propose a communication-efficient framework whi","authors_text":"Jakub Kone\\v{c}n\\'y","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-04T21:15:14Z","title":"Stochastic, Distributed and Federated Optimization for Machine Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01155","kind":"arxiv","version":1},"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:335ca02fff390900541c91951edcb81cb1d8f670950bab66a110466bec76ed5d","target":"record","created_at":"2026-05-18T00:40:53Z","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":"bcd9ab7b1713785eabe8ae919cc5035dc0b02825230026d1e52cd96379360342","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-07-04T21:15:14Z","title_canon_sha256":"2186c5a5609b06b1e5b7a33bfa0c4b9c988a9bcafb0baa159fb01ce0db94d1f7"},"schema_version":"1.0","source":{"id":"1707.01155","kind":"arxiv","version":1}},"canonical_sha256":"dbe5ae4943996e70ec82aca16e2fc28576dcd0aadaed0556eedb3d8fa95921bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dbe5ae4943996e70ec82aca16e2fc28576dcd0aadaed0556eedb3d8fa95921bf","first_computed_at":"2026-05-18T00:40:53.535843Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:53.535843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jV5G3FlUmyAShtuBK3vZpwUMqEUKCTCBgDbeMF3qxTBJG/r4wfW+shKp2WuEO+yUGRlGCTemAT92Omsh0jbyBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:53.536344Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.01155","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:335ca02fff390900541c91951edcb81cb1d8f670950bab66a110466bec76ed5d","sha256:597a92739167a7dc1ac8fed6ae68174d6dc69b787943a1baef256b9838104e24"],"state_sha256":"cef4ef0cb8c62186a815bce757de8d4016a20990de635ea0ee08d12a94bf566d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lF5gQRZ10KTMl53scV2NswELdd68g1yMmOlsboNwNVqy+yEKjuKPDeahGpLjy0WH+zq71yRD3brrzwkYevuNDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T20:28:07.795072Z","bundle_sha256":"f6d2438c3d7842335cf6623b157ee5c20f573194ebcee30fe144a169e15c70ec"}}