Pith. sign in

Paper Citation Record · LEDGER

Optimal Conservative Offline RL with General Function Approximation via Augmented Lagrangian

As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2211.00716.

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

pith.paper-citation-record.v1
2211.00716 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 5 of 5 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-09T06:31:02.800959+00:00

measured 5 of 5 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-09T20:45:51.304986Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-19T14:22:24.062474Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 6579d043-19b6-49cd-9ec0-21dd3b22a6c8 · inbound

Offline Learning for Combinatorial Multi-armed Bandits cites this paper.

Offline Learning for Combinatorial Multi-armed Bandits Optimal Conservative Offline RL with General Function Approximation via Augmented Lagrangian

Reference 25

Resolution
unresolved
no resolver link, observed 2026-08-09T20:45:51.304986Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-09T20:45:51.304986Z digest=sha256:cea3baa6da6d0e9f8f4cb68b2c1571ad61f0a152a1e0f548b1408769a7be98c5

Observation b13025b6-d6b8-4f31-b6b7-319abb5ba5bf · inbound

Offline Constrained Reinforcement Learning under Partial Data Coverage cites this paper.

Offline Constrained Reinforcement Learning under Partial Data Coverage Optimal Conservative Offline RL with General Function Approximation via Augmented Lagrangian

Reference 18

Resolution
verified exact
arxiv_id, observed 2026-05-19T14:22:24.064791Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-05-19T14:18:48.007454Z digest=sha256:34d0bafdbec3fee61302127aba72ecd9a1819cd8b8351b572110543efa876eab

Observation 5054200b-91b8-4a5c-ba16-086516345e00 · inbound

Reachability Weighted Offline Goal-conditioned Resampling cites this paper.

Reachability Weighted Offline Goal-conditioned Resampling Optimal Conservative Offline RL with General Function Approximation via Augmented Lagrangian

Reference 2018

Resolution
unresolved
no resolver link, observed 2026-08-07T11:24:59.657584Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T11:24:59.657584Z digest=sha256:36509d169f09f13b750796417ecc475d83a6fd6d6ba2431257bb853fc0593175

Observation cf44ae55-dfab-4780-9bb2-ca7787dda7d9 · inbound

Quantile-Optimal Policy Learning under Unmeasured Confounding cites this paper.

Quantile-Optimal Policy Learning under Unmeasured Confounding Optimal Conservative Offline RL with General Function Approximation via Augmented Lagrangian

Reference 52

Resolution
unresolved
no resolver link, observed 2026-08-07T05:51:17.024238Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-07T05:51:17.024238Z digest=sha256:3216fa5270cd287bb6f4b3b433030468b6d00cccef7ccbb64d2a8c663ddd88c1

Observation 51f9e518-0971-4ce2-8035-d1306909f4e5 · inbound

On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization cites this paper.

On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization Optimal Conservative Offline RL with General Function Approximation via Augmented Lagrangian

Reference 42

Resolution
verified exact
arxiv_id, observed 2026-05-09T05:45:22.251818Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.

source=pdf_text observed=2026-05-08T19:35:59.832868Z digest=sha256:d606a626d0d61e936f5a9e592f9249c72a0c860f6ae57217a1ba4fd98c9e3550