{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:RAXLUIHUUV65OWHNZXVKQIBZA6","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":"215a35171c5b34524cf58cb17b7809e96b16abe6c4d35eae7750197198efa21b","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-02T08:43:21Z","title_canon_sha256":"67576dd4275cd590ebc8f774919bc80f614a77d83e6788f014a1048dfb907c2b"},"schema_version":"1.0","source":{"id":"1507.00473","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00473","created_at":"2026-05-18T01:04:50Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00473v4","created_at":"2026-05-18T01:04:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00473","created_at":"2026-05-18T01:04:50Z"},{"alias_kind":"pith_short_12","alias_value":"RAXLUIHUUV65","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"RAXLUIHUUV65OWHN","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"RAXLUIHU","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:7967a0461d39b71f7ce7f7d982c3ae43c6fea4756373b4859b374a3e14968462","target":"graph","created_at":"2026-05-18T01:04:50Z","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":"This work establishes a new upper bound on the number of samples sufficient for PAC learning in the realizable case. The bound matches known lower bounds up to numerical constant factors. This solves a long-standing open problem on the sample complexity of PAC learning. The technique and analysis build on a recent breakthrough by Hans Simon.","authors_text":"Steve Hanneke","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-02T08:43:21Z","title":"The Optimal Sample Complexity of PAC Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00473","kind":"arxiv","version":4},"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:13baeb96dba599c819d16ef8c5bab5e2bdc7a00c628f619a3f2c77f84266b43d","target":"record","created_at":"2026-05-18T01:04:50Z","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":"215a35171c5b34524cf58cb17b7809e96b16abe6c4d35eae7750197198efa21b","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-02T08:43:21Z","title_canon_sha256":"67576dd4275cd590ebc8f774919bc80f614a77d83e6788f014a1048dfb907c2b"},"schema_version":"1.0","source":{"id":"1507.00473","kind":"arxiv","version":4}},"canonical_sha256":"882eba20f4a57dd758edcdeaa8203907bccc6ce22646ac08753c140152360636","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"882eba20f4a57dd758edcdeaa8203907bccc6ce22646ac08753c140152360636","first_computed_at":"2026-05-18T01:04:50.540156Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:50.540156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6ykTOq0JOBnm90c9bgQGiLXOpTpnga0td0afd/z6reaUkl7Efy12gwet1iKb1czigsfv/MXIpqYJeHWbN8ijCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:50.540580Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.00473","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13baeb96dba599c819d16ef8c5bab5e2bdc7a00c628f619a3f2c77f84266b43d","sha256:7967a0461d39b71f7ce7f7d982c3ae43c6fea4756373b4859b374a3e14968462"],"state_sha256":"920fb1be007d4f8d67ffae025f5857265d9fdc0d1c8c908284d94992d4f3bfbb"}