{"as_of":"2026-08-07T08:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:026e04f9a2537498e9a54ad96752c5c2f1b1651c7ee821af9b6e5f9bac1a1b21","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":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":14,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T19:03:57.101107Z","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-04T07:29:39.037995Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.00023","last_updated":"2024-10-03T17:50:33Z","snapshot_observed_at":"2026-08-03T09:39:42.593902Z","submitted_at":"2024-05-08T06:30:58Z","title":"Preble: Efficient Distributed Prompt Scheduling for LLM Serving","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.00023","snapshot_observed_at":"2026-08-06T19:03:57.101107Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.06608","last_updated":"2025-08-07T12:26:15Z","snapshot_observed_at":"2026-08-06T18:56:52.854557Z","submitted_at":"2025-07-09T07:27:18Z","title":"Nexus:Proactive Intra-GPU Disaggregation of Prefill and Decode in LLM Serving","version":5},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-06T19:03:57.101107Z"},"links":{"cited_paper":"/paper/2407.00023","citing_paper":"/paper/2507.06608"},"observation_digest":"sha256:63a9182fa533d42aa93e643d71f0091e8738bc7676eded92c826fb54b237e51b","observation_id":"914c9eb8-8f75-475d-8c57-35b59e533f5e","resolution":{"observed_at":"2026-08-06T19:03:57.101107Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00023","last_updated":"2024-10-03T17:50:33Z","snapshot_observed_at":"2026-08-03T09:39:42.593902Z","submitted_at":"2024-05-08T06:30:58Z","title":"Preble: Efficient Distributed Prompt Scheduling for LLM Serving","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.00023","snapshot_observed_at":"2026-08-05T18:46:55.092252Z","title":"Preble: Ef- ficient distributed prompt scheduling for llm serving,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.14239","last_updated":"2025-08-19T19:57:34Z","snapshot_observed_at":"2026-08-05T18:46:52.224733Z","submitted_at":"2025-08-19T19:57:34Z","title":"A Distributed Learned Hash Table","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-05T18:46:55.092252Z"},"links":{"cited_paper":"/paper/2407.00023","citing_paper":"/paper/2508.14239"},"observation_digest":"sha256:884611377dfb7bd527629ea26065eda239eb33fbde6d526e58d16d7c4ea10268","observation_id":"1993b332-271a-4fe0-bffd-aa27d0248f65","resolution":{"observed_at":"2026-08-05T18:46:55.092252Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00023","last_updated":"2024-10-03T17:50:33Z","snapshot_observed_at":"2026-08-03T09:39:42.593902Z","submitted_at":"2024-05-08T06:30:58Z","title":"Preble: Efficient Distributed Prompt Scheduling for LLM Serving","version":2},"cited_work":{"arxiv_id":"2407.00023","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.00023","snapshot_observed_at":"2026-07-04T07:29:39.037995Z","title":"Preble: Efficient distributed prompt scheduling for llm serving","venue":null,"work_id":"45a8cada-404f-4cf6-9898-5ebe00e923af","year":2024},"citing_paper":{"arxiv_id":"2602.09725","last_updated":"2026-05-12T14:12:11Z","snapshot_observed_at":"2026-07-06T22:45:15.978102Z","submitted_at":"2026-02-10T12:29:02Z","title":"Efficient Remote KV Cache Reuse with GPU-native Video Codec","version":3},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-05-16T05:21:04.555356Z"},"links":{"cited_paper":"/paper/2407.00023","citing_paper":"/paper/2602.09725"},"observation_digest":"sha256:c93fb4c0408976616f2f23a9be6261e3f8007a16ae5516296a0f0be5b8b43eee","observation_id":"80d92b4e-2a3b-48e4-896d-9da1d4791dab","resolution":{"observed_at":"2026-05-16T05:22:22.865185Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00023","last_updated":"2024-10-03T17:50:33Z","snapshot_observed_at":"2026-08-03T09:39:42.593902Z","submitted_at":"2024-05-08T06:30:58Z","title":"Preble: Efficient Distributed Prompt Scheduling for LLM Serving","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.00023","snapshot_observed_at":"2026-08-03T00:06:24.883100Z","title":"Preble: Efficient distributed prompt schedul- ing for large language model serving","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.11688","last_updated":"2026-07-29T19:22:20Z","snapshot_observed_at":"2026-08-03T00:06:24.165526Z","submitted_at":"2026-02-12T08:09:14Z","title":"GORGO: Online Tuning for Cross-Region Network-Aware LLM Serving","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T00:06:24.883100Z"},"links":{"cited_paper":"/paper/2407.00023","citing_paper":"/paper/2602.11688"},"observation_digest":"sha256:42465d018f4b6fa647d97439b793ab66e34281186541140985e8b528ea843d60","observation_id":"3865934e-50fd-4c41-b948-300605a9c65f","resolution":{"observed_at":"2026-08-03T00:06:24.883100Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00023","last_updated":"2024-10-03T17:50:33Z","snapshot_observed_at":"2026-08-03T09:39:42.593902Z","submitted_at":"2024-05-08T06:30:58Z","title":"Preble: Efficient Distributed Prompt Scheduling for LLM Serving","version":2},"cited_work":{"arxiv_id":"2407.00023","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.00023","snapshot_observed_at":"2026-07-04T07:29:39.037995Z","title":"Preble: Efficient distributed prompt scheduling for llm serving","venue":null,"work_id":"45a8cada-404f-4cf6-9898-5ebe00e923af","year":2024},"citing_paper":{"arxiv_id":"2604.24351","last_updated":"2026-04-27T11:44:45Z","snapshot_observed_at":"2026-07-06T23:10:24.992210Z","submitted_at":"2026-04-27T11:44:45Z","title":"Diffusion Templates: A Unified Plugin Framework for Controllable Diffusion","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-08T04:24:53.023047Z"},"links":{"cited_paper":"/paper/2407.00023","citing_paper":"/paper/2604.24351"},"observation_digest":"sha256:2e67a5c26877b5aa9a672decb4ae01c1a86d6ca6fa5c98bd1a193efc00306c5e","observation_id":"45e2baa5-fec3-43a3-ab5f-2b16fc3de31c","resolution":{"observed_at":"2026-05-11T21:46:42.257505Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00023","last_updated":"2024-10-03T17:50:33Z","snapshot_observed_at":"2026-08-03T09:39:42.593902Z","submitted_at":"2024-05-08T06:30:58Z","title":"Preble: Efficient Distributed Prompt Scheduling for LLM Serving","version":2},"cited_work":{"arxiv_id":"2407.00023","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.00023","snapshot_observed_at":"2026-07-04T07:29:39.037995Z","title":"Preble: Efficient distributed prompt scheduling for llm serving","venue":null,"work_id":"45a8cada-404f-4cf6-9898-5ebe00e923af","year":2024},"citing_paper":{"arxiv_id":"2605.02329","last_updated":"2026-05-25T17:26:33Z","snapshot_observed_at":"2026-08-02T00:39:56.914878Z","submitted_at":"2026-05-04T08:29:47Z","title":"Taming Request Imbalance: SLO-Aware Scheduling for Disaggregated LLM Inference","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-08T18:27:13.781231Z"},"links":{"cited_paper":"/paper/2407.00023","citing_paper":"/paper/2605.02329"},"observation_digest":"sha256:5bc79025f89dd785a8199f8f26d013d0dcb633a14e8208efb1e023cab0c27e0d","observation_id":"25a56a5a-1cd6-403a-9cef-c493fcbebe45","resolution":{"observed_at":"2026-05-09T06:25:46.437799Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00023","last_updated":"2024-10-03T17:50:33Z","snapshot_observed_at":"2026-08-03T09:39:42.593902Z","submitted_at":"2024-05-08T06:30:58Z","title":"Preble: Efficient Distributed Prompt Scheduling for LLM Serving","version":2},"cited_work":{"arxiv_id":"2407.00023","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.00023","snapshot_observed_at":"2026-07-04T07:29:39.037995Z","title":"Preble: Efficient distributed prompt scheduling for llm serving","venue":null,"work_id":"45a8cada-404f-4cf6-9898-5ebe00e923af","year":2024},"citing_paper":{"arxiv_id":"2605.02329","last_updated":"2026-05-25T17:26:33Z","snapshot_observed_at":"2026-08-02T00:39:56.914878Z","submitted_at":"2026-05-04T08:29:47Z","title":"Taming Request Imbalance: SLO-Aware Scheduling for Disaggregated LLM Inference","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-01T00:31:12.965178Z"},"links":{"cited_paper":"/paper/2407.00023","citing_paper":"/paper/2605.02329"},"observation_digest":"sha256:c58060ea0facb2cb0db088fc379626b9dee40fd789ffb82deb19920d9166f65e","observation_id":"002efe1e-7cd1-48e2-b671-536c3537e4a3","resolution":{"observed_at":"2026-07-01T00:35:10.211865Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00023","last_updated":"2024-10-03T17:50:33Z","snapshot_observed_at":"2026-08-03T09:39:42.593902Z","submitted_at":"2024-05-08T06:30:58Z","title":"Preble: Efficient Distributed Prompt Scheduling for LLM Serving","version":2},"cited_work":{"arxiv_id":"2407.00023","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.00023","snapshot_observed_at":"2026-07-04T07:29:39.037995Z","title":"Preble: Efficient distributed prompt scheduling for llm serving","venue":null,"work_id":"45a8cada-404f-4cf6-9898-5ebe00e923af","year":2024},"citing_paper":{"arxiv_id":"2605.05219","last_updated":"2026-04-17T09:24:58Z","snapshot_observed_at":"2026-07-06T23:17:52.987860Z","submitted_at":"2026-04-17T09:24:58Z","title":"Sparse Prefix Caching for Hybrid and Recurrent LLM Serving","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-10T08:49:24.880528Z"},"links":{"cited_paper":"/paper/2407.00023","citing_paper":"/paper/2605.05219"},"observation_digest":"sha256:d2dd00e5e8547d679dbdbf267649d9763bc9fe2020fe5b1b58d0ee6830376d90","observation_id":"c53960ad-a788-4de5-819e-5e4c1d220ace","resolution":{"observed_at":"2026-05-10T08:53:04.396252Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00023","last_updated":"2024-10-03T17:50:33Z","snapshot_observed_at":"2026-08-03T09:39:42.593902Z","submitted_at":"2024-05-08T06:30:58Z","title":"Preble: Efficient Distributed Prompt Scheduling for LLM Serving","version":2},"cited_work":{"arxiv_id":"2407.00023","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.00023","snapshot_observed_at":"2026-07-04T07:29:39.037995Z","title":"Preble: Efficient distributed prompt scheduling for llm serving","venue":null,"work_id":"45a8cada-404f-4cf6-9898-5ebe00e923af","year":2024},"citing_paper":{"arxiv_id":"2605.16867","last_updated":"2026-05-16T08:01:12Z","snapshot_observed_at":"2026-07-06T23:27:57.805018Z","submitted_at":"2026-05-16T08:01:12Z","title":"GoodServe: Towards High-Goodput Serving of Agentic LLM Inferences over Heterogeneous Resources","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-19T19:31:43.015127Z"},"links":{"cited_paper":"/paper/2407.00023","citing_paper":"/paper/2605.16867"},"observation_digest":"sha256:299c535093cd7dcbdf2bbf16108469bc8ffa46f513b513db8ac71493c61cd6a6","observation_id":"020d313f-09c5-4e0a-bfaf-11265397f8f2","resolution":{"observed_at":"2026-05-19T19:32:43.652815Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00023","last_updated":"2024-10-03T17:50:33Z","snapshot_observed_at":"2026-08-03T09:39:42.593902Z","submitted_at":"2024-05-08T06:30:58Z","title":"Preble: Efficient Distributed Prompt Scheduling for LLM Serving","version":2},"cited_work":{"arxiv_id":"2407.00023","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.00023","snapshot_observed_at":"2026-07-04T07:29:39.037995Z","title":"Preble: Efficient distributed prompt scheduling for llm serving","venue":null,"work_id":"45a8cada-404f-4cf6-9898-5ebe00e923af","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":69,"source":"arxiv_source","source_observed_at":"2026-06-27T01:01:34.655458Z"},"links":{"cited_paper":"/paper/2407.00023","citing_paper":"/paper/2606.18431"},"observation_digest":"sha256:49b52ac32dd1dee09c5510eeaa86951eb5834e43fec0f822a3837061b157c0e5","observation_id":"7fd7a353-79a0-4b27-92f2-55a094ba0971","resolution":{"observed_at":"2026-07-03T20:58:57.853073Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00023","last_updated":"2024-10-03T17:50:33Z","snapshot_observed_at":"2026-08-03T09:39:42.593902Z","submitted_at":"2024-05-08T06:30:58Z","title":"Preble: Efficient Distributed Prompt Scheduling for LLM Serving","version":2},"cited_work":{"arxiv_id":"2407.00023","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.00023","snapshot_observed_at":"2026-07-04T07:29:39.037995Z","title":"Preble: Efficient distributed prompt scheduling for llm serving","venue":null,"work_id":"45a8cada-404f-4cf6-9898-5ebe00e923af","year":2024},"citing_paper":{"arxiv_id":"2606.21238","last_updated":"2026-06-19T09:05:01Z","snapshot_observed_at":"2026-07-06T23:56:17.293417Z","submitted_at":"2026-06-19T09:05:01Z","title":"Recency/Frequency Adaptive KV Caching for Large Language Model Serving","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-26T13:24:44.218871Z"},"links":{"cited_paper":"/paper/2407.00023","citing_paper":"/paper/2606.21238"},"observation_digest":"sha256:fe3601e4f2856c9a8b0a9ee258f5d87ecbc5764cfb44b4981d2b2f7098ff4f9a","observation_id":"41c2e940-26d8-4f40-bb56-6ab5cbedcd0f","resolution":{"observed_at":"2026-07-04T07:29:39.040238Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00023","last_updated":"2024-10-03T17:50:33Z","snapshot_observed_at":"2026-08-03T09:39:42.593902Z","submitted_at":"2024-05-08T06:30:58Z","title":"Preble: Efficient Distributed Prompt Scheduling for LLM Serving","version":2},"cited_work":{"arxiv_id":"2407.00023","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.00023","snapshot_observed_at":"2026-07-04T07:29:39.037995Z","title":"Preble: Efficient distributed prompt scheduling for llm serving","venue":null,"work_id":"45a8cada-404f-4cf6-9898-5ebe00e923af","year":2024},"citing_paper":{"arxiv_id":"2606.31093","last_updated":"2026-06-30T03:29:21Z","snapshot_observed_at":"2026-08-01T17:26:20.214245Z","submitted_at":"2026-06-30T03:29:21Z","title":"Omni-Flow: A Unified Workflow Orchestration and Distributed KV Cache Sharing Framework for Multimodal Inference","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-07-01T04:13:53.722933Z"},"links":{"cited_paper":"/paper/2407.00023","citing_paper":"/paper/2606.31093"},"observation_digest":"sha256:da0341b85b353b2ed721d77703ff788cc7373665e6e4ba4d8ffb1ee84fa883eb","observation_id":"9ee1c01c-1454-4f03-9492-0fc51311bf0a","resolution":{"observed_at":"2026-07-01T11:35:43.630892Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00023","last_updated":"2024-10-03T17:50:33Z","snapshot_observed_at":"2026-08-03T09:39:42.593902Z","submitted_at":"2024-05-08T06:30:58Z","title":"Preble: Efficient Distributed Prompt Scheduling for LLM Serving","version":2},"cited_work":{"arxiv_id":"2407.00023","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.00023","snapshot_observed_at":"2026-07-04T07:29:39.037995Z","title":"Preble: Efficient distributed prompt scheduling for llm serving","venue":null,"work_id":"45a8cada-404f-4cf6-9898-5ebe00e923af","year":2024},"citing_paper":{"arxiv_id":"2607.00466","last_updated":"2026-07-02T08:02:42Z","snapshot_observed_at":"2026-08-02T22:04:11.416989Z","submitted_at":"2026-07-01T05:34:38Z","title":"ELDR: Expert-Locality-Aware Decode Routing for PD-Disaggregated MoE Serving","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-02T06:40:53.505889Z"},"links":{"cited_paper":"/paper/2407.00023","citing_paper":"/paper/2607.00466"},"observation_digest":"sha256:fa43ea7dfbf4b59c3128244317ff63a6e779234adc6add5829fdde5f005584c4","observation_id":"6115a4e9-75a5-45a0-81e6-1da64a5b2434","resolution":{"observed_at":"2026-07-02T06:56:43.959288Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00023","last_updated":"2024-10-03T17:50:33Z","snapshot_observed_at":"2026-08-03T09:39:42.593902Z","submitted_at":"2024-05-08T06:30:58Z","title":"Preble: Efficient Distributed Prompt Scheduling for LLM Serving","version":2},"cited_work":{"arxiv_id":"2407.00023","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.00023","snapshot_observed_at":"2026-07-04T07:29:39.037995Z","title":"Preble: Efficient distributed prompt scheduling for llm serving","venue":null,"work_id":"45a8cada-404f-4cf6-9898-5ebe00e923af","year":2024},"citing_paper":{"arxiv_id":"2607.00466","last_updated":"2026-07-02T08:02:42Z","snapshot_observed_at":"2026-08-02T22:04:11.416989Z","submitted_at":"2026-07-01T05:34:38Z","title":"ELDR: Expert-Locality-Aware Decode Routing for PD-Disaggregated MoE Serving","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-03T18:58:44.830766Z"},"links":{"cited_paper":"/paper/2407.00023","citing_paper":"/paper/2607.00466"},"observation_digest":"sha256:7585f52d56ebd173c391e786a11f7b6729beb00bb0481a30c7b4700d0379272f","observation_id":"7031347c-1ee0-42f7-a41f-9cd5ecf43824","resolution":{"observed_at":"2026-07-03T18:58:50.434903Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2407.00023/citation-record","integrity":"/paper/2407.00023/integrity","json":"/paper/2407.00023/citation-record.json","paper":"/paper/2407.00023"},"outbound":[],"paper":{"arxiv_id":"2407.00023","last_updated":"2024-10-03T17:50:33Z","latest_version":2,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-03T09:39:42.593902Z","submitted_at":"2024-05-08T06:30:58Z","title":"Preble: Efficient Distributed Prompt Scheduling for 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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 14 inbound Pith citation observations for arXiv:2407.00023."}