Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Near-Optimal Primal-Dual Algorithms for Quantity-Based Network Revenue Management
As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2011.06327.
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-08-06T18:11:14.902810Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-11T21:31:14.008705Z
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 5f776c28-2758-4907-988b-888f46f7fe93 · inbound
Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation cites this paper.
Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation Near-Optimal Primal-Dual Algorithms for Quantity-Based Network Revenue Management
Reference 56
- Resolution
- unresolved
- no resolver link, observed 2026-08-06T18:11:14.902810Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 20a90b2b-ea09-4d4f-a819-4799d8a2fc1d · inbound
Tackling the Data-Parallel Load Balancing Bottleneck in LLM Serving: Practical Online Routing at Scale cites this paper.
Tackling the Data-Parallel Load Balancing Bottleneck in LLM Serving: Practical Online Routing at Scale Near-Optimal Primal-Dual Algorithms for Quantity-Based Network Revenue Management
Reference 24
- Resolution
- verified exact
- arxiv_id, observed 2026-05-11T21:31:14.013011Z
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 d97cab97-de54-40b4-a4be-85a35f4abdf6 · inbound
Tackling the Data-Parallel Load Balancing Bottleneck in LLM Serving: Practical Online Routing at Scale cites this paper.
Tackling the Data-Parallel Load Balancing Bottleneck in LLM Serving: Practical Online Routing at Scale Near-Optimal Primal-Dual Algorithms for Quantity-Based Network Revenue Management
Reference 24
- Resolution
- verified exact
- arxiv_id, observed 2026-05-11T04:55:56.846997Z
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 f064ae84-8182-4e31-8e48-e359e7607cd9 · inbound
Online Linear Programming for Multi-Objective Routing in LLM Serving cites this paper.
Online Linear Programming for Multi-Objective Routing in LLM Serving Near-Optimal Primal-Dual Algorithms for Quantity-Based Network Revenue Management
Reference 19
- Resolution
- unresolved
- no resolver link, observed 2026-07-11T22:49:10.064714Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.