{"as_of":"2026-08-16T05:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:52e19b70de44cedfec19800e5360252fea2f88f9a95e71e40fb9c5d82f057178","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:34:58.550623Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-15T06:32:42.880941+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T15:33:58.118512Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-12T15:33:58.267055Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"cited_work":{"arxiv_id":"2608.06363","doi":null,"metadata_source":"pith","pith_arxiv_id":"2608.06363","snapshot_observed_at":"2026-08-12T15:33:58.267055Z","title":"An Optimal Agnostic PAC Algorithm","venue":"cs.LG","work_id":"4d21ccd8-aea0-42e3-85c8-14b5ce0b9b25","year":2026},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-15T02:35:55.706633Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:58.118512Z"},"links":{"cited_paper":"/paper/2608.06363","citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:80b90cceb0af90ee43cc01538b9d600c96ddf9a978a9723f3bd904dc60670799","observation_id":"79279d07-ff84-4fab-af40-71f94be17b7f","resolution":{"observed_at":"2026-08-12T15:33:58.274777Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2608.06363/citation-record","integrity":"/paper/2608.06363/integrity","json":"/paper/2608.06363/citation-record.json","paper":"/paper/2608.06363"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:34:59.978429Z","title":"The One-Inclusion Graph algorithm is not always optimal","venue":null,"work_id":"1cc18d35-aa18-4129-a7ef-4bbe667f94e1","year":2023},"citing_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T04:34:58.366070Z"},"links":{"citing_paper":"/paper/2608.06363"},"observation_digest":"sha256:ad3d0caea4b185d3cf6b044a261f74a9bf85ab103fbbc96c76cc13b9042d02eb","observation_id":"85d11e46-fe6f-4abc-b8cd-690eb0a71086","resolution":{"observed_at":"2026-08-07T04:34:59.984826Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:34:58.372420Z","title":"Optimal PAC bounds without uniform convergence","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T04:34:58.372420Z"},"links":{"citing_paper":"/paper/2608.06363"},"observation_digest":"sha256:0161ad18874fad85932368cc9b5da54a7693099141bdd6933c2693289853512f","observation_id":"64ab6e04-df42-4ca1-bebe-4685be33aca1","resolution":{"observed_at":"2026-08-07T04:34:58.372420Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:34:58.378892Z","title":"Adversarial laws of large numbers and optimal regret in online classification","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T04:34:58.378892Z"},"links":{"citing_paper":"/paper/2608.06363"},"observation_digest":"sha256:7f3448536696d3944b8defa6c6c13f53d5d6033703d06e1b725dec536be6e082","observation_id":"00793e7b-60d7-44e3-8456-c974c55011a9","resolution":{"observed_at":"2026-08-07T04:34:58.378892Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:34:59.956783Z","title":"Regularization and optimal multiclass learning","venue":null,"work_id":"104db5b7-a4c7-48a5-9bea-982abb5de34a","year":null},"citing_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T04:34:58.386079Z"},"links":{"citing_paper":"/paper/2608.06363"},"observation_digest":"sha256:e364ca3276fd2b2eea70735292abf385537807cc7d0565811a90c9195ca71b04","observation_id":"c31aa61d-9381-403c-8817-ca51af4d84f2","resolution":{"observed_at":"2026-08-07T04:34:59.964061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:34:59.930652Z","title":"OnagnosticPAClearninginthesmallerrorregime","venue":null,"work_id":"cdef83a7-83ee-46bb-997b-ace2b930e8d9","year":2025},"citing_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T04:34:58.392330Z"},"links":{"citing_paper":"/paper/2608.06363"},"observation_digest":"sha256:fe7cf42133e1952c0d9fd2445e8c3e310d26eddf5232934bf7c5c93473ac030c","observation_id":"bd8f63e8-e4b2-47ac-9e23-69892ba9800b","resolution":{"observed_at":"2026-08-07T04:34:59.938623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1214/08-aos623","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Fast learning rates in statistical inference through aggregation.The Annals of Statistics, 37(4):1591–1646, 2009.doi:10.1214/08-AOS623","venue":"The Annals of Statistics","work_id":"f01a1e33-add9-491c-9c39-7f6030ef682c","year":2009},"citing_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T04:34:58.400060Z"},"links":{"citing_paper":"/paper/2608.06363"},"observation_digest":"sha256:b53245459361a32c473e400c2097b0d8027478c7e8bb44d7f6e9829120ea073c","observation_id":"5ba12a51-c7eb-4ed6-9ade-c9453e49560f","resolution":{"observed_at":"2026-08-07T04:34:58.717524Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T00:08:25.041596+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-15T00:08:25.041596+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:34:58.407859Z","title":"Bartlett, Olivier Bousquet, and Shahar Mendelson","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T04:34:58.407859Z"},"links":{"citing_paper":"/paper/2608.06363"},"observation_digest":"sha256:2785526428fe6e878698eb3e539ac71c8ace96f490f800849419b5185f2e4d80","observation_id":"9dfd4279-9ae6-4216-9658-106c04525229","resolution":{"observed_at":"2026-08-07T04:34:58.407859Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:34:58.417289Z","title":null,"venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T04:34:58.417289Z"},"links":{"citing_paper":"/paper/2608.06363"},"observation_digest":"sha256:f34e9fdd8b9d7aa010f53a173262afda7da9dfa07c6186119f8c4f253ed1f9a1","observation_id":"c1854e6a-9a03-48de-a7dd-708d8fe5ccab","resolution":{"observed_at":"2026-08-07T04:34:58.417289Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1051/ps:2005018","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Theory of classification: A survey of some recent advances","venue":"ESAIM Probability and Statistics","work_id":"0daf44e0-895c-4560-8649-a08491540b5f","year":2005},"citing_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T04:34:58.423048Z"},"links":{"citing_paper":"/paper/2608.06363"},"observation_digest":"sha256:b7031e634af320e5d0daf3305bcec2237f1cbbdfe0510d7ec0b6a5cbb7b8e9af","observation_id":"64dbe385-8260-4f37-8666-4075a9218f26","resolution":{"observed_at":"2026-08-07T04:34:58.686571Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T00:08:25.33174+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-15T00:08:25.33174+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:34:58.429352Z","title":"Springer, New York, NY, 1996.doi:10.1007/978-1-4612-0711-5","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T04:34:58.429352Z"},"links":{"citing_paper":"/paper/2608.06363"},"observation_digest":"sha256:f7a400d3a182e71a3d088255686a15ff5497ee2804b5c5690372dec45922d80c","observation_id":"c0eb5b26-945a-4864-a6b5-bfef16bd0ffc","resolution":{"observed_at":"2026-08-07T04:34:58.429352Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0031-3203(94)00141-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Lower bounds in pattern recognition and learning.Pattern Recognition, 28(7):1011–1018, 1995.doi:10.1016/0031-3203(94)00141-8","venue":"Pattern Recognition","work_id":"134f9f64-35ed-4a5c-9d7d-d73d969ae78d","year":1995},"citing_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T04:34:58.434462Z"},"links":{"citing_paper":"/paper/2608.06363"},"observation_digest":"sha256:46d328450dfc9891a90f784537d52074e0a003f8988233efc542233e19ffd6ac","observation_id":"604a1950-7b69-4551-9df1-fc5e992f216a","resolution":{"observed_at":"2026-08-07T04:34:58.651678Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T00:08:25.700328+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-15T00:08:25.700328+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:34:58.438973Z","title":"Springer Series in Statistics","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T04:34:58.438973Z"},"links":{"citing_paper":"/paper/2608.06363"},"observation_digest":"sha256:4dc7d7bf9fc3811f74c7f57df88a71bf75ff42b85dc04c6c490183799b41f3ae","observation_id":"cc31f9ae-bfdd-413f-95ed-99339961b677","resolution":{"observed_at":"2026-08-07T04:34:58.438973Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:34:58.444951Z","title":"Springer, Berlin, Heidelberg, 5th edition, 2017.doi:10.1007/978-3-662-53622-3","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T04:34:58.444951Z"},"links":{"citing_paper":"/paper/2608.06363"},"observation_digest":"sha256:4ae1f83471b4e5dd90e2b3a86e3cc516d310ed522db731a6b637d6707afaee5f","observation_id":"84e3f9ea-f817-42ad-ae05-2062bc30327b","resolution":{"observed_at":"2026-08-07T04:34:58.444951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:34:58.456289Z","title":null,"venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T04:34:58.456289Z"},"links":{"citing_paper":"/paper/2608.06363"},"observation_digest":"sha256:46405a20851292f2b1f3770d1d060391f9df1f7952441bb89d6aa128c456a4aa","observation_id":"64feb6e3-2f81-42fa-bc84-a8596d35a909","resolution":{"observed_at":"2026-08-07T04:34:58.456289Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:34:59.909522Z","title":null,"venue":null,"work_id":"8ea2af81-0e90-47d3-9e29-75d8f1aa668a","year":2025},"citing_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T04:34:58.463733Z"},"links":{"citing_paper":"/paper/2608.06363"},"observation_digest":"sha256:8a89db72b65e2315b3541b418f9a607bdcca52ca384669284c10ba28d3b096f6","observation_id":"9acf6917-e384-4be2-9f6b-2b32d6014073","resolution":{"observed_at":"2026-08-07T04:34:59.914884Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:34:59.889622Z","title":"Optimal prediction using expert advice and randomized Littlestone dimension","venue":null,"work_id":"ad25df1d-c778-4c94-9f4f-fdb54236d7bc","year":2023},"citing_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T04:34:58.470174Z"},"links":{"citing_paper":"/paper/2608.06363"},"observation_digest":"sha256:8ab819a49ca1de52332c8b266796df58971b50f9fee01b5bd572d9319cb56909","observation_id":"32e9c6d1-cb34-41d9-a61a-0e5002154800","resolution":{"observed_at":"2026-08-07T04:34:59.896194Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:34:58.478686Z","title":"Freedman","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T04:34:58.478686Z"},"links":{"citing_paper":"/paper/2608.06363"},"observation_digest":"sha256:bf3a46a6f19051d15f9093631bf9f5b15d41f970d9ed7abb48032d4f88e1a47b","observation_id":"35a04d7e-06ff-4122-99cd-d5f2beb9ec56","resolution":{"observed_at":"2026-08-07T04:34:58.478686Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:34:59.867781Z","title":"The optimal sample complexity of PAC learning.Journal of Machine Learning Research, 17(38):1–15, 2016","venue":null,"work_id":"1d39ac5d-440c-4e7a-b0b3-c9c0f90bf09d","year":2016},"citing_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T04:34:58.484558Z"},"links":{"citing_paper":"/paper/2608.06363"},"observation_digest":"sha256:2e6bba652072c2081be064e77b711f335d2d15a3077f4b635cb57dfdcd8f4cd7","observation_id":"ca20c06d-fa7a-4d1f-9dea-249db1040d7a","resolution":{"observed_at":"2026-08-07T04:34:59.873211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:34:58.490566Z","title":"Revisiting agnostic PAC learning","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T04:34:58.490566Z"},"links":{"citing_paper":"/paper/2608.06363"},"observation_digest":"sha256:395a2232d3ca406dfbb476258b70b88d735e2c7cbfc198ee4a28a5845f1e9517","observation_id":"bf3909bc-3f94-435d-a552-1b23ea1a9e7d","resolution":{"observed_at":"2026-08-07T04:34:58.490566Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1994.1097","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:34:59.134090Z","title":null,"venue":null,"work_id":"24b39f5f-315d-4c46-bab5-8419c1ab61bb","year":1994},"citing_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T04:34:58.496334Z"},"links":{"citing_paper":"/paper/2608.06363"},"observation_digest":"sha256:84aee3268d0cece2508eaf5a7c6b220215af9adef0ea7caf47ecb91cf53880cf","observation_id":"7551708e-a9cc-482f-9b39-2e5dad7a2c78","resolution":{"observed_at":"2026-08-07T04:34:59.154149Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:34:59.844862Z","title":"Bagging is an optimal PAC learner","venue":null,"work_id":"aeb38b31-1363-4091-b1aa-dd1a880a9e6f","year":2023},"citing_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T04:34:58.500700Z"},"links":{"citing_paper":"/paper/2608.06363"},"observation_digest":"sha256:bb2e87ca23b8b19cb10dea13f4098f914cd13083e0f0a0e1b376011cfdb23059","observation_id":"aa2b3598-a539-46e1-b148-b10b0a4e999e","resolution":{"observed_at":"2026-08-07T04:34:59.852949Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:34:58.508735Z","title":null,"venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T04:34:58.508735Z"},"links":{"citing_paper":"/paper/2608.06363"},"observation_digest":"sha256:78e8fb9e851305a418d5809f97a53beb3ccce6937e82249a74fbd55d77b5a249","observation_id":"2437f89f-97cc-46fd-b959-49178a5129ed","resolution":{"observed_at":"2026-08-07T04:34:58.508735Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:34:59.820127Z","title":"Cambridge University Press, New York, NY, 2014","venue":null,"work_id":"9c9354cc-02c9-4113-bead-861384b52852","year":2014},"citing_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T04:34:58.513367Z"},"links":{"citing_paper":"/paper/2608.06363"},"observation_digest":"sha256:36e403ca4b6ce610df7981fbd2ddfea3d1aea31751ebc03d84342bfbb6d2e8c3","observation_id":"cd76d52e-7077-4d45-bb4e-b749f839a60f","resolution":{"observed_at":"2026-08-07T04:34:59.829034Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2606.13614","last_updated":"2026-06-11T17:26:13Z","snapshot_observed_at":"2026-08-16T01:16:25.455129Z","submitted_at":"2026-06-11T17:26:13Z","title":"Majority-of-Three is Optimal","version":1},"cited_work":{"arxiv_id":"2606.13614","doi":null,"metadata_source":"pith","pith_arxiv_id":"2606.13614","snapshot_observed_at":"2026-08-07T04:34:58.911778Z","title":"Majority-of-Three is Optimal","venue":"stat.ML","work_id":"591e00c1-01fd-4111-8fb3-b7e37e371a94","year":2026},"citing_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T04:34:58.518328Z"},"links":{"cited_paper":"/paper/2606.13614","citing_paper":"/paper/2608.06363"},"observation_digest":"sha256:ee66ee4b51126d95dc38b708335e7ef306436e6f156941f246864fff3018a634","observation_id":"c0e7141e-47ef-423e-91fc-ef1b0758260b","resolution":{"observed_at":"2026-08-07T04:34:58.919265Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:34:59.788271Z","title":null,"venue":null,"work_id":"f8fd5aeb-b290-48c2-8ca7-c68c24ff8cea","year":2015},"citing_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T04:34:58.524640Z"},"links":{"citing_paper":"/paper/2608.06363"},"observation_digest":"sha256:9f38cae02f1023101bf688bbc8882dc05ff62aad8f7d8809dd12185a1543fb23","observation_id":"c73f498b-d135-4986-bc75-c79da371e5ce","resolution":{"observed_at":"2026-08-07T04:34:59.794164Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:34:58.529166Z","title":null,"venue":null,"work_id":null,"year":1984},"citing_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T04:34:58.529166Z"},"links":{"citing_paper":"/paper/2608.06363"},"observation_digest":"sha256:eb008dd9285d769bf10ea1791ac12f94d3c6482337f66cbb6500347e0eb2d059","observation_id":"59d79c3c-d95b-4ded-a275-e15d13e988a9","resolution":{"observed_at":"2026-08-07T04:34:58.529166Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:34:58.533444Z","title":"Vapnik and Alexey Ya","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T04:34:58.533444Z"},"links":{"citing_paper":"/paper/2608.06363"},"observation_digest":"sha256:50eb9be2c8cb00d0c42eb3a3b98cb3e7133b92c2c32c6d133870d23fb29f17ea","observation_id":"87b44b8c-6520-45fd-ba01-d8504a4cd102","resolution":{"observed_at":"2026-08-07T04:34:58.533444Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:34:59.762735Z","title":null,"venue":null,"work_id":"3fade104-9edf-472f-976f-7428071f4fb4","year":null},"citing_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T04:34:58.540041Z"},"links":{"citing_paper":"/paper/2608.06363"},"observation_digest":"sha256:066726720c945d635e589d444a95eaaeafc1c6a65817d30f0a837eb3aed51ef0","observation_id":"f9fb055d-349a-417c-a526-412462b16124","resolution":{"observed_at":"2026-08-07T04:34:59.769502Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:34:59.730642Z","title":null,"venue":null,"work_id":"c3356c6f-1ec7-4181-ab82-06c67a2f64bc","year":null},"citing_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T04:34:58.545156Z"},"links":{"citing_paper":"/paper/2608.06363"},"observation_digest":"sha256:c6d7c4df585af13dd207775087018f18a863bdc5d3ca88c80032ab9c119634f7","observation_id":"df4f6427-b157-4a1e-acf7-313ca1545bb0","resolution":{"observed_at":"2026-08-07T04:34:59.741284Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:34:59.696348Z","title":"Fix all tie rules","venue":null,"work_id":"a7ef3c65-72a2-4e56-b2ae-eb510c18cc9d","year":null},"citing_paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T04:34:58.550623Z"},"links":{"citing_paper":"/paper/2608.06363"},"observation_digest":"sha256:f7baffcb1d6e82c902228ec05cc1cb7e42bcc3258c249477a36ab730f77c47a3","observation_id":"5ede60f3-e284-47c9-8af7-e6573ce60c79","resolution":{"observed_at":"2026-08-07T04:34:59.707016Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.06363","last_updated":"2026-08-06T17:57:25Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-14T11:59:12.721618Z","submitted_at":"2026-08-06T17:57:25Z","title":"An Optimal Agnostic PAC Algorithm"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":16,"verified_exact":5,"verified_fuzzy":7},"total_outbound_references":30},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 1 inbound Pith citation observation for arXiv:2608.06363."}