{"as_of":"2026-08-11T07:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:00e5e8a02bf8801b799868f37f306bdd0f1e208c00ab93fef3192f8b9ec0cf87","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-11T06:34:44.6726+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-09T12:06:20.481935Z","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-09T12:06:20.526457Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2205.11507","last_updated":"2022-05-23T17:59:18Z","snapshot_observed_at":"2026-07-06T13:12:59.688989Z","submitted_at":"2022-05-23T17:59:18Z","title":"Computationally Efficient Horizon-Free Reinforcement Learning for Linear Mixture MDPs","version":1},"cited_work":{"arxiv_id":"2205.11507","doi":null,"metadata_source":"pith","pith_arxiv_id":"2205.11507","snapshot_observed_at":"2026-08-09T12:06:20.526457Z","title":"Computationally Efficient Horizon-Free Reinforcement Learning for Linear Mixture MDPs","venue":"cs.LG","work_id":"4ca075a8-dd1e-4623-877b-b4f06f10557c","year":2022},"citing_paper":{"arxiv_id":"2502.02486","last_updated":"2025-02-04T17:03:32Z","snapshot_observed_at":"2026-08-10T00:13:28.338045Z","submitted_at":"2025-02-04T17:03:32Z","title":"Catoni Contextual Bandits are Robust to Heavy-tailed Rewards","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-09T12:06:20.481935Z"},"links":{"cited_paper":"/paper/2205.11507","citing_paper":"/paper/2502.02486"},"observation_digest":"sha256:6f974e3642313257cf02c461acc34204e3ac0c8b7f50f034bb8b1f774d3e09f6","observation_id":"25f15fd8-a4a5-4487-9e0b-e86681fd50a7","resolution":{"observed_at":"2026-08-09T12:06:20.533550Z","resolver_source":"local_arxiv","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/2205.11507/citation-record","integrity":"/paper/2205.11507/integrity","json":"/paper/2205.11507/citation-record.json","paper":"/paper/2205.11507"},"outbound":[],"paper":{"arxiv_id":"2205.11507","last_updated":"2022-05-23T17:59:18Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T13:12:59.688989Z","submitted_at":"2022-05-23T17:59:18Z","title":"Computationally Efficient Horizon-Free Reinforcement Learning for Linear Mixture MDPs"},"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 1 inbound Pith citation observation for arXiv:2205.11507."}