{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AS4NRZFZK3V3BS5SZW7D5772PV","short_pith_number":"pith:AS4NRZFZ","canonical_record":{"source":{"id":"1902.10710","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-27T18:50:28Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"05286b5457536767bc477d21f0d2e6ddcab062e3d45344b4e7b505256a85dcc7","abstract_canon_sha256":"7c00968113d4860e64e33be4c07cb8376b68b6485c345fe9ce9da6d286d3a199"},"schema_version":"1.0"},"canonical_sha256":"04b8d8e4b956ebb0cbb2cdbe3efffa7d4069f663e3cc2e6fd13977c3717abd54","source":{"kind":"arxiv","id":"1902.10710","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10710","created_at":"2026-05-17T23:42:42Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10710v2","created_at":"2026-05-17T23:42:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10710","created_at":"2026-05-17T23:42:42Z"},{"alias_kind":"pith_short_12","alias_value":"AS4NRZFZK3V3","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AS4NRZFZK3V3BS5S","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AS4NRZFZ","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AS4NRZFZK3V3BS5SZW7D5772PV","target":"record","payload":{"canonical_record":{"source":{"id":"1902.10710","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-27T18:50:28Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"05286b5457536767bc477d21f0d2e6ddcab062e3d45344b4e7b505256a85dcc7","abstract_canon_sha256":"7c00968113d4860e64e33be4c07cb8376b68b6485c345fe9ce9da6d286d3a199"},"schema_version":"1.0"},"canonical_sha256":"04b8d8e4b956ebb0cbb2cdbe3efffa7d4069f663e3cc2e6fd13977c3717abd54","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:42.204212Z","signature_b64":"gA/RzUa9kUeeQccBHfHKJJOxJ3G1kLkCXgETKyfp4gLgMHDGobNDYgO5fgKwbb52/SnAO6LsrepqTPAozE37DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04b8d8e4b956ebb0cbb2cdbe3efffa7d4069f663e3cc2e6fd13977c3717abd54","last_reissued_at":"2026-05-17T23:42:42.203489Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:42.203489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.10710","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:42:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sf/cNcWStUuiWT4du2K1f9bXby2oWPR74/GODT8iAtm1sb4vZg9pd/9DaAih20hLGh+Z2Ca/dc/VurgO54h1Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:10:38.285093Z"},"content_sha256":"148c461169f26c7ea81140a242bf5c20ace1b553b0eb02721dc6ea226043416d","schema_version":"1.0","event_id":"sha256:148c461169f26c7ea81140a242bf5c20ace1b553b0eb02721dc6ea226043416d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AS4NRZFZK3V3BS5SZW7D5772PV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High probability generalization bounds for uniformly stable algorithms with nearly optimal rate","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":"2019-02-27T18:50:28Z","abstract_excerpt":"Algorithmic stability is a classical approach to understanding and analysis of the generalization error of learning algorithms. A notable weakness of most stability-based generalization bounds is that they hold only in expectation. Generalization with high probability has been established in a landmark paper of Bousquet and Elisseeff (2002) albeit at the expense of an additional $\\sqrt{n}$ factor in the bound. Specifically, their bound on the estimation error of any $\\gamma$-uniformly stable learning algorithm on $n$ samples and range in $[0,1]$ is $O(\\gamma \\sqrt{n \\log(1/\\delta)} + \\sqrt{\\lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10710","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:42:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nEf0+ovTofmXvkhDceDnWm8GbuVz9wW2ydAq+/ko1JixbqRDN5gzxeAkCHguNctLlf+FaBPCPOzJp5X+zpuVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:10:38.285762Z"},"content_sha256":"ffd793303306d2c250916657999fb34c1a50404ebca765827b58c9795ca5b964","schema_version":"1.0","event_id":"sha256:ffd793303306d2c250916657999fb34c1a50404ebca765827b58c9795ca5b964"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AS4NRZFZK3V3BS5SZW7D5772PV/bundle.json","state_url":"https://pith.science/pith/AS4NRZFZK3V3BS5SZW7D5772PV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AS4NRZFZK3V3BS5SZW7D5772PV/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-27T16:10:38Z","links":{"resolver":"https://pith.science/pith/AS4NRZFZK3V3BS5SZW7D5772PV","bundle":"https://pith.science/pith/AS4NRZFZK3V3BS5SZW7D5772PV/bundle.json","state":"https://pith.science/pith/AS4NRZFZK3V3BS5SZW7D5772PV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AS4NRZFZK3V3BS5SZW7D5772PV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AS4NRZFZK3V3BS5SZW7D5772PV","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":"7c00968113d4860e64e33be4c07cb8376b68b6485c345fe9ce9da6d286d3a199","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-27T18:50:28Z","title_canon_sha256":"05286b5457536767bc477d21f0d2e6ddcab062e3d45344b4e7b505256a85dcc7"},"schema_version":"1.0","source":{"id":"1902.10710","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.10710","created_at":"2026-05-17T23:42:42Z"},{"alias_kind":"arxiv_version","alias_value":"1902.10710v2","created_at":"2026-05-17T23:42:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10710","created_at":"2026-05-17T23:42:42Z"},{"alias_kind":"pith_short_12","alias_value":"AS4NRZFZK3V3","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AS4NRZFZK3V3BS5S","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AS4NRZFZ","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:ffd793303306d2c250916657999fb34c1a50404ebca765827b58c9795ca5b964","target":"graph","created_at":"2026-05-17T23:42:42Z","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":"Algorithmic stability is a classical approach to understanding and analysis of the generalization error of learning algorithms. A notable weakness of most stability-based generalization bounds is that they hold only in expectation. Generalization with high probability has been established in a landmark paper of Bousquet and Elisseeff (2002) albeit at the expense of an additional $\\sqrt{n}$ factor in the bound. Specifically, their bound on the estimation error of any $\\gamma$-uniformly stable learning algorithm on $n$ samples and range in $[0,1]$ is $O(\\gamma \\sqrt{n \\log(1/\\delta)} + \\sqrt{\\lo","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":"2019-02-27T18:50:28Z","title":"High probability generalization bounds for uniformly stable algorithms with nearly optimal rate"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10710","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:148c461169f26c7ea81140a242bf5c20ace1b553b0eb02721dc6ea226043416d","target":"record","created_at":"2026-05-17T23:42:42Z","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":"7c00968113d4860e64e33be4c07cb8376b68b6485c345fe9ce9da6d286d3a199","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-27T18:50:28Z","title_canon_sha256":"05286b5457536767bc477d21f0d2e6ddcab062e3d45344b4e7b505256a85dcc7"},"schema_version":"1.0","source":{"id":"1902.10710","kind":"arxiv","version":2}},"canonical_sha256":"04b8d8e4b956ebb0cbb2cdbe3efffa7d4069f663e3cc2e6fd13977c3717abd54","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04b8d8e4b956ebb0cbb2cdbe3efffa7d4069f663e3cc2e6fd13977c3717abd54","first_computed_at":"2026-05-17T23:42:42.203489Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:42.203489Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gA/RzUa9kUeeQccBHfHKJJOxJ3G1kLkCXgETKyfp4gLgMHDGobNDYgO5fgKwbb52/SnAO6LsrepqTPAozE37DQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:42.204212Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.10710","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:148c461169f26c7ea81140a242bf5c20ace1b553b0eb02721dc6ea226043416d","sha256:ffd793303306d2c250916657999fb34c1a50404ebca765827b58c9795ca5b964"],"state_sha256":"0f10b6fe932e40ed26e98768ed9004731cde188ab4f606623bfb0e52e3d6e76b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JQWucMWFOkFGaZggZpBXIHkvLjHyW7UBaMQMLfMqoO6gv5qMgqNFEiMP2/OaR6KS7L0NGDJjALYc89dKlu6gBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:10:38.289534Z","bundle_sha256":"3ca52e058ad02ffd0225db6a27150dc7a4c8b5e00b66fb011396fd6103e357d6"}}