{"as_of":"2026-08-21T07:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e828e838d924f0ee83f73e82c99be23874ef172b89f856f081e1d4bc3bd52cf5","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-21T06:32:19.484+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-06-26T18:19:02.314185Z","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-04T03:09:30.521560Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2212.06132","last_updated":"2023-11-04T01:56:36Z","snapshot_observed_at":"2026-08-16T16:09:12.779799Z","submitted_at":"2022-12-12T18:58:59Z","title":"Nearly Minimax Optimal Reinforcement Learning for Linear Markov Decision Processes","version":3},"cited_work":{"arxiv_id":"2212.06132","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2212.06132","snapshot_observed_at":"2026-07-04T03:09:30.521560Z","title":"arXiv preprint arXiv:2212.06132 , year=","venue":null,"work_id":"2aa27723-9757-41ba-be49-d0805ef5fd22","year":null},"citing_paper":{"arxiv_id":"2606.20107","last_updated":"2026-06-18T11:30:59Z","snapshot_observed_at":"2026-08-07T07:50:16.581167Z","submitted_at":"2026-06-18T11:30:59Z","title":"Quantile of Means: A Bonus-Free Ensemble Method for Minimax Optimal Reinforcement Learning","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-06-26T18:19:02.314185Z"},"links":{"cited_paper":"/paper/2212.06132","citing_paper":"/paper/2606.20107"},"observation_digest":"sha256:c357203eadb063fe85c0ab2fad641e926ae6b16ccadac35d63d6249b5c5af59c","observation_id":"778a3d1a-1d8e-44c0-bade-324633c8f74e","resolution":{"observed_at":"2026-07-04T03:09:30.523310Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2212.06132/citation-record","integrity":"/paper/2212.06132/integrity","json":"/paper/2212.06132/citation-record.json","paper":"/paper/2212.06132"},"outbound":[],"paper":{"arxiv_id":"2212.06132","last_updated":"2023-11-04T01:56:36Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T16:09:12.779799Z","submitted_at":"2022-12-12T18:58:59Z","title":"Nearly Minimax Optimal Reinforcement Learning for Linear 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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2212.06132."}