Pith. sign in

Paper Citation Record · LEDGER

A Provably-Efficient Model-Free Algorithm for Constrained Markov Decision Processes

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

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

pith.paper-citation-record.v1
2106.01577 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 6 of 6 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 6 of 6 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-05T23:22:29.419418Z

measured 1 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-08-05T02:28:24.338817Z

Reference resolution

0 of 0 outbound references displayed

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

External citation measurements

6
arxiv_reference, observed 2026-08-05T02:28:24.338817Z

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 5378cdf3-dd43-45ed-9659-d97273c92922 · inbound

Near-Optimal Policy Identification in Robust Constrained Markov Decision Processes via Epigraph Form cites this paper.

Near-Optimal Policy Identification in Robust Constrained Markov Decision Processes via Epigraph Form A Provably-Efficient Model-Free Algorithm for Constrained Markov Decision Processes

Reference 75

Resolution
verified exact
arxiv_id, observed 2026-05-23T22:03:30.954711Z

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=arxiv_source observed=2026-05-23T21:58:56.180393Z digest=sha256:694d61e484565fa7e25632c26312648147c0ff640962d5a3af6e68ddf106c1bc

Observation 4280673c-88d8-46ae-98be-93ae3cda025d · inbound

Tail-Risk-Safe Monte Carlo Tree Search under PAC-Level Guarantees cites this paper.

Tail-Risk-Safe Monte Carlo Tree Search under PAC-Level Guarantees A Provably-Efficient Model-Free Algorithm for Constrained Markov Decision Processes

Reference 43

Resolution
unresolved
no resolver link, observed 2026-08-05T23:22:29.419418Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-05T23:22:29.419418Z digest=sha256:74192d100ad05cff39967f0aa0b1a751f4e966e8edf4a8e007931d7834d0a48a

Observation 33be9c60-fbe8-4421-bd83-79d2bb3ae52f · inbound

Optimistic Policy Learning under Pessimistic Adversaries with Regret and Violation Guarantees cites this paper.

Optimistic Policy Learning under Pessimistic Adversaries with Regret and Violation Guarantees A Provably-Efficient Model-Free Algorithm for Constrained Markov Decision Processes

Reference 29

Resolution
verified exact
arxiv_id, observed 2026-05-10T13:40:27.191281Z

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-10T13:36:59.355147Z digest=sha256:fc0bd5624a540976bbdaab200cf6361aafdd3034ac2ad96b121b7bfc042ecc53

Observation 979f09a2-784b-4e4a-93f2-b069fe2b8fd4 · inbound

Toward Optimal Regret in Robust Pricing: Decoupling Corruption and Time cites this paper.

Toward Optimal Regret in Robust Pricing: Decoupling Corruption and Time A Provably-Efficient Model-Free Algorithm for Constrained Markov Decision Processes

Reference 17

Resolution
verified exact
arxiv_id, observed 2026-05-12T02:26:15.748110Z

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=arxiv_source observed=2026-05-12T02:23:56.057336Z digest=sha256:ca03223c2856a7770b4dc41949ae79b37017935e2bd3c6ab71f33c4f169605c9

Observation 672f31e9-7fe0-4b65-99f6-5eb6b5998ea8 · inbound

Online Resource Allocation With General Constraints cites this paper.

Online Resource Allocation With General Constraints A Provably-Efficient Model-Free Algorithm for Constrained Markov Decision Processes

Reference 16

Resolution
verified exact
arxiv_id, observed 2026-05-12T04:06:20.709997Z

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=arxiv_source observed=2026-05-12T04:04:36.278591Z digest=sha256:3b7c1b1a37f20b19336a34ca7040fb07a2dc395b3abd57be66a648504968ea7c

Observation b497eca0-98be-4443-acbf-132214cdd6b3 · inbound

Decoupling Corruption and Horizon in Robust Contextual Pricing cites this paper.

Decoupling Corruption and Horizon in Robust Contextual Pricing A Provably-Efficient Model-Free Algorithm for Constrained Markov Decision Processes

Reference 17

Resolution
unresolved
no resolver link, observed 2026-07-14T06:16:13.601515Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-07-14T06:16:13.601515Z digest=sha256:080d96b69b28312205d2470bbd04098743deb17098bf392fb129824f65bbfa5d