Pith. sign in

Paper Citation Record · LEDGER

Span-Based Optimal Sample Complexity for Average Reward MDPs

As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2311.13469.

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

pith.paper-citation-record.v1
2311.13469 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-17T06:30:58.91139+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-16T12:42:09.225245Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-15T20:45:56.591385Z

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 486aa4c3-e495-49a0-8ec6-1b840927354f · inbound

A Computationally Efficient Algorithm for Infinite-Horizon Average-Reward Linear MDPs cites this paper.

A Computationally Efficient Algorithm for Infinite-Horizon Average-Reward Linear MDPs Span-Based Optimal Sample Complexity for Average Reward MDPs

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-16T12:42:09.225245Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T12:42:09.225245Z digest=sha256:09180bd82b21f0d875b18c0c711613e613875be187b4fd46adb69371360e9134

Observation 03c3a3cf-0150-4f91-99a2-51666ec12ac3 · 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 Span-Based Optimal Sample Complexity for Average Reward MDPs

Reference 32

Resolution
verified exact
local_arxiv, observed 2026-08-15T20:45:56.598129Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.

source=pdf_text observed=2026-08-15T20:45:55.193656Z digest=sha256:7330e43fa240b8b8aba724a312f7b34e64628b3fb3b8787896a59b0d7cf4e625