{"as_of":"2026-08-11T13:16:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ed99071279a61b949d0d7743e69eb9ba902c9bf48db7365d11dd7db2d28edce5","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":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T11:23:56.211946Z","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-04T09:49:44.292746Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.04595","last_updated":"2024-08-08T17:11:36Z","snapshot_observed_at":"2026-08-04T05:22:44.711727Z","submitted_at":"2024-08-08T17:11:36Z","title":"Inference with the Upper Confidence Bound Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.04595","snapshot_observed_at":"2026-08-07T11:23:56.211946Z","title":"Khamaru and C.-H","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.02881","last_updated":"2025-06-03T13:46:59Z","snapshot_observed_at":"2026-08-07T11:11:10.670439Z","submitted_at":"2025-06-03T13:46:59Z","title":"Simulation-Based Inference for Adaptive Experiments","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T11:23:56.211946Z"},"links":{"cited_paper":"/paper/2408.04595","citing_paper":"/paper/2506.02881"},"observation_digest":"sha256:b37940d8ae132251f253b4f7feff9e54f404b6be84cef3c1087679d93359edc3","observation_id":"eecaaf91-f34e-4d94-943a-61cdc6e50972","resolution":{"observed_at":"2026-08-07T11:23:56.211946Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.04595","last_updated":"2024-08-08T17:11:36Z","snapshot_observed_at":"2026-08-04T05:22:44.711727Z","submitted_at":"2024-08-08T17:11:36Z","title":"Inference with the Upper Confidence Bound Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.04595","snapshot_observed_at":"2026-08-02T20:49:22.226538Z","title":"Khamaru and C","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.22768","last_updated":"2026-05-30T08:32:28Z","snapshot_observed_at":"2026-08-05T20:57:45.336542Z","submitted_at":"2026-02-26T08:59:20Z","title":"Asymptotic Theory and Sequential Testing for Adaptive Bandits","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-02T20:49:22.226538Z"},"links":{"cited_paper":"/paper/2408.04595","citing_paper":"/paper/2602.22768"},"observation_digest":"sha256:311c9af0893ee11f8ba5b8be1af0b6447417558d73e9946bbc542be7a599c479","observation_id":"4604c88a-f42c-44dd-9070-3c51aa5ceef3","resolution":{"observed_at":"2026-08-02T20:49:22.226538Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.04595","last_updated":"2024-08-08T17:11:36Z","snapshot_observed_at":"2026-08-04T05:22:44.711727Z","submitted_at":"2024-08-08T17:11:36Z","title":"Inference with the Upper Confidence Bound Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.04595","snapshot_observed_at":"2026-07-14T23:50:03.797434Z","title":"Koulik Khamaru, Yash Deshpande, Tor Lattimore, Lester Mackey, and Martin J Wainwright","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.10184","last_updated":"2026-06-18T16:25:07Z","snapshot_observed_at":"2026-08-06T14:30:20.068286Z","submitted_at":"2026-03-10T19:27:47Z","title":"Stabilizing Bandits using Regularization: Precise Regret and A Quantitative Central Limit Theorem","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-14T23:50:03.797434Z"},"links":{"cited_paper":"/paper/2408.04595","citing_paper":"/paper/2603.10184"},"observation_digest":"sha256:a83d6fdda8f5d2a3c9144f3bccfda8107f543f18326262f59ca81c5c22c8ccaf","observation_id":"6e5ba997-a62e-428c-b28d-e3e8976aab0c","resolution":{"observed_at":"2026-07-14T23:50:03.797434Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.04595","last_updated":"2024-08-08T17:11:36Z","snapshot_observed_at":"2026-08-04T05:22:44.711727Z","submitted_at":"2024-08-08T17:11:36Z","title":"Inference with the Upper Confidence Bound Algorithm","version":1},"cited_work":{"arxiv_id":"2408.04595","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.04595","snapshot_observed_at":"2026-07-04T09:49:44.292746Z","title":"Inference with the upper confidence bound algorithm","venue":null,"work_id":"2580e507-828a-43be-89cb-45e8c36cae34","year":2024},"citing_paper":{"arxiv_id":"2606.00913","last_updated":"2026-05-30T22:27:31Z","snapshot_observed_at":"2026-08-09T07:09:07.579467Z","submitted_at":"2026-05-30T22:27:31Z","title":"Bandit Simulation for Average Reward Inference","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-28T17:50:08.211646Z"},"links":{"cited_paper":"/paper/2408.04595","citing_paper":"/paper/2606.00913"},"observation_digest":"sha256:b65f2046fc8afcb73ea8d354936e431132bc96d50f9f821b68c9b5f872d4012d","observation_id":"6988bd17-7f75-474a-a192-e8571ce0a1fe","resolution":{"observed_at":"2026-06-28T17:52:27.342733Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.04595","last_updated":"2024-08-08T17:11:36Z","snapshot_observed_at":"2026-08-04T05:22:44.711727Z","submitted_at":"2024-08-08T17:11:36Z","title":"Inference with the Upper Confidence Bound Algorithm","version":1},"cited_work":{"arxiv_id":"2408.04595","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.04595","snapshot_observed_at":"2026-07-04T09:49:44.292746Z","title":"Inference with the upper confidence bound algorithm","venue":null,"work_id":"2580e507-828a-43be-89cb-45e8c36cae34","year":2024},"citing_paper":{"arxiv_id":"2606.22639","last_updated":"2026-06-21T18:57:13Z","snapshot_observed_at":"2026-08-09T08:36:14.293435Z","submitted_at":"2026-06-21T18:57:13Z","title":"Statistical Inference for Misspecified Contextual Bandits","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-06-26T09:30:59.493793Z"},"links":{"cited_paper":"/paper/2408.04595","citing_paper":"/paper/2606.22639"},"observation_digest":"sha256:1de00969f60f4b4aa50b0bb18d6fc0e63ee9775be0ce04bc8e8ee82763ae0d35","observation_id":"b918d781-1df5-432a-8edf-1db0d3feaf38","resolution":{"observed_at":"2026-07-04T09:49:44.295266Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2408.04595/citation-record","integrity":"/paper/2408.04595/integrity","json":"/paper/2408.04595/citation-record.json","paper":"/paper/2408.04595"},"outbound":[],"paper":{"arxiv_id":"2408.04595","last_updated":"2024-08-08T17:11:36Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-04T05:22:44.711727Z","submitted_at":"2024-08-08T17:11:36Z","title":"Inference with the Upper Confidence Bound Algorithm"},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2408.04595."}