{"as_of":"2026-08-09T07:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:1fed7c518aff3f30fb7b4ce12e6d70ace177c263847a016746c79bf85262c87a","coverage":[{"denominator":31,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":31,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T00:05:20.143317Z","state":"measured"},{"denominator":31,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":31,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2602.12107/citation-record","integrity":"/paper/2602.12107/integrity","json":"/paper/2602.12107/citation-record.json","paper":"/paper/2602.12107"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:05:18.366529Z","title":"J., Jiang, N., Sekhari, A., and Xie, T","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:18.366529Z"},"links":{"citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:7a34d9f0b0649b905e9867a0aec3fa042e8231ac5228e1021358323f03dc10d1","observation_id":"085063fb-3ab3-43c0-be64-e5183de5d18e","resolution":{"observed_at":"2026-08-03T00:05:18.366529Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.07746","last_updated":"2025-08-11T08:26:28Z","snapshot_observed_at":"2026-08-08T07:24:59.732370Z","submitted_at":"2025-08-11T08:26:28Z","title":"A Tutorial: An Intuitive Explanation of Offline Reinforcement Learning Theory","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.07746","snapshot_observed_at":"2026-08-03T00:05:18.414526Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:18.414526Z"},"links":{"cited_paper":"/paper/2508.07746","citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:dfc7c2de57958997d33990c0618e6860db29438bcc236a3a3bfb8391f0d1542a","observation_id":"1bd3bbeb-c529-4353-901c-c5f1d92f2bba","resolution":{"observed_at":"2026-08-03T00:05:18.414526Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:05:18.492810Z","title":"and Jiang, N","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:18.492810Z"},"links":{"citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:a510048b5b8bf8be6e4c97da5c5ee4b0cc3e2ee81148e71249aa47dd3f0c053b","observation_id":"0e6251a3-39ab-4e2c-b5e8-18b61b78f2d6","resolution":{"observed_at":"2026-08-03T00:05:18.492810Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:05:18.550538Z","title":"and Jiang, N","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:18.550538Z"},"links":{"citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:1be025b94fdd44e6c51b292d84aff61fa5696a95463766cffb33fcdf0782b4f4","observation_id":"9284ed7d-d603-4687-9329-b474e4a20daa","resolution":{"observed_at":"2026-08-03T00:05:18.550538Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:05:18.605236Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:18.605236Z"},"links":{"citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:40ef652ad35b045862ef1a1ec32170e4b9af1523b20a28483924af61ffb508f0","observation_id":"f0477979-a0c7-4285-ba87-0b3f267774af","resolution":{"observed_at":"2026-08-03T00:05:18.605236Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:05:18.679897Z","title":"J., Golowich, N., and Han, Y","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:18.679897Z"},"links":{"citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:c9b5292f562d7ca3b09d92e794f4834446e5468ff83267d11763c666c312dcd7","observation_id":"bafef5a7-ea81-4080-9f50-63748358eb90","resolution":{"observed_at":"2026-08-03T00:05:18.679897Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:05:18.734735Z","title":"J., Golowich, N., Qian, J., Rakhlin, A., and Sekhari, A","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:18.734735Z"},"links":{"citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:fa5f2e7b9fdc4cb57298a626a4700237c31ca61fdac17c003da352b6013a3ed0","observation_id":"48596e63-a90b-4ba3-a29c-866e419c1ecf","resolution":{"observed_at":"2026-08-03T00:05:18.734735Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2112.13487","last_updated":"2023-07-11T16:47:42Z","snapshot_observed_at":"2026-07-06T12:22:32.240903Z","submitted_at":"2021-12-27T02:53:44Z","title":"The Statistical Complexity of Interactive Decision Making","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.13487","snapshot_observed_at":"2026-08-03T00:05:18.807556Z","title":"J., Kakade, S","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:18.807556Z"},"links":{"cited_paper":"/paper/2112.13487","citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:744aa6973726e09ad3b31064402fb6f96e14b47400c21467b7909380c3b576d7","observation_id":"c94e0e3c-0efa-48ba-a635-bdad8d11c124","resolution":{"observed_at":"2026-08-03T00:05:18.807556Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:05:18.869296Z","title":"J., Krishnamurthy, A., Simchi-Levi, D., and Xu, Y","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:18.869296Z"},"links":{"citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:d45320d7711a281c7f73509c2af852e02d6415fd1c766edcb5f4fe12841ce75f","observation_id":"1cd49f8d-59f4-4160-a9b7-6dbc3d340158","resolution":{"observed_at":"2026-08-03T00:05:18.869296Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:05:18.926242Z","title":"and Moitra, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:18.926242Z"},"links":{"citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:ed3c504ef1e0dac5a8813ecc06a739240ecc516940ae936de7e1326dd58d1279","observation_id":"5b8829c3-e9a8-40f0-be40-e547f730f729","resolution":{"observed_at":"2026-08-03T00:05:18.926242Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:05:18.973628Z","title":"L., Yan ko g lu, \\.I ., and Den Hertog, D","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:18.973628Z"},"links":{"citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:ccd7bed517dc362a98ce70bfe83d502849e3c2807b7f603d6e4e775405aebfb2","observation_id":"fa11f4ba-be23-44ef-b36a-deb0e91dc6de","resolution":{"observed_at":"2026-08-03T00:05:18.973628Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:05:19.036525Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:19.036525Z"},"links":{"citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:29ad5303ac42099894417cdb99b6a15ff1b9b87d03e89ab33b0aa87ff82f44af","observation_id":"f6695729-08cf-4ca4-b29e-00b0ea533fd6","resolution":{"observed_at":"2026-08-03T00:05:19.036525Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:05:19.086210Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:19.086210Z"},"links":{"citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:799aaa0a8acdfb7afa5240735fe3a1e724bd9b91c473508a46653159cfe751cd","observation_id":"20810682-9aa7-4083-9b8d-0b23ef5bd932","resolution":{"observed_at":"2026-08-03T00:05:19.086210Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:05:19.151579Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:19.151579Z"},"links":{"citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:86613b41c8fa91c718581fd3305c6cc7031d530161c3595c09bf6c903aa973d1","observation_id":"71a79e55-b9ab-4868-ab07-5018f810ae56","resolution":{"observed_at":"2026-08-03T00:05:19.151579Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:05:19.198766Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:19.198766Z"},"links":{"citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:efcf2b2e61bf96e1759304d89eeee1882d225135d42c7b40515f0fd543b761d6","observation_id":"7041870f-b3ea-44d3-b00a-cf681facd1a9","resolution":{"observed_at":"2026-08-03T00:05:19.198766Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:05:19.253951Z","title":"and Szepesvari, C","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:19.253951Z"},"links":{"citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:ee11718ffc8d4792d193c633fded23fbabe06d5dd438bd16e8328b3a8508c50d","observation_id":"e253d590-f554-4deb-84b9-34b810dea194","resolution":{"observed_at":"2026-08-03T00:05:19.253951Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:05:19.300743Z","title":"and Szepesv \\'a ri, C","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:19.300743Z"},"links":{"citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:7041e4816c40205b2bae9f7ca81e2972d44d92237131d1147e726d01138e5ee8","observation_id":"2db6e7b3-c099-4b5d-8637-37b1df1e22de","resolution":{"observed_at":"2026-08-03T00:05:19.300743Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:05:19.365085Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:19.365085Z"},"links":{"citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:9c666a328f7a9834c7b8e70f30b7d9ffb956823cbf97386e79689a71bd6403b2","observation_id":"30bbff21-abae-4295-884a-4d5de2aa4e20","resolution":{"observed_at":"2026-08-03T00:05:19.365085Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:05:19.414853Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:19.414853Z"},"links":{"citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:dead1e9b1c45cc4af2e757258cea4b03fcf2e09f02bc0ce88b07c36b4cdfbf18","observation_id":"9663ff69-2342-461e-889d-074a115ab83a","resolution":{"observed_at":"2026-08-03T00:05:19.414853Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:05:19.494629Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:19.494629Z"},"links":{"citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:ff3d857ee21f28548693420eb493bf49d1287afc26ed72cbecf5f60e7e4254f7","observation_id":"6c786fc4-280c-4d87-94e7-e97ba808e5de","resolution":{"observed_at":"2026-08-03T00:05:19.494629Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:05:19.578870Z","title":"E., Pattathil, S., Zhang, J., and Zhang, K","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:19.578870Z"},"links":{"citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:66bcf22a4099bacb0040d675cae705bfac0abc4ad851719359029dca5e517596","observation_id":"906a2f62-c3ce-4f40-8952-21a60d4e2bff","resolution":{"observed_at":"2026-08-03T00:05:19.578870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:05:19.632468Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:19.632468Z"},"links":{"citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:847664d37fbb1e3ad458c278667245f1f9a0f29a54298f66c59443e078d3d1a0","observation_id":"560b8bef-1b1e-48e6-bd41-3335c80b12c2","resolution":{"observed_at":"2026-08-03T00:05:19.632468Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.06718","last_updated":"2023-03-11T11:47:54Z","snapshot_observed_at":"2026-08-02T06:10:04.416926Z","submitted_at":"2022-10-13T04:19:05Z","title":"Hybrid RL: Using Both Offline and Online Data Can Make RL Efficient","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.06718","snapshot_observed_at":"2026-08-03T00:05:19.691967Z","title":"A., Krishnamurthy, A., and Sun, W","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:19.691967Z"},"links":{"cited_paper":"/paper/2210.06718","citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:ef32eff4234fa786a5ff4f8cd0a77b74e0fb16f75854a4cd8297e7508a13a795","observation_id":"5fe5774a-48df-4fd5-a21a-3bdccbd329b0","resolution":{"observed_at":"2026-08-03T00:05:19.691967Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:05:19.751086Z","title":"D., and Sun, W","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:19.751086Z"},"links":{"citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:8c059e968ea2eba1939c8e03b93c15fa906cb4ccf9665c0e2f9a7366707fe252","observation_id":"44cf4e2b-7902-499e-abab-f2caac0b6b2c","resolution":{"observed_at":"2026-08-03T00:05:19.751086Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.06226","last_updated":"2023-01-10T04:15:46Z","snapshot_observed_at":"2026-08-04T18:44:55.716082Z","submitted_at":"2021-07-13T16:30:01Z","title":"Pessimistic Model-based Offline Reinforcement Learning under Partial Coverage","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.06226","snapshot_observed_at":"2026-08-03T00:05:19.800270Z","title":"and Sun, W","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:19.800270Z"},"links":{"cited_paper":"/paper/2107.06226","citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:19a6198348f2c7a558e666adbeb61aa7823210fd627fc501db0d9817277f554f","observation_id":"8db989ba-9fbf-4274-ac81-a29ba1ce6776","resolution":{"observed_at":"2026-08-03T00:05:19.800270Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:05:19.848990Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:19.848990Z"},"links":{"citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:6a9fd0cf5e1de5a6496e4c9a5ebff65891dee8002188d208412d493ea60384b1","observation_id":"e9cc21c6-002c-4e27-9ee7-5290eedcdc7e","resolution":{"observed_at":"2026-08-03T00:05:19.848990Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.11361","last_updated":"2019-11-26T06:11:34Z","snapshot_observed_at":"2026-07-06T08:39:58.361914Z","submitted_at":"2019-11-26T06:11:34Z","title":"Behavior Regularized Offline Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.11361","snapshot_observed_at":"2026-08-03T00:05:19.900233Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:19.900233Z"},"links":{"cited_paper":"/paper/1911.11361","citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:c645ce36edb9e28da78988320ee80d2a810d2389bb1826bcab028df7eb301d66","observation_id":"933b222c-37b7-4b28-82b9-de8b415aa0f3","resolution":{"observed_at":"2026-08-03T00:05:19.900233Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:05:19.970986Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:19.970986Z"},"links":{"citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:2b6fe2821eedc476258a7ed695b681a7335efde0d2383831346597f0c976616b","observation_id":"89a1881e-491e-4168-a4cd-86638fcefe2e","resolution":{"observed_at":"2026-08-03T00:05:19.970986Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:05:20.034179Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:20.034179Z"},"links":{"citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:867692d3670d9f8d1a01c94486df7e13c784bf4a6f0a37d41e59fc2768289f0e","observation_id":"174ae979-4e02-4e1c-9536-0f51209f6f7d","resolution":{"observed_at":"2026-08-03T00:05:20.034179Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:05:20.086436Z","title":"and Zeevi, A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:20.086436Z"},"links":{"citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:ff2633483a0c47bd1211f4e04f059f9eed72b1936b0cdb3b97845d6d25c66ddd","observation_id":"3a098f92-192b-48c7-ad26-580eb2603f84","resolution":{"observed_at":"2026-08-03T00:05:20.086436Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T00:05:20.143317Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-03T00:05:20.143317Z"},"links":{"citing_paper":"/paper/2602.12107"},"observation_digest":"sha256:0250e9fba3e730db4984dab07000fd852e0245ef6fb30b91173ae08becc35fd6","observation_id":"c849b95c-6e3d-40f1-aea2-8f4498dff544","resolution":{"observed_at":"2026-08-03T00:05:20.143317Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.12107","last_updated":"2026-06-07T03:40:44Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-08T15:10:59.205706Z","submitted_at":"2026-02-12T15:59:42Z","title":"On the Complexity of Offline Reinforcement Learning with $Q^\\star$-Approximation and Partial Coverage"},"reference_resolution":{"displayed":31,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":31,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":31},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:2602.12107."}