{"as_of":"2026-08-07T17:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9248d2a32aa7b38b8740c867820cb0a1aefd1fd773c8b77d8ec487cd4828d891","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":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":11,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":11,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:30:34.441416Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.12757","last_updated":"2025-05-25T14:08:01Z","snapshot_observed_at":"2026-08-03T08:33:17.421277Z","submitted_at":"2024-08-22T23:00:40Z","title":"NanoFlow: Towards Optimal Large Language Model Serving Throughput","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.12757","snapshot_observed_at":"2026-08-07T10:30:34.441416Z","title":"Nanoflow: Towards optimal large language model serving throughput.arXiv preprint arXiv:2408.12757,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.05333","last_updated":"2025-06-20T01:25:25Z","snapshot_observed_at":"2026-08-07T10:18:59.977399Z","submitted_at":"2025-06-05T17:59:24Z","title":"Kinetics: Rethinking Test-Time Scaling Laws","version":3},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-07T10:30:34.441416Z"},"links":{"cited_paper":"/paper/2408.12757","citing_paper":"/paper/2506.05333"},"observation_digest":"sha256:6061bb9b289cbb02bf72109cbbb898d2d55c2aff2b5787bc87335af0a2f92001","observation_id":"9636216e-aac4-4212-a1ed-e54d8b11d05d","resolution":{"observed_at":"2026-08-07T10:30:34.441416Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.12757","last_updated":"2025-05-25T14:08:01Z","snapshot_observed_at":"2026-08-03T08:33:17.421277Z","submitted_at":"2024-08-22T23:00:40Z","title":"NanoFlow: Towards Optimal Large Language Model Serving Throughput","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.12757","snapshot_observed_at":"2026-08-06T19:04:00.018717Z","title":"doi:10.48550/ARXIV.2408","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":74,"source":"pdf_text","source_observed_at":"2026-08-06T19:04:00.018717Z"},"links":{"cited_paper":"/paper/2408.12757","citing_paper":"/paper/2507.06608"},"observation_digest":"sha256:d629784fe56870f71a7c47beb63ecc6cee66a34f83b7787e7f4dc8caae5c420f","observation_id":"a275db72-d7ee-4520-bd53-7035783ed824","resolution":{"observed_at":"2026-08-06T19:04:00.018717Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.12757","last_updated":"2025-05-25T14:08:01Z","snapshot_observed_at":"2026-08-03T08:33:17.421277Z","submitted_at":"2024-08-22T23:00:40Z","title":"NanoFlow: Towards Optimal Large Language Model Serving Throughput","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.12757","snapshot_observed_at":"2026-08-06T18:11:16.262684Z","title":"Nanoflow: Towards optimal large language model serving throughput","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-06T18:03:49.435059Z","submitted_at":"2025-07-11T20:58:21Z","title":"On Evaluating Performance of LLM Inference Serving Systems","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:16.262684Z"},"links":{"cited_paper":"/paper/2408.12757","citing_paper":"/paper/2507.09019"},"observation_digest":"sha256:8c40cea19d5ee067a58ec27d62ea4d73f2b5574f8247b36f4ca98085fdeab47d","observation_id":"11274d95-91cf-475e-b1a9-373b85f355a5","resolution":{"observed_at":"2026-08-06T18:11:16.262684Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.12757","last_updated":"2025-05-25T14:08:01Z","snapshot_observed_at":"2026-08-03T08:33:17.421277Z","submitted_at":"2024-08-22T23:00:40Z","title":"NanoFlow: Towards Optimal Large Language Model Serving Throughput","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.12757","snapshot_observed_at":"2026-08-06T18:11:16.322242Z","title":"URL https://doi.org/10.48550/arXiv.2408.12757","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-06T18:03:49.435059Z","submitted_at":"2025-07-11T20:58:21Z","title":"On Evaluating Performance of LLM Inference Serving Systems","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T18:11:16.322242Z"},"links":{"cited_paper":"/paper/2408.12757","citing_paper":"/paper/2507.09019"},"observation_digest":"sha256:8182292d6811e40188c146ff069ac5dec304270b05c5a391c33193e13c2a1f5c","observation_id":"55532324-5a12-45f1-b6fd-75421016dbd9","resolution":{"observed_at":"2026-08-06T18:11:16.322242Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.12757","last_updated":"2025-05-25T14:08:01Z","snapshot_observed_at":"2026-08-03T08:33:17.421277Z","submitted_at":"2024-08-22T23:00:40Z","title":"NanoFlow: Towards Optimal Large Language Model Serving Throughput","version":2},"cited_work":{"arxiv_id":"2408.12757","doi":"10.48550/arxiv.2408.12757","metadata_source":"arxiv_reference","pith_arxiv_id":"2408.12757","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Forked History","venue":"arXiv (Cornell University)","work_id":"9ff62941-44d1-4e06-b970-bbe8d7957a08","year":2025},"citing_paper":{"arxiv_id":"2604.24203","last_updated":"2026-04-27T09:07:15Z","snapshot_observed_at":"2026-07-06T23:10:16.426836Z","submitted_at":"2026-04-27T09:07:15Z","title":"Agentic Witnessing: Pragmatic and Scalable TEE-Enabled Privacy-Preserving Auditing","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-08T02:57:11.715370Z"},"links":{"cited_paper":"/paper/2408.12757","citing_paper":"/paper/2604.24203"},"observation_digest":"sha256:858a30b132b29786420c0181cb0e0319e3ae2cd3678e61440614becb690fa0e0","observation_id":"7fe95d27-a9fc-486f-8ac6-5b01de35e34a","resolution":{"observed_at":"2026-05-09T00:34:30.192398Z","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":"2408.12757","last_updated":"2025-05-25T14:08:01Z","snapshot_observed_at":"2026-08-03T08:33:17.421277Z","submitted_at":"2024-08-22T23:00:40Z","title":"NanoFlow: Towards Optimal Large Language Model Serving Throughput","version":2},"cited_work":{"arxiv_id":"2408.12757","doi":"10.48550/arxiv.2408.12757","metadata_source":"arxiv_reference","pith_arxiv_id":"2408.12757","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Forked History","venue":"arXiv (Cornell University)","work_id":"9ff62941-44d1-4e06-b970-bbe8d7957a08","year":2025},"citing_paper":{"arxiv_id":"2606.09200","last_updated":"2026-06-08T08:33:03Z","snapshot_observed_at":"2026-08-05T05:55:19.354737Z","submitted_at":"2026-06-08T08:33:03Z","title":"Resource-aware Computation-Communication Overlap for multi-GPU ML Workloads","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-27T15:00:07.823857Z"},"links":{"cited_paper":"/paper/2408.12757","citing_paper":"/paper/2606.09200"},"observation_digest":"sha256:d2b776a4d28097631c4ea4baf455ed3acc03d4c99a8621242eeed2734f52ffb4","observation_id":"fb2bbcf9-a1d8-4ab4-a0f5-38f112192068","resolution":{"observed_at":"2026-07-03T03:37:35.991585Z","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":"2408.12757","last_updated":"2025-05-25T14:08:01Z","snapshot_observed_at":"2026-08-03T08:33:17.421277Z","submitted_at":"2024-08-22T23:00:40Z","title":"NanoFlow: Towards Optimal Large Language Model Serving Throughput","version":2},"cited_work":{"arxiv_id":"2408.12757","doi":"10.48550/arxiv.2408.12757","metadata_source":"arxiv_reference","pith_arxiv_id":"2408.12757","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Forked History","venue":"arXiv (Cornell University)","work_id":"9ff62941-44d1-4e06-b970-bbe8d7957a08","year":2025},"citing_paper":{"arxiv_id":"2606.10493","last_updated":"2026-06-09T07:17:34Z","snapshot_observed_at":"2026-08-02T12:04:13.074478Z","submitted_at":"2026-06-09T07:17:34Z","title":"Achieving Cloud-Grade SLOs for Local Mixture-of-Experts Inference through CPU-GPU Hybrid Design","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-06-27T12:06:46.806138Z"},"links":{"cited_paper":"/paper/2408.12757","citing_paper":"/paper/2606.10493"},"observation_digest":"sha256:60fd9b80c6db97256ec1e5452a96724c90097706950440439f0cc181530d31df","observation_id":"96d7fdc0-a735-4c31-9844-4c2b05b065aa","resolution":{"observed_at":"2026-07-03T07:27:44.453159Z","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":"2408.12757","last_updated":"2025-05-25T14:08:01Z","snapshot_observed_at":"2026-08-03T08:33:17.421277Z","submitted_at":"2024-08-22T23:00:40Z","title":"NanoFlow: Towards Optimal Large Language Model Serving Throughput","version":2},"cited_work":{"arxiv_id":"2408.12757","doi":"10.48550/arxiv.2408.12757","metadata_source":"arxiv_reference","pith_arxiv_id":"2408.12757","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Forked History","venue":"arXiv (Cornell University)","work_id":"9ff62941-44d1-4e06-b970-bbe8d7957a08","year":2025},"citing_paper":{"arxiv_id":"2606.19746","last_updated":"2026-06-18T03:21:32Z","snapshot_observed_at":"2026-07-06T23:55:01.487552Z","submitted_at":"2026-06-18T03:21:32Z","title":"SAC: Disaggregated KV Cache System for Sparse Attention LLMs with CXL","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-26T16:22:45.441035Z"},"links":{"cited_paper":"/paper/2408.12757","citing_paper":"/paper/2606.19746"},"observation_digest":"sha256:6a81249acd6276ab6e53b610a141eef6ec5d13746674c3a0834f00aebcb936bd","observation_id":"de9a7c98-b60b-4d12-a03c-e6320022e531","resolution":{"observed_at":"2026-07-04T05:09:35.717356Z","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":"2408.12757","last_updated":"2025-05-25T14:08:01Z","snapshot_observed_at":"2026-08-03T08:33:17.421277Z","submitted_at":"2024-08-22T23:00:40Z","title":"NanoFlow: Towards Optimal Large Language Model Serving Throughput","version":2},"cited_work":{"arxiv_id":"2408.12757","doi":"10.48550/arxiv.2408.12757","metadata_source":"arxiv_reference","pith_arxiv_id":"2408.12757","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Forked History","venue":"arXiv (Cornell University)","work_id":"9ff62941-44d1-4e06-b970-bbe8d7957a08","year":2025},"citing_paper":{"arxiv_id":"2606.20295","last_updated":"2026-07-24T07:54:17Z","snapshot_observed_at":"2026-08-02T10:48:55.986116Z","submitted_at":"2026-06-18T14:33:09Z","title":"Token-Operations-Oriented Inference Optimization Techniques for Large Models","version":1},"reference_index":211,"source":"pdf_text","source_observed_at":"2026-06-26T16:15:22.543601Z"},"links":{"cited_paper":"/paper/2408.12757","citing_paper":"/paper/2606.20295"},"observation_digest":"sha256:f421869d4f10daa9f48a6bace4d2610c0e447c3ae85732f1bd3d52583a4f8c9d","observation_id":"0077e074-ec36-41aa-a8d5-339277276fe9","resolution":{"observed_at":"2026-07-04T05:09:36.790508Z","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":"2408.12757","last_updated":"2025-05-25T14:08:01Z","snapshot_observed_at":"2026-08-03T08:33:17.421277Z","submitted_at":"2024-08-22T23:00:40Z","title":"NanoFlow: Towards Optimal Large Language Model Serving Throughput","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.12757","snapshot_observed_at":"2026-08-02T10:49:23.721737Z","title":"NanoFlow: Towards Optimal Large Language Model Serving Throughput","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.20295","last_updated":"2026-07-24T07:54:17Z","snapshot_observed_at":"2026-08-02T10:48:55.986116Z","submitted_at":"2026-06-18T14:33:09Z","title":"Token-Operations-Oriented Inference Optimization Techniques for Large Models","version":2},"reference_index":211,"source":"pdf_text","source_observed_at":"2026-08-02T10:49:23.721737Z"},"links":{"cited_paper":"/paper/2408.12757","citing_paper":"/paper/2606.20295"},"observation_digest":"sha256:df4ad748ede606329a7c86ea066643a3118904b410af6c79eb97138fe731738c","observation_id":"7eb6445c-87dc-4b19-9caa-5794131b8b03","resolution":{"observed_at":"2026-08-02T10:49:23.721737Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.12757","last_updated":"2025-05-25T14:08:01Z","snapshot_observed_at":"2026-08-03T08:33:17.421277Z","submitted_at":"2024-08-22T23:00:40Z","title":"NanoFlow: Towards Optimal Large Language Model Serving Throughput","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.12757","snapshot_observed_at":"2026-08-01T12:03:18.901949Z","title":"all-MiniLM-L6-v2","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.19704","last_updated":"2026-07-22T03:06:57Z","snapshot_observed_at":"2026-08-03T19:16:52.195856Z","submitted_at":"2026-07-22T03:06:57Z","title":"Efficient Clustering with Provable Guardrails for LLM Inference at Scale","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T12:03:18.901949Z"},"links":{"cited_paper":"/paper/2408.12757","citing_paper":"/paper/2607.19704"},"observation_digest":"sha256:fd06a08125d8925276eb9509589c5ae3c5f491c73476c4c1def99664760f817b","observation_id":"1e955080-a0f7-4840-b0ee-9e4bec337fac","resolution":{"observed_at":"2026-08-01T12:03:18.901949Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2408.12757/citation-record","integrity":"/paper/2408.12757/integrity","json":"/paper/2408.12757/citation-record.json","paper":"/paper/2408.12757"},"outbound":[],"paper":{"arxiv_id":"2408.12757","last_updated":"2025-05-25T14:08:01Z","latest_version":2,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-03T08:33:17.421277Z","submitted_at":"2024-08-22T23:00:40Z","title":"NanoFlow: Towards Optimal Large Language Model Serving Throughput"},"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 11 inbound Pith citation observations for arXiv:2408.12757."}