{"as_of":"2026-08-07T05:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:48beb8d4b13338842a08370190f8c7c7e0a70af52284bcd438dfdfc2d7040f0c","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-06T06:34:29.942622+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-05T21:35:27.400756Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-05T21:35:27.923201Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2002.08436","last_updated":"2020-02-19T20:43:27Z","snapshot_observed_at":"2026-08-02T16:13:54.228417Z","submitted_at":"2020-02-19T20:43:27Z","title":"Residual Bootstrap Exploration for Bandit Algorithms","version":1},"cited_work":{"arxiv_id":"2002.08436","doi":null,"metadata_source":"pith","pith_arxiv_id":"2002.08436","snapshot_observed_at":"2026-08-05T21:35:27.923201Z","title":"Residual Bootstrap Exploration for Bandit Algorithms","venue":"stat.ML","work_id":"8d8de83c-e3d4-43b6-b130-31301eeedae3","year":2020},"citing_paper":{"arxiv_id":"2508.08436","last_updated":"2025-08-11T19:53:24Z","snapshot_observed_at":"2026-08-05T21:35:13.638864Z","submitted_at":"2025-08-11T19:53:24Z","title":"Toward Optimal Statistical Inference in Noisy Linear Quadratic Reinforcement Learning over a Finite Horizon","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-05T21:35:27.400756Z"},"links":{"cited_paper":"/paper/2002.08436","citing_paper":"/paper/2508.08436"},"observation_digest":"sha256:02b12f9bb855339bca4930d25d86436f647b9544ae99a86c6c1bbcc16218df64","observation_id":"0771b835-b586-4bf6-bf9a-a262f3fbfb0f","resolution":{"observed_at":"2026-08-05T21:35:27.961339Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2002.08436/citation-record","integrity":"/paper/2002.08436/integrity","json":"/paper/2002.08436/citation-record.json","paper":"/paper/2002.08436"},"outbound":[],"paper":{"arxiv_id":"2002.08436","last_updated":"2020-02-19T20:43:27Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-02T16:13:54.228417Z","submitted_at":"2020-02-19T20:43:27Z","title":"Residual Bootstrap Exploration for Bandit Algorithms"},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2002.08436."}