Pith. sign in

Paper Citation Record · LEDGER

Optimal Sample Complexity for Average Reward Markov Decision Processes

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

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

pith.paper-citation-record.v1
2310.08833 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-18T06:34:40.430872+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.198958Z

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.054263Z

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 217f2d16-2c1e-46c1-8c2e-141cdeb8a9cc · 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 Optimal Sample Complexity for Average Reward Markov Decision Processes

Reference 17

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-16T12:42:09.198958Z digest=sha256:f65f3e42533e06db6a9460b72637e60de24c964f8c7a7ccea2d997b1360b30d6

Observation 6291b4b6-4fc3-4311-bbb2-2b5e064cb378 · 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 for Average Reward Markov Decision Processes

Reference 66

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

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.

source=pdf_text observed=2026-08-15T20:45:55.389158Z digest=sha256:ad1e8c1c11f8e8a32787bec1426357a68fbb862129375379bf142bc170e13a86