{"as_of":"2026-08-21T13:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:debaab4a87fbcf7bda9ce1a66094959c0d8a44e6158c697e588c78e698aee042","coverage":[{"denominator":10,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T08:30:32.915006Z","state":"measured"},{"denominator":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2605.30479/citation-record","integrity":"/paper/2605.30479/integrity","json":"/paper/2605.30479/citation-record.json","paper":"/paper/2605.30479"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T08:30:32.915006Z","title":"A theory of PAC learnability of partial concept classes","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.30479","last_updated":"2026-05-28T18:51:53Z","snapshot_observed_at":"2026-08-05T02:34:48.401474Z","submitted_at":"2026-05-28T18:51:53Z","title":"Universal Multiclass Transductive Online Learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T08:30:32.915006Z"},"links":{"citing_paper":"/paper/2605.30479"},"observation_digest":"sha256:0c2fe923c4eec8819b4a9e2997da11a86e6567a4d9d22c279fc002f770cf8140","observation_id":"e208efe4-46d0-4bfe-9b28-7bf5d910229d","resolution":{"observed_at":"2026-06-29T08:30:32.915006Z","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-06-29T08:30:32.915006Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2605.30479","last_updated":"2026-05-28T18:51:53Z","snapshot_observed_at":"2026-08-05T02:34:48.401474Z","submitted_at":"2026-05-28T18:51:53Z","title":"Universal Multiclass Transductive Online Learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T08:30:32.915006Z"},"links":{"citing_paper":"/paper/2605.30479"},"observation_digest":"sha256:89b555996aa417a1d17926f99397b9d0f6f1d9e7a434f762c017e74c34d9af51","observation_id":"1667a31e-27a6-4643-85c5-cfe5f7b1b2ef","resolution":{"observed_at":"2026-06-29T08:30:32.915006Z","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-06-29T08:30:32.915006Z","title":null,"venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2605.30479","last_updated":"2026-05-28T18:51:53Z","snapshot_observed_at":"2026-08-05T02:34:48.401474Z","submitted_at":"2026-05-28T18:51:53Z","title":"Universal Multiclass Transductive Online Learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T08:30:32.915006Z"},"links":{"citing_paper":"/paper/2605.30479"},"observation_digest":"sha256:437c3e8954032785944f1fe0a4d83ae5bb7c84d9d2f30eb9dfa233d4316c51d8","observation_id":"30dbcf04-2bbf-48dc-ac1d-84c769d7dd98","resolution":{"observed_at":"2026-06-29T08:30:32.915006Z","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-06-29T08:30:32.915006Z","title":"1 nKd nKdX t=1 I h ˆht−1(Xt)̸=Y t i Kd # ≥ 1 4 .(1) Thus, we have lim sup d→∞ E","venue":null,"work_id":null,"year":1953},"citing_paper":{"arxiv_id":"2605.30479","last_updated":"2026-05-28T18:51:53Z","snapshot_observed_at":"2026-08-05T02:34:48.401474Z","submitted_at":"2026-05-28T18:51:53Z","title":"Universal Multiclass Transductive Online Learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T08:30:32.915006Z"},"links":{"citing_paper":"/paper/2605.30479"},"observation_digest":"sha256:d8b635a961773e3d7f00a661c9589cbb22cfff17afdd014ebb22aa9d9a4b91fe","observation_id":"9137846d-a641-47b3-b4a2-eeb62dd39fa3","resolution":{"observed_at":"2026-06-29T08:30:32.915006Z","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-06-29T08:30:32.915006Z","title":"Thus, there are ⌊logT⌋ nodes where the algorithm will make a mistake with probability half","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2605.30479","last_updated":"2026-05-28T18:51:53Z","snapshot_observed_at":"2026-08-05T02:34:48.401474Z","submitted_at":"2026-05-28T18:51:53Z","title":"Universal Multiclass Transductive Online Learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-29T08:30:32.915006Z"},"links":{"citing_paper":"/paper/2605.30479"},"observation_digest":"sha256:97d25b77af27f709986b11b46ec5657486dffab57d9ce73805b5de488fad44b4","observation_id":"ae0dca50-8a59-438f-8a85-7ceb28753e9d","resolution":{"observed_at":"2026-06-29T08:30:32.915006Z","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-06-29T08:30:32.915006Z","title":"TX t=1 I h Yt ̸= ˆYt i −I[Y t ̸=Y ∗ t ] # =E","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2605.30479","last_updated":"2026-05-28T18:51:53Z","snapshot_observed_at":"2026-08-05T02:34:48.401474Z","submitted_at":"2026-05-28T18:51:53Z","title":"Universal Multiclass Transductive Online Learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-29T08:30:32.915006Z"},"links":{"citing_paper":"/paper/2605.30479"},"observation_digest":"sha256:fe6bd908665ba269953171a43b86d4234333d57ac866516ba413a688b766a379","observation_id":"0d5f004c-d2ab-497c-a706-abb4012e7669","resolution":{"observed_at":"2026-06-29T08:30:32.915006Z","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-06-29T08:30:32.915006Z","title":"That finishes the proof","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.30479","last_updated":"2026-05-28T18:51:53Z","snapshot_observed_at":"2026-08-05T02:34:48.401474Z","submitted_at":"2026-05-28T18:51:53Z","title":"Universal Multiclass Transductive Online Learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-29T08:30:32.915006Z"},"links":{"citing_paper":"/paper/2605.30479"},"observation_digest":"sha256:8149dbac4e40b4b4490f6f790fa6dd436790ff9a9b144e018e665a0d7a47ce49","observation_id":"d4b586f4-953e-44ab-92e7-4b12d778b67d","resolution":{"observed_at":"2026-06-29T08:30:32.915006Z","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-06-29T08:30:32.915006Z","title":"To prove the property of the algorithm, we first need a lemma about the prediction rule","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.30479","last_updated":"2026-05-28T18:51:53Z","snapshot_observed_at":"2026-08-05T02:34:48.401474Z","submitted_at":"2026-05-28T18:51:53Z","title":"Universal Multiclass Transductive Online Learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-29T08:30:32.915006Z"},"links":{"citing_paper":"/paper/2605.30479"},"observation_digest":"sha256:c0b9f7478c56ccef4ef6cf8ba41b94e28ce52ac83b5b313a14d38281432bc5b5","observation_id":"24f2512e-46f4-48b3-92e5-403d31e1c29d","resolution":{"observed_at":"2026-06-29T08:30:32.915006Z","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-06-29T08:30:32.915006Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2605.30479","last_updated":"2026-05-28T18:51:53Z","snapshot_observed_at":"2026-08-05T02:34:48.401474Z","submitted_at":"2026-05-28T18:51:53Z","title":"Universal Multiclass Transductive Online Learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-29T08:30:32.915006Z"},"links":{"citing_paper":"/paper/2605.30479"},"observation_digest":"sha256:3fa47b8a67b67cd61463cd270735f4f7970f11a97ae2a6c0d856b80cdde94205","observation_id":"cc7ca6cf-040b-43cf-af01-c40a49d1eef8","resolution":{"observed_at":"2026-06-29T08:30:32.915006Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T08:30:32.915006Z","title":"optimistically universal online learning","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2605.30479","last_updated":"2026-05-28T18:51:53Z","snapshot_observed_at":"2026-08-05T02:34:48.401474Z","submitted_at":"2026-05-28T18:51:53Z","title":"Universal Multiclass Transductive Online Learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-29T08:30:32.915006Z"},"links":{"citing_paper":"/paper/2605.30479"},"observation_digest":"sha256:056d5672fd0f86c6220c2b5d9fc4589313f190a5c2c31682a2cc0c80e1ed0a56","observation_id":"60d057cc-f0ea-436c-b905-85fc4bda83bf","resolution":{"observed_at":"2026-06-29T08:30:32.915006Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.30479","last_updated":"2026-05-28T18:51:53Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-05T02:34:48.401474Z","submitted_at":"2026-05-28T18:51:53Z","title":"Universal Multiclass Transductive Online Learning"},"reference_resolution":{"displayed":10,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":10},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 10 of 10 outbound references and 0 inbound Pith citation observations for arXiv:2605.30479."}