Paper Citation Record · LEDGER

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage

As of 8 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:2602.12107.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2602.12107 v2

Coverage vector

measured 31 of 31 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-03T00:05:20.143317Z

measured 31 of 31 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

31 of 31 outbound references displayed

verified exact0
verified fuzzy0
unresolved31
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 085063fb-3ab3-43c0-be64-e5183de5d18e · outbound

This paper cites J., Jiang, N., Sekhari, A., and Xie, T.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage J., Jiang, N., Sekhari, A., and Xie, T

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:18.366529Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1bd3bbeb-c529-4353-901c-c5f1d92f2bba · outbound

This paper cites A Tutorial: An Intuitive Explanation of Offline Reinforcement Learning Theory.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage A Tutorial: An Intuitive Explanation of Offline Reinforcement Learning Theory

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:18.414526Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0e6251a3-39ab-4e2c-b5e8-18b61b78f2d6 · outbound

This paper cites and Jiang, N.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage and Jiang, N

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:18.492810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9284ed7d-d603-4687-9329-b474e4a20daa · outbound

This paper cites and Jiang, N.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage and Jiang, N

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:18.550538Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f0477979-a0c7-4285-ba87-0b3f267774af · outbound

This paper cites an unresolved cited work.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage Unresolved cited work

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:18.605236Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bafef5a7-ea81-4080-9f50-63748358eb90 · outbound

This paper cites J., Golowich, N., and Han, Y.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage J., Golowich, N., and Han, Y

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:18.679897Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 48596e63-a90b-4ba3-a29c-866e419c1ecf · outbound

This paper cites J., Golowich, N., Qian, J., Rakhlin, A., and Sekhari, A.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage J., Golowich, N., Qian, J., Rakhlin, A., and Sekhari, A

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:18.734735Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c94e0e3c-0efa-48ba-a635-bdad8d11c124 · outbound

This paper cites The Statistical Complexity of Interactive Decision Making.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage The Statistical Complexity of Interactive Decision Making

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:18.807556Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1cd49f8d-59f4-4160-a9b7-6dbc3d340158 · outbound

This paper cites J., Krishnamurthy, A., Simchi-Levi, D., and Xu, Y.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage J., Krishnamurthy, A., Simchi-Levi, D., and Xu, Y

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:18.869296Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5b8829c3-e9a8-40f0-be40-e547f730f729 · outbound

This paper cites and Moitra, A.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage and Moitra, A

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:18.926242Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fa11f4ba-be23-44ef-b36a-deb0e91dc6de · outbound

This paper cites L., Yan ko g lu, \.I ., and Den Hertog, D.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage L., Yan ko g lu, \.I ., and Den Hertog, D

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:18.973628Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f6695729-08cf-4ca4-b29e-00b0ea533fd6 · outbound

This paper cites an unresolved cited work.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage Unresolved cited work

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:19.036525Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 20810682-9aa7-4083-9b8d-0b23ef5bd932 · outbound

This paper cites an unresolved cited work.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage Unresolved cited work

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:19.086210Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 71a79e55-b9ab-4868-ab07-5018f810ae56 · outbound

This paper cites an unresolved cited work.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage Unresolved cited work

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:19.151579Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7041870f-b3ea-44d3-b00a-cf681facd1a9 · outbound

This paper cites an unresolved cited work.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage Unresolved cited work

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:19.198766Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e253d590-f554-4deb-84b9-34b810dea194 · outbound

This paper cites and Szepesvari, C.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage and Szepesvari, C

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:19.253951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2db6e7b3-c099-4b5d-8637-37b1df1e22de · outbound

This paper cites and Szepesv \'a ri, C.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage and Szepesv \'a ri, C

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:19.300743Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 30bbff21-abae-4295-884a-4d5de2aa4e20 · outbound

This paper cites an unresolved cited work.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage Unresolved cited work

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:19.365085Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9663ff69-2342-461e-889d-074a115ab83a · outbound

This paper cites an unresolved cited work.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage Unresolved cited work

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:19.414853Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6c786fc4-280c-4d87-94e7-e97ba808e5de · outbound

This paper cites an unresolved cited work.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage Unresolved cited work

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:19.494629Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 906a2f62-c3ce-4f40-8952-21a60d4e2bff · outbound

This paper cites E., Pattathil, S., Zhang, J., and Zhang, K.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage E., Pattathil, S., Zhang, J., and Zhang, K

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:19.578870Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 560b8bef-1b1e-48e6-bd41-3335c80b12c2 · outbound

This paper cites an unresolved cited work.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage Unresolved cited work

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:19.632468Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5fe5774a-48df-4fd5-a21a-3bdccbd329b0 · outbound

This paper cites Hybrid RL: Using Both Offline and Online Data Can Make RL Efficient.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage Hybrid RL: Using Both Offline and Online Data Can Make RL Efficient

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:19.691967Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 44cf4e2b-7902-499e-abab-f2caac0b6b2c · outbound

This paper cites D., and Sun, W.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage D., and Sun, W

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:19.751086Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8db989ba-9fbf-4274-ac81-a29ba1ce6776 · outbound

This paper cites Pessimistic Model-based Offline Reinforcement Learning under Partial Coverage.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage Pessimistic Model-based Offline Reinforcement Learning under Partial Coverage

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:19.800270Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e9cc21c6-002c-4e27-9ee7-5290eedcdc7e · outbound

This paper cites an unresolved cited work.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage Unresolved cited work

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:19.848990Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 933b222c-37b7-4b28-82b9-de8b415aa0f3 · outbound

This paper cites Behavior Regularized Offline Reinforcement Learning.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage Behavior Regularized Offline Reinforcement Learning

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:19.900233Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 89a1881e-491e-4168-a4cd-86638fcefe2e · outbound

This paper cites an unresolved cited work.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage Unresolved cited work

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:19.970986Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 174ae979-4e02-4e1c-9536-0f51209f6f7d · outbound

This paper cites an unresolved cited work.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage Unresolved cited work

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:20.034179Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3a098f92-192b-48c7-ad26-580eb2603f84 · outbound

This paper cites and Zeevi, A.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage and Zeevi, A

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:20.086436Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c849b95c-6e3d-40f1-aea2-8f4498dff544 · outbound

This paper cites an unresolved cited work.

On the Complexity of Offline Reinforcement Learning with $Q^\star$-Approximation and Partial Coverage Unresolved cited work

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-03T00:05:20.143317Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.