Paper Citation Record · LEDGER

Efficient LLM Scheduling by Learning to Rank

As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2408.15792.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2408.15792 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 7 of 7 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00

measured 7 of 7 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T01:09:20.668798Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-05-23T16:58:11.939588Z

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 d6cffcd0-997e-4ed8-b7e3-b00084c21a0f · inbound

BatchLLM: Optimizing Large Batched LLM Inference with Global Prefix Sharing and Throughput-oriented Token Batching cites this paper.

BatchLLM: Optimizing Large Batched LLM Inference with Global Prefix Sharing and Throughput-oriented Token Batching Efficient LLM Scheduling by Learning to Rank

Reference 8

Resolution: verified exact; arxiv_id, observed 2026-05-23T16:58:11.942769Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation fd320b43-ac2b-4ddb-b872-fb874a849378 · inbound

Semantic Scheduling for LLM Inference cites this paper.

Semantic Scheduling for LLM Inference Efficient LLM Scheduling by Learning to Rank

Reference 2025

Resolution: unresolved; no resolver link, observed 2026-08-07T01:09:20.668798Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9afccbaa-727d-41b4-8f2c-29152b6b8767 · inbound

On Evaluating Performance of LLM Inference Serving Systems cites this paper.

On Evaluating Performance of LLM Inference Serving Systems Efficient LLM Scheduling by Learning to Rank

Reference 2024

Resolution: unresolved; no resolver link, observed 2026-08-06T18:11:15.858434Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a2a5b4ec-bc6f-45e1-a9d3-dfb502f56274 · inbound

Agentic AI Systems Should Be Designed as Marginal Token Allocators cites this paper.

Agentic AI Systems Should Be Designed as Marginal Token Allocators Efficient LLM Scheduling by Learning to Rank

Reference 13

Resolution: metadata mismatch; arxiv_id, observed 2026-05-11T16:46:05.683454Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 716fb37d-d4d0-4b47-941c-1b377e54d7ec · 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 Efficient LLM Scheduling by Learning to Rank

Reference 15

Resolution: verified exact; arxiv_id, observed 2026-05-11T21:31:14.027016Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation b46e4510-1807-4dac-88b0-9623f1430df8 · 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 Efficient LLM Scheduling by Learning to Rank

Reference 15

Resolution: verified exact; arxiv_id, observed 2026-05-11T04:55:56.840728Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.

Observation 350e49ef-b6b2-471d-b256-6e98cc0f76a4 · inbound

Online Linear Programming for Multi-Objective Routing in LLM Serving cites this paper.

Online Linear Programming for Multi-Objective Routing in LLM Serving Efficient LLM Scheduling by Learning to Rank

Reference 12

Resolution: unresolved; no resolver link, observed 2026-07-11T22:49:10.064714Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.