{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:X5ZE2LNDVI7DTUUMQYLA6XSPQ3","short_pith_number":"pith:X5ZE2LND","canonical_record":{"source":{"id":"1301.0579","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-12T15:56:58Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ac6d6037825c4f29ede6e2225c7230d40b71fb7814e890175033ca33f88d5f12","abstract_canon_sha256":"8f5b1c5e377736b186f4e6643b11f958f771ef7c39bab64a04e2f42cc30fdc1f"},"schema_version":"1.0"},"canonical_sha256":"bf724d2da3aa3e39d28c86160f5e4f86ccff47a0806588381d9a15fe760531b6","source":{"kind":"arxiv","id":"1301.0579","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0579","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0579v1","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0579","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"pith_short_12","alias_value":"X5ZE2LNDVI7D","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"X5ZE2LNDVI7DTUUM","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"X5ZE2LND","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:X5ZE2LNDVI7DTUUMQYLA6XSPQ3","target":"record","payload":{"canonical_record":{"source":{"id":"1301.0579","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-12T15:56:58Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ac6d6037825c4f29ede6e2225c7230d40b71fb7814e890175033ca33f88d5f12","abstract_canon_sha256":"8f5b1c5e377736b186f4e6643b11f958f771ef7c39bab64a04e2f42cc30fdc1f"},"schema_version":"1.0"},"canonical_sha256":"bf724d2da3aa3e39d28c86160f5e4f86ccff47a0806588381d9a15fe760531b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:18.399547Z","signature_b64":"yqz4RAgwL5H+QYwovIFuggUNufUIxVllndCM7c5q3MWE+9iU4tjjFPI25Fgn4vE5ooZgNIAoW9LmPTFa51X6BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf724d2da3aa3e39d28c86160f5e4f86ccff47a0806588381d9a15fe760531b6","last_reissued_at":"2026-05-18T03:37:18.399030Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:18.399030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.0579","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-05-18T03:37:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ElHmy5vyp9iemPwAcKwDrHoYsGCaMpGZ9N40x9+uNohs1yWIV4D3R9JF49eCjO80OAPC53hLPUOgqLlWdFmJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:15:56.522048Z"},"content_sha256":"490ad12dfd4168f44ca0ea088609f8bde9c22412ab3e0934aaa2302ff2460a97","schema_version":"1.0","event_id":"sha256:490ad12dfd4168f44ca0ea088609f8bde9c22412ab3e0934aaa2302ff2460a97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:X5ZE2LNDVI7DTUUMQYLA6XSPQ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Almost-everywhere algorithmic stability and generalization error","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Partha Niyogi, Samuel Kutin","submitted_at":"2012-12-12T15:56:58Z","abstract_excerpt":"We explore in some detail the notion of algorithmic stability as a viable framework for analyzing the generalization error of learning algorithms.  We introduce the new notion of training stability of a learning algorithm and show that, in a general setting, it is sufficient for good bounds on generalization error.  In the PAC setting, training stability is both necessary and sufficient for learnability.\\ The approach based on training stability makes no reference to VC dimension or VC entropy. There is no need to prove uniform convergence, and generalization error is bounded directly via an e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0579","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":""},"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-18T03:37:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O2TwAvaLG5QSQevNT4eadP9jxaaGiHBq9HXyQbngeVKy/7I6L42CLJrZNIXpOCoqSqwFgpLIu4kZXnwaoQ89Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T07:15:56.522405Z"},"content_sha256":"d233874b4fc18a118d072bce92383c04e040db9461a9e1df53ab62b763cde200","schema_version":"1.0","event_id":"sha256:d233874b4fc18a118d072bce92383c04e040db9461a9e1df53ab62b763cde200"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X5ZE2LNDVI7DTUUMQYLA6XSPQ3/bundle.json","state_url":"https://pith.science/pith/X5ZE2LNDVI7DTUUMQYLA6XSPQ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X5ZE2LNDVI7DTUUMQYLA6XSPQ3/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-03T07:15:56Z","links":{"resolver":"https://pith.science/pith/X5ZE2LNDVI7DTUUMQYLA6XSPQ3","bundle":"https://pith.science/pith/X5ZE2LNDVI7DTUUMQYLA6XSPQ3/bundle.json","state":"https://pith.science/pith/X5ZE2LNDVI7DTUUMQYLA6XSPQ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X5ZE2LNDVI7DTUUMQYLA6XSPQ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:X5ZE2LNDVI7DTUUMQYLA6XSPQ3","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":"8f5b1c5e377736b186f4e6643b11f958f771ef7c39bab64a04e2f42cc30fdc1f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-12T15:56:58Z","title_canon_sha256":"ac6d6037825c4f29ede6e2225c7230d40b71fb7814e890175033ca33f88d5f12"},"schema_version":"1.0","source":{"id":"1301.0579","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0579","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0579v1","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0579","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"pith_short_12","alias_value":"X5ZE2LNDVI7D","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"X5ZE2LNDVI7DTUUM","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"X5ZE2LND","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:d233874b4fc18a118d072bce92383c04e040db9461a9e1df53ab62b763cde200","target":"graph","created_at":"2026-05-18T03:37:18Z","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":"We explore in some detail the notion of algorithmic stability as a viable framework for analyzing the generalization error of learning algorithms.  We introduce the new notion of training stability of a learning algorithm and show that, in a general setting, it is sufficient for good bounds on generalization error.  In the PAC setting, training stability is both necessary and sufficient for learnability.\\ The approach based on training stability makes no reference to VC dimension or VC entropy. There is no need to prove uniform convergence, and generalization error is bounded directly via an e","authors_text":"Partha Niyogi, Samuel Kutin","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-12T15:56:58Z","title":"Almost-everywhere algorithmic stability and generalization error"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0579","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:490ad12dfd4168f44ca0ea088609f8bde9c22412ab3e0934aaa2302ff2460a97","target":"record","created_at":"2026-05-18T03:37:18Z","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":"8f5b1c5e377736b186f4e6643b11f958f771ef7c39bab64a04e2f42cc30fdc1f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-12T15:56:58Z","title_canon_sha256":"ac6d6037825c4f29ede6e2225c7230d40b71fb7814e890175033ca33f88d5f12"},"schema_version":"1.0","source":{"id":"1301.0579","kind":"arxiv","version":1}},"canonical_sha256":"bf724d2da3aa3e39d28c86160f5e4f86ccff47a0806588381d9a15fe760531b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf724d2da3aa3e39d28c86160f5e4f86ccff47a0806588381d9a15fe760531b6","first_computed_at":"2026-05-18T03:37:18.399030Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:18.399030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yqz4RAgwL5H+QYwovIFuggUNufUIxVllndCM7c5q3MWE+9iU4tjjFPI25Fgn4vE5ooZgNIAoW9LmPTFa51X6BA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:18.399547Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.0579","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:490ad12dfd4168f44ca0ea088609f8bde9c22412ab3e0934aaa2302ff2460a97","sha256:d233874b4fc18a118d072bce92383c04e040db9461a9e1df53ab62b763cde200"],"state_sha256":"98b16c3efd7f33ec4bb36bf824f1ba1474652bbc8ab31a5480ccd398e2ac88ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kvAeBqsczr5JTGNZJA4kkzzhi8pQSZGDnXNrCX2323jlOh231wFqt70dRdhcPKtp5+lcv9ui9qlyFpbWoFkmAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T07:15:56.524363Z","bundle_sha256":"9faeb01d1a55f7bf5f9021826b45140379159b14087c02ea9a68e06bb71f3dc8"}}