Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Queue Scheduling with Adversarial Bandit Learning
As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2303.01745.
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-07-14T09:06:47.558015Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-21T06:24:00.487193Z
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 c5468515-3338-4d5e-936a-c91c7d2e108c · inbound
Constrained Contextual Bandits with Adversarial Contexts cites this paper.
Constrained Contextual Bandits with Adversarial Contexts Queue Scheduling with Adversarial Bandit Learning
Reference 106
- Resolution
- verified exact
- arxiv_id, observed 2026-05-11T18:51:08.193929Z
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 b342fdb8-0ce7-4eda-9d97-f51e749f6ce9 · inbound
A Geometric Approach to Constrained Online Learning cites this paper.
A Geometric Approach to Constrained Online Learning Queue Scheduling with Adversarial Bandit Learning
Reference 117
- Resolution
- verified exact
- arxiv_id, observed 2026-05-21T06:24:00.488711Z
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 b4077676-e2e0-4378-b8cd-da9d3c3c8e91 · inbound
Lower Bound on the Cumulative Constrained Violation for the OGD+Projection algorithm for Constrained Online Convex Optimization (COCO) cites this paper.
Lower Bound on the Cumulative Constrained Violation for the OGD+Projection algorithm for Constrained Online Convex Optimization (COCO) Queue Scheduling with Adversarial Bandit Learning
Reference 99
- Resolution
- unresolved
- no resolver link, observed 2026-07-14T09:06:47.558015Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.