{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GOXHU4LFZRP45WF5DVXWEIMGED","short_pith_number":"pith:GOXHU4LF","canonical_record":{"source":{"id":"1605.08882","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-28T12:11:22Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"d047fb2901a248a09962a958761b7d6527701619d9e6880e6ef14260047d47cf","abstract_canon_sha256":"9ad0aae59e40e5070a1b12823a9cb8c76e08b350ebe1607c13b8d020fbbc93ab"},"schema_version":"1.0"},"canonical_sha256":"33ae7a7165cc5fced8bd1d6f62218620c26bdb44e2bbb91113c383a56be90ce1","source":{"kind":"arxiv","id":"1605.08882","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08882","created_at":"2026-05-17T23:51:15Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08882v3","created_at":"2026-05-17T23:51:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08882","created_at":"2026-05-17T23:51:15Z"},{"alias_kind":"pith_short_12","alias_value":"GOXHU4LFZRP4","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GOXHU4LFZRP45WF5","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GOXHU4LF","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GOXHU4LFZRP45WF5DVXWEIMGED","target":"record","payload":{"canonical_record":{"source":{"id":"1605.08882","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-28T12:11:22Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"d047fb2901a248a09962a958761b7d6527701619d9e6880e6ef14260047d47cf","abstract_canon_sha256":"9ad0aae59e40e5070a1b12823a9cb8c76e08b350ebe1607c13b8d020fbbc93ab"},"schema_version":"1.0"},"canonical_sha256":"33ae7a7165cc5fced8bd1d6f62218620c26bdb44e2bbb91113c383a56be90ce1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:15.035493Z","signature_b64":"O9sGLJbtvLKg0MdVjE/qDaLYP8NJvh8xFOafT/3bIaa+42Tun4mVvz45vrIlpQNQuGBBrU7u4mE3tAdlnVRvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33ae7a7165cc5fced8bd1d6f62218620c26bdb44e2bbb91113c383a56be90ce1","last_reissued_at":"2026-05-17T23:51:15.034911Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:15.034911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.08882","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:51:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w12OsjxF42Cxp93t+QvTvj1w69AzL4+Vy8isz/97N1y+iVgJu01riWKZICSHfFx5tCD4QjUzNDsxLJaO3Fn7BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:06:14.739597Z"},"content_sha256":"242bdd58a1ee4aa0a9da854db304af8f210a717b1cffa23a87ecf979b35e88df","schema_version":"1.0","event_id":"sha256:242bdd58a1ee4aa0a9da854db304af8f210a717b1cffa23a87ecf979b35e88df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GOXHU4LFZRP45WF5DVXWEIMGED","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Rates for Multi-pass Stochastic Gradient Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Junhong Lin, Lorenzo Rosasco","submitted_at":"2016-05-28T12:11:22Z","abstract_excerpt":"We analyze the learning properties of the stochastic gradient method when multiple passes over the data and mini-batches are allowed. We study how regularization properties are controlled by the step-size, the number of passes and the mini-batch size. In particular, we consider the square loss and show that for a universal step-size choice, the number of passes acts as a regularization parameter, and optimal finite sample bounds can be achieved by early-stopping. Moreover, we show that larger step-sizes are allowed when considering mini-batches. Our analysis is based on a unifying approach, en"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08882","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:51:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AKbpOIfkSBN8pqKAtg/TflXQdXjRfVPlA/HF7SKPT1dUNi6GLPFzoWkE18P5y1aL5akRvGs1IT+owRHfHs92AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:06:14.740458Z"},"content_sha256":"b7cbfce5e91e692a2768d04409e36e12f5dcbb19e94bb4bea678a8c660ea6370","schema_version":"1.0","event_id":"sha256:b7cbfce5e91e692a2768d04409e36e12f5dcbb19e94bb4bea678a8c660ea6370"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GOXHU4LFZRP45WF5DVXWEIMGED/bundle.json","state_url":"https://pith.science/pith/GOXHU4LFZRP45WF5DVXWEIMGED/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GOXHU4LFZRP45WF5DVXWEIMGED/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-26T23:06:14Z","links":{"resolver":"https://pith.science/pith/GOXHU4LFZRP45WF5DVXWEIMGED","bundle":"https://pith.science/pith/GOXHU4LFZRP45WF5DVXWEIMGED/bundle.json","state":"https://pith.science/pith/GOXHU4LFZRP45WF5DVXWEIMGED/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GOXHU4LFZRP45WF5DVXWEIMGED/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GOXHU4LFZRP45WF5DVXWEIMGED","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":"9ad0aae59e40e5070a1b12823a9cb8c76e08b350ebe1607c13b8d020fbbc93ab","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-28T12:11:22Z","title_canon_sha256":"d047fb2901a248a09962a958761b7d6527701619d9e6880e6ef14260047d47cf"},"schema_version":"1.0","source":{"id":"1605.08882","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08882","created_at":"2026-05-17T23:51:15Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08882v3","created_at":"2026-05-17T23:51:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08882","created_at":"2026-05-17T23:51:15Z"},{"alias_kind":"pith_short_12","alias_value":"GOXHU4LFZRP4","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GOXHU4LFZRP45WF5","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GOXHU4LF","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:b7cbfce5e91e692a2768d04409e36e12f5dcbb19e94bb4bea678a8c660ea6370","target":"graph","created_at":"2026-05-17T23:51:15Z","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 analyze the learning properties of the stochastic gradient method when multiple passes over the data and mini-batches are allowed. We study how regularization properties are controlled by the step-size, the number of passes and the mini-batch size. In particular, we consider the square loss and show that for a universal step-size choice, the number of passes acts as a regularization parameter, and optimal finite sample bounds can be achieved by early-stopping. Moreover, we show that larger step-sizes are allowed when considering mini-batches. Our analysis is based on a unifying approach, en","authors_text":"Junhong Lin, Lorenzo Rosasco","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-28T12:11:22Z","title":"Optimal Rates for Multi-pass Stochastic Gradient Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08882","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:242bdd58a1ee4aa0a9da854db304af8f210a717b1cffa23a87ecf979b35e88df","target":"record","created_at":"2026-05-17T23:51:15Z","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":"9ad0aae59e40e5070a1b12823a9cb8c76e08b350ebe1607c13b8d020fbbc93ab","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-05-28T12:11:22Z","title_canon_sha256":"d047fb2901a248a09962a958761b7d6527701619d9e6880e6ef14260047d47cf"},"schema_version":"1.0","source":{"id":"1605.08882","kind":"arxiv","version":3}},"canonical_sha256":"33ae7a7165cc5fced8bd1d6f62218620c26bdb44e2bbb91113c383a56be90ce1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33ae7a7165cc5fced8bd1d6f62218620c26bdb44e2bbb91113c383a56be90ce1","first_computed_at":"2026-05-17T23:51:15.034911Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:15.034911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"O9sGLJbtvLKg0MdVjE/qDaLYP8NJvh8xFOafT/3bIaa+42Tun4mVvz45vrIlpQNQuGBBrU7u4mE3tAdlnVRvAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:15.035493Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.08882","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:242bdd58a1ee4aa0a9da854db304af8f210a717b1cffa23a87ecf979b35e88df","sha256:b7cbfce5e91e692a2768d04409e36e12f5dcbb19e94bb4bea678a8c660ea6370"],"state_sha256":"def7bcb32e3ee6847bad1bef84f8aa0c49b18336e4fafbb50cc472e5266139cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"blsup9rr5JtfuiQDzImsJVMe+3TwpM+aJ0s72cRzWaXcd0/H3b3jevIvkcjff0rArtvS2BDPR7AuERnj7VqpCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:06:14.744041Z","bundle_sha256":"cb0a45c8f83683bea13665c583e073cede383c2399ad1419f7c5668109a9c37e"}}