{"as_of":"2026-08-10T15:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cc5f9cb38e38938fde10badd6eb05ca7b858cd5a251de3cc506d987f1ee6dc65","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-10T06:31:04.303077+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-07T14:41:52.867553Z","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-05-25T20:11:11.534082Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1905.12425","last_updated":"2019-12-11T18:01:23Z","snapshot_observed_at":"2026-08-09T09:03:14.982810Z","submitted_at":"2019-05-27T20:15:54Z","title":"Near-optimal Optimistic Reinforcement Learning using Empirical Bernstein Inequalities","version":2},"cited_work":{"arxiv_id":"1905.12425","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1905.12425","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Near-optimal Optimistic Reinforcement Learning using Empirical Bernstein Inequalities","venue":null,"work_id":"69a0ef54-3eef-44fa-bc52-4725015ef82f","year":1905},"citing_paper":{"arxiv_id":"1906.09114","last_updated":"2019-07-09T21:47:50Z","snapshot_observed_at":"2026-08-02T23:36:33.424039Z","submitted_at":"2019-06-20T06:32:36Z","title":"Near-optimal Bayesian Solution For Unknown Discrete Markov Decision Process","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-25T20:08:03.014744Z"},"links":{"cited_paper":"/paper/1905.12425","citing_paper":"/paper/1906.09114"},"observation_digest":"sha256:893acc8522f7788998aa2b8335c0a4aeeeac8196ec34852e4b38df5ca3afee58","observation_id":"10e26e9c-5901-492e-a54a-5b705351410a","resolution":{"observed_at":"2026-05-25T20:11:11.537485Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.12425","last_updated":"2019-12-11T18:01:23Z","snapshot_observed_at":"2026-08-09T09:03:14.982810Z","submitted_at":"2019-05-27T20:15:54Z","title":"Near-optimal Optimistic Reinforcement Learning using Empirical Bernstein Inequalities","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.12425","snapshot_observed_at":"2026-08-07T14:41:52.867553Z","title":"Damianos Tranos and Alexandre Proutiere","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2505.18064","last_updated":"2025-05-23T16:11:39Z","snapshot_observed_at":"2026-08-09T14:21:57.411902Z","submitted_at":"2025-05-23T16:11:39Z","title":"Asymptotically optimal regret in communicating Markov decision processes","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:41:52.867553Z"},"links":{"cited_paper":"/paper/1905.12425","citing_paper":"/paper/2505.18064"},"observation_digest":"sha256:d66ac587d58d4aafbb23b97cbb4da42770edbd62347d41c3474334a74d2fe978","observation_id":"59780be3-1494-4337-9bc4-08bd81a43143","resolution":{"observed_at":"2026-08-07T14:41:52.867553Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1905.12425/citation-record","integrity":"/paper/1905.12425/integrity","json":"/paper/1905.12425/citation-record.json","paper":"/paper/1905.12425"},"outbound":[],"paper":{"arxiv_id":"1905.12425","last_updated":"2019-12-11T18:01:23Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T09:03:14.982810Z","submitted_at":"2019-05-27T20:15:54Z","title":"Near-optimal Optimistic Reinforcement Learning using Empirical Bernstein Inequalities"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1905.12425."}