{"as_of":"2026-08-10T12:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d7fcd1a9fd62e1f97d24c6adba2eedcf7b4a073fb23b26a7d4e69e22f605f5b1","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T20:45:51.310714Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":8,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2202.13890","last_updated":"2022-06-10T21:36:10Z","snapshot_observed_at":"2026-08-06T06:31:56.061050Z","submitted_at":"2022-02-28T15:39:36Z","title":"Pessimistic Q-Learning for Offline Reinforcement Learning: Towards Optimal Sample Complexity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2202.13890","snapshot_observed_at":"2026-08-09T20:45:51.310714Z","title":"org/CorpusID:257495837","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.19300","last_updated":"2025-05-29T03:11:10Z","snapshot_observed_at":"2026-08-10T08:15:42.185401Z","submitted_at":"2025-01-31T16:56:18Z","title":"Offline Learning for Combinatorial Multi-armed Bandits","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-09T20:45:51.310714Z"},"links":{"cited_paper":"/paper/2202.13890","citing_paper":"/paper/2501.19300"},"observation_digest":"sha256:02984cd791c0d5249b8c7684de476097e2078bcd0ffaa8a45c28f9b88ddddb44","observation_id":"08f0f9f1-6674-45f7-809c-eb401a3af3e2","resolution":{"observed_at":"2026-08-09T20:45:51.310714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2202.13890","last_updated":"2022-06-10T21:36:10Z","snapshot_observed_at":"2026-08-06T06:31:56.061050Z","submitted_at":"2022-02-28T15:39:36Z","title":"Pessimistic Q-Learning for Offline Reinforcement Learning: Towards Optimal Sample Complexity","version":2},"cited_work":{"arxiv_id":"2202.13890","doi":"10.48550/arxiv.2202.13890","metadata_source":"arxiv_reference","pith_arxiv_id":"2202.13890","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Pessimistic q-learning for offline reinforcement learning: Towards optimal sample complexity","venue":"arXiv (Cornell University)","work_id":"292ddae4-04d9-4389-a6c0-baf6659435d0","year":2022},"citing_paper":{"arxiv_id":"2604.02438","last_updated":"2026-05-09T18:59:30Z","snapshot_observed_at":"2026-08-03T15:17:23.743228Z","submitted_at":"2026-04-02T18:09:11Z","title":"Mitigating Data Scarcity in Spaceflight Applications for Offline Reinforcement Learning Using Physics-Informed Deep Generative Models","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-13T21:35:52.012244Z"},"links":{"cited_paper":"/paper/2202.13890","citing_paper":"/paper/2604.02438"},"observation_digest":"sha256:ce8ae6cdc4b8c7c52df7ad8b35ba0cba0cef83fcfae01f22b13b6ba7f99042a9","observation_id":"54a9079e-cebd-44c1-ad05-ab140499b496","resolution":{"observed_at":"2026-05-13T21:38:18.429878Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.13890","last_updated":"2022-06-10T21:36:10Z","snapshot_observed_at":"2026-08-06T06:31:56.061050Z","submitted_at":"2022-02-28T15:39:36Z","title":"Pessimistic Q-Learning for Offline Reinforcement Learning: Towards Optimal Sample Complexity","version":2},"cited_work":{"arxiv_id":"2202.13890","doi":"10.48550/arxiv.2202.13890","metadata_source":"arxiv_reference","pith_arxiv_id":"2202.13890","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Pessimistic q-learning for offline reinforcement learning: Towards optimal sample complexity","venue":"arXiv (Cornell University)","work_id":"292ddae4-04d9-4389-a6c0-baf6659435d0","year":2022},"citing_paper":{"arxiv_id":"2605.03393","last_updated":"2026-05-05T06:08:54Z","snapshot_observed_at":"2026-08-07T11:17:36.866995Z","submitted_at":"2026-05-05T06:08:54Z","title":"Adaptive Estimation and Optimal Control in Offline Contextual MDPs without Stationarity","version":1},"reference_index":248,"source":"arxiv_source","source_observed_at":"2026-05-07T13:27:05.081050Z"},"links":{"cited_paper":"/paper/2202.13890","citing_paper":"/paper/2605.03393"},"observation_digest":"sha256:357787c29f116ebd635534ccc94933ebbdf69a5be18c2ac2443b463ce237df80","observation_id":"94743818-adde-4b57-b13c-328ea9f1bf65","resolution":{"observed_at":"2026-05-12T08:56:26.464421Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2202.13890","last_updated":"2022-06-10T21:36:10Z","snapshot_observed_at":"2026-08-06T06:31:56.061050Z","submitted_at":"2022-02-28T15:39:36Z","title":"Pessimistic Q-Learning for Offline Reinforcement Learning: Towards Optimal Sample Complexity","version":2},"cited_work":{"arxiv_id":"2202.13890","doi":"10.48550/arxiv.2202.13890","metadata_source":"arxiv_reference","pith_arxiv_id":"2202.13890","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Pessimistic q-learning for offline reinforcement learning: Towards optimal sample complexity","venue":"arXiv (Cornell University)","work_id":"292ddae4-04d9-4389-a6c0-baf6659435d0","year":2022},"citing_paper":{"arxiv_id":"2605.07218","last_updated":"2026-05-08T04:10:03Z","snapshot_observed_at":"2026-07-06T23:19:35.885430Z","submitted_at":"2026-05-08T04:10:03Z","title":"Improved Model-based Reinforcement Learning with Smooth Kernels","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-11T02:32:24.570036Z"},"links":{"cited_paper":"/paper/2202.13890","citing_paper":"/paper/2605.07218"},"observation_digest":"sha256:be2aa34a60380bcf51c51923ff38733c4386239a2c4d8d975b9b9a031aad6222","observation_id":"99ae8463-a913-4a36-81f1-f0d42bc21231","resolution":{"observed_at":"2026-05-11T03:15:56.810729Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2202.13890/citation-record","integrity":"/paper/2202.13890/integrity","json":"/paper/2202.13890/citation-record.json","paper":"/paper/2202.13890"},"outbound":[],"paper":{"arxiv_id":"2202.13890","last_updated":"2022-06-10T21:36:10Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T06:31:56.061050Z","submitted_at":"2022-02-28T15:39:36Z","title":"Pessimistic Q-Learning for Offline Reinforcement Learning: Towards Optimal Sample Complexity"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2202.13890."}