{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZCH4OLRZNNVO5JXGPLSHLXIWN7","short_pith_number":"pith:ZCH4OLRZ","canonical_record":{"source":{"id":"1608.04414","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-15T21:19:51Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"52c852b2d338b99a4438413b31fc4b678446b7944b7d6b6481b6f8a3826a10d5","abstract_canon_sha256":"d4bb7e7e026774fe74a43d039e3653417fddc9ffe684a113dbd5a255a9423815"},"schema_version":"1.0"},"canonical_sha256":"c88fc72e396b6aeea6e67ae475dd166fe23ebdb3f3a4ee80059e913eea1487fc","source":{"kind":"arxiv","id":"1608.04414","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04414","created_at":"2026-05-18T00:53:59Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04414v3","created_at":"2026-05-18T00:53:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04414","created_at":"2026-05-18T00:53:59Z"},{"alias_kind":"pith_short_12","alias_value":"ZCH4OLRZNNVO","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZCH4OLRZNNVO5JXG","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZCH4OLRZ","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZCH4OLRZNNVO5JXGPLSHLXIWN7","target":"record","payload":{"canonical_record":{"source":{"id":"1608.04414","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-15T21:19:51Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"52c852b2d338b99a4438413b31fc4b678446b7944b7d6b6481b6f8a3826a10d5","abstract_canon_sha256":"d4bb7e7e026774fe74a43d039e3653417fddc9ffe684a113dbd5a255a9423815"},"schema_version":"1.0"},"canonical_sha256":"c88fc72e396b6aeea6e67ae475dd166fe23ebdb3f3a4ee80059e913eea1487fc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:59.306208Z","signature_b64":"EWPe33XkW5qwVmJus5l12XcSulF71BqJ4e86Yc75jzfjhoOah4D72KDF1dkfQReag+BSCjXOOAkkuiD0xXTXCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c88fc72e396b6aeea6e67ae475dd166fe23ebdb3f3a4ee80059e913eea1487fc","last_reissued_at":"2026-05-18T00:53:59.305567Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:59.305567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.04414","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:53:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pwp+v+k6x8GoC1tPzWLcdIHV4BM8TUTpL0lllT5UA4Nfm5U/AyjBm6RVntKFJSKAA6sqWx6n/0hG2EZDi9DpBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:54:04.845168Z"},"content_sha256":"7b3376225dc8814dcf1004f8f76fd44eaa247793b43566cf7a0ae0f4a03c62ce","schema_version":"1.0","event_id":"sha256:7b3376225dc8814dcf1004f8f76fd44eaa247793b43566cf7a0ae0f4a03c62ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZCH4OLRZNNVO5JXGPLSHLXIWN7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalization of ERM in Stochastic Convex Optimization: The Dimension Strikes Back","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Vitaly Feldman","submitted_at":"2016-08-15T21:19:51Z","abstract_excerpt":"In stochastic convex optimization the goal is to minimize a convex function $F(x) \\doteq {\\mathbf E}_{{\\mathbf f}\\sim D}[{\\mathbf f}(x)]$ over a convex set $\\cal K \\subset {\\mathbb R}^d$ where $D$ is some unknown distribution and each $f(\\cdot)$ in the support of $D$ is convex over $\\cal K$. The optimization is commonly based on i.i.d.~samples $f^1,f^2,\\ldots,f^n$ from $D$. A standard approach to such problems is empirical risk minimization (ERM) that optimizes $F_S(x) \\doteq \\frac{1}{n}\\sum_{i\\leq n} f^i(x)$. Here we consider the question of how many samples are necessary for ERM to succeed a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04414","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:53:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+QrdgTbLhWoxyQRxnQMgSqPgDlewSnBOFospWCb3xnDMuJ3m8xPoXR2u0B3JZgZpR4fiZhgpHP0Lgfl90+d3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:54:04.845852Z"},"content_sha256":"b22a122196586cd5e5d36992da160404bfe4e78f3a7258b142286e1ee08f3ccc","schema_version":"1.0","event_id":"sha256:b22a122196586cd5e5d36992da160404bfe4e78f3a7258b142286e1ee08f3ccc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZCH4OLRZNNVO5JXGPLSHLXIWN7/bundle.json","state_url":"https://pith.science/pith/ZCH4OLRZNNVO5JXGPLSHLXIWN7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZCH4OLRZNNVO5JXGPLSHLXIWN7/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-27T05:54:04Z","links":{"resolver":"https://pith.science/pith/ZCH4OLRZNNVO5JXGPLSHLXIWN7","bundle":"https://pith.science/pith/ZCH4OLRZNNVO5JXGPLSHLXIWN7/bundle.json","state":"https://pith.science/pith/ZCH4OLRZNNVO5JXGPLSHLXIWN7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZCH4OLRZNNVO5JXGPLSHLXIWN7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZCH4OLRZNNVO5JXGPLSHLXIWN7","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":"d4bb7e7e026774fe74a43d039e3653417fddc9ffe684a113dbd5a255a9423815","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-15T21:19:51Z","title_canon_sha256":"52c852b2d338b99a4438413b31fc4b678446b7944b7d6b6481b6f8a3826a10d5"},"schema_version":"1.0","source":{"id":"1608.04414","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04414","created_at":"2026-05-18T00:53:59Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04414v3","created_at":"2026-05-18T00:53:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04414","created_at":"2026-05-18T00:53:59Z"},{"alias_kind":"pith_short_12","alias_value":"ZCH4OLRZNNVO","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZCH4OLRZNNVO5JXG","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZCH4OLRZ","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:b22a122196586cd5e5d36992da160404bfe4e78f3a7258b142286e1ee08f3ccc","target":"graph","created_at":"2026-05-18T00:53:59Z","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 stochastic convex optimization the goal is to minimize a convex function $F(x) \\doteq {\\mathbf E}_{{\\mathbf f}\\sim D}[{\\mathbf f}(x)]$ over a convex set $\\cal K \\subset {\\mathbb R}^d$ where $D$ is some unknown distribution and each $f(\\cdot)$ in the support of $D$ is convex over $\\cal K$. The optimization is commonly based on i.i.d.~samples $f^1,f^2,\\ldots,f^n$ from $D$. A standard approach to such problems is empirical risk minimization (ERM) that optimizes $F_S(x) \\doteq \\frac{1}{n}\\sum_{i\\leq n} f^i(x)$. Here we consider the question of how many samples are necessary for ERM to succeed a","authors_text":"Vitaly Feldman","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-15T21:19:51Z","title":"Generalization of ERM in Stochastic Convex Optimization: The Dimension Strikes Back"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04414","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:7b3376225dc8814dcf1004f8f76fd44eaa247793b43566cf7a0ae0f4a03c62ce","target":"record","created_at":"2026-05-18T00:53:59Z","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":"d4bb7e7e026774fe74a43d039e3653417fddc9ffe684a113dbd5a255a9423815","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-15T21:19:51Z","title_canon_sha256":"52c852b2d338b99a4438413b31fc4b678446b7944b7d6b6481b6f8a3826a10d5"},"schema_version":"1.0","source":{"id":"1608.04414","kind":"arxiv","version":3}},"canonical_sha256":"c88fc72e396b6aeea6e67ae475dd166fe23ebdb3f3a4ee80059e913eea1487fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c88fc72e396b6aeea6e67ae475dd166fe23ebdb3f3a4ee80059e913eea1487fc","first_computed_at":"2026-05-18T00:53:59.305567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:59.305567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EWPe33XkW5qwVmJus5l12XcSulF71BqJ4e86Yc75jzfjhoOah4D72KDF1dkfQReag+BSCjXOOAkkuiD0xXTXCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:59.306208Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.04414","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b3376225dc8814dcf1004f8f76fd44eaa247793b43566cf7a0ae0f4a03c62ce","sha256:b22a122196586cd5e5d36992da160404bfe4e78f3a7258b142286e1ee08f3ccc"],"state_sha256":"9de3b7e5c038d892f178b2ec733c7b4e90e9de91cea6f9c2f8f78a51aee9eb09"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UXF7huyALTYskXhbBFaCZYj0ol5IpjXO/teszEWhD72D9/x8IH6q/39dl75JWKY5hEgRmOOlGb7geibS5VyzCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:54:04.849353Z","bundle_sha256":"59351b770fb041b946642e55364676033f30ef1ffc915127c45b27afc982b154"}}