{"as_of":"2026-08-08T21:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f8c2087af5fdde79df4c17aa04197e149b0c3b0a67458b97d123491b3285935c","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-08T06:32:00.761636+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-07T13:32:56.972939Z","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-04T19:10:05.228039Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2102.06548","last_updated":"2023-03-17T19:02:46Z","snapshot_observed_at":"2026-07-06T10:40:50.436828Z","submitted_at":"2021-02-12T14:22:05Z","title":"Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.06548","snapshot_observed_at":"2026-08-07T13:32:56.972939Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.21796","last_updated":"2025-05-27T21:58:35Z","snapshot_observed_at":"2026-08-07T13:20:37.182943Z","submitted_at":"2025-05-27T21:58:35Z","title":"A General-Purpose Theorem for High-Probability Bounds of Stochastic Approximation with Polyak Averaging","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T13:32:56.972939Z"},"links":{"cited_paper":"/paper/2102.06548","citing_paper":"/paper/2505.21796"},"observation_digest":"sha256:44a2f46c16318d495dd5c24cda4ddf40d977492399e752948d89836ca82d27a4","observation_id":"23803ec9-8bf0-42d5-93ea-e8cd0227ca00","resolution":{"observed_at":"2026-08-07T13:32:56.972939Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.06548","last_updated":"2023-03-17T19:02:46Z","snapshot_observed_at":"2026-07-06T10:40:50.436828Z","submitted_at":"2021-02-12T14:22:05Z","title":"Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis","version":4},"cited_work":{"arxiv_id":"2102.06548","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2102.06548","snapshot_observed_at":"2026-07-04T19:10:05.228039Z","title":"Chenbei Lu, Zaiwei Chen, Tongxin Li, Chenye Wu, and Adam Wierman","venue":null,"work_id":"febbcd0a-6d6a-4d3e-83b2-293e949ff1a8","year":null},"citing_paper":{"arxiv_id":"2606.25170","last_updated":"2026-06-23T21:02:18Z","snapshot_observed_at":"2026-08-08T11:53:10.462502Z","submitted_at":"2026-06-23T21:02:18Z","title":"Minimax PAC Bounds for Learning in Exogenous Contextual MDPs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-25T21:39:39.968655Z"},"links":{"cited_paper":"/paper/2102.06548","citing_paper":"/paper/2606.25170"},"observation_digest":"sha256:b36a7657ecc4aa2dcf5d5930e2edfb9b378527c8f8cc9f956dfe1799ff71a155","observation_id":"5cd57cd6-b470-4294-86a0-cbfe1e8326b1","resolution":{"observed_at":"2026-07-04T19:10:05.229713Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2102.06548/citation-record","integrity":"/paper/2102.06548/integrity","json":"/paper/2102.06548/citation-record.json","paper":"/paper/2102.06548"},"outbound":[],"paper":{"arxiv_id":"2102.06548","last_updated":"2023-03-17T19:02:46Z","latest_version":4,"primary_category":"stat.ML","snapshot_observed_at":"2026-07-06T10:40:50.436828Z","submitted_at":"2021-02-12T14:22:05Z","title":"Is Q-Learning Minimax Optimal? A Tight Sample Complexity Analysis"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2102.06548."}