{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DXY4MLR7FVAKE2YQYYMEMQ5OE4","short_pith_number":"pith:DXY4MLR7","canonical_record":{"source":{"id":"1805.10074","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-25T10:45:09Z","cross_cats_sorted":["math.OC","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"7d0bad674a845cdb9e1863448f9ccc744c01c7bb65ce29b7bfcebff9a37ba115","abstract_canon_sha256":"c513fb1e24f10b6aed023f06c4dae4c19a7fa4868d1529bfd449ca6018f74012"},"schema_version":"1.0"},"canonical_sha256":"1df1c62e3f2d40a26b10c6184643ae2738e0e3cdb2037a8b87faa66a1bfb7836","source":{"kind":"arxiv","id":"1805.10074","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10074","created_at":"2026-05-18T00:00:08Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10074v3","created_at":"2026-05-18T00:00:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10074","created_at":"2026-05-18T00:00:08Z"},{"alias_kind":"pith_short_12","alias_value":"DXY4MLR7FVAK","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DXY4MLR7FVAKE2YQ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DXY4MLR7","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DXY4MLR7FVAKE2YQYYMEMQ5OE4","target":"record","payload":{"canonical_record":{"source":{"id":"1805.10074","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-25T10:45:09Z","cross_cats_sorted":["math.OC","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"7d0bad674a845cdb9e1863448f9ccc744c01c7bb65ce29b7bfcebff9a37ba115","abstract_canon_sha256":"c513fb1e24f10b6aed023f06c4dae4c19a7fa4868d1529bfd449ca6018f74012"},"schema_version":"1.0"},"canonical_sha256":"1df1c62e3f2d40a26b10c6184643ae2738e0e3cdb2037a8b87faa66a1bfb7836","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:08.530672Z","signature_b64":"b85TTSiRZevSVe0jGlxHLMRr19nJRFDpQrukfPPbWp/L6PF6KykZyfUKLP11T3NgrMGaWcPPl/MH1qXzRpRICQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1df1c62e3f2d40a26b10c6184643ae2738e0e3cdb2037a8b87faa66a1bfb7836","last_reissued_at":"2026-05-18T00:00:08.530196Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:08.530196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.10074","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-18T00:00:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F6D0G/LzddU+WvUdbCWXeCF6uIs8uyNTE+396WN/uoKWAa4mC9yff4JfNXB1AV9mJH1hL3Vx+Ihu7saRZZiyAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:30:27.835571Z"},"content_sha256":"ae1c18e03de24e5eecbcb0b4df1142d7303fe5df850bdf462b3afd962287c983","schema_version":"1.0","event_id":"sha256:ae1c18e03de24e5eecbcb0b4df1142d7303fe5df850bdf462b3afd962287c983"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DXY4MLR7FVAKE2YQYYMEMQ5OE4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Statistical Optimality of Stochastic Gradient Descent on Hard Learning Problems through Multiple Passes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Alessandro Rudi (SIERRA, Francis Bach (SIERRA, Loucas Pillaud-Vivien (SIERRA, PSL)","submitted_at":"2018-05-25T10:45:09Z","abstract_excerpt":"We consider stochastic gradient descent (SGD) for least-squares regression with potentially several passes over the data. While several passes have been widely reported to perform practically better in terms of predictive performance on unseen data, the existing theoretical analysis of SGD suggests that a single pass is statistically optimal. While this is true for low-dimensional easy problems, we show that for hard problems, multiple passes lead to statistically optimal predictions while single pass does not; we also show that in these hard models, the optimal number of passes over the data "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10074","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-18T00:00:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YGK9RGJrnyZ7k8lJ7aQJOoZG//fBa7gx9BUXfK06ACmwJlsT1iZMmkbgDi9qfRAbpulnNEGab3zwHkK/SX7/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:30:27.836189Z"},"content_sha256":"2c98ccaf18ea5cbc7ad254ab351db26a362675fe2f811882aec46d4bd0ab9889","schema_version":"1.0","event_id":"sha256:2c98ccaf18ea5cbc7ad254ab351db26a362675fe2f811882aec46d4bd0ab9889"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DXY4MLR7FVAKE2YQYYMEMQ5OE4/bundle.json","state_url":"https://pith.science/pith/DXY4MLR7FVAKE2YQYYMEMQ5OE4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DXY4MLR7FVAKE2YQYYMEMQ5OE4/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-31T16:30:27Z","links":{"resolver":"https://pith.science/pith/DXY4MLR7FVAKE2YQYYMEMQ5OE4","bundle":"https://pith.science/pith/DXY4MLR7FVAKE2YQYYMEMQ5OE4/bundle.json","state":"https://pith.science/pith/DXY4MLR7FVAKE2YQYYMEMQ5OE4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DXY4MLR7FVAKE2YQYYMEMQ5OE4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DXY4MLR7FVAKE2YQYYMEMQ5OE4","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":"c513fb1e24f10b6aed023f06c4dae4c19a7fa4868d1529bfd449ca6018f74012","cross_cats_sorted":["math.OC","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-25T10:45:09Z","title_canon_sha256":"7d0bad674a845cdb9e1863448f9ccc744c01c7bb65ce29b7bfcebff9a37ba115"},"schema_version":"1.0","source":{"id":"1805.10074","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10074","created_at":"2026-05-18T00:00:08Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10074v3","created_at":"2026-05-18T00:00:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10074","created_at":"2026-05-18T00:00:08Z"},{"alias_kind":"pith_short_12","alias_value":"DXY4MLR7FVAK","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DXY4MLR7FVAKE2YQ","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DXY4MLR7","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:2c98ccaf18ea5cbc7ad254ab351db26a362675fe2f811882aec46d4bd0ab9889","target":"graph","created_at":"2026-05-18T00:00:08Z","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 consider stochastic gradient descent (SGD) for least-squares regression with potentially several passes over the data. While several passes have been widely reported to perform practically better in terms of predictive performance on unseen data, the existing theoretical analysis of SGD suggests that a single pass is statistically optimal. While this is true for low-dimensional easy problems, we show that for hard problems, multiple passes lead to statistically optimal predictions while single pass does not; we also show that in these hard models, the optimal number of passes over the data ","authors_text":"Alessandro Rudi (SIERRA, Francis Bach (SIERRA, Loucas Pillaud-Vivien (SIERRA, PSL)","cross_cats":["math.OC","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-25T10:45:09Z","title":"Statistical Optimality of Stochastic Gradient Descent on Hard Learning Problems through Multiple Passes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10074","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:ae1c18e03de24e5eecbcb0b4df1142d7303fe5df850bdf462b3afd962287c983","target":"record","created_at":"2026-05-18T00:00:08Z","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":"c513fb1e24f10b6aed023f06c4dae4c19a7fa4868d1529bfd449ca6018f74012","cross_cats_sorted":["math.OC","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-25T10:45:09Z","title_canon_sha256":"7d0bad674a845cdb9e1863448f9ccc744c01c7bb65ce29b7bfcebff9a37ba115"},"schema_version":"1.0","source":{"id":"1805.10074","kind":"arxiv","version":3}},"canonical_sha256":"1df1c62e3f2d40a26b10c6184643ae2738e0e3cdb2037a8b87faa66a1bfb7836","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1df1c62e3f2d40a26b10c6184643ae2738e0e3cdb2037a8b87faa66a1bfb7836","first_computed_at":"2026-05-18T00:00:08.530196Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:08.530196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b85TTSiRZevSVe0jGlxHLMRr19nJRFDpQrukfPPbWp/L6PF6KykZyfUKLP11T3NgrMGaWcPPl/MH1qXzRpRICQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:08.530672Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.10074","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae1c18e03de24e5eecbcb0b4df1142d7303fe5df850bdf462b3afd962287c983","sha256:2c98ccaf18ea5cbc7ad254ab351db26a362675fe2f811882aec46d4bd0ab9889"],"state_sha256":"633db2dc14f6607bb9575d3d935fca1320170ca06d17f3f4a6cf61df9479b558"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QnI5TN3QxIFJB0vF+rSPVU67Ms6XBuXsy+mp3d0yY1ar/RYrZOOqaPGzSxp8iQID40p3s3VE1TL8esjbhkGFAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T16:30:27.839589Z","bundle_sha256":"58e27be60a4434156da47a39de3e73116346faf379213ec1dc7026ffed2d09c8"}}