{"as_of":"2026-08-15T22:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:481c8ce2072348ecb1d6e33454b0acd4c8f9a78cc5cc18dd4d55ff83a88c3f22","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-15T06:32:42.880941+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-15T15:43:40.020798Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-10T16:37:23.046838Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2504.19720","last_updated":"2025-04-28T12:14:02Z","snapshot_observed_at":"2026-08-13T23:59:06.501830Z","submitted_at":"2025-04-28T12:14:02Z","title":"Taming the Titans: A Survey of Efficient LLM Inference Serving","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.19720","snapshot_observed_at":"2026-08-15T15:43:40.020798Z","title":"Taming the titans: A survey of efficient llm inference serving.arXiv preprint arXiv:2504.19720,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.20408","last_updated":"2026-06-08T09:56:22Z","snapshot_observed_at":"2026-08-15T15:37:05.690638Z","submitted_at":"2026-01-28T09:13:17Z","title":"Meeting SLOs, Slashing Hours: Automated Enterprise LLM Optimization with OptiKIT","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T15:43:40.020798Z"},"links":{"cited_paper":"/paper/2504.19720","citing_paper":"/paper/2601.20408"},"observation_digest":"sha256:958e81cd0fd504a45c22c4b9414a5662a25f2a415822c6b261e86393c4158bdd","observation_id":"b8329d69-3ab0-4e7d-9cc0-4ba684ce9bfc","resolution":{"observed_at":"2026-08-15T15:43:40.020798Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.19720","last_updated":"2025-04-28T12:14:02Z","snapshot_observed_at":"2026-08-13T23:59:06.501830Z","submitted_at":"2025-04-28T12:14:02Z","title":"Taming the Titans: A Survey of Efficient LLM Inference Serving","version":1},"cited_work":{"arxiv_id":"2504.19720","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.19720","snapshot_observed_at":"2026-07-10T16:37:23.046838Z","title":"Taming the Titans: A Survey of Efficient LLM Inference Serving","venue":"cs.CL","work_id":"c12f143b-2331-4901-a3b7-11c3c0f7a7fb","year":2025},"citing_paper":{"arxiv_id":"2605.17842","last_updated":"2026-07-08T06:32:43Z","snapshot_observed_at":"2026-07-12T16:36:39.172164Z","submitted_at":"2026-05-18T04:28:16Z","title":"SNLP: Layer-Parallel Inference via Structured Newton Corrections","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-20T12:36:41.055552Z"},"links":{"cited_paper":"/paper/2504.19720","citing_paper":"/paper/2605.17842"},"observation_digest":"sha256:75dd45a3cb45509df859d762b12323a3b3107985e30b1d722528fdde949efa7d","observation_id":"0365177a-d57d-4ed1-87cb-4e1e494377b1","resolution":{"observed_at":"2026-05-20T12:38:16.792421Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.19720","last_updated":"2025-04-28T12:14:02Z","snapshot_observed_at":"2026-08-13T23:59:06.501830Z","submitted_at":"2025-04-28T12:14:02Z","title":"Taming the Titans: A Survey of Efficient LLM Inference Serving","version":1},"cited_work":{"arxiv_id":"2504.19720","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.19720","snapshot_observed_at":"2026-07-10T16:37:23.046838Z","title":"Taming the Titans: A Survey of Efficient LLM Inference Serving","venue":"cs.CL","work_id":"c12f143b-2331-4901-a3b7-11c3c0f7a7fb","year":2025},"citing_paper":{"arxiv_id":"2605.17842","last_updated":"2026-07-08T06:32:43Z","snapshot_observed_at":"2026-07-12T16:36:39.172164Z","submitted_at":"2026-05-18T04:28:16Z","title":"SNLP: Layer-Parallel Inference via Structured Newton Corrections","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-06-30T18:53:40.889001Z"},"links":{"cited_paper":"/paper/2504.19720","citing_paper":"/paper/2605.17842"},"observation_digest":"sha256:a12b27c6654a125890cb562075cdb47daacbf8ca2364e6804af5ac1f1114ace6","observation_id":"e44697e8-5558-40b7-be87-4cc4f1203112","resolution":{"observed_at":"2026-06-30T18:55:00.149925Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.19720","last_updated":"2025-04-28T12:14:02Z","snapshot_observed_at":"2026-08-13T23:59:06.501830Z","submitted_at":"2025-04-28T12:14:02Z","title":"Taming the Titans: A Survey of Efficient LLM Inference Serving","version":1},"cited_work":{"arxiv_id":"2504.19720","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.19720","snapshot_observed_at":"2026-07-10T16:37:23.046838Z","title":"Taming the Titans: A Survey of Efficient LLM Inference Serving","venue":"cs.CL","work_id":"c12f143b-2331-4901-a3b7-11c3c0f7a7fb","year":2025},"citing_paper":{"arxiv_id":"2606.21238","last_updated":"2026-06-19T09:05:01Z","snapshot_observed_at":"2026-08-07T12:20:29.118971Z","submitted_at":"2026-06-19T09:05:01Z","title":"Recency/Frequency Adaptive KV Caching for Large Language Model Serving","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-26T13:24:44.218871Z"},"links":{"cited_paper":"/paper/2504.19720","citing_paper":"/paper/2606.21238"},"observation_digest":"sha256:56e38681390fd2d8c24dbb66505792a8f5c390f735a008a582b11e57dd1af201","observation_id":"6a33381b-bbf5-4aff-9cdd-32de3877eabe","resolution":{"observed_at":"2026-07-04T07:29:39.033127Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.19720","last_updated":"2025-04-28T12:14:02Z","snapshot_observed_at":"2026-08-13T23:59:06.501830Z","submitted_at":"2025-04-28T12:14:02Z","title":"Taming the Titans: A Survey of Efficient LLM Inference Serving","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.19720","snapshot_observed_at":"2026-07-11T13:03:39.236118Z","title":"arXiv preprint arXiv:2504.19720 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04819","last_updated":"2026-07-13T09:12:14Z","snapshot_observed_at":"2026-08-14T16:33:54.686738Z","submitted_at":"2026-07-06T08:51:22Z","title":"Layer-Parallel Inference Reduces Encrypted Nonlinear Depth in Transformers","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-11T13:03:39.236118Z"},"links":{"cited_paper":"/paper/2504.19720","citing_paper":"/paper/2607.04819"},"observation_digest":"sha256:709b0a89add44b2f79063aca50d9c58f8b880bb0a518991fbb14ead3209baf88","observation_id":"c2416f8d-2cc5-4fbc-92d5-21919b12a54e","resolution":{"observed_at":"2026-07-11T13:03:39.236118Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.19720","last_updated":"2025-04-28T12:14:02Z","snapshot_observed_at":"2026-08-13T23:59:06.501830Z","submitted_at":"2025-04-28T12:14:02Z","title":"Taming the Titans: A Survey of Efficient LLM Inference Serving","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.19720","snapshot_observed_at":"2026-07-14T16:21:05.570023Z","title":"arXiv preprint arXiv:2504.19720 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.04819","last_updated":"2026-07-13T09:12:14Z","snapshot_observed_at":"2026-08-14T16:33:54.686738Z","submitted_at":"2026-07-06T08:51:22Z","title":"Layer-Parallel Inference Reduces Encrypted Nonlinear Depth in Transformers","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-07-14T16:21:05.570023Z"},"links":{"cited_paper":"/paper/2504.19720","citing_paper":"/paper/2607.04819"},"observation_digest":"sha256:7ce7e2ed14904d704ef1af786bebd8071eed3c50271f6b48460d2d2ffed783be","observation_id":"0d37bf6c-7e9a-48db-aa6a-3820733bd029","resolution":{"observed_at":"2026-07-14T16:21:05.570023Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.19720","last_updated":"2025-04-28T12:14:02Z","snapshot_observed_at":"2026-08-13T23:59:06.501830Z","submitted_at":"2025-04-28T12:14:02Z","title":"Taming the Titans: A Survey of Efficient LLM Inference Serving","version":1},"cited_work":{"arxiv_id":"2504.19720","doi":null,"metadata_source":"pith","pith_arxiv_id":"2504.19720","snapshot_observed_at":"2026-07-10T16:37:23.046838Z","title":"Taming the Titans: A Survey of Efficient LLM Inference Serving","venue":"cs.CL","work_id":"c12f143b-2331-4901-a3b7-11c3c0f7a7fb","year":2025},"citing_paper":{"arxiv_id":"2607.07862","last_updated":"2026-07-08T18:54:08Z","snapshot_observed_at":"2026-08-14T23:42:15.034758Z","submitted_at":"2026-07-08T18:54:08Z","title":"CTA-Pipelining: A Latency-Oriented Spatial Scaling Method for Multi-GPU Systems","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-10T16:30:09.561233Z"},"links":{"cited_paper":"/paper/2504.19720","citing_paper":"/paper/2607.07862"},"observation_digest":"sha256:7e058bb56b8320a09d916bbb9317366c9022240d5ac377c2740c6d007b4db52c","observation_id":"af013cce-dc30-4506-8d31-1418aaecfcf5","resolution":{"observed_at":"2026-07-10T16:37:23.048137Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2504.19720/citation-record","integrity":"/paper/2504.19720/integrity","json":"/paper/2504.19720/citation-record.json","paper":"/paper/2504.19720"},"outbound":[],"paper":{"arxiv_id":"2504.19720","last_updated":"2025-04-28T12:14:02Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-13T23:59:06.501830Z","submitted_at":"2025-04-28T12:14:02Z","title":"Taming the Titans: A Survey of Efficient LLM Inference 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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2504.19720."}