{"as_of":"2026-08-10T05:26:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:26d9ba915d36a087cc3481f89f828f9dd7ac5ec8a4edcf6f9da0cb06fdbeae4f","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-09T06:31:02.800959+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-09T05:40:21.420376Z","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-06-30T07:04:20.871745Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2402.09398","last_updated":"2024-06-12T06:08:58Z","snapshot_observed_at":"2026-08-05T03:17:46.344890Z","submitted_at":"2024-02-14T18:54:56Z","title":"Get More with LESS: Synthesizing Recurrence with KV Cache Compression for Efficient LLM Inference","version":2},"cited_work":{"arxiv_id":"2402.09398","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.09398","snapshot_observed_at":"2026-06-30T07:04:20.871745Z","title":"arXiv preprint arXiv:2402.09398 , year=","venue":null,"work_id":"cd089e5a-f860-4eb7-bdd0-12c98cf24efa","year":null},"citing_paper":{"arxiv_id":"2406.02069","last_updated":"2025-05-15T17:18:12Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-06-04T07:51:30Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","version":4},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"cited_paper":"/paper/2402.09398","citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:83da18323ceb38a2ba905dc7a6eb93686b7723e2c7c44289a90c8b91c996c988","observation_id":"c935123c-84ea-458a-80dd-3a8a694ba6a4","resolution":{"observed_at":"2026-05-12T09:58:29.127993Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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":"2402.09398","last_updated":"2024-06-12T06:08:58Z","snapshot_observed_at":"2026-08-05T03:17:46.344890Z","submitted_at":"2024-02-14T18:54:56Z","title":"Get More with LESS: Synthesizing Recurrence with KV Cache Compression for Efficient LLM Inference","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09398","snapshot_observed_at":"2026-08-07T20:15:13.933003Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.09888","last_updated":"2025-08-28T01:40:30Z","snapshot_observed_at":"2026-08-07T20:07:17.154568Z","submitted_at":"2025-02-14T03:25:09Z","title":"Climber: Toward Efficient Scaling Laws for Large Recommendation Models","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T20:15:13.933003Z"},"links":{"cited_paper":"/paper/2402.09398","citing_paper":"/paper/2502.09888"},"observation_digest":"sha256:615923afb6640b03d6f703b617c83bebb7918a4afb3b740caeb50752179bc33c","observation_id":"efcfaefd-a247-4353-a861-efdbe90e7350","resolution":{"observed_at":"2026-08-07T20:15:13.933003Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09398","last_updated":"2024-06-12T06:08:58Z","snapshot_observed_at":"2026-08-05T03:17:46.344890Z","submitted_at":"2024-02-14T18:54:56Z","title":"Get More with LESS: Synthesizing Recurrence with KV Cache Compression for Efficient LLM Inference","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09398","snapshot_observed_at":"2026-08-09T05:40:21.420376Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.15734","last_updated":"2025-02-05T14:12:33Z","snapshot_observed_at":"2026-08-09T08:05:40.503223Z","submitted_at":"2025-02-05T14:12:33Z","title":"Cache-Craft: Managing Chunk-Caches for Efficient Retrieval-Augmented Generation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-09T05:40:21.420376Z"},"links":{"cited_paper":"/paper/2402.09398","citing_paper":"/paper/2502.15734"},"observation_digest":"sha256:8754cb9276024210d240338de0e08de7838f5be7a05013305df9ed0bb5ebc197","observation_id":"49442074-052e-4d9c-a885-1bd1d94332c4","resolution":{"observed_at":"2026-08-09T05:40:21.420376Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09398","last_updated":"2024-06-12T06:08:58Z","snapshot_observed_at":"2026-08-05T03:17:46.344890Z","submitted_at":"2024-02-14T18:54:56Z","title":"Get More with LESS: Synthesizing Recurrence with KV Cache Compression for Efficient LLM Inference","version":2},"cited_work":{"arxiv_id":"2402.09398","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.09398","snapshot_observed_at":"2026-06-30T07:04:20.871745Z","title":"arXiv preprint arXiv:2402.09398 , year=","venue":null,"work_id":"cd089e5a-f860-4eb7-bdd0-12c98cf24efa","year":null},"citing_paper":{"arxiv_id":"2605.22884","last_updated":"2026-05-21T00:21:51Z","snapshot_observed_at":"2026-08-09T03:17:27.707172Z","submitted_at":"2026-05-21T00:21:51Z","title":"Tensor Cache: Eviction-conditioned Associative Memory for Transformers","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-05-25T05:49:43.160574Z"},"links":{"cited_paper":"/paper/2402.09398","citing_paper":"/paper/2605.22884"},"observation_digest":"sha256:4ab68626e43a797ac38d72c991f56726dfbd9b88eae680221a57d974233e0cc8","observation_id":"1dc4b474-fa34-4e3b-b537-3d0469b20443","resolution":{"observed_at":"2026-05-25T05:50:23.550340Z","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":"2402.09398","last_updated":"2024-06-12T06:08:58Z","snapshot_observed_at":"2026-08-05T03:17:46.344890Z","submitted_at":"2024-02-14T18:54:56Z","title":"Get More with LESS: Synthesizing Recurrence with KV Cache Compression for Efficient LLM Inference","version":2},"cited_work":{"arxiv_id":"2402.09398","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.09398","snapshot_observed_at":"2026-06-30T07:04:20.871745Z","title":"arXiv preprint arXiv:2402.09398 , year=","venue":null,"work_id":"cd089e5a-f860-4eb7-bdd0-12c98cf24efa","year":null},"citing_paper":{"arxiv_id":"2606.30389","last_updated":"2026-06-29T14:43:25Z","snapshot_observed_at":"2026-08-08T05:45:34.017287Z","submitted_at":"2026-06-29T14:43:25Z","title":"Predict, Reuse, and Repair: Accelerating Dynamic Sparse Attention for Long-Context LLM Decoding","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-06-30T07:03:08.617257Z"},"links":{"cited_paper":"/paper/2402.09398","citing_paper":"/paper/2606.30389"},"observation_digest":"sha256:cf75324f94c1d9566e36612ebc7ce0585dfaabf258e42992b045a3d623dcd4d1","observation_id":"c7bf44d1-23f0-4280-a864-204f71d92004","resolution":{"observed_at":"2026-06-30T07:04:20.873934Z","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":"2402.09398","last_updated":"2024-06-12T06:08:58Z","snapshot_observed_at":"2026-08-05T03:17:46.344890Z","submitted_at":"2024-02-14T18:54:56Z","title":"Get More with LESS: Synthesizing Recurrence with KV Cache Compression for Efficient LLM Inference","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09398","snapshot_observed_at":"2026-07-12T09:50:23.266920Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.02574","last_updated":"2026-06-30T16:12:40Z","snapshot_observed_at":"2026-07-12T09:50:22.497230Z","submitted_at":"2026-06-30T16:12:40Z","title":"From Tensor Buffer to Distributed Memory Hierarchy: A Survey of KV Cache Management for LLM Serving","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-12T09:50:23.266920Z"},"links":{"cited_paper":"/paper/2402.09398","citing_paper":"/paper/2607.02574"},"observation_digest":"sha256:4b32ff5c6854017999f6824963d9d498e62c54f73e1a024982ef9cda02f9becc","observation_id":"b59e9c71-c4f4-41f5-a174-fe493555aa17","resolution":{"observed_at":"2026-07-12T09:50:23.266920Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09398","last_updated":"2024-06-12T06:08:58Z","snapshot_observed_at":"2026-08-05T03:17:46.344890Z","submitted_at":"2024-02-14T18:54:56Z","title":"Get More with LESS: Synthesizing Recurrence with KV Cache Compression for Efficient LLM Inference","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09398","snapshot_observed_at":"2026-08-02T09:52:44.106186Z","title":"Get more with less: Synthesizing recurrence with kv cache compression for efficient llm inference,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24788","last_updated":"2026-06-26T17:48:13Z","snapshot_observed_at":"2026-08-08T22:24:44.919436Z","submitted_at":"2026-06-26T17:48:13Z","title":"GLIDE: Guided Layerwise Hybrid Attention for Efficient LLM Inference","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T09:52:44.106186Z"},"links":{"cited_paper":"/paper/2402.09398","citing_paper":"/paper/2607.24788"},"observation_digest":"sha256:e9d452932d1406966e734d73f3bde51c448bab78e0cb827230ba50768fbf0f16","observation_id":"77917668-f16d-4abe-b609-fe7f6bb63bec","resolution":{"observed_at":"2026-08-02T09:52:44.106186Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2402.09398/citation-record","integrity":"/paper/2402.09398/integrity","json":"/paper/2402.09398/citation-record.json","paper":"/paper/2402.09398"},"outbound":[],"paper":{"arxiv_id":"2402.09398","last_updated":"2024-06-12T06:08:58Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-05T03:17:46.344890Z","submitted_at":"2024-02-14T18:54:56Z","title":"Get More with LESS: Synthesizing Recurrence with KV Cache Compression for Efficient LLM Inference"},"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 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2402.09398."}