{"as_of":"2026-08-15T06:02:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2307a325f307d1c903d285a25ef4f185b10997ba9d8142e21217ecb93ba5c50a","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T10:09:01.013036Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T03:09:30.520310Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2110.11202","last_updated":"2022-04-11T19:34:30Z","snapshot_observed_at":"2026-07-06T12:00:17.963060Z","submitted_at":"2021-10-21T15:25:15Z","title":"Anti-Concentrated Confidence Bonuses for Scalable Exploration","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.11202","snapshot_observed_at":"2026-08-04T10:09:01.013036Z","title":"Anti-concentrated confidence bonuses for scalable exploration.arXiv preprint arXiv:2110.11202,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.11686","last_updated":"2026-07-15T17:43:29Z","snapshot_observed_at":"2026-08-14T19:55:37.652802Z","submitted_at":"2025-10-13T17:49:05Z","title":"Representation-Based Exploration for Language Models: From Test-Time to Post-Training","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-04T10:09:01.013036Z"},"links":{"cited_paper":"/paper/2110.11202","citing_paper":"/paper/2510.11686"},"observation_digest":"sha256:e3509a9a1efdf2023b3035d2be44661ff82b2d9c6dea746c99d7ce3f73b03fbb","observation_id":"a8299430-4a49-47a9-a262-4b91bc6e1875","resolution":{"observed_at":"2026-08-04T10:09:01.013036Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.11202","last_updated":"2022-04-11T19:34:30Z","snapshot_observed_at":"2026-07-06T12:00:17.963060Z","submitted_at":"2021-10-21T15:25:15Z","title":"Anti-Concentrated Confidence Bonuses for Scalable Exploration","version":2},"cited_work":{"arxiv_id":"2110.11202","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2110.11202","snapshot_observed_at":"2026-07-04T03:09:30.520310Z","title":"arXiv preprint arXiv:2110.11202 , year=","venue":null,"work_id":"28269fca-3958-43ac-bb3d-00ddf317348e","year":null},"citing_paper":{"arxiv_id":"2606.20107","last_updated":"2026-06-18T11:30:59Z","snapshot_observed_at":"2026-08-07T07:50:16.581167Z","submitted_at":"2026-06-18T11:30:59Z","title":"Quantile of Means: A Bonus-Free Ensemble Method for Minimax Optimal Reinforcement Learning","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-06-26T18:19:02.314185Z"},"links":{"cited_paper":"/paper/2110.11202","citing_paper":"/paper/2606.20107"},"observation_digest":"sha256:91632dc9c4d76620150b67f466fa4ed2606cfd67a449c7dba77855ae023ca2bf","observation_id":"b1de570e-f523-4a7e-83ef-c1052e64973d","resolution":{"observed_at":"2026-07-04T03:09:30.522465Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2110.11202/citation-record","integrity":"/paper/2110.11202/integrity","json":"/paper/2110.11202/citation-record.json","paper":"/paper/2110.11202"},"outbound":[],"paper":{"arxiv_id":"2110.11202","last_updated":"2022-04-11T19:34:30Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T12:00:17.963060Z","submitted_at":"2021-10-21T15:25:15Z","title":"Anti-Concentrated Confidence Bonuses for Scalable Exploration"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2110.11202."}