Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Optimal Sample Complexity of Reinforcement Learning for Mixing Discounted Markov Decision Processes
As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2302.07477.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-15T20:45:55.394758Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-15T20:45:56.028924Z
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 bbcd3ccd-dc07-4cd4-a930-e02b95d2e698 · inbound
Model-Free Robust Average-Reward Reinforcement Learning with Sample Complexity Analysis cites this paper.
Model-Free Robust Average-Reward Reinforcement Learning with Sample Complexity Analysis Optimal Sample Complexity of Reinforcement Learning for Mixing Discounted Markov Decision Processes
Reference 67
- Resolution
- verified exact
- local_arxiv, observed 2026-08-15T20:45:56.034715Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.