{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SZRLVZHHKMCQKSBKBHWOENXAO3","short_pith_number":"pith:SZRLVZHH","canonical_record":{"source":{"id":"1812.09859","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-24T07:55:45Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"b25f96d771e5c9d373f70174e71bd8ba262339afc3b04df393f807322f8ad1fe","abstract_canon_sha256":"32b229476bf4e99d9966c784bbda0f93a8104c89237eb9163d2432fd585b85a3"},"schema_version":"1.0"},"canonical_sha256":"9662bae4e7530505482a09ece236e076ecf23099b4ab8e1969cfe4607134ae42","source":{"kind":"arxiv","id":"1812.09859","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09859","created_at":"2026-05-17T23:51:05Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09859v2","created_at":"2026-05-17T23:51:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09859","created_at":"2026-05-17T23:51:05Z"},{"alias_kind":"pith_short_12","alias_value":"SZRLVZHHKMCQ","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SZRLVZHHKMCQKSBK","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SZRLVZHH","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SZRLVZHHKMCQKSBKBHWOENXAO3","target":"record","payload":{"canonical_record":{"source":{"id":"1812.09859","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-24T07:55:45Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"b25f96d771e5c9d373f70174e71bd8ba262339afc3b04df393f807322f8ad1fe","abstract_canon_sha256":"32b229476bf4e99d9966c784bbda0f93a8104c89237eb9163d2432fd585b85a3"},"schema_version":"1.0"},"canonical_sha256":"9662bae4e7530505482a09ece236e076ecf23099b4ab8e1969cfe4607134ae42","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:05.125082Z","signature_b64":"XyaayiMNsnXuGb5wq879P4Mtoe0d38qzjol0mf+ctTZtdCgMoJq+sSRyVLFFaMZTIzW2evKmWdqBgtEYppNBBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9662bae4e7530505482a09ece236e076ecf23099b4ab8e1969cfe4607134ae42","last_reissued_at":"2026-05-17T23:51:05.124472Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:05.124472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.09859","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-17T23:51:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UgJwv2LIRIt2GTrXfd/w1QJxb4ZzLo9ngPo+GU9+fh3uS5MEKaM7Rzqq+LawYWrNIFXgxKP5VrVihLk9cAiVAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:35:10.860151Z"},"content_sha256":"659b45096e499f44f2f29777516eac865387c66811006af2ad35320eeba46431","schema_version":"1.0","event_id":"sha256:659b45096e499f44f2f29777516eac865387c66811006af2ad35320eeba46431"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SZRLVZHHKMCQKSBKBHWOENXAO3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalization Bounds for Uniformly Stable Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jan Vondrak, Vitaly Feldman","submitted_at":"2018-12-24T07:55:45Z","abstract_excerpt":"Uniform stability of a learning algorithm is a classical notion of algorithmic stability introduced to derive high-probability bounds on the generalization error (Bousquet and Elisseeff, 2002). Specifically, for a loss function with range bounded in $[0,1]$, the generalization error of a $\\gamma$-uniformly stable learning algorithm on $n$ samples is known to be within $O((\\gamma +1/n) \\sqrt{n \\log(1/\\delta)})$ of the empirical error with probability at least $1-\\delta$. Unfortunately, this bound does not lead to meaningful generalization bounds in many common settings where $\\gamma \\geq 1/\\sqr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09859","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-17T23:51:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l3gX/y73zQbAYwdoW/ulp616a4YuBxXU5ZxH4cGL6uVbC0TBOq0oLbPNK+/J+E+O4F/EnAJYH0+k0vEqfYSBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:35:10.860895Z"},"content_sha256":"549b18b8c89322d62c4d940dfee5654b59a1e512081dc15ea9ba5ecf4fe9e618","schema_version":"1.0","event_id":"sha256:549b18b8c89322d62c4d940dfee5654b59a1e512081dc15ea9ba5ecf4fe9e618"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SZRLVZHHKMCQKSBKBHWOENXAO3/bundle.json","state_url":"https://pith.science/pith/SZRLVZHHKMCQKSBKBHWOENXAO3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SZRLVZHHKMCQKSBKBHWOENXAO3/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-27T10:35:10Z","links":{"resolver":"https://pith.science/pith/SZRLVZHHKMCQKSBKBHWOENXAO3","bundle":"https://pith.science/pith/SZRLVZHHKMCQKSBKBHWOENXAO3/bundle.json","state":"https://pith.science/pith/SZRLVZHHKMCQKSBKBHWOENXAO3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SZRLVZHHKMCQKSBKBHWOENXAO3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SZRLVZHHKMCQKSBKBHWOENXAO3","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":"32b229476bf4e99d9966c784bbda0f93a8104c89237eb9163d2432fd585b85a3","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-24T07:55:45Z","title_canon_sha256":"b25f96d771e5c9d373f70174e71bd8ba262339afc3b04df393f807322f8ad1fe"},"schema_version":"1.0","source":{"id":"1812.09859","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09859","created_at":"2026-05-17T23:51:05Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09859v2","created_at":"2026-05-17T23:51:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09859","created_at":"2026-05-17T23:51:05Z"},{"alias_kind":"pith_short_12","alias_value":"SZRLVZHHKMCQ","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SZRLVZHHKMCQKSBK","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SZRLVZHH","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:549b18b8c89322d62c4d940dfee5654b59a1e512081dc15ea9ba5ecf4fe9e618","target":"graph","created_at":"2026-05-17T23:51:05Z","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":"Uniform stability of a learning algorithm is a classical notion of algorithmic stability introduced to derive high-probability bounds on the generalization error (Bousquet and Elisseeff, 2002). Specifically, for a loss function with range bounded in $[0,1]$, the generalization error of a $\\gamma$-uniformly stable learning algorithm on $n$ samples is known to be within $O((\\gamma +1/n) \\sqrt{n \\log(1/\\delta)})$ of the empirical error with probability at least $1-\\delta$. Unfortunately, this bound does not lead to meaningful generalization bounds in many common settings where $\\gamma \\geq 1/\\sqr","authors_text":"Jan Vondrak, Vitaly Feldman","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-24T07:55:45Z","title":"Generalization Bounds for Uniformly Stable Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09859","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:659b45096e499f44f2f29777516eac865387c66811006af2ad35320eeba46431","target":"record","created_at":"2026-05-17T23:51:05Z","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":"32b229476bf4e99d9966c784bbda0f93a8104c89237eb9163d2432fd585b85a3","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-24T07:55:45Z","title_canon_sha256":"b25f96d771e5c9d373f70174e71bd8ba262339afc3b04df393f807322f8ad1fe"},"schema_version":"1.0","source":{"id":"1812.09859","kind":"arxiv","version":2}},"canonical_sha256":"9662bae4e7530505482a09ece236e076ecf23099b4ab8e1969cfe4607134ae42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9662bae4e7530505482a09ece236e076ecf23099b4ab8e1969cfe4607134ae42","first_computed_at":"2026-05-17T23:51:05.124472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:05.124472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XyaayiMNsnXuGb5wq879P4Mtoe0d38qzjol0mf+ctTZtdCgMoJq+sSRyVLFFaMZTIzW2evKmWdqBgtEYppNBBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:05.125082Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.09859","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:659b45096e499f44f2f29777516eac865387c66811006af2ad35320eeba46431","sha256:549b18b8c89322d62c4d940dfee5654b59a1e512081dc15ea9ba5ecf4fe9e618"],"state_sha256":"77e2a43e4f5770f6a658564b735bf5418ea4486956e4d029d2eda77c46dc1b6e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LxMEmB35RlJ+bXi4EIyV+VNaAQfeLSMjwKC9lvjrlBN90YpaaCR5th4fqxsD36RscCY6Da+Io5Uscg7sdZXCCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:35:10.864580Z","bundle_sha256":"6780eb203399e8fa620b825d4d6f623b2be44a21d39aa0c63d33d4e6c37df5d4"}}