{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AYX7UHAGBGIC63SEMHYY5ESVZN","short_pith_number":"pith:AYX7UHAG","canonical_record":{"source":{"id":"1504.04407","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-04-16T23:31:38Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"559fd3eb1d030fff319636ec494d8c934bd1a2045b99e935119560a9bb174f59","abstract_canon_sha256":"7f7fe05374be2ec5524a435dff6ec1da9f11a994aa408c3f86021dd6075584b3"},"schema_version":"1.0"},"canonical_sha256":"062ffa1c0609902f6e4461f18e9255cb7ba29afe1bc82358aff34e26b737a3ca","source":{"kind":"arxiv","id":"1504.04407","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04407","created_at":"2026-05-18T01:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04407v2","created_at":"2026-05-18T01:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04407","created_at":"2026-05-18T01:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"AYX7UHAGBGIC","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"AYX7UHAGBGIC63SE","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"AYX7UHAG","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AYX7UHAGBGIC63SEMHYY5ESVZN","target":"record","payload":{"canonical_record":{"source":{"id":"1504.04407","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-04-16T23:31:38Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"559fd3eb1d030fff319636ec494d8c934bd1a2045b99e935119560a9bb174f59","abstract_canon_sha256":"7f7fe05374be2ec5524a435dff6ec1da9f11a994aa408c3f86021dd6075584b3"},"schema_version":"1.0"},"canonical_sha256":"062ffa1c0609902f6e4461f18e9255cb7ba29afe1bc82358aff34e26b737a3ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:50.848698Z","signature_b64":"LdwuU5KHBLi8URHEKQkmfUt1h1pMk2ZSkdjr//PS1IMw3xBnUr64aUgE2mTP7LvcDJL8y18573zJx7F7CrJGCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"062ffa1c0609902f6e4461f18e9255cb7ba29afe1bc82358aff34e26b737a3ca","last_reissued_at":"2026-05-18T01:16:50.848012Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:50.848012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.04407","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:16:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CS4q22/1sek3qcSuME3YmeZtbtkiHF9T40V4aa//mIGv5xPSjrPER4P/FMs/eUNIEZLCfrAITGMfd1Se4S30CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:47:52.480686Z"},"content_sha256":"478203a2e893387e5493c838ccb137bd093b0cf7256ad4fe410ec1e0d23324c0","schema_version":"1.0","event_id":"sha256:478203a2e893387e5493c838ccb137bd093b0cf7256ad4fe410ec1e0d23324c0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AYX7UHAGBGIC63SEMHYY5ESVZN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mini-Batch Semi-Stochastic Gradient Descent in the Proximal Setting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jakub Kone\\v{c}n\\'y, Jie Liu, Martin Tak\\'a\\v{c}, Peter Richt\\'arik","submitted_at":"2015-04-16T23:31:38Z","abstract_excerpt":"We propose mS2GD: a method incorporating a mini-batching scheme for improving the theoretical complexity and practical performance of semi-stochastic gradient descent (S2GD). We consider the problem of minimizing a strongly convex function represented as the sum of an average of a large number of smooth convex functions, and a simple nonsmooth convex regularizer. Our method first performs a deterministic step (computation of the gradient of the objective function at the starting point), followed by a large number of stochastic steps. The process is repeated a few times with the last iterate be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04407","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:16:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WdtXhskWsHcRt6gHrbnfSQvrtsOo3pxoqSVBaubjLjCWjR8wgxgJEVioTGBDCnt3f190mi+7mH/06FRazFDnAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:47:52.481426Z"},"content_sha256":"fc0b5220e23d6a5d8e8bbc0c1891756621afdbb7b41fba5158f6c41532c9587a","schema_version":"1.0","event_id":"sha256:fc0b5220e23d6a5d8e8bbc0c1891756621afdbb7b41fba5158f6c41532c9587a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AYX7UHAGBGIC63SEMHYY5ESVZN/bundle.json","state_url":"https://pith.science/pith/AYX7UHAGBGIC63SEMHYY5ESVZN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AYX7UHAGBGIC63SEMHYY5ESVZN/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-25T23:47:52Z","links":{"resolver":"https://pith.science/pith/AYX7UHAGBGIC63SEMHYY5ESVZN","bundle":"https://pith.science/pith/AYX7UHAGBGIC63SEMHYY5ESVZN/bundle.json","state":"https://pith.science/pith/AYX7UHAGBGIC63SEMHYY5ESVZN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AYX7UHAGBGIC63SEMHYY5ESVZN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AYX7UHAGBGIC63SEMHYY5ESVZN","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":"7f7fe05374be2ec5524a435dff6ec1da9f11a994aa408c3f86021dd6075584b3","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-04-16T23:31:38Z","title_canon_sha256":"559fd3eb1d030fff319636ec494d8c934bd1a2045b99e935119560a9bb174f59"},"schema_version":"1.0","source":{"id":"1504.04407","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04407","created_at":"2026-05-18T01:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04407v2","created_at":"2026-05-18T01:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04407","created_at":"2026-05-18T01:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"AYX7UHAGBGIC","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"AYX7UHAGBGIC63SE","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"AYX7UHAG","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:fc0b5220e23d6a5d8e8bbc0c1891756621afdbb7b41fba5158f6c41532c9587a","target":"graph","created_at":"2026-05-18T01:16:50Z","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 propose mS2GD: a method incorporating a mini-batching scheme for improving the theoretical complexity and practical performance of semi-stochastic gradient descent (S2GD). We consider the problem of minimizing a strongly convex function represented as the sum of an average of a large number of smooth convex functions, and a simple nonsmooth convex regularizer. Our method first performs a deterministic step (computation of the gradient of the objective function at the starting point), followed by a large number of stochastic steps. The process is repeated a few times with the last iterate be","authors_text":"Jakub Kone\\v{c}n\\'y, Jie Liu, Martin Tak\\'a\\v{c}, Peter Richt\\'arik","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-04-16T23:31:38Z","title":"Mini-Batch Semi-Stochastic Gradient Descent in the Proximal Setting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04407","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:478203a2e893387e5493c838ccb137bd093b0cf7256ad4fe410ec1e0d23324c0","target":"record","created_at":"2026-05-18T01:16:50Z","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":"7f7fe05374be2ec5524a435dff6ec1da9f11a994aa408c3f86021dd6075584b3","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-04-16T23:31:38Z","title_canon_sha256":"559fd3eb1d030fff319636ec494d8c934bd1a2045b99e935119560a9bb174f59"},"schema_version":"1.0","source":{"id":"1504.04407","kind":"arxiv","version":2}},"canonical_sha256":"062ffa1c0609902f6e4461f18e9255cb7ba29afe1bc82358aff34e26b737a3ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"062ffa1c0609902f6e4461f18e9255cb7ba29afe1bc82358aff34e26b737a3ca","first_computed_at":"2026-05-18T01:16:50.848012Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:50.848012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LdwuU5KHBLi8URHEKQkmfUt1h1pMk2ZSkdjr//PS1IMw3xBnUr64aUgE2mTP7LvcDJL8y18573zJx7F7CrJGCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:50.848698Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.04407","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:478203a2e893387e5493c838ccb137bd093b0cf7256ad4fe410ec1e0d23324c0","sha256:fc0b5220e23d6a5d8e8bbc0c1891756621afdbb7b41fba5158f6c41532c9587a"],"state_sha256":"a2f2a5b6be9b3cdc17ed2c285c193c51ce84e01467d5c70b955362fc6b59517b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LTIZPBfMfGoqtH7btlHrEnfM3HfqWho4ZgcoDGcWPbDuhFRpGbiVLjqFRgaIguDD1/je4WCzreyb5i5pU3q2Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:47:52.485155Z","bundle_sha256":"10e0c8f6c4fafeb191b5ba59dc1e8751c690f9bf7eb63158ce20616fa539f57e"}}