{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ROO2FTA35G6PETB3CBC6HGKGVT","short_pith_number":"pith:ROO2FTA3","canonical_record":{"source":{"id":"1608.06072","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-22T07:47:56Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"c79254a38f5beea77cc22e25a9308df9e790c2bed9282f11c515518b8c5823f5","abstract_canon_sha256":"e79804c8b81606679f861a7b4526c40b02a75b0bbaa4b8e2432bc6e014f4255d"},"schema_version":"1.0"},"canonical_sha256":"8b9da2cc1be9bcf24c3b1045e39946acceceff4420656dfeee7eca34bf37c7a1","source":{"kind":"arxiv","id":"1608.06072","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06072","created_at":"2026-05-18T01:03:26Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06072v2","created_at":"2026-05-18T01:03:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06072","created_at":"2026-05-18T01:03:26Z"},{"alias_kind":"pith_short_12","alias_value":"ROO2FTA35G6P","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"ROO2FTA35G6PETB3","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"ROO2FTA3","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ROO2FTA35G6PETB3CBC6HGKGVT","target":"record","payload":{"canonical_record":{"source":{"id":"1608.06072","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-22T07:47:56Z","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"title_canon_sha256":"c79254a38f5beea77cc22e25a9308df9e790c2bed9282f11c515518b8c5823f5","abstract_canon_sha256":"e79804c8b81606679f861a7b4526c40b02a75b0bbaa4b8e2432bc6e014f4255d"},"schema_version":"1.0"},"canonical_sha256":"8b9da2cc1be9bcf24c3b1045e39946acceceff4420656dfeee7eca34bf37c7a1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:26.067939Z","signature_b64":"9AqjPb0kf3CpKDfTOkH2dycGiqCBZex8a94mwOqwIoDdGHf5VPf4pt0EL+KmhiA05BQz8Y/w6cGiekkbpV4pBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b9da2cc1be9bcf24c3b1045e39946acceceff4420656dfeee7eca34bf37c7a1","last_reissued_at":"2026-05-18T01:03:26.067516Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:26.067516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.06072","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:03:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LOX1/ie6Lb7ZNh2F/lavdFLPuJ7v+J/ebQIAp37NBcAwbvUj9eHE1qgViT1n6pVX5YdG7PWGxF0G3Ay9qeRYBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:24:26.969273Z"},"content_sha256":"ffd0d3e294008c9d2f57f4de9aa2ac6ca9eada0c13dbd8ddedc239ec5a8e8c39","schema_version":"1.0","event_id":"sha256:ffd0d3e294008c9d2f57f4de9aa2ac6ca9eada0c13dbd8ddedc239ec5a8e8c39"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ROO2FTA35G6PETB3CBC6HGKGVT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Uniform Generalization, Concentration, and Adaptive Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ibrahim Alabdulmohsin","submitted_at":"2016-08-22T07:47:56Z","abstract_excerpt":"One fundamental goal in any learning algorithm is to mitigate its risk for overfitting. Mathematically, this requires that the learning algorithm enjoys a small generalization risk, which is defined either in expectation or in probability. Both types of generalization are commonly used in the literature. For instance, generalization in expectation has been used to analyze algorithms, such as ridge regression and SGD, whereas generalization in probability is used in the VC theory, among others. Recently, a third notion of generalization has been studied, called uniform generalization, which req"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06072","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:03:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rjx5rQkcz0SojH4d1Bl6jPBYwLFQJKkWwrMupHtFLFRb+PRyALpJ5rmM90Py6Dphyco+/0hwv43T2XKUvL2KDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:24:26.969642Z"},"content_sha256":"b22f273cf7e859d30b737790a20d9da8157648b60ac9cbd9b92c87288a51a34a","schema_version":"1.0","event_id":"sha256:b22f273cf7e859d30b737790a20d9da8157648b60ac9cbd9b92c87288a51a34a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ROO2FTA35G6PETB3CBC6HGKGVT/bundle.json","state_url":"https://pith.science/pith/ROO2FTA35G6PETB3CBC6HGKGVT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ROO2FTA35G6PETB3CBC6HGKGVT/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-06-10T19:24:26Z","links":{"resolver":"https://pith.science/pith/ROO2FTA35G6PETB3CBC6HGKGVT","bundle":"https://pith.science/pith/ROO2FTA35G6PETB3CBC6HGKGVT/bundle.json","state":"https://pith.science/pith/ROO2FTA35G6PETB3CBC6HGKGVT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ROO2FTA35G6PETB3CBC6HGKGVT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ROO2FTA35G6PETB3CBC6HGKGVT","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":"e79804c8b81606679f861a7b4526c40b02a75b0bbaa4b8e2432bc6e014f4255d","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-22T07:47:56Z","title_canon_sha256":"c79254a38f5beea77cc22e25a9308df9e790c2bed9282f11c515518b8c5823f5"},"schema_version":"1.0","source":{"id":"1608.06072","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06072","created_at":"2026-05-18T01:03:26Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06072v2","created_at":"2026-05-18T01:03:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06072","created_at":"2026-05-18T01:03:26Z"},{"alias_kind":"pith_short_12","alias_value":"ROO2FTA35G6P","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"ROO2FTA35G6PETB3","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"ROO2FTA3","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:b22f273cf7e859d30b737790a20d9da8157648b60ac9cbd9b92c87288a51a34a","target":"graph","created_at":"2026-05-18T01:03:26Z","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":"One fundamental goal in any learning algorithm is to mitigate its risk for overfitting. Mathematically, this requires that the learning algorithm enjoys a small generalization risk, which is defined either in expectation or in probability. Both types of generalization are commonly used in the literature. For instance, generalization in expectation has been used to analyze algorithms, such as ridge regression and SGD, whereas generalization in probability is used in the VC theory, among others. Recently, a third notion of generalization has been studied, called uniform generalization, which req","authors_text":"Ibrahim Alabdulmohsin","cross_cats":["cs.IT","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-22T07:47:56Z","title":"Uniform Generalization, Concentration, and Adaptive Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06072","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:ffd0d3e294008c9d2f57f4de9aa2ac6ca9eada0c13dbd8ddedc239ec5a8e8c39","target":"record","created_at":"2026-05-18T01:03:26Z","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":"e79804c8b81606679f861a7b4526c40b02a75b0bbaa4b8e2432bc6e014f4255d","cross_cats_sorted":["cs.IT","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-08-22T07:47:56Z","title_canon_sha256":"c79254a38f5beea77cc22e25a9308df9e790c2bed9282f11c515518b8c5823f5"},"schema_version":"1.0","source":{"id":"1608.06072","kind":"arxiv","version":2}},"canonical_sha256":"8b9da2cc1be9bcf24c3b1045e39946acceceff4420656dfeee7eca34bf37c7a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b9da2cc1be9bcf24c3b1045e39946acceceff4420656dfeee7eca34bf37c7a1","first_computed_at":"2026-05-18T01:03:26.067516Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:26.067516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9AqjPb0kf3CpKDfTOkH2dycGiqCBZex8a94mwOqwIoDdGHf5VPf4pt0EL+KmhiA05BQz8Y/w6cGiekkbpV4pBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:26.067939Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.06072","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ffd0d3e294008c9d2f57f4de9aa2ac6ca9eada0c13dbd8ddedc239ec5a8e8c39","sha256:b22f273cf7e859d30b737790a20d9da8157648b60ac9cbd9b92c87288a51a34a"],"state_sha256":"20b91b38d210795ba253bdfa27497293acc132fa12d394221156adfdbae1c50e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kn/VXWJTSynx2G961sX8PrV048iX8Sw7cviEgD3f8+hex1ZXKuIW9lwmcroup13UPYWeceHnUO1xGmSEozoJDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T19:24:26.971947Z","bundle_sha256":"b6ac12ca1c9ab76c876ec9c732fecd0382703d76f1447ba097bc15fd26dd3c55"}}