Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
A Near-Optimal Algorithm for Safe Reinforcement Learning Under Instantaneous Hard Constraints
As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2302.04375.
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-10T06:31:04.303077+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-07-14T06:16:13.601515Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-12T07:41:27.805494Z
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 bca6eaa8-0753-4716-9b6f-a1d3ee917867 · 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 Near-Optimal Algorithm for Safe Reinforcement Learning Under Instantaneous Hard Constraints
Reference 49
- Resolution
- verified exact
- arxiv_id, observed 2026-05-12T07:41:27.808407Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation 1523ae56-3171-49eb-a096-9493a2202f92 · inbound
Online Resource Allocation With General Constraints cites this paper.
Online Resource Allocation With General Constraints A Near-Optimal Algorithm for Safe Reinforcement Learning Under Instantaneous Hard Constraints
Reference 48
- Resolution
- verified exact
- arxiv_id, observed 2026-05-12T06:41:32.052220Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.
Observation fd8bdb5e-4bbc-4b20-9c4f-c8f6e5d1ef2b · inbound
Decoupling Corruption and Horizon in Robust Contextual Pricing cites this paper.
Decoupling Corruption and Horizon in Robust Contextual Pricing A Near-Optimal Algorithm for Safe Reinforcement Learning Under Instantaneous Hard Constraints
Reference 49
- Resolution
- unresolved
- no resolver link, observed 2026-07-14T06:16:13.601515Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.