{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:CQKIATQSJUVX3HH3GCU2IPRGCL","merge_version":"pith-open-graph-merge-v1","event_count":3,"valid_event_count":3,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c1e03d3a9b26402072eeb99f7498d41d402ab63cee34b3bfc8f60463f24a215d","cross_cats_sorted":["cs.AI","cs.DS","math.ST","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-06T17:57:25Z","title_canon_sha256":"4bf12211038afea5a931b0ac307bf3d8b659f420ffc0cbae06d41dd2555662db"},"schema_version":"1.0","source":{"id":"2608.06363","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.06363","created_at":"2026-08-07T01:41:29Z"},{"alias_kind":"arxiv_version","alias_value":"2608.06363v1","created_at":"2026-08-07T01:41:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.06363","created_at":"2026-08-07T01:41:29Z"},{"alias_kind":"pith_short_12","alias_value":"CQKIATQSJUVX","created_at":"2026-08-07T01:41:29Z"},{"alias_kind":"pith_short_16","alias_value":"CQKIATQSJUVX3HH3","created_at":"2026-08-07T01:41:29Z"},{"alias_kind":"pith_short_8","alias_value":"CQKIATQS","created_at":"2026-08-07T01:41:29Z"}],"graph_snapshots":[{"event_id":"sha256:5abfb23363649a59ccb220dedb89af0dcc34c3e0996ce7a3f1d7533f44e4ed8f","target":"graph","created_at":"2026-08-07T01:41:29Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.06363/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $H\\subseteq\\{-1,+1\\}^X$ be a class of finite VC dimension $d\\ge1$. Writing $L$ for the binary risk and $L^*=\\min_{h\\in H}L(h)$, we construct a learner achieving the statistically optimal risk bound: from an i.i.d.\\ sample of size $n$, for every $0<\\delta\\le 1/2$, with probability at least $1-\\delta$, \\[\n  L(\\widehat h)\n  \\le L^*+ 7\\cdot10^8\\left(\n  \\sqrt{\\frac{L^*(d+\\log(1/\\delta))}{n}}\n  +\\frac{d+\\log(1/\\delta)}{n}\n  \\right). \\] This settles the sample complexity of agnostic PAC learning up to universal constants at every fixed $L^*$, matching the lower bounds of Devroye, Gy\\\"orfi, and Lu","authors_text":"Jian Qian, Markus Engelund Mathiasen, Nikita Zhivotovskiy","cross_cats":["cs.AI","cs.DS","math.ST","stat.TH"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.06363","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:f2899b5e27f9b8c178c3d5f4f1a8aa0e1b72c4ebbf7a110e5b1f54be97dd53ab","target":"record","created_at":"2026-08-07T01:41:29Z","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":"c1e03d3a9b26402072eeb99f7498d41d402ab63cee34b3bfc8f60463f24a215d","cross_cats_sorted":["cs.AI","cs.DS","math.ST","stat.TH"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-06T17:57:25Z","title_canon_sha256":"4bf12211038afea5a931b0ac307bf3d8b659f420ffc0cbae06d41dd2555662db"},"schema_version":"1.0","source":{"id":"2608.06363","kind":"arxiv","version":1}},"canonical_sha256":"1414804e124d2b7d9cfb30a9a43e2612e07ff6816c376852bfe5d9c2de85a316","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1414804e124d2b7d9cfb30a9a43e2612e07ff6816c376852bfe5d9c2de85a316","first_computed_at":"2026-08-07T01:41:29.117507Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-07T01:41:29.117507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hdOVAOSoyyif7iCRjxslrjvJK4q1V7NWwAS/r97AEkad9gC68xCNn3HbsfHiRhvZOJmRfaZCdq0+d5otg0MnBw==","signature_status":"signed_v1","signed_at":"2026-08-07T01:41:29.119223Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.06363","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2899b5e27f9b8c178c3d5f4f1a8aa0e1b72c4ebbf7a110e5b1f54be97dd53ab","sha256:5abfb23363649a59ccb220dedb89af0dcc34c3e0996ce7a3f1d7533f44e4ed8f","sha256:33b6020df561131b9f5d5a19a366bc2a8eb9d668716c676a89f74176a6817731"],"state_sha256":"8725762832e44cc67d1574751a41f94ed74da63af435bf13e45c66166d519091"}