{"as_of":"2026-08-16T15:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:857bbeb40be2fe3c72e1d4182a3b3ca08dd40351159ac7ca5edb5a6f2d3785aa","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T15:33:58.168750Z","state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2608.10869/citation-record","integrity":"/paper/2608.10869/integrity","json":"/paper/2608.10869/citation-record.json","paper":"/paper/2608.10869"},"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-12T15:33:58.966908Z","title":"Optimal PAC bounds without uniform convergence","venue":null,"work_id":"b5878a4e-608e-4fc9-9265-55335448a460","year":2023},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:57.972450Z"},"links":{"citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:60e393f2767bddcc060e1e79e04de05018eaffecd5cba11240d69cfc4c4c4c7d","observation_id":"30e86f16-9777-489a-a4ca-df93520a3a19","resolution":{"observed_at":"2026-08-12T15:33:58.971603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T15:33:58.945009Z","title":"Regularization and optimal multiclass learning","venue":null,"work_id":"1fd712c4-d6ff-4a18-8870-ef794a5f48d0","year":2024},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:57.978744Z"},"links":{"citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:94f398c4e928d4992f2d972629456ae909b5705fd10d7f4d1b0565628c9a36d8","observation_id":"37e8210b-a1bc-4f1b-881a-21a01882f910","resolution":{"observed_at":"2026-08-12T15:33:58.949738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T15:33:58.927877Z","title":"A theory of PAC learnability of partial concept classes","venue":null,"work_id":"c78b9be4-552b-4a9f-8e92-2a81dd77eaf5","year":2021},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:57.985894Z"},"links":{"citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:8e60849629c044ec5ad79b11708d7c0625a40bca2cfcee7151b5f4cf09cd805f","observation_id":"b0be477b-20a3-4820-91db-484829316da0","resolution":{"observed_at":"2026-08-12T15:33:58.933234Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T15:33:57.991663Z","title":"On agnostic PAC learning in the small error regime","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:57.991663Z"},"links":{"citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:dd0cc212e6e999a80d397959e300b9a12f8614ecd8ceb4fa33269c4477e0cf03","observation_id":"9a851fb0-2824-4585-b8be-628c42d8e1aa","resolution":{"observed_at":"2026-08-12T15:33:57.991663Z","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-12T15:33:58.909790Z","title":"Bartlett, Olivier Bousquet, and Shahar Mendelson","venue":null,"work_id":"9d6fc8e6-ce7c-473f-81b3-9ac009495f3f","year":2005},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:57.996761Z"},"links":{"citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:a643770dcac826712d6708fa01038f4a91f4d9d397d7d0aaab62605ee2911026","observation_id":"ce9a8205-1d5f-48b0-beb7-d21263d83890","resolution":{"observed_at":"2026-08-12T15:33:58.915346Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T15:33:58.890180Z","title":"A characterization of multiclass learnability","venue":null,"work_id":"994b81d0-c6c5-407a-99b9-ab443e06b26e","year":2022},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:58.001922Z"},"links":{"citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:5f65174e89f768af1ccc7dd7657da24a46c1a87445b28893c4f5eb6aa8fe3714","observation_id":"20d10784-0a27-4b67-90c6-15f748822a62","resolution":{"observed_at":"2026-08-12T15:33:58.895707Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T15:33:58.866432Z","title":null,"venue":null,"work_id":"5d7bb50c-7ece-4540-8935-088434227372","year":1995},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:58.008112Z"},"links":{"citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:663106eb8bac1fe835e7fcc0500706f98df7145c40546adea8182bea160df4c9","observation_id":"7f8775a7-7369-4548-827a-58aabc3bff97","resolution":{"observed_at":"2026-08-12T15:33:58.875142Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T15:33:58.846364Z","title":"Multiclass boosting: Simple and intuitive weak learning criteria","venue":null,"work_id":"be1724fe-d062-4ad6-a400-2fe24d25d968","year":2023},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:58.013190Z"},"links":{"citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:566e2cdec2a62546ef1da3e83edeb81e7c7a45ee6e18d23160caa561b463af85","observation_id":"aafee752-693f-43cd-bad2-52b249bbf44e","resolution":{"observed_at":"2026-08-12T15:33:58.853101Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T15:33:58.824271Z","title":"Concentration Inequalities: A Nonasymptotic Theory of Independence","venue":null,"work_id":"93359981-72ab-4331-8a2b-bf07b54606c2","year":2013},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:58.018873Z"},"links":{"citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:eaa31c46728df500e3d1dbdcda032cab6fb059027708a71f840fb82635a8053c","observation_id":"1d746847-4bd1-4003-b4a9-cadf895a454f","resolution":{"observed_at":"2026-08-12T15:33:58.830774Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T15:33:58.024786Z","title":"Sample complexity of agnostic multiclass classification: Natarajan dimension strikes back","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:58.024786Z"},"links":{"citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:60e7ff096e69f3774a66886aff94d8af0acc66b435925dcf5fd0f7a8370fdd67","observation_id":"4bb498cb-098e-478f-9fa7-48a8bef9247a","resolution":{"observed_at":"2026-08-12T15:33:58.024786Z","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-12T15:33:58.805417Z","title":"A characterization of list learnability","venue":null,"work_id":"af7dd802-124e-421e-b617-2eb8b62361ec","year":2023},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:58.030132Z"},"links":{"citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:e8091c758449a3ba4a9892e157ab83096cb9e2cbdeef0dc882bf16735a9b7340","observation_id":"46337e68-6510-40f6-8e1a-318ed75ac065","resolution":{"observed_at":"2026-08-12T15:33:58.810472Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T15:33:58.788150Z","title":"Lower bounds in pattern recognition and learning","venue":null,"work_id":"2b5a9672-9dfc-4313-8fd1-8d87c190b451","year":1995},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:58.035360Z"},"links":{"citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:6de025fba38f56ea5484f84f2346843a1443c4b25705ba7e18bab8a9e0a42dcb","observation_id":"2783ebc6-0c1d-4dca-b119-1e60a494995a","resolution":{"observed_at":"2026-08-12T15:33:58.792988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T15:33:58.770665Z","title":"Supervised learning through the lens of compression","venue":null,"work_id":"c6814872-dc91-4348-a434-e443a616394b","year":2016},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:58.040600Z"},"links":{"citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:54549caf7f62d6b4ae8c9cd10c18bb7fadf74288d7c371eb42e15337001e94dd","observation_id":"f2f62c49-53fb-4231-8cb2-9f057700975a","resolution":{"observed_at":"2026-08-12T15:33:58.775933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T15:33:58.753140Z","title":"Optimal learners for multiclass problems","venue":null,"work_id":"69612fbc-d900-4ab0-b3a9-c04861e6230d","year":2014},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:58.046390Z"},"links":{"citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:4deee54783b75fc8a6581a177870a7475dda271189d9efd503b3c1b118f43d58","observation_id":"c3fe8e62-1708-480f-bb8d-dd2b3ff53cf6","resolution":{"observed_at":"2026-08-12T15:33:58.758393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T15:33:58.735266Z","title":"Multiclass learnability and the ERM principle","venue":null,"work_id":"95de496e-6fe9-4856-be74-c12734c8ac53","year":2015},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:58.051588Z"},"links":{"citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:0e494c0d8e77feb0b1eea9c2b0b51e8f07a05f6350740ce644928aa92b4a0a11","observation_id":"d2d1295d-cb6e-4f76-83c8-0c187afcc5db","resolution":{"observed_at":"2026-08-12T15:33:58.740219Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T15:33:58.715239Z","title":"A general lower bound on the number of examples needed for learning","venue":null,"work_id":"709e0e08-6136-41ef-9d12-c9fb97324daa","year":1989},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:58.056416Z"},"links":{"citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:442280f0ed332ba3e94aab57089fd3980842c96550210c804ea23adc7860b1cf","observation_id":"b12faa9e-6163-4290-bca0-dcafedb60306","resolution":{"observed_at":"2026-08-12T15:33:58.720661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T15:33:58.693887Z","title":"Sample compression, learnability, and the Vapnik -- Chervonenkis dimension","venue":null,"work_id":"80240cc4-dead-4588-adf5-0dab5d642063","year":1995},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:58.061588Z"},"links":{"citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:3807cb5508094c69d096c565e71429ebc3bb00dc3fb819e2cd6c39c8b0b03bc2","observation_id":"3f2265e2-20d0-4e4b-bb3d-0174b0310392","resolution":{"observed_at":"2026-08-12T15:33:58.700122Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T15:33:58.674372Z","title":"PAC - Bayesian compression bounds on the prediction error of learning algorithms for classification","venue":null,"work_id":"61b444e6-b8d5-4851-a00d-06ffc19b5735","year":2005},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:58.066791Z"},"links":{"citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:c38d48b63d6809e02c94d95723aa3d540be506ca561307e8c5c63c13ac1f73ff","observation_id":"06f3b6ba-3e9d-4415-8be2-8d0aef0e66ca","resolution":{"observed_at":"2026-08-12T15:33:58.679848Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T15:33:58.656827Z","title":"Nearly optimal classification for semimetrics","venue":null,"work_id":"ebd16f99-2202-4f9a-916d-8374be35c9c6","year":2017},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:58.072847Z"},"links":{"citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:73c2aad18656019373e4c51d7ba4ca298f9832a203c6f6d70610b3a8de4deadd","observation_id":"65a9a4f9-3e31-4469-8a1a-8699b39b7d39","resolution":{"observed_at":"2026-08-12T15:33:58.662436Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T15:33:58.639307Z","title":"A sharp lower bound for agnostic learning with sample compression schemes","venue":null,"work_id":"cb60bf8c-c572-40cd-a304-abe5aefebefb","year":2019},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:58.078580Z"},"links":{"citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:7364413cfac78bfafb8f69f3e20ea5320be21e9e17e0aa948a6e5ca6af7bbced","observation_id":"b79d01b2-4c08-43b3-b010-331ef783b945","resolution":{"observed_at":"2026-08-12T15:33:58.645099Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T15:33:58.619943Z","title":"Stable sample compression schemes: New applications and an optimal SVM margin bound","venue":null,"work_id":"ac2fff0c-368f-4c7d-b028-2b60e98aa5cb","year":2021},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:58.083921Z"},"links":{"citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:f984bf62095c7bbc4f1f6215fb380387b9febe33c849947c6b0f22e4eca1c91a","observation_id":"ce2d6c80-eb9e-4809-a9ec-91305a5065ed","resolution":{"observed_at":"2026-08-12T15:33:58.626311Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T15:33:58.602060Z","title":null,"venue":null,"work_id":"8fe1b569-74bf-46a2-9eb5-d99d185e5305","year":1994},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:58.089591Z"},"links":{"citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:2f99fc1f46dec7ee2f41bc90677d929c167be046060db28cebf68a5fa0b85f97","observation_id":"340ec30a-e72a-47db-a5df-e6da5271f3a4","resolution":{"observed_at":"2026-08-12T15:33:58.607384Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T15:33:58.582957Z","title":"Revisiting agnostic PAC learning","venue":null,"work_id":"89f664d8-2134-4e5b-a90b-1219cd351617","year":2024},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:58.095626Z"},"links":{"citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:d1b29d624f7f951a8a205540a9ec25639f2aad4666133713349b2106167d57c8","observation_id":"05b19327-96af-4b86-972f-f5fa0a69562e","resolution":{"observed_at":"2026-08-12T15:33:58.588278Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.12952","last_updated":"2026-04-14T16:50:38Z","snapshot_observed_at":"2026-08-16T03:12:01.828678Z","submitted_at":"2026-04-14T16:50:38Z","title":"An Optimal Sauer Lemma Over $k$-ary Alphabets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.12952","snapshot_observed_at":"2026-08-12T15:33:58.100247Z","title":"An optimal Sauer lemma over k -ary alphabets, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:58.100247Z"},"links":{"cited_paper":"/paper/2604.12952","citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:49c88e2188d842f92a94c7b1f045fc78449fc80c8c00a6d68462983c017f34e9","observation_id":"30000d65-8aca-43e9-9a5e-cf0cfa06a417","resolution":{"observed_at":"2026-08-12T15:33:58.100247Z","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-12T15:33:58.565408Z","title":"Representation preserving multiclass agnostic to realizable reduction","venue":null,"work_id":"cf5b801f-c5a0-4acc-94fd-a5ca4e186518","year":2025},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:58.106590Z"},"links":{"citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:dba2ba5c12a8fe5a362a6126c8e928463f496c292580839de11ad96bb90083ee","observation_id":"3a65f299-fa72-4d37-813c-fe2c44a4df0a","resolution":{"observed_at":"2026-08-12T15:33:58.570539Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T15:33:58.542405Z","title":"Improved sample complexity for multiclass PAC learning","venue":null,"work_id":"d2d42da0-4cb1-48c8-bf1b-ca4511d30e52","year":2024},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:58.112986Z"},"links":{"citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:f4c94be7a4118aabdc5ae770165c60038e1f5b295e2c5404ce5b08b7a3cb5a5b","observation_id":"5ff73ebd-cec4-4f1f-b6f6-3c9f56005aeb","resolution":{"observed_at":"2026-08-12T15:33:58.550046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-16T06:09:22.334255Z","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:09d1112a863dab9da31efcaac2fe47c7b45be1130f0896b13f96d965dca0271e","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T15:33:58.523655Z","title":"Natarajan","venue":null,"work_id":"2cf86fae-2270-4913-bd85-8710ce297ea7","year":1989},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:58.124269Z"},"links":{"citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:b936d4d0e66d30f0ac07816ce3025d6ff79a774e5683b6a80b124cae919d033e","observation_id":"8b71902d-56ba-4c78-a785-de34f965743f","resolution":{"observed_at":"2026-08-12T15:33:58.528703Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2604.24749","last_updated":"2026-08-13T15:40:34Z","snapshot_observed_at":"2026-08-16T14:12:13.180693Z","submitted_at":"2026-04-27T17:54:12Z","title":"The Optimal Sample Complexity of Multiclass and List Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.24749","snapshot_observed_at":"2026-08-12T15:33:58.129686Z","title":"The optimal sample complexity of multiclass and list learning, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:58.129686Z"},"links":{"cited_paper":"/paper/2604.24749","citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:59127ec7b1627a35ab1d49dfc3078b0227063fa4c61b1658472ff4b2b331174a","observation_id":"8bb6b9b0-32b8-43df-9f6e-cc9adcdaf77e","resolution":{"observed_at":"2026-08-12T15:33:58.129686Z","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-12T15:33:58.505501Z","title":"Some extensions of an inequality of Vapnik and Chervonenkis","venue":null,"work_id":"c997000b-af10-479f-9da8-f747cfb091f0","year":2002},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:58.135887Z"},"links":{"citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:bd7ba22d57d62190115b3c8a614d51b3c4a3b39bfbe158ddaaaba3b1dd0b12c2","observation_id":"db32bb19-9e3f-41c2-baac-e2ebaed5f725","resolution":{"observed_at":"2026-08-12T15:33:58.511382Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T15:33:58.486624Z","title":null,"venue":null,"work_id":"2ec674e3-1a72-4bd4-ba98-8787d523bcd9","year":2006},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:58.141025Z"},"links":{"citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:37b072b9a58ceb7f6497875739b347e80a11639af1d1931fce23b67b27791e03","observation_id":"37f3f8ea-d25d-48c5-bc60-cc1ccaa895e8","resolution":{"observed_at":"2026-08-12T15:33:58.492181Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1009.3896","last_updated":"2012-11-26T06:42:25Z","snapshot_observed_at":"2026-08-15T05:08:18.811569Z","submitted_at":"2010-09-20T17:35:35Z","title":"Optimistic Rates for Learning with a Smooth Loss","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1009.3896","snapshot_observed_at":"2026-08-12T15:33:58.147019Z","title":"Optimistic rates for learning with a smooth loss, 2010","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:58.147019Z"},"links":{"cited_paper":"/paper/1009.3896","citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:f7f5106a32cb7e12fd6c6bba7d5752c09396e2c41de62f491ac41e8a31483904","observation_id":"ed43ea2f-260a-4a00-a3bb-dd6d076de50e","resolution":{"observed_at":"2026-08-12T15:33:58.147019Z","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-12T15:33:58.468557Z","title":"Tsybakov","venue":null,"work_id":"d39d7431-e59b-4f9f-a335-9fb09167b032","year":2009},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:58.162901Z"},"links":{"citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:38dd60ee0683bbcdf5bd91b1eeb2cf9815eec7c9a5d8a35236733f4288200b23","observation_id":"befe9571-4b10-4913-a5da-cd84ee6a96a2","resolution":{"observed_at":"2026-08-12T15:33:58.473418Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-12T15:33:58.448620Z","title":"Localization of VC classes: Beyond local Rademacher complexities","venue":null,"work_id":"5d099b75-df89-4d3f-839c-9bbdbdbd6a3f","year":2018},"citing_paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-12T15:33:58.168750Z"},"links":{"citing_paper":"/paper/2608.10869"},"observation_digest":"sha256:e29384689473f378255da5dd23c4734b0c43cd85ba4b921514432921c9ce2657","observation_id":"2788d9c3-709c-43b5-a127-c3700c06b72e","resolution":{"observed_at":"2026-08-12T15:33:58.456865Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2608.10869","last_updated":"2026-08-11T12:46:03Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T06:09:22.334255Z","submitted_at":"2026-08-11T12:46:03Z","title":"Optimistic Rates for Multiclass PAC Learning"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":1,"verified_fuzzy":25},"total_outbound_references":34},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 0 inbound Pith citation observations for arXiv:2608.10869."}