Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries
As of 24 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2504.00461.
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-23T06:30:58.430688+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-07T13:03:57.337942Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-20T20:59:01.936060Z
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 7419b645-f73e-46af-a77b-5d6f5fff10c8 · inbound
Learning to Incentivize in Repeated Principal-Agent Problems with Adversarial Agent Arrivals cites this paper.
Learning to Incentivize in Repeated Principal-Agent Problems with Adversarial Agent Arrivals Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries
Reference 25
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T13:03:57.337942Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation bd30cf9e-2b15-4d6c-bbcd-b705f288ba6b · inbound
Differential Privacy in the Extensive-Form Bandit Problem cites this paper.
Differential Privacy in the Extensive-Form Bandit Problem Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries
Reference 13
- Resolution
- metadata mismatch
- arxiv_id, observed 2026-05-11T17:31:06.755277Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.
Observation 3f82cfb3-4dd9-4998-8f6b-9271cf5a1152 · inbound
On the Power of Adaptivity for $\varepsilon$-Best Arm Identification in Linear Bandits cites this paper.
On the Power of Adaptivity for $\varepsilon$-Best Arm Identification in Linear Bandits Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries
Reference 4
- Resolution
- verified exact
- arxiv_id, observed 2026-05-20T20:59:01.939929Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.