{"as_of":"2026-08-23T12:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e106400b19799a71113c1f2052518357eaa86b312c4ab43977d4dc4479029756","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:42:31.698219Z","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-02T16:17:09.083875Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.13511","last_updated":"2025-03-09T11:01:45Z","snapshot_observed_at":"2026-08-18T10:37:27.983230Z","submitted_at":"2024-06-19T12:59:15Z","title":"Slice-Level Scheduling for High Throughput and Load Balanced LLM Serving","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.13511","snapshot_observed_at":"2026-08-11T23:56:23.156010Z","title":"Slice-level scheduling for high throughput and load balanced llm serving","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.04504","last_updated":"2026-08-17T00:01:33Z","snapshot_observed_at":"2026-08-20T23:11:50.074747Z","submitted_at":"2024-12-03T03:16:12Z","title":"Multi-Bin Batching for Increasing LLM Inference Throughput","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-11T23:56:23.156010Z"},"links":{"cited_paper":"/paper/2406.13511","citing_paper":"/paper/2412.04504"},"observation_digest":"sha256:d837ab929fc6425c0f314738c2fe6b6f7e3f42a8ef4b3ae52e8452cbd162be5f","observation_id":"bc527404-68ee-4cf3-843e-bd8d3726b516","resolution":{"observed_at":"2026-08-11T23:56:23.156010Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.13511","last_updated":"2025-03-09T11:01:45Z","snapshot_observed_at":"2026-08-18T10:37:27.983230Z","submitted_at":"2024-06-19T12:59:15Z","title":"Slice-Level Scheduling for High Throughput and Load Balanced LLM Serving","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.13511","snapshot_observed_at":"2026-08-10T22:16:53.025399Z","title":"arXiv:2406.13511","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.14784","last_updated":"2025-01-04T02:10:50Z","snapshot_observed_at":"2026-08-17T19:14:28.998756Z","submitted_at":"2025-01-04T02:10:50Z","title":"DeServe: Towards Affordable Offline LLM Inference via Decentralization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T22:16:53.025399Z"},"links":{"cited_paper":"/paper/2406.13511","citing_paper":"/paper/2501.14784"},"observation_digest":"sha256:8f20102e2abcdc0b8f9ab7a5a25c3846fcfda9e51fe7d215b567f8f9e2f909b2","observation_id":"84af620b-0654-4e1f-82ba-fa65bf115b9f","resolution":{"observed_at":"2026-08-10T22:16:53.025399Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.13511","last_updated":"2025-03-09T11:01:45Z","snapshot_observed_at":"2026-08-18T10:37:27.983230Z","submitted_at":"2024-06-19T12:59:15Z","title":"Slice-Level Scheduling for High Throughput and Load Balanced LLM Serving","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.13511","snapshot_observed_at":"2026-08-16T11:42:31.698219Z","title":"Sli ce-level scheduling for high throughput and load balanced llm servin g,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.14941","last_updated":"2025-06-13T01:19:34Z","snapshot_observed_at":"2026-08-18T13:23:47.095083Z","submitted_at":"2025-04-21T08:02:25Z","title":"WindVE: Collaborative CPU-NPU Vector Embedding","version":4},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-16T11:42:31.698219Z"},"links":{"cited_paper":"/paper/2406.13511","citing_paper":"/paper/2504.14941"},"observation_digest":"sha256:e1a9cdfb82a80730f9afdb55738c7c03ff0ab638f8faf7b03f08f9c953baa4cf","observation_id":"f7d0968c-0f9a-4d02-9a7f-2f646c6de948","resolution":{"observed_at":"2026-08-16T11:42:31.698219Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.13511","last_updated":"2025-03-09T11:01:45Z","snapshot_observed_at":"2026-08-18T10:37:27.983230Z","submitted_at":"2024-06-19T12:59:15Z","title":"Slice-Level Scheduling for High Throughput and Load Balanced LLM Serving","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.13511","snapshot_observed_at":"2026-08-16T11:39:53.708221Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.14966","last_updated":"2025-06-12T01:39:50Z","snapshot_observed_at":"2026-08-20T16:23:29.314751Z","submitted_at":"2025-04-21T08:48:48Z","title":"SLO-Aware Scheduling for Large Language Model Inferences","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T11:39:53.708221Z"},"links":{"cited_paper":"/paper/2406.13511","citing_paper":"/paper/2504.14966"},"observation_digest":"sha256:e76890f76c8eae401d94e47c8c728ab29bed5dfe52c2508e06c0ac6661869c26","observation_id":"02d3b520-2a3d-4bf2-92f6-2f222987f600","resolution":{"observed_at":"2026-08-16T11:39:53.708221Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.13511","last_updated":"2025-03-09T11:01:45Z","snapshot_observed_at":"2026-08-18T10:37:27.983230Z","submitted_at":"2024-06-19T12:59:15Z","title":"Slice-Level Scheduling for High Throughput and Load Balanced LLM Serving","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.13511","snapshot_observed_at":"2026-08-16T05:49:09.712328Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.19720","last_updated":"2025-04-28T12:14:02Z","snapshot_observed_at":"2026-08-19T00:58:17.913230Z","submitted_at":"2025-04-28T12:14:02Z","title":"Taming the Titans: A Survey of Efficient LLM Inference Serving","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-16T05:49:09.712328Z"},"links":{"cited_paper":"/paper/2406.13511","citing_paper":"/paper/2504.19720"},"observation_digest":"sha256:b0097add391badc39ebe1a8537bcf4733f0c00aadaf3758c6e6015a4b3b9b6a4","observation_id":"dd405bdf-6ffd-4768-9eab-b96b043a70c5","resolution":{"observed_at":"2026-08-16T05:49:09.712328Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.13511","last_updated":"2025-03-09T11:01:45Z","snapshot_observed_at":"2026-08-18T10:37:27.983230Z","submitted_at":"2024-06-19T12:59:15Z","title":"Slice-Level Scheduling for High Throughput and Load Balanced LLM Serving","version":2},"cited_work":{"arxiv_id":"2406.13511","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.13511","snapshot_observed_at":"2026-07-02T16:17:09.083875Z","title":"Cheng, W","venue":null,"work_id":"73d1c870-faa3-40d8-a978-f60eab4016dc","year":2024},"citing_paper":{"arxiv_id":"2606.06820","last_updated":"2026-06-05T01:45:02Z","snapshot_observed_at":"2026-08-15T18:19:40.364185Z","submitted_at":"2026-06-05T01:45:02Z","title":"SCALE: Scalable Cross-Attention Learning with Extrapolation for Agentic Workflow Scheduling","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-27T22:52:37.127993Z"},"links":{"cited_paper":"/paper/2406.13511","citing_paper":"/paper/2606.06820"},"observation_digest":"sha256:a72874d6031d12ac1459b3359fafea5b0512e91608a7b33404245183c48e2e6d","observation_id":"2d3a9bbc-708f-4f10-a4c0-9c73b723dee9","resolution":{"observed_at":"2026-07-02T16:17:09.085114Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.13511","last_updated":"2025-03-09T11:01:45Z","snapshot_observed_at":"2026-08-18T10:37:27.983230Z","submitted_at":"2024-06-19T12:59:15Z","title":"Slice-Level Scheduling for High Throughput and Load Balanced LLM Serving","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.13511","snapshot_observed_at":"2026-08-01T20:54:10.303506Z","title":"Slice-level scheduling for high throughput and load balanced llm serving,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.16488","last_updated":"2026-07-17T20:27:26Z","snapshot_observed_at":"2026-08-18T11:45:42.205768Z","submitted_at":"2026-07-17T20:27:26Z","title":"Auto-Scaling Heterogeneous Neural Processing Units for Energy and Cost-Efficient LLM Serving","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T20:54:10.303506Z"},"links":{"cited_paper":"/paper/2406.13511","citing_paper":"/paper/2607.16488"},"observation_digest":"sha256:4de55ecb400c7d8749a6f91235a20410c0c4b32ad146498db8c3a948f35e16e4","observation_id":"23fc5ea6-32fc-4583-b2ba-e2690a3d4469","resolution":{"observed_at":"2026-08-01T20:54:10.303506Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2406.13511/citation-record","integrity":"/paper/2406.13511/integrity","json":"/paper/2406.13511/citation-record.json","paper":"/paper/2406.13511"},"outbound":[],"paper":{"arxiv_id":"2406.13511","last_updated":"2025-03-09T11:01:45Z","latest_version":2,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-18T10:37:27.983230Z","submitted_at":"2024-06-19T12:59:15Z","title":"Slice-Level Scheduling for High Throughput and Load Balanced LLM Serving"},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2406.13511."}