{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JF7L4UFSHJ62VTZWOWX3VOUQJG","short_pith_number":"pith:JF7L4UFS","canonical_record":{"source":{"id":"1312.1666","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-05T20:04:52Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA","math.OC"],"title_canon_sha256":"153faab22d0d0b09a05ac7f6ad65cc14763cf3fbf58602cc36c2e38bbe3abe1c","abstract_canon_sha256":"c39968e4f38a929b416cc906390eddc166039c35ccf671375a44daeb85b5cb8d"},"schema_version":"1.0"},"canonical_sha256":"497ebe50b23a7daacf3675afbaba9049a30d774664f31c83bcca8a4482c5862f","source":{"kind":"arxiv","id":"1312.1666","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1666","created_at":"2026-05-18T01:48:06Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1666v2","created_at":"2026-05-18T01:48:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1666","created_at":"2026-05-18T01:48:06Z"},{"alias_kind":"pith_short_12","alias_value":"JF7L4UFSHJ62","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JF7L4UFSHJ62VTZW","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JF7L4UFS","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JF7L4UFSHJ62VTZWOWX3VOUQJG","target":"record","payload":{"canonical_record":{"source":{"id":"1312.1666","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-05T20:04:52Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA","math.OC"],"title_canon_sha256":"153faab22d0d0b09a05ac7f6ad65cc14763cf3fbf58602cc36c2e38bbe3abe1c","abstract_canon_sha256":"c39968e4f38a929b416cc906390eddc166039c35ccf671375a44daeb85b5cb8d"},"schema_version":"1.0"},"canonical_sha256":"497ebe50b23a7daacf3675afbaba9049a30d774664f31c83bcca8a4482c5862f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:48:06.889360Z","signature_b64":"X5ILiM5FfWc8PSrCVqS1FmasFgAUo9CszH+0pPL9KtI9UMWeyt7ziw/d04wMhL8LFGb78wTjQ3DRV5sJfeI5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"497ebe50b23a7daacf3675afbaba9049a30d774664f31c83bcca8a4482c5862f","last_reissued_at":"2026-05-18T01:48:06.888818Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:48:06.888818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.1666","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-18T01:48:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LVmn0aMVOZqV+cxjRREI5v/YQdNplKUzDy9rSlguOLOJBnT03Q2H20sN73lYJW4YMl7l/A55Yu8BcIID3gY/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T00:50:32.162810Z"},"content_sha256":"c9295fae498f4a9b872610967ba84a576f8ae59bd9cc8fb182ce9cd4d4e4f76d","schema_version":"1.0","event_id":"sha256:c9295fae498f4a9b872610967ba84a576f8ae59bd9cc8fb182ce9cd4d4e4f76d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JF7L4UFSHJ62VTZWOWX3VOUQJG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Semi-Stochastic Gradient Descent Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA","math.OC"],"primary_cat":"stat.ML","authors_text":"Jakub Kone\\v{c}n\\'y, Peter Richt\\'arik","submitted_at":"2013-12-05T20:04:52Z","abstract_excerpt":"In this paper we study the problem of minimizing the average of a large number ($n$) of smooth convex loss functions. We propose a new method, S2GD (Semi-Stochastic Gradient Descent), which runs for one or several epochs in each of which a single full gradient and a random number of stochastic gradients is computed, following a geometric law. The total work needed for the method to output an $\\varepsilon$-accurate solution in expectation, measured in the number of passes over data, or equivalently, in units equivalent to the computation of a single gradient of the loss, is $O((\\kappa/n)\\log(1/"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1666","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-18T01:48:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"18Y3iZQwlpnf498Y6C7dandngXg5cWRkqtw8yoT7E5QaWZ0tmYSmmnKWhS9luLWJeSZJx8rwDiI7I8OfIKQ3BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T00:50:32.163531Z"},"content_sha256":"089653127fce0a9de19e014c43a2253392ed132f11bdf437a53a73ce0d8fd1b9","schema_version":"1.0","event_id":"sha256:089653127fce0a9de19e014c43a2253392ed132f11bdf437a53a73ce0d8fd1b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JF7L4UFSHJ62VTZWOWX3VOUQJG/bundle.json","state_url":"https://pith.science/pith/JF7L4UFSHJ62VTZWOWX3VOUQJG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JF7L4UFSHJ62VTZWOWX3VOUQJG/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-24T00:50:32Z","links":{"resolver":"https://pith.science/pith/JF7L4UFSHJ62VTZWOWX3VOUQJG","bundle":"https://pith.science/pith/JF7L4UFSHJ62VTZWOWX3VOUQJG/bundle.json","state":"https://pith.science/pith/JF7L4UFSHJ62VTZWOWX3VOUQJG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JF7L4UFSHJ62VTZWOWX3VOUQJG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JF7L4UFSHJ62VTZWOWX3VOUQJG","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":"c39968e4f38a929b416cc906390eddc166039c35ccf671375a44daeb85b5cb8d","cross_cats_sorted":["cs.LG","cs.NA","math.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-05T20:04:52Z","title_canon_sha256":"153faab22d0d0b09a05ac7f6ad65cc14763cf3fbf58602cc36c2e38bbe3abe1c"},"schema_version":"1.0","source":{"id":"1312.1666","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.1666","created_at":"2026-05-18T01:48:06Z"},{"alias_kind":"arxiv_version","alias_value":"1312.1666v2","created_at":"2026-05-18T01:48:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.1666","created_at":"2026-05-18T01:48:06Z"},{"alias_kind":"pith_short_12","alias_value":"JF7L4UFSHJ62","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JF7L4UFSHJ62VTZW","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JF7L4UFS","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:089653127fce0a9de19e014c43a2253392ed132f11bdf437a53a73ce0d8fd1b9","target":"graph","created_at":"2026-05-18T01:48:06Z","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 study the problem of minimizing the average of a large number ($n$) of smooth convex loss functions. We propose a new method, S2GD (Semi-Stochastic Gradient Descent), which runs for one or several epochs in each of which a single full gradient and a random number of stochastic gradients is computed, following a geometric law. The total work needed for the method to output an $\\varepsilon$-accurate solution in expectation, measured in the number of passes over data, or equivalently, in units equivalent to the computation of a single gradient of the loss, is $O((\\kappa/n)\\log(1/","authors_text":"Jakub Kone\\v{c}n\\'y, Peter Richt\\'arik","cross_cats":["cs.LG","cs.NA","math.NA","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-05T20:04:52Z","title":"Semi-Stochastic Gradient Descent Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.1666","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:c9295fae498f4a9b872610967ba84a576f8ae59bd9cc8fb182ce9cd4d4e4f76d","target":"record","created_at":"2026-05-18T01:48:06Z","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":"c39968e4f38a929b416cc906390eddc166039c35ccf671375a44daeb85b5cb8d","cross_cats_sorted":["cs.LG","cs.NA","math.NA","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-05T20:04:52Z","title_canon_sha256":"153faab22d0d0b09a05ac7f6ad65cc14763cf3fbf58602cc36c2e38bbe3abe1c"},"schema_version":"1.0","source":{"id":"1312.1666","kind":"arxiv","version":2}},"canonical_sha256":"497ebe50b23a7daacf3675afbaba9049a30d774664f31c83bcca8a4482c5862f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"497ebe50b23a7daacf3675afbaba9049a30d774664f31c83bcca8a4482c5862f","first_computed_at":"2026-05-18T01:48:06.888818Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:48:06.888818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X5ILiM5FfWc8PSrCVqS1FmasFgAUo9CszH+0pPL9KtI9UMWeyt7ziw/d04wMhL8LFGb78wTjQ3DRV5sJfeI5BA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:48:06.889360Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.1666","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9295fae498f4a9b872610967ba84a576f8ae59bd9cc8fb182ce9cd4d4e4f76d","sha256:089653127fce0a9de19e014c43a2253392ed132f11bdf437a53a73ce0d8fd1b9"],"state_sha256":"2e0258cdc7764ad5fd06c371fa9a8acb47aa31f615e19cabb8fdb64873707c95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c4ikPxmYnsvhE5OuqHBsdqyiTuSLE4LHkDnsVgws7FIk86vs8noMyo/SdqIAV7Aq4orXXFsIkzOVK1glMz99CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T00:50:32.167527Z","bundle_sha256":"e43fc07b37972371f4eb26fdc3aa3a1139d760c7e1e25cc9f394a50b97f2b4e9"}}