{"as_of":"2026-08-09T22:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9a1b66ca0b07fc18c7b104d8756c335790f7bf486911518115238b628a7364a1","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":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":9,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T10:54:03.018347Z","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-07-04T08:39:41.962600Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.01035","last_updated":"2024-10-01T19:51:07Z","snapshot_observed_at":"2026-08-06T13:32:41.475152Z","submitted_at":"2024-10-01T19:51:07Z","title":"Don't Stop Me Now: Embedding Based Scheduling for LLMs","version":1},"cited_work":{"arxiv_id":"2410.01035","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.01035","snapshot_observed_at":"2026-07-04T08:39:41.962600Z","title":"arXiv preprint arXiv:2410.01035 , year=","venue":null,"work_id":"5875c418-6eb6-4d8c-9238-c81b1ec2d9ec","year":2024},"citing_paper":{"arxiv_id":"2605.01280","last_updated":"2026-05-02T06:31:11Z","snapshot_observed_at":"2026-08-03T03:47:16.035466Z","submitted_at":"2026-05-02T06:31:11Z","title":"Position: LLM Serving Needs Mathematical Optimization and Algorithmic Foundations, Not Just Heuristics","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-05-09T18:53:29.089882Z"},"links":{"cited_paper":"/paper/2410.01035","citing_paper":"/paper/2605.01280"},"observation_digest":"sha256:c124fda5a89a70e630ea9e6971cc4f3edf697cf954ed155be9302b903e1ec5ba","observation_id":"8c7d3f81-e625-4574-9d7b-2c84c3ad1683","resolution":{"observed_at":"2026-05-11T16:01:20.359944Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01035","last_updated":"2024-10-01T19:51:07Z","snapshot_observed_at":"2026-08-06T13:32:41.475152Z","submitted_at":"2024-10-01T19:51:07Z","title":"Don't Stop Me Now: Embedding Based Scheduling for LLMs","version":1},"cited_work":{"arxiv_id":"2410.01035","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.01035","snapshot_observed_at":"2026-07-04T08:39:41.962600Z","title":"arXiv preprint arXiv:2410.01035 , year=","venue":null,"work_id":"5875c418-6eb6-4d8c-9238-c81b1ec2d9ec","year":2024},"citing_paper":{"arxiv_id":"2605.04595","last_updated":"2026-05-06T07:42:26Z","snapshot_observed_at":"2026-08-08T18:04:13.922410Z","submitted_at":"2026-05-06T07:42:26Z","title":"A Queueing-Theoretic Framework for Stability Analysis of LLM Inference with KV Cache Memory Constraints","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-08T17:28:05.492863Z"},"links":{"cited_paper":"/paper/2410.01035","citing_paper":"/paper/2605.04595"},"observation_digest":"sha256:7f2a0c426e0fc8abd2721b9f7b20577fe02d352b7a60dd53f7d1e7315dee7d91","observation_id":"34a307d4-383d-463e-84db-fc6e1714f74e","resolution":{"observed_at":"2026-05-11T17:31:08.890784Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01035","last_updated":"2024-10-01T19:51:07Z","snapshot_observed_at":"2026-08-06T13:32:41.475152Z","submitted_at":"2024-10-01T19:51:07Z","title":"Don't Stop Me Now: Embedding Based Scheduling for LLMs","version":1},"cited_work":{"arxiv_id":"2410.01035","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.01035","snapshot_observed_at":"2026-07-04T08:39:41.962600Z","title":"arXiv preprint arXiv:2410.01035 , year=","venue":null,"work_id":"5875c418-6eb6-4d8c-9238-c81b1ec2d9ec","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":18,"source":"arxiv_source","source_observed_at":"2026-05-08T05:22:14.122156Z"},"links":{"cited_paper":"/paper/2410.01035","citing_paper":"/paper/2605.06113"},"observation_digest":"sha256:410f77bd0da3d3458e05e4df495e386b529659ffa7865243d7e0b1a5eb4a29c6","observation_id":"80f542a0-202d-4b3e-87d2-0675b2734dcb","resolution":{"observed_at":"2026-05-11T21:31:14.084155Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01035","last_updated":"2024-10-01T19:51:07Z","snapshot_observed_at":"2026-08-06T13:32:41.475152Z","submitted_at":"2024-10-01T19:51:07Z","title":"Don't Stop Me Now: Embedding Based Scheduling for LLMs","version":1},"cited_work":{"arxiv_id":"2410.01035","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.01035","snapshot_observed_at":"2026-07-04T08:39:41.962600Z","title":"arXiv preprint arXiv:2410.01035 , year=","venue":null,"work_id":"5875c418-6eb6-4d8c-9238-c81b1ec2d9ec","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":18,"source":"arxiv_source","source_observed_at":"2026-05-11T00:59:57.639525Z"},"links":{"cited_paper":"/paper/2410.01035","citing_paper":"/paper/2605.06113"},"observation_digest":"sha256:c3a3a9aa0c5529895dc1672ddb499066ff7e7b2d0d3257325b8e6941491e6405","observation_id":"d32caab7-0977-458d-aea3-1033fcafcb7d","resolution":{"observed_at":"2026-05-11T04:55:56.880280Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01035","last_updated":"2024-10-01T19:51:07Z","snapshot_observed_at":"2026-08-06T13:32:41.475152Z","submitted_at":"2024-10-01T19:51:07Z","title":"Don't Stop Me Now: Embedding Based Scheduling for LLMs","version":1},"cited_work":{"arxiv_id":"2410.01035","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.01035","snapshot_observed_at":"2026-07-04T08:39:41.962600Z","title":"arXiv preprint arXiv:2410.01035 , year=","venue":null,"work_id":"5875c418-6eb6-4d8c-9238-c81b1ec2d9ec","year":2024},"citing_paper":{"arxiv_id":"2605.21427","last_updated":"2026-05-20T17:19:20Z","snapshot_observed_at":"2026-07-06T23:31:51.443407Z","submitted_at":"2026-05-20T17:19:20Z","title":"PALS: Power-Aware LLM Serving for Mixture-of-Experts Models","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-21T04:06:32.227076Z"},"links":{"cited_paper":"/paper/2410.01035","citing_paper":"/paper/2605.21427"},"observation_digest":"sha256:d5050a684706491518022ea670fcfff58a83a35883abd403a72d5f065ab1cbc3","observation_id":"fa7a0406-e6a3-461c-85f2-d7b05b3be2fd","resolution":{"observed_at":"2026-05-21T04:09:33.698136Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01035","last_updated":"2024-10-01T19:51:07Z","snapshot_observed_at":"2026-08-06T13:32:41.475152Z","submitted_at":"2024-10-01T19:51:07Z","title":"Don't Stop Me Now: Embedding Based Scheduling for LLMs","version":1},"cited_work":{"arxiv_id":"2410.01035","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.01035","snapshot_observed_at":"2026-07-04T08:39:41.962600Z","title":"arXiv preprint arXiv:2410.01035 , year=","venue":null,"work_id":"5875c418-6eb6-4d8c-9238-c81b1ec2d9ec","year":2024},"citing_paper":{"arxiv_id":"2606.18431","last_updated":"2026-06-16T19:25:37Z","snapshot_observed_at":"2026-08-04T00:16:31.977200Z","submitted_at":"2026-06-16T19:25:37Z","title":"Beyond Prediction: Tail-Aware Scheduling for LLM Inference","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-06-27T01:01:34.655458Z"},"links":{"cited_paper":"/paper/2410.01035","citing_paper":"/paper/2606.18431"},"observation_digest":"sha256:307977f2735b48ab9fc9a6a10dda49a3ed9798173c9c82ed995f030e3026d879","observation_id":"715e3749-0a94-4d79-bb37-49d47959f374","resolution":{"observed_at":"2026-07-03T20:58:57.855226Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01035","last_updated":"2024-10-01T19:51:07Z","snapshot_observed_at":"2026-08-06T13:32:41.475152Z","submitted_at":"2024-10-01T19:51:07Z","title":"Don't Stop Me Now: Embedding Based Scheduling for LLMs","version":1},"cited_work":{"arxiv_id":"2410.01035","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.01035","snapshot_observed_at":"2026-07-04T08:39:41.962600Z","title":"arXiv preprint arXiv:2410.01035 , year=","venue":null,"work_id":"5875c418-6eb6-4d8c-9238-c81b1ec2d9ec","year":2024},"citing_paper":{"arxiv_id":"2606.22327","last_updated":"2026-06-24T14:02:53Z","snapshot_observed_at":"2026-08-07T17:40:04.855669Z","submitted_at":"2026-06-21T04:05:38Z","title":"Geometry-Aware Online Scheduling for LLM Serving: From Theoretical Bound to System Practice","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-26T11:17:35.860286Z"},"links":{"cited_paper":"/paper/2410.01035","citing_paper":"/paper/2606.22327"},"observation_digest":"sha256:8b0ac811a31b94c7c365a1179bafe4b4e528e82190a47905832393e9233b6105","observation_id":"89c89c7c-f76c-488e-8c0d-0190d61e845d","resolution":{"observed_at":"2026-07-04T08:39:41.963996Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.01035","last_updated":"2024-10-01T19:51:07Z","snapshot_observed_at":"2026-08-06T13:32:41.475152Z","submitted_at":"2024-10-01T19:51:07Z","title":"Don't Stop Me Now: Embedding Based Scheduling for LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.01035","snapshot_observed_at":"2026-07-11T22:49:10.064714Z","title":"arXiv preprint arXiv:2410.01035 , 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":14,"source":"arxiv_source","source_observed_at":"2026-07-11T22:49:10.064714Z"},"links":{"cited_paper":"/paper/2410.01035","citing_paper":"/paper/2607.03948"},"observation_digest":"sha256:705b5902a5a839f92fc760e374247886a742f6d1dfe85906b7bf5ae11e23d376","observation_id":"e8703276-6d49-4fb0-825f-01d8bf30b3c3","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":"2410.01035","last_updated":"2024-10-01T19:51:07Z","snapshot_observed_at":"2026-08-06T13:32:41.475152Z","submitted_at":"2024-10-01T19:51:07Z","title":"Don't Stop Me Now: Embedding Based Scheduling for LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.01035","snapshot_observed_at":"2026-08-04T10:54:03.018347Z","title":"Ying Sheng, Shiyi Cao, Dacheng Li, Banghua Zhu, Zhuohan Li, Danyang Zhuo, Joseph E Gonzalez, and Ion Stoica","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2608.02244","last_updated":"2026-08-03T13:55:20Z","snapshot_observed_at":"2026-08-08T06:39:19.636143Z","submitted_at":"2026-08-03T13:55:20Z","title":"Efficiency and Cost Alignment in Batched LLM Serving via Resource-Fair Scheduling","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T10:54:03.018347Z"},"links":{"cited_paper":"/paper/2410.01035","citing_paper":"/paper/2608.02244"},"observation_digest":"sha256:bbf8e096bb0cb92a341bc0bbda522f28ca77ae8d43d57f1070d69afb81cb5afc","observation_id":"7a132beb-3140-4865-aba1-858a953f1282","resolution":{"observed_at":"2026-08-04T10:54:03.018347Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2410.01035/citation-record","integrity":"/paper/2410.01035/integrity","json":"/paper/2410.01035/citation-record.json","paper":"/paper/2410.01035"},"outbound":[],"paper":{"arxiv_id":"2410.01035","last_updated":"2024-10-01T19:51:07Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-06T13:32:41.475152Z","submitted_at":"2024-10-01T19:51:07Z","title":"Don't Stop Me Now: Embedding Based Scheduling for LLMs"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 9 inbound Pith citation observations for arXiv:2410.01035."}