{"as_of":"2026-08-10T11:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2f5d4517afe684b673a305ecd934ce59491e9527ad03a6ccda67bc9953f025e6","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":8,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:20:21.392848Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-23T16:58:11.939588Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.15792","last_updated":"2024-08-28T13:35:54Z","snapshot_observed_at":"2026-08-10T07:06:10.343215Z","submitted_at":"2024-08-28T13:35:54Z","title":"Efficient LLM Scheduling by Learning to Rank","version":1},"cited_work":{"arxiv_id":"2408.15792","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.15792","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2408.15792 , year=","venue":null,"work_id":"a76d6b80-a402-43a5-b5d6-15eb1cd2e132","year":2024},"citing_paper":{"arxiv_id":"2412.03594","last_updated":"2026-04-22T15:33:51Z","snapshot_observed_at":"2026-07-06T20:01:45.826971Z","submitted_at":"2024-11-29T05:57:37Z","title":"BatchLLM: Optimizing Large Batched LLM Inference with Global Prefix Sharing and Throughput-oriented Token Batching","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-23T16:57:46.645061Z"},"links":{"cited_paper":"/paper/2408.15792","citing_paper":"/paper/2412.03594"},"observation_digest":"sha256:4ec064696c84b0fdea57ca5b1aecea0562df330161cb4e0a47a902224555a084","observation_id":"d6cffcd0-997e-4ed8-b7e3-b00084c21a0f","resolution":{"observed_at":"2026-05-23T16:58:11.942769Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.15792","last_updated":"2024-08-28T13:35:54Z","snapshot_observed_at":"2026-08-10T07:06:10.343215Z","submitted_at":"2024-08-28T13:35:54Z","title":"Efficient LLM Scheduling by Learning to Rank","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.15792","snapshot_observed_at":"2026-08-07T01:09:20.668798Z","title":"Efficient llm scheduling by learning to rank.arXiv preprint arXiv:2408.15792,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.12204","last_updated":"2025-06-13T20:15:58Z","snapshot_observed_at":"2026-08-09T07:59:09.687258Z","submitted_at":"2025-06-13T20:15:58Z","title":"Semantic Scheduling for LLM Inference","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-07T01:09:20.668798Z"},"links":{"cited_paper":"/paper/2408.15792","citing_paper":"/paper/2506.12204"},"observation_digest":"sha256:49de8d1baf99629d688155cfa1a215847d1045deffee351650672b534643b96d","observation_id":"fd320b43-ac2b-4ddb-b872-fb874a849378","resolution":{"observed_at":"2026-08-07T01:09:20.668798Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.15792","last_updated":"2024-08-28T13:35:54Z","snapshot_observed_at":"2026-08-10T07:06:10.343215Z","submitted_at":"2024-08-28T13:35:54Z","title":"Efficient LLM Scheduling by Learning to Rank","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.15792","snapshot_observed_at":"2026-08-06T18:11:15.858434Z","title":"Efficient llm scheduling by learning to rank","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.09019","last_updated":"2025-07-11T20:58:21Z","snapshot_observed_at":"2026-08-10T10:34:57.611921Z","submitted_at":"2025-07-11T20:58:21Z","title":"On Evaluating Performance of LLM Inference Serving Systems","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:15.858434Z"},"links":{"cited_paper":"/paper/2408.15792","citing_paper":"/paper/2507.09019"},"observation_digest":"sha256:17afa54cda7dfa244081ef73d48194ef84894e0f2b2c5271d6a931bc7cf1b83b","observation_id":"9afccbaa-727d-41b4-8f2c-29152b6b8767","resolution":{"observed_at":"2026-08-06T18:11:15.858434Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.15792","last_updated":"2024-08-28T13:35:54Z","snapshot_observed_at":"2026-08-10T07:06:10.343215Z","submitted_at":"2024-08-28T13:35:54Z","title":"Efficient LLM Scheduling by Learning to Rank","version":1},"cited_work":{"arxiv_id":"2408.15792","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.15792","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2408.15792 , year=","venue":null,"work_id":"a76d6b80-a402-43a5-b5d6-15eb1cd2e132","year":2024},"citing_paper":{"arxiv_id":"2605.01214","last_updated":"2026-05-02T03:06:02Z","snapshot_observed_at":"2026-08-04T03:54:47.150761Z","submitted_at":"2026-05-02T03:06:02Z","title":"Agentic AI Systems Should Be Designed as Marginal Token Allocators","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-09T15:11:41.570592Z"},"links":{"cited_paper":"/paper/2408.15792","citing_paper":"/paper/2605.01214"},"observation_digest":"sha256:4489e1c09fb7a2ae7aea6e2acbce224927698c3f138a4c17e3584bcd9bab2aed","observation_id":"a2a5b4ec-bc6f-45e1-a9d3-dfb502f56274","resolution":{"observed_at":"2026-05-11T16:46:05.683454Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.15792","last_updated":"2024-08-28T13:35:54Z","snapshot_observed_at":"2026-08-10T07:06:10.343215Z","submitted_at":"2024-08-28T13:35:54Z","title":"Efficient LLM Scheduling by Learning to Rank","version":1},"cited_work":{"arxiv_id":"2408.15792","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.15792","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2408.15792 , year=","venue":null,"work_id":"a76d6b80-a402-43a5-b5d6-15eb1cd2e132","year":2024},"citing_paper":{"arxiv_id":"2605.06113","last_updated":"2026-05-08T02:53:17Z","snapshot_observed_at":"2026-07-06T23:18:36.537416Z","submitted_at":"2026-05-07T12:25:38Z","title":"Tackling the Data-Parallel Load Balancing Bottleneck in LLM Serving: Practical Online Routing at Scale","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-08T05:22:14.122156Z"},"links":{"cited_paper":"/paper/2408.15792","citing_paper":"/paper/2605.06113"},"observation_digest":"sha256:d7a5c716e1d5793bf3cb4236e7dc2872597f20671f907394ddedc45a214cbb12","observation_id":"716fb37d-d4d0-4b47-941c-1b377e54d7ec","resolution":{"observed_at":"2026-05-11T21:31:14.027016Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.15792","last_updated":"2024-08-28T13:35:54Z","snapshot_observed_at":"2026-08-10T07:06:10.343215Z","submitted_at":"2024-08-28T13:35:54Z","title":"Efficient LLM Scheduling by Learning to Rank","version":1},"cited_work":{"arxiv_id":"2408.15792","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2408.15792","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2408.15792 , year=","venue":null,"work_id":"a76d6b80-a402-43a5-b5d6-15eb1cd2e132","year":2024},"citing_paper":{"arxiv_id":"2605.06113","last_updated":"2026-05-08T02:53:17Z","snapshot_observed_at":"2026-07-06T23:18:36.537416Z","submitted_at":"2026-05-07T12:25:38Z","title":"Tackling the Data-Parallel Load Balancing Bottleneck in LLM Serving: Practical Online Routing at Scale","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-11T00:59:57.639525Z"},"links":{"cited_paper":"/paper/2408.15792","citing_paper":"/paper/2605.06113"},"observation_digest":"sha256:17b605f7c499f04ff37bfc07063e74bd76240b5f3fba035f5f90b832b5fe01a8","observation_id":"b46e4510-1807-4dac-88b0-9623f1430df8","resolution":{"observed_at":"2026-05-11T04:55:56.840728Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.15792","last_updated":"2024-08-28T13:35:54Z","snapshot_observed_at":"2026-08-10T07:06:10.343215Z","submitted_at":"2024-08-28T13:35:54Z","title":"Efficient LLM Scheduling by Learning to Rank","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.15792","snapshot_observed_at":"2026-07-11T22:49:10.064714Z","title":"arXiv preprint arXiv:2408.15792 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.03948","last_updated":"2026-07-04T16:48:37Z","snapshot_observed_at":"2026-08-07T06:39:55.842387Z","submitted_at":"2026-07-04T16:48:37Z","title":"Online Linear Programming for Multi-Objective Routing in LLM Serving","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"cited_paper":"/paper/2408.15792","citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:5992ad83642eba75691d7abd4aea606cadb33d959d75f8447bb49c27ea16682b","observation_id":"350e49ef-b6b2-471d-b256-6e98cc0f76a4","resolution":{"observed_at":"2026-07-11T22:49:10.064714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.15792","last_updated":"2024-08-28T13:35:54Z","snapshot_observed_at":"2026-08-10T07:06:10.343215Z","submitted_at":"2024-08-28T13:35:54Z","title":"Efficient LLM Scheduling by Learning to Rank","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.15792","snapshot_observed_at":"2026-08-07T14:20:21.392848Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.06135","last_updated":"2026-08-06T15:07:43Z","snapshot_observed_at":"2026-08-09T23:12:59.185361Z","submitted_at":"2026-08-06T15:07:43Z","title":"LLM Inference Under Bursty Workload Distribution: Modifying the WAIT Algorithm","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:21.392848Z"},"links":{"cited_paper":"/paper/2408.15792","citing_paper":"/paper/2608.06135"},"observation_digest":"sha256:b5ec504980eda00369e26187edb0f3ebb867a4bf89d9ce76e0dce7ca0a18060c","observation_id":"230abf2d-a39a-43a5-be93-b896e49c7e3c","resolution":{"observed_at":"2026-08-07T14:20:21.392848Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2408.15792/citation-record","integrity":"/paper/2408.15792/integrity","json":"/paper/2408.15792/citation-record.json","paper":"/paper/2408.15792"},"outbound":[],"paper":{"arxiv_id":"2408.15792","last_updated":"2024-08-28T13:35:54Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T07:06:10.343215Z","submitted_at":"2024-08-28T13:35:54Z","title":"Efficient LLM Scheduling by Learning to Rank"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 8 inbound Pith citation observations for arXiv:2408.15792."}