Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Primal-Dual $\pi$ Learning: Sample Complexity and Sublinear Run Time for Ergodic Markov Decision Problems
As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1710.06100.
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-09T06:31:02.800959+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-08T22:48:32.829460Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-10T23:30:49.569007Z
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 c5337e60-d0f6-445d-9e53-ee7c5761380f · inbound
Near-Optimal Sample Complexity for MDPs via Anchoring cites this paper.
Near-Optimal Sample Complexity for MDPs via Anchoring Primal-Dual $\pi$ Learning: Sample Complexity and Sublinear Run Time for Ergodic Markov Decision Problems
Reference 57
- Resolution
- unresolved
- no resolver link, observed 2026-08-08T22:48:32.829460Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 6e8bf332-c7ab-4cc7-80f6-30b07b7d1439 · inbound
Exploration from a Primal-Dual Lens: Value-Incentivized Actor-Critic Methods for Sample-Efficient Online RL cites this paper.
Exploration from a Primal-Dual Lens: Value-Incentivized Actor-Critic Methods for Sample-Efficient Online RL Primal-Dual $\pi$ Learning: Sample Complexity and Sublinear Run Time for Ergodic Markov Decision Problems
Reference 15
- Resolution
- unresolved
- no resolver link, observed 2026-08-06T22:16:41.136263Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 4f84cbce-69ac-48af-97a3-efc9fb8fc1e6 · inbound
Value Mirror Descent for Reinforcement Learning cites this paper.
Value Mirror Descent for Reinforcement Learning Primal-Dual $\pi$ Learning: Sample Complexity and Sublinear Run Time for Ergodic Markov Decision Problems
Reference 31
- Resolution
- verified exact
- arxiv_id, observed 2026-07-04T22:16:54.694076Z
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.