Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Provably Efficient Model-Free Algorithm for MDPs with Peak Constraints
As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2003.05555.
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-07T14:16:51.975070Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-12T07:41:27.784625Z
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 27452e6a-0ee1-445e-882d-ea16bb0f363b · inbound
Data-Dependent Regret Bounds for Constrained MABs cites this paper.
Data-Dependent Regret Bounds for Constrained MABs Provably Efficient Model-Free Algorithm for MDPs with Peak Constraints
Reference 2002
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T14:16:51.975070Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 8c408b1d-45ae-4f0e-be9a-c40a6b2ffdb9 · inbound
No-Regret Learning Under Adversarial Resource Constraints: A Spending Plan Is All You Need! cites this paper.
No-Regret Learning Under Adversarial Resource Constraints: A Spending Plan Is All You Need! Provably Efficient Model-Free Algorithm for MDPs with Peak Constraints
Reference 2018
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T00:44:26.151610Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 2e37f8fc-2085-4179-adc2-016a6f644834 · inbound
Toward Optimal Regret in Robust Pricing: Decoupling Corruption and Time cites this paper.
Toward Optimal Regret in Robust Pricing: Decoupling Corruption and Time Provably Efficient Model-Free Algorithm for MDPs with Peak Constraints
Reference 21
- Resolution
- verified exact
- arxiv_id, observed 2026-05-12T07:41:27.786973Z
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.
Observation cd92a5bb-b3cb-4b2a-a951-a824a76e1bed · inbound
Online Resource Allocation With General Constraints cites this paper.
Online Resource Allocation With General Constraints Provably Efficient Model-Free Algorithm for MDPs with Peak Constraints
Reference 20
- Resolution
- verified exact
- arxiv_id, observed 2026-05-12T06:41:31.460412Z
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.
Observation c484bef1-cdf7-42be-9a02-60f768be6e00 · inbound
Decoupling Corruption and Horizon in Robust Contextual Pricing cites this paper.
Decoupling Corruption and Horizon in Robust Contextual Pricing Provably Efficient Model-Free Algorithm for MDPs with Peak Constraints
Reference 21
- Resolution
- unresolved
- no resolver link, observed 2026-07-14T06:16:13.601515Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.