{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:O3WI6FPWSGIGT4VT6YOVX4HP2S","short_pith_number":"pith:O3WI6FPW","canonical_record":{"source":{"id":"2311.05398","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-09T14:29:25Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e87679c0aaa726e8c394e32d5d07623120ddc722d57460270e2f1b7d828a15ca","abstract_canon_sha256":"2b003d248423a74c0b1a56e736a6caa6465968858405467b7a71050496090ea1"},"schema_version":"1.0"},"canonical_sha256":"76ec8f15f6919069f2b3f61d5bf0efd4b1fcd011604443c989f38af9c9186425","source":{"kind":"arxiv","id":"2311.05398","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.05398","created_at":"2026-07-05T07:10:59Z"},{"alias_kind":"arxiv_version","alias_value":"2311.05398v1","created_at":"2026-07-05T07:10:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.05398","created_at":"2026-07-05T07:10:59Z"},{"alias_kind":"pith_short_12","alias_value":"O3WI6FPWSGIG","created_at":"2026-07-05T07:10:59Z"},{"alias_kind":"pith_short_16","alias_value":"O3WI6FPWSGIGT4VT","created_at":"2026-07-05T07:10:59Z"},{"alias_kind":"pith_short_8","alias_value":"O3WI6FPW","created_at":"2026-07-05T07:10:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:O3WI6FPWSGIGT4VT6YOVX4HP2S","target":"record","payload":{"canonical_record":{"source":{"id":"2311.05398","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-09T14:29:25Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e87679c0aaa726e8c394e32d5d07623120ddc722d57460270e2f1b7d828a15ca","abstract_canon_sha256":"2b003d248423a74c0b1a56e736a6caa6465968858405467b7a71050496090ea1"},"schema_version":"1.0"},"canonical_sha256":"76ec8f15f6919069f2b3f61d5bf0efd4b1fcd011604443c989f38af9c9186425","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:10:59.057901Z","signature_b64":"PDRXa7ywtItgACJCcnY8NvWw53ZEi1rCqv2EfsWY7Cukulpfzj8fga7Uf4Go+UBa+h/CXw7HyuV0HqrfghldAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76ec8f15f6919069f2b3f61d5bf0efd4b1fcd011604443c989f38af9c9186425","last_reissued_at":"2026-07-05T07:10:59.057398Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:10:59.057398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2311.05398","source_version":1,"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-07-05T07:10:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w1OOXykIDzNVHSt8hwf3L87ESKxmLU3CV/R0xiVwNnCZ2FSWCvWIwnBcr4/qNb6K3mY6F5M7LMWAnuGzsCyFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T12:31:09.970857Z"},"content_sha256":"6599a4cfa0812f22cc469eb112c69cf91f8489e5f6dc6b1df0361fd55b76f5f2","schema_version":"1.0","event_id":"sha256:6599a4cfa0812f22cc469eb112c69cf91f8489e5f6dc6b1df0361fd55b76f5f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:O3WI6FPWSGIGT4VT6YOVX4HP2S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Sample Complexity Of ERMs In Stochastic Convex Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Amir Yehudayoff, Daniel Carmon, Roi Livni","submitted_at":"2023-11-09T14:29:25Z","abstract_excerpt":"Stochastic convex optimization is one of the most well-studied models for learning in modern machine learning. Nevertheless, a central fundamental question in this setup remained unresolved: \"How many data points must be observed so that any empirical risk minimizer (ERM) shows good performance on the true population?\" This question was proposed by Feldman (2016), who proved that $\\Omega(\\frac{d}{\\epsilon}+\\frac{1}{\\epsilon^2})$ data points are necessary (where $d$ is the dimension and $\\epsilon>0$ is the accuracy parameter). Proving an $\\omega(\\frac{d}{\\epsilon}+\\frac{1}{\\epsilon^2})$ lower b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.05398","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.05398/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T07:10:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NrEnXHiWMoeWZoy6aBSLm3dUdbOhukHDCuNeOP213uXXgG34yym3ugnWPe222NqZvoYIzP7R53/w9DWxF+BSCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T12:31:09.971749Z"},"content_sha256":"9d996a0676a0d45825703dbcb8b1b053d1a62104c5b9bc10883670a2b416ae3f","schema_version":"1.0","event_id":"sha256:9d996a0676a0d45825703dbcb8b1b053d1a62104c5b9bc10883670a2b416ae3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O3WI6FPWSGIGT4VT6YOVX4HP2S/bundle.json","state_url":"https://pith.science/pith/O3WI6FPWSGIGT4VT6YOVX4HP2S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O3WI6FPWSGIGT4VT6YOVX4HP2S/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-08-05T12:31:09Z","links":{"resolver":"https://pith.science/pith/O3WI6FPWSGIGT4VT6YOVX4HP2S","bundle":"https://pith.science/pith/O3WI6FPWSGIGT4VT6YOVX4HP2S/bundle.json","state":"https://pith.science/pith/O3WI6FPWSGIGT4VT6YOVX4HP2S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O3WI6FPWSGIGT4VT6YOVX4HP2S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:O3WI6FPWSGIGT4VT6YOVX4HP2S","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":"2b003d248423a74c0b1a56e736a6caa6465968858405467b7a71050496090ea1","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-09T14:29:25Z","title_canon_sha256":"e87679c0aaa726e8c394e32d5d07623120ddc722d57460270e2f1b7d828a15ca"},"schema_version":"1.0","source":{"id":"2311.05398","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.05398","created_at":"2026-07-05T07:10:59Z"},{"alias_kind":"arxiv_version","alias_value":"2311.05398v1","created_at":"2026-07-05T07:10:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.05398","created_at":"2026-07-05T07:10:59Z"},{"alias_kind":"pith_short_12","alias_value":"O3WI6FPWSGIG","created_at":"2026-07-05T07:10:59Z"},{"alias_kind":"pith_short_16","alias_value":"O3WI6FPWSGIGT4VT","created_at":"2026-07-05T07:10:59Z"},{"alias_kind":"pith_short_8","alias_value":"O3WI6FPW","created_at":"2026-07-05T07:10:59Z"}],"graph_snapshots":[{"event_id":"sha256:9d996a0676a0d45825703dbcb8b1b053d1a62104c5b9bc10883670a2b416ae3f","target":"graph","created_at":"2026-07-05T07:10: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2311.05398/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Stochastic convex optimization is one of the most well-studied models for learning in modern machine learning. Nevertheless, a central fundamental question in this setup remained unresolved: \"How many data points must be observed so that any empirical risk minimizer (ERM) shows good performance on the true population?\" This question was proposed by Feldman (2016), who proved that $\\Omega(\\frac{d}{\\epsilon}+\\frac{1}{\\epsilon^2})$ data points are necessary (where $d$ is the dimension and $\\epsilon>0$ is the accuracy parameter). Proving an $\\omega(\\frac{d}{\\epsilon}+\\frac{1}{\\epsilon^2})$ lower b","authors_text":"Amir Yehudayoff, Daniel Carmon, Roi Livni","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-09T14:29:25Z","title":"The Sample Complexity Of ERMs In Stochastic Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.05398","kind":"arxiv","version":1},"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:6599a4cfa0812f22cc469eb112c69cf91f8489e5f6dc6b1df0361fd55b76f5f2","target":"record","created_at":"2026-07-05T07:10: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":"2b003d248423a74c0b1a56e736a6caa6465968858405467b7a71050496090ea1","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-09T14:29:25Z","title_canon_sha256":"e87679c0aaa726e8c394e32d5d07623120ddc722d57460270e2f1b7d828a15ca"},"schema_version":"1.0","source":{"id":"2311.05398","kind":"arxiv","version":1}},"canonical_sha256":"76ec8f15f6919069f2b3f61d5bf0efd4b1fcd011604443c989f38af9c9186425","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76ec8f15f6919069f2b3f61d5bf0efd4b1fcd011604443c989f38af9c9186425","first_computed_at":"2026-07-05T07:10:59.057398Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:10:59.057398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PDRXa7ywtItgACJCcnY8NvWw53ZEi1rCqv2EfsWY7Cukulpfzj8fga7Uf4Go+UBa+h/CXw7HyuV0HqrfghldAA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:10:59.057901Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.05398","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6599a4cfa0812f22cc469eb112c69cf91f8489e5f6dc6b1df0361fd55b76f5f2","sha256:9d996a0676a0d45825703dbcb8b1b053d1a62104c5b9bc10883670a2b416ae3f"],"state_sha256":"a2cc91ad14fc4da588cc04ed4a87589d9014087b40131da0e76b908983fa7c19"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OGfm3lIj6vuCp68RKaB7FDDGOo90ez3xgfrA7K84mDzO0qIF0Yl1jOUS6tcxjcXjMRGPGSmJYwiWfXdbWFZKAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T12:31:09.978397Z","bundle_sha256":"a7f82248034f4c85d4c130853483cfb31107959088508e291d8413c50bd7c527"}}