{"as_of":"2026-08-08T20:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c695be7afb49468586ed8df64880baa338d70224dbd837d7965e0ac0020002ff","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:51:17.105267Z","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-05-20T12:38:16.756881Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2203.05804","last_updated":"2022-03-11T09:00:12Z","snapshot_observed_at":"2026-07-06T12:46:41.057346Z","submitted_at":"2022-03-11T09:00:12Z","title":"Near-optimal Offline Reinforcement Learning with Linear Representation: Leveraging Variance Information with Pessimism","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.05804","snapshot_observed_at":"2026-08-07T05:51:17.105267Z","title":", Duan, Y","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.07140","last_updated":"2025-06-08T13:37:38Z","snapshot_observed_at":"2026-08-07T05:38:55.820011Z","submitted_at":"2025-06-08T13:37:38Z","title":"Quantile-Optimal Policy Learning under Unmeasured Confounding","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-07T05:51:17.105267Z"},"links":{"cited_paper":"/paper/2203.05804","citing_paper":"/paper/2506.07140"},"observation_digest":"sha256:c3feac999e8ada607b29ac975e7e48d0bbd55e3a37b67562bc80714d28403344","observation_id":"f8fd36ff-4ce6-4f2f-bf7d-a6798274c259","resolution":{"observed_at":"2026-08-07T05:51:17.105267Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.05804","last_updated":"2022-03-11T09:00:12Z","snapshot_observed_at":"2026-07-06T12:46:41.057346Z","submitted_at":"2022-03-11T09:00:12Z","title":"Near-optimal Offline Reinforcement Learning with Linear Representation: Leveraging Variance Information with Pessimism","version":1},"cited_work":{"arxiv_id":"2203.05804","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2203.05804","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2203.05804 , year=","venue":null,"work_id":"ad269559-96b4-4f50-aeb2-7a855259d66d","year":null},"citing_paper":{"arxiv_id":"2604.13966","last_updated":"2026-04-15T15:17:40Z","snapshot_observed_at":"2026-08-08T02:57:57.796032Z","submitted_at":"2026-04-15T15:17:40Z","title":"Provably Efficient Offline-to-Online Value Adaptation with General Function Approximation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-10T12:55:12.531822Z"},"links":{"cited_paper":"/paper/2203.05804","citing_paper":"/paper/2604.13966"},"observation_digest":"sha256:9221e30504ea6dc2cc63bcd0f985b040fa25b161b03f0a1e8b8382cbcde3a77f","observation_id":"6ac93ea6-8707-452d-9bae-0fa87e6b7c2a","resolution":{"observed_at":"2026-05-10T12:55:24.127153Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2203.05804","last_updated":"2022-03-11T09:00:12Z","snapshot_observed_at":"2026-07-06T12:46:41.057346Z","submitted_at":"2022-03-11T09:00:12Z","title":"Near-optimal Offline Reinforcement Learning with Linear Representation: Leveraging Variance Information with Pessimism","version":1},"cited_work":{"arxiv_id":"2203.05804","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2203.05804","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2203.05804 , year=","venue":null,"work_id":"ad269559-96b4-4f50-aeb2-7a855259d66d","year":null},"citing_paper":{"arxiv_id":"2605.18246","last_updated":"2026-05-18T11:41:03Z","snapshot_observed_at":"2026-08-02T19:54:22.887281Z","submitted_at":"2026-05-18T11:41:03Z","title":"Privacy Preserving Reinforcement Learning with One-Sided Feedback","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-05-20T12:38:14.099577Z"},"links":{"cited_paper":"/paper/2203.05804","citing_paper":"/paper/2605.18246"},"observation_digest":"sha256:35edfb89713624f2d6e5640a12893c2690d74599919a0103c1efc395e396d854","observation_id":"2814b34a-d4e4-4b40-be2d-a0c4b750067f","resolution":{"observed_at":"2026-05-20T12:38:16.759079Z","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/2203.05804/citation-record","integrity":"/paper/2203.05804/integrity","json":"/paper/2203.05804/citation-record.json","paper":"/paper/2203.05804"},"outbound":[],"paper":{"arxiv_id":"2203.05804","last_updated":"2022-03-11T09:00:12Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T12:46:41.057346Z","submitted_at":"2022-03-11T09:00:12Z","title":"Near-optimal Offline Reinforcement Learning with Linear Representation: Leveraging Variance Information with Pessimism"},"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 3 inbound Pith citation observations for arXiv:2203.05804."}