Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Learning Adversarial MDPs with Stochastic Hard Constraints
As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2403.03672.
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-17T06:30:58.91139+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-07T14:16:52.208911Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-12T07:41:27.789065Z
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 0500cb62-2128-4fe6-a506-10c64ffda4f7 · inbound
Data-Dependent Regret Bounds for Constrained MABs cites this paper.
Data-Dependent Regret Bounds for Constrained MABs Learning Adversarial MDPs with Stochastic Hard Constraints
Reference 2020
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T14:16:52.208911Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation a182d344-fcc4-42ee-bf95-7cbc40d03d95 · inbound
An Optimistic Algorithm for online CMDPS with Anytime Adversarial Constraints cites this paper.
An Optimistic Algorithm for online CMDPS with Anytime Adversarial Constraints Learning Adversarial MDPs with Stochastic Hard Constraints
Reference 34
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T13:35:51.044652Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation a48b5e45-c020-4f85-983c-bea6457fb9b8 · 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! Learning Adversarial MDPs with Stochastic Hard Constraints
Reference 2024
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T00:44:27.212457Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation e25465a4-fbc9-4f66-99a5-5fa98b70a251 · inbound
Toward Optimal Regret in Robust Pricing: Decoupling Corruption and Time cites this paper.
Toward Optimal Regret in Robust Pricing: Decoupling Corruption and Time Learning Adversarial MDPs with Stochastic Hard Constraints
Reference 41
- Resolution
- verified exact
- arxiv_id, observed 2026-05-12T07:41:27.794159Z
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.
Observation bb51d065-4e69-4969-b200-8c17d5295f61 · inbound
Online Resource Allocation With General Constraints cites this paper.
Online Resource Allocation With General Constraints Learning Adversarial MDPs with Stochastic Hard Constraints
Reference 40
- Resolution
- verified exact
- arxiv_id, observed 2026-05-12T06:41:31.772007Z
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.
Observation f6298c77-7829-4a96-a705-ac0563ec262c · inbound
Decoupling Corruption and Horizon in Robust Contextual Pricing cites this paper.
Decoupling Corruption and Horizon in Robust Contextual Pricing Learning Adversarial MDPs with Stochastic Hard Constraints
Reference 41
- Resolution
- unresolved
- no resolver link, observed 2026-07-14T06:16:13.601515Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.