{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:2IMHBDD76D46IADELO5S4M7KJ2","short_pith_number":"pith:2IMHBDD7","schema_version":"1.0","canonical_sha256":"d218708c7ff0f9e400645bbb2e33ea4eadc51bd9a2dbc8fec5db44b446cf47eb","source":{"kind":"arxiv","id":"2011.04483","version":1},"attestation_state":"computed","paper":{"title":"A Theory of Universal Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Amir Yehudayoff, Olivier Bousquet, Ramon van Handel, Shay Moran, Steve Hanneke","submitted_at":"2020-11-09T15:10:32Z","abstract_excerpt":"How quickly can a given class of concepts be learned from examples? It is common to measure the performance of a supervised machine learning algorithm by plotting its \"learning curve\", that is, the decay of the error rate as a function of the number of training examples. However, the classical theoretical framework for understanding learnability, the PAC model of Vapnik-Chervonenkis and Valiant, does not explain the behavior of learning curves: the distribution-free PAC model of learning can only bound the upper envelope of the learning curves over all possible data distributions. This does no"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2011.04483","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-11-09T15:10:32Z","cross_cats_sorted":["cs.DS","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"bc40eb4aa0c0ef7e54479c064a3138e8a3fa81fab033bac79a36f3102bbc8cdd","abstract_canon_sha256":"684668b6c8195869fe69a1c94e653cfa61edde4270eeba5615c344217685ffca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:50:05.751487Z","signature_b64":"tLQmf+AO55+ZEx5Ss6oGdxgkn34RQwxW9Oipc0amMOYC/B1goIfohenABpOfP7sX8c6XRK6vGsn8wdfz9Qu1Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d218708c7ff0f9e400645bbb2e33ea4eadc51bd9a2dbc8fec5db44b446cf47eb","last_reissued_at":"2026-07-05T01:50:05.751116Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:50:05.751116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Theory of Universal Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.LG","authors_text":"Amir Yehudayoff, Olivier Bousquet, Ramon van Handel, Shay Moran, Steve Hanneke","submitted_at":"2020-11-09T15:10:32Z","abstract_excerpt":"How quickly can a given class of concepts be learned from examples? It is common to measure the performance of a supervised machine learning algorithm by plotting its \"learning curve\", that is, the decay of the error rate as a function of the number of training examples. However, the classical theoretical framework for understanding learnability, the PAC model of Vapnik-Chervonenkis and Valiant, does not explain the behavior of learning curves: the distribution-free PAC model of learning can only bound the upper envelope of the learning curves over all possible data distributions. This does no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.04483","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/2011.04483/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2011.04483","created_at":"2026-07-05T01:50:05.751180+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.04483v1","created_at":"2026-07-05T01:50:05.751180+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.04483","created_at":"2026-07-05T01:50:05.751180+00:00"},{"alias_kind":"pith_short_12","alias_value":"2IMHBDD76D46","created_at":"2026-07-05T01:50:05.751180+00:00"},{"alias_kind":"pith_short_16","alias_value":"2IMHBDD76D46IADE","created_at":"2026-07-05T01:50:05.751180+00:00"},{"alias_kind":"pith_short_8","alias_value":"2IMHBDD7","created_at":"2026-07-05T01:50:05.751180+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.03823","citing_title":"Realizable Bayes-Consistency for General Metric Losses","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03823","citing_title":"Realizable Bayes-Consistency for General Metric Losses","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2IMHBDD76D46IADELO5S4M7KJ2","json":"https://pith.science/pith/2IMHBDD76D46IADELO5S4M7KJ2.json","graph_json":"https://pith.science/api/pith-number/2IMHBDD76D46IADELO5S4M7KJ2/graph.json","events_json":"https://pith.science/api/pith-number/2IMHBDD76D46IADELO5S4M7KJ2/events.json","paper":"https://pith.science/paper/2IMHBDD7"},"agent_actions":{"view_html":"https://pith.science/pith/2IMHBDD76D46IADELO5S4M7KJ2","download_json":"https://pith.science/pith/2IMHBDD76D46IADELO5S4M7KJ2.json","view_paper":"https://pith.science/paper/2IMHBDD7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.04483&json=true","fetch_graph":"https://pith.science/api/pith-number/2IMHBDD76D46IADELO5S4M7KJ2/graph.json","fetch_events":"https://pith.science/api/pith-number/2IMHBDD76D46IADELO5S4M7KJ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2IMHBDD76D46IADELO5S4M7KJ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2IMHBDD76D46IADELO5S4M7KJ2/action/storage_attestation","attest_author":"https://pith.science/pith/2IMHBDD76D46IADELO5S4M7KJ2/action/author_attestation","sign_citation":"https://pith.science/pith/2IMHBDD76D46IADELO5S4M7KJ2/action/citation_signature","submit_replication":"https://pith.science/pith/2IMHBDD76D46IADELO5S4M7KJ2/action/replication_record"}},"created_at":"2026-07-05T01:50:05.751180+00:00","updated_at":"2026-07-05T01:50:05.751180+00:00"}