{"as_of":"2026-08-09T22:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:323f07720217eb8d87c0038358e511a4d047403c37499d633ee07c553dbb9763","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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-01T11:40:26.383570Z","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":[{"citation":{"cited_paper":{"arxiv_id":"2102.09703","last_updated":"2022-10-13T01:13:42Z","snapshot_observed_at":"2026-08-04T11:20:08.270262Z","submitted_at":"2021-02-19T01:42:50Z","title":"Near-Optimal Randomized Exploration for Tabular Markov Decision Processes","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.09703","snapshot_observed_at":"2026-08-01T11:40:26.383570Z","title":"Randomized exploration is near-optimal for tabular mdp","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.19854","last_updated":"2026-07-22T07:42:19Z","snapshot_observed_at":"2026-08-01T11:40:18.790734Z","submitted_at":"2026-07-22T07:42:19Z","title":"Asymptotically Optimal Regret for Reinforcement Learning without Horizon Dependence","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-01T11:40:26.383570Z"},"links":{"cited_paper":"/paper/2102.09703","citing_paper":"/paper/2607.19854"},"observation_digest":"sha256:5f55caf0a7bb9ca0b67d61fb3ce5076a2611b9599693dab328d3a70519e16c7a","observation_id":"041767f7-ac81-47bd-a7a1-123a5d521c32","resolution":{"observed_at":"2026-08-01T11:40:26.383570Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2102.09703/citation-record","integrity":"/paper/2102.09703/integrity","json":"/paper/2102.09703/citation-record.json","paper":"/paper/2102.09703"},"outbound":[],"paper":{"arxiv_id":"2102.09703","last_updated":"2022-10-13T01:13:42Z","latest_version":5,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-04T11:20:08.270262Z","submitted_at":"2021-02-19T01:42:50Z","title":"Near-Optimal Randomized Exploration for Tabular Markov Decision Processes"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2102.09703."}