{"as_of":"2026-08-06T20:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6bc37d162893694b57b9f935ece5cd2e7ccc601d46a542cbde3865c5ea68479a","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-12T09:58:29.057357Z","state":"measured"},{"denominator":140,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":140,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":138,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T20:08:09.488803Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":2,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2407.11550","last_updated":"2025-10-16T13:25:38Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-07-16T09:53:32Z","title":"Ada-KV: Optimizing KV Cache Eviction by Adaptive Budget Allocation for Efficient LLM Inference","version":5},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-17T11:16:31.904921Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2407.11550"},"observation_digest":"sha256:8f17d6024c5464ed6a84fb12889321571f6783490c07202c7c14ec752d756945","observation_id":"5db3f52e-6649-45e8-9603-4ddd49a703be","resolution":{"observed_at":"2026-05-17T11:16:32.027501Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2409.10516","last_updated":"2024-12-31T07:11:00Z","snapshot_observed_at":"2026-07-06T19:16:14.638445Z","submitted_at":"2024-09-16T17:59:52Z","title":"RetrievalAttention: Accelerating Long-Context LLM Inference via Vector Retrieval","version":3},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-05-18T08:12:01.798459Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2409.10516"},"observation_digest":"sha256:781d695ad6e2a731cb9608561cf5e2ea180dc8cfb2111632e4bb2edb2ca8932a","observation_id":"666adf94-9fe6-462a-817f-4cb202cab9d2","resolution":{"observed_at":"2026-05-18T08:12:01.920496Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2410.13846","last_updated":"2026-05-18T05:12:14Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-10-17T17:58:14Z","title":"LightTransfer: Your Long-Context LLM is Secretly a Hybrid Model with Effortless Adaptation","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-23T18:31:35.391674Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2410.13846"},"observation_digest":"sha256:15dc3517c9cd83a08b063edd100c2eb27a7ed6f48fa28ba7beedaa2d3e96ca2b","observation_id":"190f646b-99d6-4527-99ea-26a17bafab65","resolution":{"observed_at":"2026-05-23T18:33:19.388291Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2502.01068","last_updated":"2026-04-20T06:24:40Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-02-03T05:25:09Z","title":"FastKV: Decoupling of Context Reduction and KV Cache Compression for Prefill-Decoding Acceleration","version":7},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-23T03:59:58.634512Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2502.01068"},"observation_digest":"sha256:eb5c22dd5ff27ea1c80145e4e1e95613b2e3474c1c6ef193b743dff49ee7f0b4","observation_id":"5c759f4b-a372-4848-b09f-d38b369845d1","resolution":{"observed_at":"2026-05-23T04:02:29.940554Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2502.01941","last_updated":"2026-05-12T08:04:27Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-02-04T02:23:06Z","title":"Semantic Integrity Matters: Benchmarking and Preserving High-Density Reasoning in KV Cache Compression","version":4},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-23T04:15:36.906263Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2502.01941"},"observation_digest":"sha256:83a5620f5ee596ee690269ff82e93ce0cdeb6c66f027662d05bdf59dd4e213d6","observation_id":"073260d5-2cbc-4713-9d53-45eef363d853","resolution":{"observed_at":"2026-05-23T04:17:31.250437Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2504.19874","last_updated":"2025-04-28T15:05:35Z","snapshot_observed_at":"2026-08-01T14:10:27.172555Z","submitted_at":"2025-04-28T15:05:35Z","title":"TurboQuant: Online Vector Quantization with Near-optimal Distortion Rate","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-20T08:09:22.226608Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2504.19874"},"observation_digest":"sha256:6f2074d6bfbc820c7dec611e4e143198a28fbfe2cee99d0f4eec57599a100957","observation_id":"dd015a65-76a0-4100-9804-995fade955fd","resolution":{"observed_at":"2026-05-20T08:09:22.359112Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2505.02922","last_updated":"2026-04-27T10:13:35Z","snapshot_observed_at":"2026-08-02T06:23:14.961990Z","submitted_at":"2025-05-05T18:01:17Z","title":"RetroInfer: A Vector Storage Engine for Scalable Long-Context LLM Inference","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-22T15:59:04.724780Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2505.02922"},"observation_digest":"sha256:814e9e7fc1a34696350a7a203e323fe3114d4962534c3d23197f146bf3dbcdd5","observation_id":"01914110-32ad-4d4b-85db-ec6ad85e851d","resolution":{"observed_at":"2026-05-12T09:58:29.304691Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-06T20:08:09.488803Z","title":"Pyramidkv: Dynamic kv cache compression based on pyramidal information funneling","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.03865","last_updated":"2025-08-16T11:42:58Z","snapshot_observed_at":"2026-08-06T19:58:31.345730Z","submitted_at":"2025-07-05T02:29:23Z","title":"OrthoRank: Token Selection via Sink Token Orthogonality for Efficient LLM inference","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-06T20:08:09.488803Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2507.03865"},"observation_digest":"sha256:54034cedd87ed45d04bae6e1e8981a0b85d7b801e49366e8418ca7ecd48b067a","observation_id":"ae04f335-09c4-4713-9b2e-f61df35db73e","resolution":{"observed_at":"2026-08-06T20:08:09.488803Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-06T19:10:01.168058Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.06517","last_updated":"2025-07-09T03:33:44Z","snapshot_observed_at":"2026-08-06T18:59:37.663507Z","submitted_at":"2025-07-09T03:33:44Z","title":"SpindleKV: A Novel KV Cache Reduction Method Balancing Both Shallow and Deep Layers","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T19:10:01.168058Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2507.06517"},"observation_digest":"sha256:f40f1d68bd9385cd69cbf2185dfa56e4cc0eaea1f98cc3c0689a15f2171e7751","observation_id":"909506b7-faec-4605-9ec8-43fbedf0c25a","resolution":{"observed_at":"2026-08-06T19:10:01.168058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-06T18:32:45.136591Z","title":"Pyramidkv: Dynamic kv cache compression based on pyramidal information funneling","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.07990","last_updated":"2025-07-10T17:59:02Z","snapshot_observed_at":"2026-08-06T18:25:29.869749Z","submitted_at":"2025-07-10T17:59:02Z","title":"Multi-Granular Spatio-Temporal Token Merging for Training-Free Acceleration of Video LLMs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T18:32:45.136591Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2507.07990"},"observation_digest":"sha256:69bf97b12683d1bfcf4fa0e8524898dc7f8cd58f9d6c2e18c7d705e91624e446","observation_id":"1d098822-e46e-43ba-98be-c0a9f7a2e67f","resolution":{"observed_at":"2026-08-06T18:32:45.136591Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-06T13:57:15.666030Z","title":"Pyramidkv: Dynamic kv cache compression based on pyramidal information funneling","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.19906","last_updated":"2025-08-04T08:19:26Z","snapshot_observed_at":"2026-08-06T13:57:11.431220Z","submitted_at":"2025-07-26T10:34:53Z","title":"CaliDrop: KV Cache Compression with Calibration","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T13:57:15.666030Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2507.19906"},"observation_digest":"sha256:2aea9652cb43eafb59c09da5344605ec8f65d6405f75ad592562f0cde1076b01","observation_id":"71be8909-196f-489c-9806-77b6bc72c888","resolution":{"observed_at":"2026-08-06T13:57:15.666030Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-06T14:00:43.056432Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.20030","last_updated":"2025-07-26T18:20:25Z","snapshot_observed_at":"2026-08-06T14:00:29.609119Z","submitted_at":"2025-07-26T18:20:25Z","title":"FAEDKV: Infinite-Window Fourier Transform for Unbiased KV Cache Compression","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T14:00:43.056432Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2507.20030"},"observation_digest":"sha256:aef3e6e9bb6017823685b07952884b3b83c171126eba2a88fe3f340aaee70607","observation_id":"1d0e505e-5774-42d4-b0d1-a59251e4c9cf","resolution":{"observed_at":"2026-08-06T14:00:43.056432Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-06T05:00:04.815941Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.02401","last_updated":"2025-08-04T13:26:16Z","snapshot_observed_at":"2026-08-06T04:59:59.905015Z","submitted_at":"2025-08-04T13:26:16Z","title":"CompressKV: Semantic Retrieval Heads Know What Tokens are Not Important Before Generation","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T05:00:04.815941Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2508.02401"},"observation_digest":"sha256:e301364dc6c47547b5941d9f74f7a1253fb23bc880c477ecdab4169d114fae4e","observation_id":"8c878f50-e796-4a0e-bff9-99634a5bdaa3","resolution":{"observed_at":"2026-08-06T05:00:04.815941Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2508.06526","last_updated":"2026-05-19T16:34:08Z","snapshot_observed_at":"2026-07-06T22:10:11.873662Z","submitted_at":"2025-08-02T03:50:14Z","title":"PiKV: KV Cache Management System for Mixture of Experts","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-21T23:59:54.173495Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2508.06526"},"observation_digest":"sha256:2cba6aaac9edc177f38d2303565c8261a28b882baccbe03ed4b7e955923c0659","observation_id":"025b074b-3744-4487-af55-32e841e5e6b2","resolution":{"observed_at":"2026-05-22T00:00:47.796797Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T13:44:17.124146Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.00388","last_updated":"2025-08-30T06:56:28Z","snapshot_observed_at":"2026-08-05T13:44:14.963957Z","submitted_at":"2025-08-30T06:56:28Z","title":"GraphKV: Breaking the Static Selection Paradigm with Graph-Based KV Cache Eviction","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-05T13:44:17.124146Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2509.00388"},"observation_digest":"sha256:62aa637ce995a357d0cdc17501a8813f72062fc4a3a0ffc74e60619d8b2d504b","observation_id":"b5151996-ff67-4cd4-8d85-9bc3cc9ba343","resolution":{"observed_at":"2026-08-05T13:44:17.124146Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T11:10:56.529594Z","title":"Pyramidkv: Dynamic kv cache compression based on pyra- midal information funneling","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.03136","last_updated":"2025-09-03T08:38:40Z","snapshot_observed_at":"2026-08-05T11:10:55.803387Z","submitted_at":"2025-09-03T08:38:40Z","title":"Adaptive KV-Cache Compression without Manually Setting Budget","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-05T11:10:56.529594Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2509.03136"},"observation_digest":"sha256:e0e6fa490477a1828c638556ecdd738a911fdac46c1b985c45d868dd181393c1","observation_id":"a57ee57f-005d-44a1-b3a5-f6d6c96c5c2c","resolution":{"observed_at":"2026-08-05T11:10:56.529594Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T10:16:13.114722Z","title":"In Conference on Empirical Methods in Natural Language Processing (EMNLP)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.04377","last_updated":"2025-09-04T16:40:01Z","snapshot_observed_at":"2026-08-06T07:33:15.787399Z","submitted_at":"2025-09-04T16:40:01Z","title":"PagedEviction: Structured Block-wise KV Cache Pruning for Efficient Large Language Model Inference","version":1},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-05T10:16:13.114722Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2509.04377"},"observation_digest":"sha256:d40e8956e1f8a2a256c24fc326091c6d84874c41b55d54185efc00f56b75203e","observation_id":"762a847d-aaed-432f-a10d-9f7845876930","resolution":{"observed_at":"2026-08-05T10:16:13.114722Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-04T20:53:27.311694Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.08315","last_updated":"2025-09-10T06:32:49Z","snapshot_observed_at":"2026-08-04T20:53:17.807634Z","submitted_at":"2025-09-10T06:32:49Z","title":"EvolKV: Evolutionary KV Cache Compression for LLM Inference","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-04T20:53:27.311694Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2509.08315"},"observation_digest":"sha256:1e619c88f7f9afbf7fdc87bf5a6c09248e99f16c8ad8070b243ed9d690cae894","observation_id":"ec5e6bb3-5d9a-4eb8-be3f-f54dad7cc057","resolution":{"observed_at":"2026-08-04T20:53:27.311694Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2509.17396","last_updated":"2026-05-19T20:55:44Z","snapshot_observed_at":"2026-07-06T22:30:26.679189Z","submitted_at":"2025-09-22T06:56:35Z","title":"EpiCache: Episodic KV Cache Management for Long-Term Conversation on Resource-Constrained Environments","version":4},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-21T21:54:05.442769Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2509.17396"},"observation_digest":"sha256:e94e06fd1c6ff332844ccdad68d234a226e37a6c0aaa296ebd74c8868bd493b9","observation_id":"f9f7b201-db2b-4528-bda9-5d54ab196de3","resolution":{"observed_at":"2026-05-21T21:54:22.788872Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2510.00231","last_updated":"2026-05-13T19:46:01Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-09-30T19:55:26Z","title":"The Pitfalls of KV Cache Compression","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-18T11:31:57.865691Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2510.00231"},"observation_digest":"sha256:e8712d844ba42eb0a2579b1e44147baa87d73abd653da94ce054d107582bafc8","observation_id":"93e37d9d-8598-453f-9f87-9c7301c848df","resolution":{"observed_at":"2026-05-18T11:32:35.154557Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-04T14:43:00.828806Z","title":"Pyramidkv: Dynamic KV cache compression based on pyramidal information funneling","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.02361","last_updated":"2026-05-25T07:51:15Z","snapshot_observed_at":"2026-08-04T14:42:55.586487Z","submitted_at":"2025-09-28T11:04:00Z","title":"ChunkLLM: A Lightweight Pluggable Framework for Accelerating LLMs Inference","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-04T14:43:00.828806Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2510.02361"},"observation_digest":"sha256:0595abd29c97e9ee91a9fac8554c0b4b9cdf04b75c7668a4eb398af98b97d8b9","observation_id":"8154630b-1f14-4887-8f2f-9687e91c15b0","resolution":{"observed_at":"2026-08-04T14:43:00.828806Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2510.10129","last_updated":"2026-05-21T08:20:19Z","snapshot_observed_at":"2026-07-06T22:32:22.953630Z","submitted_at":"2025-10-11T09:28:26Z","title":"CacheClip: Accelerating RAG with Effective KV Cache Reuse","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-22T12:36:41.630618Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2510.10129"},"observation_digest":"sha256:16cb880e0ca7ca5f489ecd653ccfc4dfc1269f102b663117dc7a533d4ea3aa59","observation_id":"8d2a2249-c81e-45b2-b0c2-beb039d9682b","resolution":{"observed_at":"2026-05-22T12:41:33.680339Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-04T07:44:17.063957Z","title":"Pyramidkv: Dynamic kv cache compression based on pyramidal information funneling.arXiv preprint arXiv:2406.02069,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2510.24606","last_updated":"2026-05-27T23:25:55Z","snapshot_observed_at":"2026-08-04T07:44:14.501838Z","submitted_at":"2025-10-28T16:34:18Z","title":"Long-Context Modeling with Dynamic Hierarchical Sparse Attention for Memory-Constrained LLM Inference","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T07:44:17.063957Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2510.24606"},"observation_digest":"sha256:75a8c9bfebe4315f156f7f0753cad023fbc298818785ad9c1c9a1bc9a7d03f6a","observation_id":"095e062d-1ca3-47bf-a3b7-d314d4b98893","resolution":{"observed_at":"2026-08-04T07:44:17.063957Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2601.13684","last_updated":"2026-04-18T08:34:09Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-01-20T07:35:06Z","title":"HeteroCache: A Dynamic Retrieval Approach to Heterogeneous KV Cache Compression for Long-Context LLM Inference","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-16T13:16:31.568604Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2601.13684"},"observation_digest":"sha256:a0506177b41d33ba996ec2a7542dd4a4c92269e66dae2371c6a70e175fcc87ca","observation_id":"40bb759f-29fa-4826-a57e-37277ad85db8","resolution":{"observed_at":"2026-05-16T13:17:54.905052Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2601.14004","last_updated":"2026-04-14T03:49:06Z","snapshot_observed_at":"2026-07-31T09:24:49.481740Z","submitted_at":"2026-01-20T14:23:23Z","title":"Locate, Steer, and Improve: A Practical Survey of Actionable Mechanistic Interpretability in Large Language Models","version":4},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-16T12:39:57.398423Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2601.14004"},"observation_digest":"sha256:20c730d179c3704be35e6b14a9d297ca66b0cfd1120c3fa7c520df97f414e3ce","observation_id":"a0d59ee3-8a6d-47c0-ad90-bf2af8c5be53","resolution":{"observed_at":"2026-05-16T12:40:54.722220Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-03T03:37:50.092147Z","title":"Pyramidkv: Dynamic kv cache compression based on pyramidal information funneling.arXiv preprint arXiv:2406.02069,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.07721","last_updated":"2026-05-28T23:34:23Z","snapshot_observed_at":"2026-08-03T03:37:48.402653Z","submitted_at":"2026-02-07T22:26:45Z","title":"ParisKV: Fast and Drift-Robust KV-Cache Retrieval for Long-Context LLMs","version":3},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-03T03:37:50.092147Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2602.07721"},"observation_digest":"sha256:41259916423115daa209c29fce005d665fc46f4a0601bf4d65a47ea24fde9aed","observation_id":"06efd669-e6ad-40c4-93dd-ace01ae12ff1","resolution":{"observed_at":"2026-08-03T03:37:50.092147Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2602.08686","last_updated":"2026-07-21T10:42:28Z","snapshot_observed_at":"2026-08-03T03:16:17.613692Z","submitted_at":"2026-02-09T14:07:55Z","title":"CompilerKV: Risk-Adaptive KV Compression via Offline Experience Compilation","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-21T13:32:15.598047Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2602.08686"},"observation_digest":"sha256:fa90373d481ecec795dea6342bb9b4eb4591bdc1aa096863379089dcc2938d5f","observation_id":"23d9454a-000a-499c-97c7-1b22f972b741","resolution":{"observed_at":"2026-05-21T13:34:11.338551Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-03T03:16:19.856696Z","title":"Pyramidkv: Dynamic kv cache compression based on pyramidal information funneling.arXiv preprint arXiv:2406.02069,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.08686","last_updated":"2026-07-21T10:42:28Z","snapshot_observed_at":"2026-08-03T03:16:17.613692Z","submitted_at":"2026-02-09T14:07:55Z","title":"CompilerKV: Risk-Adaptive KV Compression via Offline Experience Compilation","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T03:16:19.856696Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2602.08686"},"observation_digest":"sha256:f9e3284a2a67665a1ea88cb5f0b804589b69df600c186a3caf17c2e61a7d7e99","observation_id":"fc30f8e6-df5d-4382-9704-458e28ff03f8","resolution":{"observed_at":"2026-08-03T03:16:19.856696Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-03T01:18:02.495588Z","title":"Edoardo Cetin, Qi Sun, Tianyu Zhao, and Yujin Tang","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.10238","last_updated":"2026-06-26T10:01:58Z","snapshot_observed_at":"2026-08-03T01:17:29.085975Z","submitted_at":"2026-02-10T19:34:15Z","title":"Learning to Evict from Key-Value Cache","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T01:18:02.495588Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2602.10238"},"observation_digest":"sha256:35b5e9a454da6e902549524d37076d59554dac31c12df4c24101ad8576ba30b9","observation_id":"4149d7af-395d-46ed-867b-6fdde9f92f96","resolution":{"observed_at":"2026-08-03T01:18:02.495588Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-02T18:47:14.754202Z","title":"Pyramidkv: Dynamic kv cache compression based on pyramidal information funneling.arXiv preprint arXiv:2406.02069,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2603.05353","last_updated":"2026-07-16T04:21:11Z","snapshot_observed_at":"2026-08-05T20:13:20.512147Z","submitted_at":"2026-03-05T16:33:20Z","title":"InfoFlow KV: Information-Flow-Aware KV Recomputation for Long Context","version":3},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-02T18:47:14.754202Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2603.05353"},"observation_digest":"sha256:a16b2e0f2286f1b6bb4630c1b870ccd96425df2eea352afa52f0c2662a724c95","observation_id":"0b3cbd01-fae1-4787-82c0-913dd87d1f84","resolution":{"observed_at":"2026-08-02T18:47:14.754202Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2604.03679","last_updated":"2026-04-04T10:46:09Z","snapshot_observed_at":"2026-07-06T22:52:48.277339Z","submitted_at":"2026-04-04T10:46:09Z","title":"LightThinker++: From Reasoning Compression to Memory Management","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-05-13T17:25:28.432170Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2604.03679"},"observation_digest":"sha256:03e67d2234feeae433ca8013e411fcdb852d9f34e254f970251e3f44917a669a","observation_id":"8dfff70d-83ea-4390-a4e3-b59fe0c0498b","resolution":{"observed_at":"2026-05-13T17:28:01.768934Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2604.04921","last_updated":"2026-04-06T17:58:42Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-06T17:58:42Z","title":"TriAttention: Efficient Long Reasoning with Trigonometric KV Compression","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T19:55:45.739280Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2604.04921"},"observation_digest":"sha256:d0a520c9a2c2b52cf2834233092d68fca27923a0ba65283508b892d45b5fa793","observation_id":"f8c610bf-d118-4b52-98fd-2c9e89832bf9","resolution":{"observed_at":"2026-05-12T09:58:29.304691Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-07-13T09:09:32.932051Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2604.06035","last_updated":"2026-06-02T01:46:36Z","snapshot_observed_at":"2026-08-06T06:50:01.259424Z","submitted_at":"2026-04-07T16:30:54Z","title":"cuRAMSES: Scalable AMR Optimizations for Large-Scale Cosmological Simulations","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-13T09:09:32.932051Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2604.06035"},"observation_digest":"sha256:a1dc8f2c51dc5041b8fd21c43f91ee7b3eceab404148d90edf3802ccdc83bddb","observation_id":"859261f3-bb98-4699-8f3c-3b5712ee5a4e","resolution":{"observed_at":"2026-07-13T09:09:32.932051Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2604.06036","last_updated":"2026-04-09T09:40:36Z","snapshot_observed_at":"2026-07-06T22:54:34.877944Z","submitted_at":"2026-04-07T16:31:45Z","title":"CodecSight: Leveraging Video Codec Signals for Efficient Streaming VLM Inference","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T18:45:26.555395Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2604.06036"},"observation_digest":"sha256:bd853af2185a30edcc0ee36a231d92db4120453724c4b0cd30ec1748f60c8fc3","observation_id":"6d4d2d06-b832-418f-82b8-49a4de90efa1","resolution":{"observed_at":"2026-05-12T09:58:29.304691Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2604.06694","last_updated":"2026-04-08T05:20:39Z","snapshot_observed_at":"2026-07-06T22:55:06.424752Z","submitted_at":"2026-04-08T05:20:39Z","title":"AudioKV: KV Cache Eviction in Efficient Large Audio Language Models","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T18:28:49.768210Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2604.06694"},"observation_digest":"sha256:67e39663fb231d3639740d59ff9a317220570f58942604e9caaf24a9c53b1444","observation_id":"1640abe1-e9bf-46d8-86e7-eccb0bfac392","resolution":{"observed_at":"2026-05-12T09:58:29.304691Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2604.08603","last_updated":"2026-04-08T06:07:48Z","snapshot_observed_at":"2026-08-03T09:06:40.497418Z","submitted_at":"2026-04-08T06:07:48Z","title":"From Business Events to Auditable Decisions: Ontology-Governed Graph Simulation for Enterprise AI","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T18:26:16.639817Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2604.08603"},"observation_digest":"sha256:6cd6ea3619c5e6e43fd24c40862ba9ddb7bc8bd61a04ced4b9caaf68a9ea76a3","observation_id":"9cf29f5b-daed-495f-b55f-93113e273f66","resolution":{"observed_at":"2026-05-12T09:58:29.304691Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2604.09595","last_updated":"2026-03-05T14:50:39Z","snapshot_observed_at":"2026-08-02T10:22:45.523119Z","submitted_at":"2026-03-05T14:50:39Z","title":"Why Smaller Is Slower? Dimensional Misalignment in Compressed LLMs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-15T15:40:09.438406Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2604.09595"},"observation_digest":"sha256:8dc684bc53a6185dc85c2185ebd0996ec6ea427cc6287c8413fa80fc28186950","observation_id":"8f13d916-cdf4-4b0f-8e4d-f1bd44c47eea","resolution":{"observed_at":"2026-05-15T15:41:12.000328Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2604.10098","last_updated":"2026-04-11T08:41:33Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-11T08:41:33Z","title":"Attention Sink in Transformers: A Survey on Utilization, Interpretation, and Mitigation","version":1},"reference_index":148,"source":"pdf_text","source_observed_at":"2026-05-10T16:17:09.834609Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2604.10098"},"observation_digest":"sha256:0b6765b733d9973974839a9f48e64f0e340d53d10f97e001a5b3b6dc01e4a9e9","observation_id":"cb0a69a0-9e79-4605-9788-cc9cd057db81","resolution":{"observed_at":"2026-05-12T09:58:29.304691Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2604.11288","last_updated":"2026-04-13T10:51:46Z","snapshot_observed_at":"2026-07-06T22:59:45.139155Z","submitted_at":"2026-04-13T10:51:46Z","title":"Transactional Attention: Semantic Sponsorship for KV-Cache Retention","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-10T15:10:24.725639Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2604.11288"},"observation_digest":"sha256:7c6110692b0c35cf26daa556b431a7016a94cff596678de58dafa9e278e30f3e","observation_id":"712cd662-7769-4f97-bb3e-41bc8db80015","resolution":{"observed_at":"2026-05-12T09:58:29.304691Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2604.16864","last_updated":"2026-04-18T06:28:21Z","snapshot_observed_at":"2026-08-02T05:52:50.560554Z","submitted_at":"2026-04-18T06:28:21Z","title":"HieraSparse: Hierarchical Semi-Structured Sparse KV Attention","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-10T07:15:19.184970Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2604.16864"},"observation_digest":"sha256:c5fd3647bd59a0f7da8b5b45ce7c39199a7c75330b009345008d3434f8a43656","observation_id":"6546f922-6a28-4b09-876d-730dce5e5f79","resolution":{"observed_at":"2026-05-12T09:58:29.304691Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2604.16983","last_updated":"2026-04-18T12:55:28Z","snapshot_observed_at":"2026-07-06T23:04:10.324443Z","submitted_at":"2026-04-18T12:55:28Z","title":"Graph-Guided Adaptive Channel Elimination for KV Cache Compression","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-10T07:06:08.786535Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2604.16983"},"observation_digest":"sha256:fba887b080f9cc17510808d17424caf7ed4afbf0d3e28ed3770c5711a763499b","observation_id":"3aff886b-21e0-4aac-81c4-592803206504","resolution":{"observed_at":"2026-05-12T09:58:29.304691Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2604.17935","last_updated":"2026-04-20T08:15:17Z","snapshot_observed_at":"2026-07-06T23:04:55.190916Z","submitted_at":"2026-04-20T08:15:17Z","title":"How Much Cache Does Reasoning Need? Depth-Cache Tradeoffs in KV-Compressed Transformers","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-10T05:17:52.344313Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2604.17935"},"observation_digest":"sha256:074331d18c8007546d50e58dfc1c27fe7e0fcd4cb692a30a3199ee8574af12ac","observation_id":"f2a2bac6-c38c-47a3-a3e9-88900606a684","resolution":{"observed_at":"2026-05-12T09:58:29.304691Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2604.19351","last_updated":"2026-05-05T06:39:27Z","snapshot_observed_at":"2026-07-06T23:06:02.635464Z","submitted_at":"2026-04-21T11:33:24Z","title":"DASH-KV: Accelerating Long-Context LLM Inference via Asymmetric KV Cache Hashing","version":4},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-10T02:23:37.859259Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2604.19351"},"observation_digest":"sha256:88298768b5d5051daf506fd93625334e70747b20d44a03bca59d5b0c98f24e08","observation_id":"236f647c-d90b-49da-9bca-9136d4e9e153","resolution":{"observed_at":"2026-05-12T09:58:29.304691Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2604.22782","last_updated":"2026-04-03T14:56:17Z","snapshot_observed_at":"2026-08-02T15:24:09.520492Z","submitted_at":"2026-04-03T14:56:17Z","title":"Stochastic KV Routing: Enabling Adaptive Depth-Wise Cache Sharing","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-13T19:56:48.015363Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2604.22782"},"observation_digest":"sha256:c60fa490205e03e3d25d960355a2fcee3665e05aa66626696d6fcf59d0af196f","observation_id":"5810c075-62f7-4771-8a1b-62be82877a59","resolution":{"observed_at":"2026-05-13T19:58:12.038555Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2604.24820","last_updated":"2026-04-27T14:06:21Z","snapshot_observed_at":"2026-07-31T06:39:38.066325Z","submitted_at":"2026-04-27T14:06:21Z","title":"Salca: A Sparsity-Aware Hardware Accelerator for Efficient Long-Context Attention Decoding","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-07T17:56:39.124969Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2604.24820"},"observation_digest":"sha256:cd17a04073cc1631dc518f61c81075c5e85b7b8f152dd426a4a4c0fd71dd388d","observation_id":"b2efa000-9188-47a2-8efa-329975d8daef","resolution":{"observed_at":"2026-05-12T09:58:29.304691Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.02905","last_updated":"2026-04-06T02:05:52Z","snapshot_observed_at":"2026-07-06T23:15:55.848885Z","submitted_at":"2026-04-06T02:05:52Z","title":"eOptShrinkQ: Near-Lossless KV Cache Compression Through Optimal Spectral Denoising and Quantization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T20:18:04.392331Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.02905"},"observation_digest":"sha256:1ea46dacb824a828c28521cb4a048a6591931b12573bb517c14e0906b47b4be7","observation_id":"3072c7cd-214a-4941-9706-6cbc1a578cd7","resolution":{"observed_at":"2026-05-12T09:58:29.304691Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.04075","last_updated":"2026-04-14T08:17:53Z","snapshot_observed_at":"2026-08-03T03:08:39.084770Z","submitted_at":"2026-04-14T08:17:53Z","title":"RetentiveKV: State-Space Memory for Uncertainty-Aware Multimodal KV Cache Eviction","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-10T15:29:17.567557Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.04075"},"observation_digest":"sha256:72bfd59b6798388351fd391ffa3bf915401e9a47125beb6de3ed7b754ef66235","observation_id":"ce697c96-9e77-48fd-a908-446f3ccfc699","resolution":{"observed_at":"2026-05-12T09:58:29.304691Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","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":4,"source":"pdf_text","source_observed_at":"2026-05-10T08:49:24.880528Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.05219"},"observation_digest":"sha256:e2abcf5b6d46eca211c9e912e94a5fe2126d17621bbe6169de629237a991f840","observation_id":"576ebfb6-fad7-4eb5-ba6b-d799020bd625","resolution":{"observed_at":"2026-05-12T09:58:29.304691Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.06105","last_updated":"2026-05-07T12:21:03Z","snapshot_observed_at":"2026-07-06T23:18:36.537416Z","submitted_at":"2026-05-07T12:21:03Z","title":"Shallow Prefill, Deep Decoding: Efficient Long-Context Inference via Layer-Asymmetric KV Visibility","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-08T10:33:52.457620Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.06105"},"observation_digest":"sha256:61b88d300ab7cce3feba382b9f41ade33983ed6b107a2e83b6a9c5410de967e0","observation_id":"27343873-201c-4b3f-8e0f-f0cc5a0d9d4b","resolution":{"observed_at":"2026-05-12T09:58:29.304691Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.06763","last_updated":"2026-05-11T02:30:41Z","snapshot_observed_at":"2026-07-06T23:19:10.574595Z","submitted_at":"2026-05-07T17:37:56Z","title":"Sparse Attention as a Range Searching Problem: Towards an Inference-Efficient Index for KV Cache","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-11T01:15:35.871863Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.06763"},"observation_digest":"sha256:4638c0712843ebe04ce67818c7da624be3b142ed2d38a8c6d8730271701f3db9","observation_id":"f5d66a73-d766-44f2-a6f2-48d219f62db4","resolution":{"observed_at":"2026-05-12T09:58:29.304691Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.07234","last_updated":"2026-05-08T04:37:22Z","snapshot_observed_at":"2026-08-06T04:40:19.152385Z","submitted_at":"2026-05-08T04:37:22Z","title":"Reformulating KV Cache Eviction Problem for Long-Context LLM Inference","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-11T02:37:52.545943Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.07234"},"observation_digest":"sha256:54782bb89ffc46c9110601fd9472ce26665b36f91317d2da911ad6a37a5b4b0f","observation_id":"d0835c05-69e5-45b1-953f-d446d681bca4","resolution":{"observed_at":"2026-05-12T09:58:29.304691Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.07719","last_updated":"2026-05-08T13:24:39Z","snapshot_observed_at":"2026-07-31T02:35:55.019423Z","submitted_at":"2026-05-08T13:24:39Z","title":"An Efficient Hybrid Sparse Attention with CPU-GPU Parallelism for Long-Context Inference","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-11T02:56:28.828593Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.07719"},"observation_digest":"sha256:6cb3bdb83a9f9bc6c3b4a3ca5312da6696ff9623d393e11a819d8183ad8898e4","observation_id":"1b712941-cb9c-4850-b8f7-dde3b848fcaf","resolution":{"observed_at":"2026-05-12T09:58:29.304691Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.08317","last_updated":"2026-05-08T15:15:06Z","snapshot_observed_at":"2026-07-06T23:20:33.816373Z","submitted_at":"2026-05-08T15:15:06Z","title":"RDKV: Rate-Distortion Bit Allocation for Joint Eviction and Quantization of the KV Cache","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-12T01:16:15.869198Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.08317"},"observation_digest":"sha256:cc7c7bbfbcfcac04a5b9b1de004b74c6ea3c9300e152c6cbbfbb852c022b943f","observation_id":"d95ea6f0-1c72-44be-83ea-baf9206524f9","resolution":{"observed_at":"2026-05-12T09:58:29.304691Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.08580","last_updated":"2026-05-09T00:47:43Z","snapshot_observed_at":"2026-07-06T23:20:47.880233Z","submitted_at":"2026-05-09T00:47:43Z","title":"Slipstream: Trajectory-Grounded Compaction Validation for Long-Horizon Agents","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-05-12T01:04:55.618417Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.08580"},"observation_digest":"sha256:08205ba64efadbb42d4af92a66e14fc4673cf97bd9c2a0e11d60c701d782c924","observation_id":"e1148e5f-a39e-4e7f-8ed5-81b133bcb0b9","resolution":{"observed_at":"2026-05-12T09:58:29.304691Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.08840","last_updated":"2026-05-09T09:49:32Z","snapshot_observed_at":"2026-07-06T23:21:02.177557Z","submitted_at":"2026-05-09T09:49:32Z","title":"ReST-KV: Robust KV Cache Eviction with Layer-wise Output Reconstruction and Spatial-Temporal Smoothing","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-12T02:52:33.076123Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.08840"},"observation_digest":"sha256:82774b2ba40a6db8b46fdfaee89dadd9b518748b74f57b9ca2f612dc71911a4c","observation_id":"5d92d5f7-92dc-41eb-bef8-75266efcd3b8","resolution":{"observed_at":"2026-05-12T09:58:29.304691Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.09490","last_updated":"2026-05-10T11:54:40Z","snapshot_observed_at":"2026-07-06T23:21:35.327066Z","submitted_at":"2026-05-10T11:54:40Z","title":"Not All Thoughts Need HBM: Semantics-Aware Memory Hierarchy for LLM Reasoning","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-12T05:30:46.989747Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.09490"},"observation_digest":"sha256:95259d5490ce4bb953617964fd4686dfc6c59b1e6ace3644f2e578d867880e68","observation_id":"d18feb2c-dc19-4e2c-906a-40e76796fe89","resolution":{"observed_at":"2026-05-12T09:58:29.304691Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.09649","last_updated":"2026-05-10T16:47:50Z","snapshot_observed_at":"2026-07-06T23:21:44.900680Z","submitted_at":"2026-05-10T16:47:50Z","title":"Make Each Token Count: Towards Improving Long-Context Performance with KV Cache Eviction","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-12T05:02:25.513351Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.09649"},"observation_digest":"sha256:2182f53d1e6ba5363ab43d0cbdfa0bd463bb951fadb945a0e336c88428e1b1bf","observation_id":"416e77be-388e-4f64-a49b-e09f86040c65","resolution":{"observed_at":"2026-05-12T09:58:29.304691Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.09735","last_updated":"2026-06-30T03:39:11Z","snapshot_observed_at":"2026-07-06T23:21:49.499951Z","submitted_at":"2026-05-10T20:10:26Z","title":"KV-RM: Regularizing KV-Cache Movement for Static-Graph LLM Serving","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-12T03:57:30.104609Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.09735"},"observation_digest":"sha256:5571a2b27725f5b10337293ea79109fde5c4f0b776abb6be539f7b16f29ab7e8","observation_id":"26fb4424-f977-4ec1-8ecb-7966ac01a53e","resolution":{"observed_at":"2026-05-12T09:58:29.304691Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.09735","last_updated":"2026-06-30T03:39:11Z","snapshot_observed_at":"2026-07-06T23:21:49.499951Z","submitted_at":"2026-05-10T20:10:26Z","title":"KV-RM: Regularizing KV-Cache Movement for Static-Graph LLM Serving","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-01T08:05:44.256565Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.09735"},"observation_digest":"sha256:32fa27fdc7c820fa69139776e04f0c932190caf9a7a2140ee5dcb2bc62f53fa4","observation_id":"14f2a3b6-2fc2-427b-9c3c-4a4b61e85987","resolution":{"observed_at":"2026-07-01T08:15:32.477467Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.11478","last_updated":"2026-05-12T03:45:53Z","snapshot_observed_at":"2026-08-04T07:02:09.241482Z","submitted_at":"2026-05-12T03:45:53Z","title":"FibQuant: Universal Vector Quantization for Random-Access KV-Cache Compression","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-13T01:42:45.446358Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.11478"},"observation_digest":"sha256:f615356fdff6b19900bc2244b419d28868c4e585c65f08251be78e00fb066f82","observation_id":"8cd7a87a-3ace-459c-806b-9f82c0345f65","resolution":{"observed_at":"2026-05-13T01:47:04.493056Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.12471","last_updated":"2026-05-12T17:53:47Z","snapshot_observed_at":"2026-08-06T08:38:13.813222Z","submitted_at":"2026-05-12T17:53:47Z","title":"KV-Fold: One-Step KV-Cache Recurrence for Long-Context Inference","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-13T05:28:14.842129Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.12471"},"observation_digest":"sha256:674fd59e7c6f88dc80c53c4016b3b41f2262c04baa67aa9192c8be9a343748af","observation_id":"4aad0bad-7043-49f3-be24-12b6859822b8","resolution":{"observed_at":"2026-05-13T05:32:19.502490Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.13111","last_updated":"2026-05-13T07:23:02Z","snapshot_observed_at":"2026-08-04T00:43:58.708088Z","submitted_at":"2026-05-13T07:23:02Z","title":"Pyramid Forcing: Head-Aware Pyramid KV Cache Policy for High-Quality Long Video Generation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-14T19:49:04.707675Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.13111"},"observation_digest":"sha256:19ea7a34d95276a57e232ffb8d3053afdecaaa1831d7a18244ef24e6222027cf","observation_id":"a86cc061-34ba-4579-91ee-cd756dafd982","resolution":{"observed_at":"2026-05-14T19:49:25.591746Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.14037","last_updated":"2026-05-13T18:58:16Z","snapshot_observed_at":"2026-08-04T00:53:16.855757Z","submitted_at":"2026-05-13T18:58:16Z","title":"Self-Pruned Key-Value Attention: Learning When to Write by Predicting Future Utility","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-05-15T05:35:09.705532Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.14037"},"observation_digest":"sha256:04e52995a1c83b7cb52ed8d49f047e6b3a12dbcf3e65ad2eb078eec5816ba81c","observation_id":"0fdb6fa9-bae4-4d2e-9fe9-3dd310249f95","resolution":{"observed_at":"2026-05-15T05:39:47.934459Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.14292","last_updated":"2026-05-17T02:21:29Z","snapshot_observed_at":"2026-07-06T23:25:44.508166Z","submitted_at":"2026-05-14T02:50:20Z","title":"Minimal-Intervention KV Retention via Set-Conditioned Diversity","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-20T20:58:07.403912Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.14292"},"observation_digest":"sha256:d9d0695ed339541b0387e541d21cb2d50e71c68f2a695edb59166f2e8e8348ca","observation_id":"ed16ad11-c355-4668-945e-12d5ed9802e7","resolution":{"observed_at":"2026-05-20T20:59:01.564827Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.15852","last_updated":"2026-05-28T02:32:12Z","snapshot_observed_at":"2026-07-06T23:27:05.961780Z","submitted_at":"2026-05-15T11:07:33Z","title":"GHOST: Geometry-Hierarchical Online Streaming Token Eviction for Efficient 3D Reconstruction","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-20T19:53:19.060333Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.15852"},"observation_digest":"sha256:11c636fec9c9716eca14118115260fb248a3cda542adf556d9d4ec17cd710c9a","observation_id":"77171088-c208-4680-9028-16625599915c","resolution":{"observed_at":"2026-05-20T19:53:42.064916Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.15852","last_updated":"2026-05-28T02:32:12Z","snapshot_observed_at":"2026-07-06T23:27:05.961780Z","submitted_at":"2026-05-15T11:07:33Z","title":"GHOST: Geometry-Hierarchical Online Streaming Token Eviction for Efficient 3D Reconstruction","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-30T19:19:55.184680Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.15852"},"observation_digest":"sha256:0df8a6ef8dd04e4f19e23a98abeeef0ae1c893c08404aa65ba554a6a27c8e270","observation_id":"739b33d3-79cc-4ccc-bd3e-027f66b58d5a","resolution":{"observed_at":"2026-06-30T19:25:01.134173Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.16360","last_updated":"2026-05-09T13:18:01Z","snapshot_observed_at":"2026-08-02T10:05:32.372239Z","submitted_at":"2026-05-09T13:18:01Z","title":"ProxyKV: Cross-Model Proxy Pruning for Efficient Long-Context LLM Inference","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-20T22:45:05.973231Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.16360"},"observation_digest":"sha256:8c15e7a395e2b44bdd4064b7148b70a731e0c0c31bbbf1a68684c97cadc473f5","observation_id":"8bc20ac5-dc0c-4ae2-9ad1-57ae2f767a0f","resolution":{"observed_at":"2026-05-20T22:49:10.890422Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.17410","last_updated":"2026-05-17T12:11:34Z","snapshot_observed_at":"2026-07-06T23:28:26.397778Z","submitted_at":"2026-05-17T12:11:34Z","title":"Computational Challenges in Token Economics: Bridging Economic Theory and AI System Design","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-20T13:00:56.755353Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.17410"},"observation_digest":"sha256:9f7ef9bd8c62de31aa9a0061f6dc63a9bf89cf9df99f491b705192de235e47d4","observation_id":"f096c003-eca4-4da5-9ffd-3636e8a7ba5c","resolution":{"observed_at":"2026-05-20T13:03:17.942900Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.17447","last_updated":"2026-05-17T13:39:47Z","snapshot_observed_at":"2026-08-02T22:21:28.317441Z","submitted_at":"2026-05-17T13:39:47Z","title":"FastOCR: Dynamic Visual Fixation via KV Cache Pruning for Efficient Document Parsing","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-20T14:53:57.376715Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.17447"},"observation_digest":"sha256:3cdeef51d9880d25bf1fe99d6903c7a44257673b3084f95607036f246633f0d6","observation_id":"385e8fbe-0fba-4de6-a968-0001b21c507a","resolution":{"observed_at":"2026-05-20T14:58:24.848419Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.17613","last_updated":"2026-05-17T19:18:39Z","snapshot_observed_at":"2026-07-06T23:28:36.134614Z","submitted_at":"2026-05-17T19:18:39Z","title":"VeriCache: Turning Lossy KV Cache into Lossless LLM Inference","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-19T22:09:15.782104Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.17613"},"observation_digest":"sha256:42fbd89ba63d91a2f98ad8dd9b84d15113dac1f23be3bd0127a2597475c67c90","observation_id":"dd57e39b-c936-463d-81b7-a081a09c70a9","resolution":{"observed_at":"2026-05-19T22:12:51.107861Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.17757","last_updated":"2026-05-18T02:24:29Z","snapshot_observed_at":"2026-07-06T23:28:45.646975Z","submitted_at":"2026-05-18T02:24:29Z","title":"OSCAR: Offline Spectral Covariance-Aware Rotation for 2-bit KV Cache Quantization","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-20T12:16:07.797702Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.17757"},"observation_digest":"sha256:75c04cbdbfaf9195a4bc5a22835ecebd778c942e12cc17258a60320b70b1c4ec","observation_id":"9b244e32-3936-4fa8-a4ff-3e75cb43ac59","resolution":{"observed_at":"2026-05-20T12:18:16.482638Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.18165","last_updated":"2026-05-18T10:09:10Z","snapshot_observed_at":"2026-07-06T23:29:04.241654Z","submitted_at":"2026-05-18T10:09:10Z","title":"Elastic-dLLM: Position Preserving Context Compression and Augmentation of Diffusion LLMs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-20T13:13:05.695349Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.18165"},"observation_digest":"sha256:267016548141fc680cd9197e9f182c0f1a5527cff92cfefda040357fa5ca1521","observation_id":"a04faa5c-55ba-42be-9dba-51a6e99f55fa","resolution":{"observed_at":"2026-05-20T13:13:17.925481Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.18753","last_updated":"2026-05-18T17:59:52Z","snapshot_observed_at":"2026-08-02T11:52:59.734226Z","submitted_at":"2026-05-18T17:59:52Z","title":"DashAttention: Differentiable and Adaptive Sparse Hierarchical Attention","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-20T10:50:12.926232Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.18753"},"observation_digest":"sha256:36ef51a336b16e4a81692f0808564bb0144b7ff459ecf69f8666bb27bc511ace","observation_id":"5991786b-911d-483f-b8fe-2a03898e7ed1","resolution":{"observed_at":"2026-05-20T10:53:13.596117Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.18856","last_updated":"2026-06-07T06:58:25Z","snapshot_observed_at":"2026-08-02T07:58:37.314471Z","submitted_at":"2026-05-13T18:48:48Z","title":"SPHERICAL KV: Angle-Domain Attention and Rate-Distortion Retention for Efficient Long-Context Inference","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-20T20:30:33.208386Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.18856"},"observation_digest":"sha256:972cb74f33054e55ad5e8a57e3b81e430981869cb997867716876a64845af93c","observation_id":"e4381dec-dfae-45a8-befe-f2f3800a298a","resolution":{"observed_at":"2026-05-20T20:33:43.342863Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.19260","last_updated":"2026-05-19T02:13:29Z","snapshot_observed_at":"2026-07-06T23:30:02.207108Z","submitted_at":"2026-05-19T02:13:29Z","title":"AQuaUI: Visual Token Reduction for GUI Agents with Adaptive Quadtrees","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-20T06:20:33.874919Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.19260"},"observation_digest":"sha256:125090a57e13c08f19e305ff44fcbf16af225fbfe8bf4123d5af32c003300bc7","observation_id":"2a8b4c53-2f14-4f62-9325-ea236ade942c","resolution":{"observed_at":"2026-05-20T06:23:05.528663Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.19660","last_updated":"2026-05-19T10:53:03Z","snapshot_observed_at":"2026-08-02T21:06:34.067413Z","submitted_at":"2026-05-19T10:53:03Z","title":"OScaR: The Occam's Razor for Extreme KV Cache Quantization in LLMs and Beyond","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-20T07:57:51.032025Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.19660"},"observation_digest":"sha256:8eef81dcadfd92fa2c1b5c3ecfa74fdbbbb1cc983b01c4c8cefdf35c1c0c9fe4","observation_id":"cb595ec9-f028-46c7-b7b4-e4442ae1acb7","resolution":{"observed_at":"2026-05-20T07:58:07.640084Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.20600","last_updated":"2026-05-20T01:30:33Z","snapshot_observed_at":"2026-07-06T23:31:08.671011Z","submitted_at":"2026-05-20T01:30:33Z","title":"Head-Aware Key-Value Compression for Efficient Autoregressive Image Generation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-21T06:05:23.148656Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.20600"},"observation_digest":"sha256:41d27e54111455cd5899a5cef0cf16f28e57eed242ec7dfd4aa218596c285f6c","observation_id":"91cdb1d5-ecfa-4445-999c-bda66ba3e08f","resolution":{"observed_at":"2026-05-21T06:09:41.645572Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.20683","last_updated":"2026-05-21T04:53:43Z","snapshot_observed_at":"2026-08-03T20:30:59.841300Z","submitted_at":"2026-05-20T03:52:31Z","title":"Layer-wise Token Compression for Efficient Document Reranking","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-21T03:02:34.320850Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.20683"},"observation_digest":"sha256:37b4e67d4e446e40b9db8130fac877c52c7d4522227d28a50272e85675ddeafe","observation_id":"249f2ae3-c372-4a09-8228-a4ac3cb3492f","resolution":{"observed_at":"2026-05-21T03:03:55.870896Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.20683","last_updated":"2026-05-21T04:53:43Z","snapshot_observed_at":"2026-08-03T20:30:59.841300Z","submitted_at":"2026-05-20T03:52:31Z","title":"Layer-wise Token Compression for Efficient Document Reranking","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-22T09:18:39.895672Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.20683"},"observation_digest":"sha256:a3367d03f20e6c303ef1955636244be82ed91be82325700b93df463ec6e0e86a","observation_id":"fa282a29-e98b-4715-ab21-3e41c848d7da","resolution":{"observed_at":"2026-05-22T09:21:21.703780Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.22337","last_updated":"2026-05-23T16:54:41Z","snapshot_observed_at":"2026-07-06T23:32:39.761431Z","submitted_at":"2026-05-21T11:24:46Z","title":"Meta-Soft: Leveraging Composable Meta-Tokens for Context-Preserving KV Cache Compression","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-22T05:10:53.133346Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.22337"},"observation_digest":"sha256:3da9f89727322ed553ef3b144508a453e9099003f79ab1f81394f9924d392277","observation_id":"f50264e5-bb5b-4a79-935f-949786167a21","resolution":{"observed_at":"2026-05-22T05:11:06.201039Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.22337","last_updated":"2026-05-23T16:54:41Z","snapshot_observed_at":"2026-07-06T23:32:39.761431Z","submitted_at":"2026-05-21T11:24:46Z","title":"Meta-Soft: Leveraging Composable Meta-Tokens for Context-Preserving KV Cache Compression","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-30T17:28:08.750049Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.22337"},"observation_digest":"sha256:0a38bbbbfebeee4dd4128a4ecc3a70459b30b71073e7da96133fa92bc0230bf2","observation_id":"b57415e4-3f09-4c7d-b52a-dd41da64c4f0","resolution":{"observed_at":"2026-06-30T17:34:57.881326Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.23200","last_updated":"2026-05-22T03:32:52Z","snapshot_observed_at":"2026-08-02T09:14:38.688799Z","submitted_at":"2026-05-22T03:32:52Z","title":"Adaptive Mass-Segmented KV Compression for Long-Context Reasoning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-25T05:22:47.198185Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.23200"},"observation_digest":"sha256:52d93ddb20786bfe07323238811443290f652039e7562b4b0b9c204f7729a36f","observation_id":"39be823e-c8cd-4e40-9f5d-f9be27e03428","resolution":{"observed_at":"2026-05-25T05:25:22.830790Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.23258","last_updated":"2026-05-22T06:00:15Z","snapshot_observed_at":"2026-08-03T03:36:58.256274Z","submitted_at":"2026-05-22T06:00:15Z","title":"A Simple Plug-in for Improving Eviction-Based KV Cache Compression","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-25T04:51:04.068354Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.23258"},"observation_digest":"sha256:b8840fa07d19a5103a3d7b527a63fd260df95e8e59a5b1b6b35adebef7362d21","observation_id":"561e053f-1bfa-4c2e-a060-205e0484a38c","resolution":{"observed_at":"2026-05-25T04:55:24.177510Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.24786","last_updated":"2026-05-24T00:15:34Z","snapshot_observed_at":"2026-08-01T15:32:42.392462Z","submitted_at":"2026-05-24T00:15:34Z","title":"CONF-KV: Confidence-Aware KV Cache Eviction with Mixed-Precision Storage for Long-Horizon LLM","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-30T11:52:50.864071Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.24786"},"observation_digest":"sha256:7ad194013004e0fb6ca22e4ebda4c47f136c5bfce977ffb4a1a989a2c61883aa","observation_id":"6cb3f8bb-9b81-41a5-a48b-b3de21a55b6d","resolution":{"observed_at":"2026-06-30T11:54:38.177115Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.25085","last_updated":"2026-06-07T06:58:29Z","snapshot_observed_at":"2026-07-06T23:35:06.733347Z","submitted_at":"2026-05-24T13:54:13Z","title":"Polynomial Context-Truncation Sensitivity in Autoregressive Language Models: Sequential Wyner-Ziv Bounds for KV Cache Compression","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-06-29T23:46:44.498959Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.25085"},"observation_digest":"sha256:40a13c3133d5a0da671a78891155dc3427452aee86b0d6006115428af0170e1b","observation_id":"779c2791-8a71-4f9a-b0ec-d294aed53b9f","resolution":{"observed_at":"2026-06-30T00:04:07.002951Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.29535","last_updated":"2026-05-28T07:49:45Z","snapshot_observed_at":"2026-07-06T23:38:56.014434Z","submitted_at":"2026-05-28T07:49:45Z","title":"AsymVLM: Asymmetric Token Pruning for Efficient Vision-Language Model Inference","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T08:48:58.583657Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.29535"},"observation_digest":"sha256:a07d6f2c9b09fe0353b8cfa789584d735742e5699a57a9ee09bbcc5a53a9e598","observation_id":"9ca33049-920e-4a17-8484-c7bf32607a5d","resolution":{"observed_at":"2026-06-29T08:53:15.969539Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.31105","last_updated":"2026-05-29T10:16:30Z","snapshot_observed_at":"2026-08-02T14:00:03.048292Z","submitted_at":"2026-05-29T10:16:30Z","title":"GRKV: Global Regression for Training-Free KV Cache Compression in Long-Context LLMs","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-06-28T22:54:55.101568Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.31105"},"observation_digest":"sha256:386ca5df3d9dd346e15d87cfd10838cd6e981b2bb1808f34f15dfb28f38c1b65","observation_id":"95b7db54-37c8-4c06-ba88-fe18f0da20d0","resolution":{"observed_at":"2026-07-01T19:16:00.781888Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2605.31598","last_updated":"2026-05-29T17:59:02Z","snapshot_observed_at":"2026-07-06T23:40:46.825645Z","submitted_at":"2026-05-29T17:59:02Z","title":"Linear Scaling Video VLMs for Long Video Understanding","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-28T23:00:11.246232Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2605.31598"},"observation_digest":"sha256:65d90faff286a11643b2d9ff24461e7186e0bf3c70162db4deb705e218da5b91","observation_id":"955a8755-56de-4d6d-9c23-c12b5dfdb6c3","resolution":{"observed_at":"2026-06-28T23:02:46.207233Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2606.01483","last_updated":"2026-05-31T22:54:57Z","snapshot_observed_at":"2026-08-04T15:12:58.596963Z","submitted_at":"2026-05-31T22:54:57Z","title":"MURMUR: An Efficient Inference System for Long-Form ASR","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-06-28T17:06:02.978205Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2606.01483"},"observation_digest":"sha256:3634f06fd750004b9931bf92011f10133d7c1632314d9f87dce6dcc07decf438","observation_id":"ac39024b-6899-4cf5-ace9-682f720164a0","resolution":{"observed_at":"2026-06-28T17:12:25.090451Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2606.01563","last_updated":"2026-06-01T02:08:40Z","snapshot_observed_at":"2026-08-06T03:26:36.028360Z","submitted_at":"2026-06-01T02:08:40Z","title":"MomentKV: Closing the Directional Gap in KV Cache Eviction for Long-Context Inference","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-28T16:07:22.196982Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2606.01563"},"observation_digest":"sha256:e3071e0d9f66c43cb12286c6704107480a4fb8af95782c335cf0660ff5ab9c88","observation_id":"3806adf3-9eeb-4303-a6a8-30d858131273","resolution":{"observed_at":"2026-07-01T21:56:15.432735Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2606.01790","last_updated":"2026-06-01T07:10:00Z","snapshot_observed_at":"2026-08-04T13:06:32.367007Z","submitted_at":"2026-06-01T07:10:00Z","title":"STaR-KV: Spatio-Temporal Adaptive Re-weighting for KV Cache Compression in GUI Vision-Language Models","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-06-28T15:32:24.815131Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2606.01790"},"observation_digest":"sha256:0a670e04889ff58fcd74f4ce4064bf82abe20deb72e98e05b3174f9f23b9eec8","observation_id":"75494f65-1906-45a1-9eb3-3e04a3ec4105","resolution":{"observed_at":"2026-07-01T22:16:16.632799Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2606.01927","last_updated":"2026-06-01T08:58:23Z","snapshot_observed_at":"2026-07-06T23:42:26.018647Z","submitted_at":"2026-06-01T08:58:23Z","title":"Scaling LLM Inference Beyond Amdahl`s Limits via Eliminating Non-Scalable Overheads","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-28T12:48:02.761437Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2606.01927"},"observation_digest":"sha256:3ad149492f8d7f6ad92bedf131c9d2d4d11aef8379244829d43812be826af804","observation_id":"5d6d97df-07de-4a0b-894f-f5498adc8412","resolution":{"observed_at":"2026-07-02T01:06:24.213195Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2606.03075","last_updated":"2026-06-02T03:06:17Z","snapshot_observed_at":"2026-08-03T19:26:00.654755Z","submitted_at":"2026-06-02T03:06:17Z","title":"TGV-KV: Text-Grounded KV Eviction for Vision-Language Models","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-06-28T11:04:54.171291Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2606.03075"},"observation_digest":"sha256:839b0f9f59fb4e6069f02423ac1a26970a54d2f186dcc54edd9d9312acc3d780","observation_id":"3410da57-d4a8-481d-83f1-904c680b19ef","resolution":{"observed_at":"2026-07-02T02:16:26.718585Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2606.03928","last_updated":"2026-06-02T17:16:33Z","snapshot_observed_at":"2026-08-06T06:58:50.530659Z","submitted_at":"2026-06-02T17:16:33Z","title":"Value-Aware Stochastic KV Cache Eviction for Reasoning Models","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-06-28T11:13:43.369888Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2606.03928"},"observation_digest":"sha256:f77d72c467a42e566a1c4fe22d4a39c5674509d7544c990f63ed8226a272e5f0","observation_id":"95c4c548-b895-44d4-9b0d-9520d6a1d998","resolution":{"observed_at":"2026-07-02T02:06:27.047584Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2606.05875","last_updated":"2026-06-04T08:47:46Z","snapshot_observed_at":"2026-07-06T23:45:47.161248Z","submitted_at":"2026-06-04T08:47:46Z","title":"QCFuse: Query-Aware Cache Fusion via Compressed View for Efficient RAG Serving","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-28T01:47:43.240850Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2606.05875"},"observation_digest":"sha256:4999ab752f900200fc792ebee70f33efdee9737ef5a3b0b37ee84858450ac1cf","observation_id":"25317026-020d-4960-8907-d7d6826142fa","resolution":{"observed_at":"2026-07-02T12:46:57.486135Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2606.07684","last_updated":"2026-06-05T02:46:04Z","snapshot_observed_at":"2026-08-06T15:37:49.045087Z","submitted_at":"2026-06-05T02:46:04Z","title":"Semantic Cache Distillation: Efficient State Transfer via Reuse and Selective Patching","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-06-27T22:43:25.637631Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2606.07684"},"observation_digest":"sha256:45b538d913fb8b4ab547e318f57e51abe2282aeea5fddd43bc0a781a294b367c","observation_id":"3deba656-f2df-4d11-bf85-e0447395c6e2","resolution":{"observed_at":"2026-07-02T16:27:09.083376Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2606.08635","last_updated":"2026-06-07T13:57:05Z","snapshot_observed_at":"2026-08-02T07:41:43.943071Z","submitted_at":"2026-06-07T13:57:05Z","title":"SpectrumKV: Per-Token Mixed-Precision KV Cache Transfer for Prefill-Decode Disaggregated LLM Serving","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-27T18:50:50.066713Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2606.08635"},"observation_digest":"sha256:68bd8bc9f35104d01ee2328b727166cbfe253b1e41ea69592c60f9756b3f3169","observation_id":"aa6355ae-43ab-418c-89db-e8dc9f1a6f14","resolution":{"observed_at":"2026-07-02T22:27:26.305482Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2606.09916","last_updated":"2026-06-06T15:54:48Z","snapshot_observed_at":"2026-08-01T16:04:11.631139Z","submitted_at":"2026-06-06T15:54:48Z","title":"IntentKV: Cross-Turn Intent-Aware KV Cache Pruning for Agent Inference","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-06-27T20:04:44.703782Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2606.09916"},"observation_digest":"sha256:acab3373aa513f1174438c943f765ec6dbfbd49e30145b0ca09d7c435a4b62c5","observation_id":"e4ec9704-176e-4c7a-b4ac-ec10432a4bf8","resolution":{"observed_at":"2026-07-02T20:57:22.978766Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2606.10671","last_updated":"2026-08-04T12:43:00Z","snapshot_observed_at":"2026-08-06T19:38:58.721587Z","submitted_at":"2026-06-09T10:22:18Z","title":"FadeMem: Distance-Aware Memory Consolidation for Autoregressive Video Diffusion","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-06-27T13:44:44.550033Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2606.10671"},"observation_digest":"sha256:10f88adc8da8fdd2225524c46c06238f7ad26a9c74abe8e7c1ae2737e784c979","observation_id":"4bbe0573-b390-41d5-932b-32bb4a7b07bc","resolution":{"observed_at":"2026-07-03T04:37:37.453144Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2406.02069","doi":"10.48550/arxiv.2406.02069","metadata_source":"pith","pith_arxiv_id":"2406.02069","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling","venue":"cs.CL","work_id":"6317700d-f903-4ce1-8f53-b43cb146d48b","year":2024},"citing_paper":{"arxiv_id":"2606.11164","last_updated":"2026-06-09T17:44:23Z","snapshot_observed_at":"2026-08-06T18:04:13.001964Z","submitted_at":"2026-06-09T17:44:23Z","title":"ReasonAlloc: Hierarchical Decoding-Time KV Cache Budget Allocation for Reasoning Models","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-06-27T13:09:37.979051Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2606.11164"},"observation_digest":"sha256:452ac5b4457cb1fd6cc02c4ee64d32dd64904ea32960b2c07e13310cf552168b","observation_id":"3700b887-558b-4063-87a4-e50c7ba484da","resolution":{"observed_at":"2026-07-03T05:37:40.350799Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:26.042348+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2406.02069/citation-record","integrity":"/paper/2406.02069/integrity","json":"/paper/2406.02069/citation-record.json","paper":"/paper/2406.02069"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":"2303.08774","doi":"10.1002/tea.20265","metadata_source":"pith","pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"GPT-4 Technical Report","venue":"cs.CL","work_id":"b928e041-6991-4c08-8c81-0359e4097c7b","year":2023},"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":1,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:fe531946629199739a76f6601413bdae3e96d154c3cf08cbe97bc2b1dc6d0841","observation_id":"d76ccab1-98d3-4d5a-a01b-e10038b9ff84","resolution":{"observed_at":"2026-05-12T09:58:29.134040Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.14508","last_updated":"2024-06-19T04:00:32Z","snapshot_observed_at":"2026-08-02T11:20:36.216220Z","submitted_at":"2023-08-28T11:53:40Z","title":"LongBench: A Bilingual, Multitask Benchmark for Long Context Understanding","version":2},"cited_work":{"arxiv_id":"2308.14508","doi":"10.48550/arxiv.2308.14508","metadata_source":"pith","pith_arxiv_id":"2308.14508","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"LongBench: A Bilingual, Multitask Benchmark for Long Context Understanding","venue":"cs.CL","work_id":"ba7831c4-9427-4e0e-a5c1-4e98511f4b53","year":2023},"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":2,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"cited_paper":"/paper/2308.14508","citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:b17d5830a959728be1e98ce33808553dab40d8975b3009547f794410424a2a04","observation_id":"c7d1b727-7603-48ff-94d0-a383b66ef2fc","resolution":{"observed_at":"2026-05-12T20:22:11.032040Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.06764","last_updated":"2024-09-02T05:48:54Z","snapshot_observed_at":"2026-07-06T17:42:37.195473Z","submitted_at":"2024-03-11T14:35:32Z","title":"An Image is Worth 1/2 Tokens After Layer 2: Plug-and-Play Inference Acceleration for Large Vision-Language Models","version":3},"cited_work":{"arxiv_id":"2403.06764","doi":"10.48550/arxiv.2403.06764","metadata_source":"pith","pith_arxiv_id":"2403.06764","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An image is worth 1/2 tokens after layer 2: Plug-and-play inference acceleration for large vision-language models","venue":"cs.CV","work_id":"b09c06ba-a6cd-48cf-83f7-30a010a04ef4","year":2024},"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":3,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"cited_paper":"/paper/2403.06764","citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:35495ff4bf8411efd188aa97bdd063954456ae1bf52e6a32717e98183230af09","observation_id":"36fb42a2-82c2-44de-8e31-e2539c974c31","resolution":{"observed_at":"2026-05-12T09:58:29.106770Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16179","last_updated":"2024-12-18T17:36:36Z","snapshot_observed_at":"2026-07-06T19:37:11.636987Z","submitted_at":"2024-10-21T16:44:51Z","title":"MagicPIG: LSH Sampling for Efficient LLM Generation","version":4},"cited_work":{"arxiv_id":"2410.16179","doi":"10.48550/arxiv.2410.16179","metadata_source":"arxiv_reference","pith_arxiv_id":"2410.16179","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"arXiv preprint arXiv:2410.16179 , year=","venue":"arXiv (Cornell University)","work_id":"24103510-199d-40aa-ae36-22602d72d97f","year":2021},"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":4,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"cited_paper":"/paper/2410.16179","citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:f04c0fbd9e098ded2be10c9fb99e9ade669dcdb022c81f882d6d1476a6fa7322","observation_id":"4d823fe4-7ab2-4c79-b664-8b09f7daa877","resolution":{"observed_at":"2026-05-12T09:58:29.115168Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Pradeep Dasigi, Kyle Lo, Iz Beltagy, Arman Cohan, Noah A Smith, and Matt Gardner","venue":null,"work_id":"59596c59-5d66-429d-8b08-a49c88399bac","year":2023},"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":5,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:f6397029da968dd10177ae0be154917f03b666c615efc9a0142b5006b34b752d","observation_id":"9be4d397-a07c-4c49-ae6d-126368d84810","resolution":{"observed_at":"2026-05-12T09:58:29.242922Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.13753","last_updated":"2024-02-21T12:30:33Z","snapshot_observed_at":"2026-08-02T12:47:57.325302Z","submitted_at":"2024-02-21T12:30:33Z","title":"LongRoPE: Extending LLM Context Window Beyond 2 Million Tokens","version":1},"cited_work":{"arxiv_id":"2402.13753","doi":"10.48550/arxiv.2402.13753","metadata_source":"pith","pith_arxiv_id":"2402.13753","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"LongRoPE: Extending LLM Context Window Beyond 2 Million Tokens","venue":"cs.CL","work_id":"41fabff1-11da-43da-8efd-2eb55186b9f2","year":2024},"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":6,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"cited_paper":"/paper/2402.13753","citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:c2ae171754c513e6dd8d16ff1e9dd6885a3193ae3e243221250f4f27cd0f9563","observation_id":"12ac178d-1ee8-49ab-847e-d5558564a844","resolution":{"observed_at":"2026-05-15T08:31:04.851790Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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":"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:d3aeb73c94922a78ccb2936ba416d6ab8cb06154fe188f8e7a2e148fc2709a45","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-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/p19-1102","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Multi-News: A Large-Scale Multi-Document Summarization Dataset and Abstractive Hierarchical Model , url =","venue":null,"work_id":"f6604434-9abe-4445-ac73-321c421c2fa1","year":2019},"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":8,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:3dadfa89f292634ca7f368d7ca65dad62af3c01cb8e5262048e4462cd5e53fde","observation_id":"f1607adb-bc9e-43da-b492-4e9f81aac032","resolution":{"observed_at":"2026-05-12T09:58:29.092124Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-03T15:08:43.944816+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T15:08:43.944816+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01801","last_updated":"2024-10-29T18:26:09Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-03T05:17:08Z","title":"Model Tells You What to Discard: Adaptive KV Cache Compression for LLMs","version":4},"cited_work":{"arxiv_id":"2310.01801","doi":"10.48550/arxiv.2310.01801","metadata_source":"pith","pith_arxiv_id":"2310.01801","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Model Tells You What to Discard: Adaptive KV Cache Compression for LLMs","venue":"cs.CL","work_id":"91379982-466d-4895-96f5-079b66259a73","year":2023},"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":9,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"cited_paper":"/paper/2310.01801","citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:00e915e4fcbb02be2d7b03ed210f67109dce2477fecfaa5205f4fdfa5c56eb90","observation_id":"3333bdbb-2141-4ced-9349-a34185d0fc54","resolution":{"observed_at":"2026-05-17T11:11:21.895994Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Samsum corpus: A human-annotated dialogue dataset for abstractive summarization","venue":null,"work_id":"e5b88cab-94f3-4972-99a7-82c10c39bb48","year":2019},"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":10,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:3913949d03455f925eefefc43c44a738650b8280b237f421c1ed65d514e74549","observation_id":"f9307598-04bc-492a-8519-778f8954d24f","resolution":{"observed_at":"2026-05-12T09:58:29.250861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.14893","last_updated":"2023-06-26T17:59:24Z","snapshot_observed_at":"2026-07-06T15:46:55.111790Z","submitted_at":"2023-06-26T17:59:24Z","title":"LongCoder: A Long-Range Pre-trained Language Model for Code Completion","version":1},"cited_work":{"arxiv_id":"2306.14893","doi":"10.48550/arxiv.2306.14893","metadata_source":"arxiv_reference","pith_arxiv_id":"2306.14893","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Longcoder: A long-range pre-trained language model for code completion","venue":"arXiv (Cornell University)","work_id":"4f1cd69e-bdc1-4030-a4fc-ca9c553ef6b5","year":2023},"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":11,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"cited_paper":"/paper/2306.14893","citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:fca54ad09d4de88d3ab9878ac6d842552c210fe37c379e5d9981580aa02946ba","observation_id":"18d5fe14-fae6-44b0-b4a8-b0144a8675f2","resolution":{"observed_at":"2026-05-12T09:58:29.150738Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.16137","last_updated":"2024-06-24T21:22:00Z","snapshot_observed_at":"2026-07-31T23:13:29.378237Z","submitted_at":"2023-08-30T16:47:51Z","title":"LM-Infinite: Zero-Shot Extreme Length Generalization for Large Language Models","version":7},"cited_work":{"arxiv_id":"2308.16137","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2308.16137","snapshot_observed_at":"2026-07-04T16:59:58.965650Z","title":"Lm- infinite: Simple on-the-fly length generalization for large language models","venue":null,"work_id":"62f73354-8046-4134-b4e3-1bfab8df2d99","year":2023},"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":12,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"cited_paper":"/paper/2308.16137","citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:c9637f4a220856f2f26e576434ff90c2be861de1d4d23540e53c914e4e33d3b3","observation_id":"7a68cb7e-960f-4615-b7d5-e3fd24d35a13","resolution":{"observed_at":"2026-05-12T09:58:29.156505Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Efficient attentions for long document summarization","venue":null,"work_id":"c774dbdf-1bc5-4d6f-964b-31a1559bc5db","year":2021},"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":13,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:89c3e925a7a75940696bb3ecb93a05dfc4ebe163145073ee7991f522bc7c2f8c","observation_id":"11cc31d0-fb5a-4b8a-97cf-517dc0b0b918","resolution":{"observed_at":"2026-05-12T09:58:29.263988Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06825","last_updated":"2023-10-10T17:54:58Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-10T17:54:58Z","title":"Mistral 7B","version":1},"cited_work":{"arxiv_id":"2310.06825","doi":"10.48550/arxiv.2310.06825","metadata_source":"pith","pith_arxiv_id":"2310.06825","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Mistral 7B","venue":"cs.CL","work_id":"eb5e1305-ad11-4875-ad8d-ad8b8f697599","year":2023},"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":14,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"cited_paper":"/paper/2310.06825","citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:80cb3c35ce291ca98dea3117c7e37f2eec33ea29c432c8327b3b99801ece7764","observation_id":"e85ef8f1-0b06-408d-9742-ae0b7b25b12e","resolution":{"observed_at":"2026-05-12T09:58:29.161133Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-02T03:08:12.282824+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-02T03:08:12.282824+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.02490","last_updated":"2024-10-30T14:53:22Z","snapshot_observed_at":"2026-07-06T18:40:27.299063Z","submitted_at":"2024-07-02T17:59:56Z","title":"MInference 1.0: Accelerating Pre-filling for Long-Context LLMs via Dynamic Sparse Attention","version":2},"cited_work":{"arxiv_id":"2407.02490","doi":"10.48550/arxiv.2407.02490","metadata_source":"pith","pith_arxiv_id":"2407.02490","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Abdi, Dongsheng Li, Chin-Yew Lin, Yuqing Yang, and Lili Qiu","venue":"cs.CL","work_id":"ead3d842-61e6-4c52-8e2a-ea9a3986a1af","year":2024},"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":15,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"cited_paper":"/paper/2407.02490","citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:a86d6ca766e89193f316c167a69f90dcfe44a76b42e8996ccb2f1d2ca948e504","observation_id":"9b2ac96e-76a3-4183-bfa8-0a575b874f14","resolution":{"observed_at":"2026-05-12T09:58:29.171156Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.19707","last_updated":"2024-06-28T07:41:26Z","snapshot_observed_at":"2026-07-06T18:38:21.977142Z","submitted_at":"2024-06-28T07:41:26Z","title":"InfiniGen: Efficient Generative Inference of Large Language Models with Dynamic KV Cache Management","version":1},"cited_work":{"arxiv_id":"2406.19707","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.19707","snapshot_observed_at":"2026-07-10T01:36:44.031071Z","title":"Xin Li and Dan Roth","venue":"cs.LG","work_id":"57b180a0-b105-4bd0-a104-5e90e82b0121","year":2024},"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":16,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"cited_paper":"/paper/2406.19707","citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:b893db4e5db4d651d1083b6eff93a55a28a04e08d6cda559b73748034093be71","observation_id":"dccc4d18-53e0-470f-8c6e-8d12fae31190","resolution":{"observed_at":"2026-05-12T09:58:29.177917Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14469","last_updated":"2024-06-17T03:01:58Z","snapshot_observed_at":"2026-07-06T18:03:55.981890Z","submitted_at":"2024-04-22T17:42:58Z","title":"SnapKV: LLM Knows What You are Looking for Before Generation","version":2},"cited_work":{"arxiv_id":"2404.14469","doi":"10.48550/arxiv.2404.14469","metadata_source":"pith","pith_arxiv_id":"2404.14469","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"SnapKV: LLM Knows What You are Looking for Before Generation","venue":"cs.CL","work_id":"4afe6cb0-dba4-42b6-b553-e685e5730d61","year":2024},"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":17,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"cited_paper":"/paper/2404.14469","citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:698150b40dd83569f938a83c41fca50e56109a947a79b69a5800bdfd84a52e3c","observation_id":"8305a765-6a57-4243-bdc6-82fdf2f855f1","resolution":{"observed_at":"2026-05-13T12:57:43.256882Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T13:53:27.134462+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T13:53:27.134462+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2308.12950","last_updated":"2024-01-31T19:47:26Z","snapshot_observed_at":"2026-07-06T16:10:07.931347Z","submitted_at":"2023-08-24T17:39:13Z","title":"Code Llama: Open Foundation Models for Code","version":3},"cited_work":{"arxiv_id":"2308.12950","doi":"10.48550/arxiv.2308.12950","metadata_source":"pith","pith_arxiv_id":"2308.12950","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Code Llama: Open Foundation Models for Code","venue":"cs.CL","work_id":"e73bffa4-7620-47ac-9327-259a60db52ca","year":2023},"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":18,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"cited_paper":"/paper/2308.12950","citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:eacddf95f58dd018902bede2f01c623a97112bdc1f300ccbdb67bf1c2b24f225","observation_id":"6d84fce4-3ee4-4326-8fae-7ea9674aadbd","resolution":{"observed_at":"2026-05-12T09:58:29.190481Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-07-09T08:48:36.742994+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-09T08:48:36.742994+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17762","last_updated":"2024-08-14T16:00:49Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-02-27T18:55:17Z","title":"Massive Activations in Large Language Models","version":2},"cited_work":{"arxiv_id":"2402.17762","doi":"10.48550/arxiv.2402.17762","metadata_source":"pith","pith_arxiv_id":"2402.17762","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Massive Activations in Large Language Models","venue":"cs.CL","work_id":"a8da768a-7f38-4db5-912b-4d5b7581c8dd","year":2024},"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":19,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"cited_paper":"/paper/2402.17762","citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:7b750875393e23f42353a58d2b58ce31394a2b28fa863c4d7b8ccf7283ae732b","observation_id":"0f564b89-e117-4001-8b73-a4d58afb5382","resolution":{"observed_at":"2026-05-16T07:02:54.298502Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-05-25T12:53:24.227166+00:00","source":"crossref_status_cache"},{"observed_at":"2026-05-25T12:53:24.227166+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":"2302.13971","doi":"10.48550/arxiv.2302.13971","metadata_source":"pith","pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"LLaMA: Open and Efficient Foundation Language Models","venue":"cs.CL","work_id":"c018fc23-6f3f-4035-9d02-28a2173b2b9d","year":2023},"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":20,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:4f5133b8ae6b5911a675beda658d3dc38c7469eb892dce0f6fca7d89052f8142","observation_id":"edae8866-c63f-427a-a54e-7dbf1c8815ba","resolution":{"observed_at":"2026-05-12T09:58:29.200441Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-01T11:08:05.851253+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-01T11:08:05.851253+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.14160","last_updated":"2023-12-19T15:13:52Z","snapshot_observed_at":"2026-08-04T17:03:48.643939Z","submitted_at":"2023-05-23T15:26:20Z","title":"Label Words are Anchors: An Information Flow Perspective for Understanding In-Context Learning","version":4},"cited_work":{"arxiv_id":"2305.14160","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2305.14160","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Label words are anchors: An information flow perspective for understanding in-context learning","venue":null,"work_id":"7cb0216f-300a-428f-836d-bf5864ddd05d","year":2023},"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":21,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"cited_paper":"/paper/2305.14160","citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:4e9d5479d5c856f0ed8de53d056815723547a54349df9ab897a5e4adc5edf7b7","observation_id":"2eb9a3f7-c326-414a-b4f5-2fbe7a305013","resolution":{"observed_at":"2026-05-12T09:58:29.206330Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.15574","last_updated":"2024-04-24T00:24:03Z","snapshot_observed_at":"2026-08-06T03:07:12.026697Z","submitted_at":"2024-04-24T00:24:03Z","title":"Retrieval Head Mechanistically Explains Long-Context Factuality","version":1},"cited_work":{"arxiv_id":"2404.15574","doi":"10.48550/arxiv.2404.15574","metadata_source":"pith","pith_arxiv_id":"2404.15574","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Re- trieval head mechanistically explains long-context factu- ality.arXiv preprint arXiv:2404.15574","venue":"cs.CL","work_id":"43c186a9-18a4-4468-8e5e-e8e32f44538f","year":2024},"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":22,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"cited_paper":"/paper/2404.15574","citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:f68d8b2f585eae635103ac1239ca55463b97a0b322237f75471a76aef6aad27b","observation_id":"c25c24a4-8f2c-4353-ae1c-8b957dc7ce3b","resolution":{"observed_at":"2026-05-12T09:58:29.212025Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.17453","last_updated":"2024-04-07T00:56:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-09-29T17:59:56Z","title":"Efficient Streaming Language Models with Attention Sinks","version":4},"cited_work":{"arxiv_id":"2309.17453","doi":"10.48550/arxiv.2309.17453","metadata_source":"pith","pith_arxiv_id":"2309.17453","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Efficient Streaming Language Models with Attention Sinks","venue":"cs.CL","work_id":"a8d25452-c237-48c9-88a4-682717c3979a","year":2023},"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":23,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"cited_paper":"/paper/2309.17453","citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:0f02fdd8cd54aba86a1cd51574a6be1f4d56567e4956bc99bdf89bc96f519415","observation_id":"eda72efb-d4c0-4ba1-9ac9-390b89065224","resolution":{"observed_at":"2026-05-12T09:58:29.216384Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.12532","last_updated":"2024-06-05T09:01:24Z","snapshot_observed_at":"2026-07-06T18:17:08.160308Z","submitted_at":"2024-05-21T06:46:37Z","title":"PyramidInfer: Pyramid KV Cache Compression for High-throughput LLM Inference","version":2},"cited_work":{"arxiv_id":"2405.12532","doi":null,"metadata_source":"pith","pith_arxiv_id":"2405.12532","snapshot_observed_at":"2026-07-10T01:36:44.048156Z","title":"Pyramidinfer: Pyramid kv cache compres- sion for high-throughput llm inference","venue":"cs.CL","work_id":"385e7040-ccf4-4ff5-87de-f50bb44b6374","year":2024},"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":24,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"cited_paper":"/paper/2405.12532","citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:8bd60539d1cfc8ea4134a2c14d5694f2136b10a5f5dd322c1ee97bf0e56b854a","observation_id":"1d273cea-bb4c-45d8-9942-948c028785f0","resolution":{"observed_at":"2026-05-12T09:58:29.224557Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Hotpotqa: A dataset for diverse, explainable multi-hop question answering","venue":null,"work_id":"5957a103-4112-4031-8977-68fbf8f1e69d","year":2018},"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":25,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:44788bc08339c454e30d7d4f094ca6900764aa2b5150a059e221f49b5e3a5998","observation_id":"6cb252ed-4af6-4136-ad08-e9f4cf9582ae","resolution":{"observed_at":"2026-05-12T09:58:29.247054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Qmsum: A new benchmark for query- based multi-domain meeting summarization","venue":null,"work_id":"f06cc2d7-4d53-4142-98b6-fa54c6d751dc","year":2021},"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":26,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:8422a0bfb48e9b8c001ac2812b4076ff09403daee544faa8b34373729f8ae0f2","observation_id":"62bc80b6-48af-46f3-9261-f2c630e0aa02","resolution":{"observed_at":"2026-05-12T09:58:29.255249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.10400","last_updated":"2024-02-21T13:37:07Z","snapshot_observed_at":"2026-08-02T07:16:04.509348Z","submitted_at":"2023-09-19T08:03:38Z","title":"PoSE: Efficient Context Window Extension of LLMs via Positional Skip-wise Training","version":3},"cited_work":{"arxiv_id":"2309.10400","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2309.10400","snapshot_observed_at":"2026-07-04T03:29:31.191174Z","title":"Pose: Efficient context window extension of llms via positional skip-wise training.arXiv preprint arXiv:2309.10400","venue":null,"work_id":"dc99417e-5644-47d0-83bc-e683ec644cff","year":2023},"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":27,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"cited_paper":"/paper/2309.10400","citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:867afaf08d1a269a09ea22ceb72d7d5ed1aa3cab86b2df9882f85c53cba1e5fc","observation_id":"a005d97e-ecd6-4d1a-bc46-e3fad4e010b2","resolution":{"observed_at":"2026-05-12T09:58:29.229758Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"attention sink","venue":null,"work_id":"4a909b16-dcb4-4263-bbe3-167b07203db4","year":2023},"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":28,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:c193d89c1ce97fc98a0690088cf7341112ab2fd254ffc47e57d609048fe144f3","observation_id":"49dab320-4689-48e8-af64-e23d0d1ccee4","resolution":{"observed_at":"2026-05-12T09:58:29.267681Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Figure 5 and Figure 6 demonstrate that the Pyramidal Informa- tion Funneling phenomenon is also evident in both the Mistral model and Mixtral model","venue":null,"work_id":"957624aa-c6e6-4f34-b842-53c267f62390","year":2024},"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":29,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:7b0a52a2010f71841d63b96235635b1a62625edad19901f3f7b654a420dd1939","observation_id":"4a7d71b4-6bb2-4d37-b645-e1b6cc3ca446","resolution":{"observed_at":"2026-05-12T09:58:29.271567Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"While Lee et al","venue":null,"work_id":"6ab15de9-6edb-4dfb-8f2f-acee82d61d1f","year":2024},"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":30,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:e87f370d07256b1528d9b8433f32bcc8b44761faf04a864b26b8ac3489effea1","observation_id":"c6a60026-156a-4939-af5d-4a675a4fc125","resolution":{"observed_at":"2026-05-12T09:58:29.275213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"81e6debe-0150-4078-9679-d5a99ea0c5de","year":2023},"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":31,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:e281eb7657cddb20aa5c9af63805843fd7bc5a3ea867bd9d52b0ef81ad7d0d3b","observation_id":"5d6537ba-72e5-4d12-b9d2-2d2df2ed65b5","resolution":{"observed_at":"2026-05-12T09:58:29.279451Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"α Single-Document QA Multi-Document QA Summarization Few-shot Learning Synthetic Code Avg","venue":null,"work_id":"a6eeef4b-2ab8-42ce-ab3e-45569bca49ce","year":1924},"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":32,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:b0759f95d2c8ed7307a0be0c8715c3099f49dd45b9c3b9b20cec277e1c61e386","observation_id":"b3d64715-b33b-41c0-9969-3bb0f4d1ae6f","resolution":{"observed_at":"2026-05-12T09:58:29.283943Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"β Single-Document QA Multi-Document QA Summarization Few-shot Learning Synthetic Code Avg","venue":null,"work_id":"fb88a15a-9114-4b22-86c5-13ef4ec9363e","year":2024},"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":33,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:ef7037d1f251ff69b58cbab3790e5ca1da1d655db69a8d9da6e35616459c7353","observation_id":"52ca5888-b66d-4714-b8fc-ad319da371fe","resolution":{"observed_at":"2026-05-12T09:58:29.287621Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"186148ff-6e70-4cba-a274-f920b28c40e4","year":2024},"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":34,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:6f3f823feb117e68042ca810c408e8960e2ab6db5b9f377f9c5c037c6ce9e1c0","observation_id":"48e361fa-81e2-4aca-9c0d-eb8caf5745fc","resolution":{"observed_at":"2026-05-12T09:58:29.291379Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"[Prompt length, Generation length]","venue":null,"work_id":"f7d4aa67-b7d1-443e-b42d-b450688636fe","year":2048},"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":35,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:f0fc351a879ab13d4e0f59f77f4d6fac491a596b5f191b80863da23c045b3ac2","observation_id":"6ecf3ca3-36eb-4c2b-b0f1-645efed42179","resolution":{"observed_at":"2026-05-12T09:58:29.295445Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"[Prompt length, Generation length]","venue":null,"work_id":"0511bf44-8493-4820-83a2-de8f78c39747","year":2024},"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":36,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:68e7f8d22738f94b7efe60b453ce698aa438d83752c3a4819027e0a36e658f51","observation_id":"3b1f5b9e-f401-4feb-bd27-dc30b653bd74","resolution":{"observed_at":"2026-05-12T09:58:29.299113Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"That’s because the allocation strategy requires very limited additional complexity in the inference/generation phase compared with computation required for generation as Appendix L","venue":null,"work_id":"665d36f4-9161-41ef-8566-6cf13312b677","year":2024},"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":37,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:0ce5fd01aeddfbb66920765ed3c5ed92d1f7614a9121dfdb0378742a7179cc3c","observation_id":"4fbec693-5e8d-4499-b0b3-f2a99c0e74d8","resolution":{"observed_at":"2026-05-12T09:58:29.303404Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"6369.3353","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Attention Recall Rate Experiment","venue":null,"work_id":"861c9743-a3eb-4ef9-8d39-215d65c41601","year":2048},"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":38,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:0ed28a00cdb0f78448f9f602fe735bbeb86ee453bec51475b0bdb183a63dcd7f","observation_id":"91b3d879-2b91-483b-955d-7804f89b3efe","resolution":{"observed_at":"2026-05-12T09:58:29.234563Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"However, with a larger budget (i.e., 2k KV Cache Size), the improvement decreases","venue":null,"work_id":"d60e82be-0300-4eab-b08b-7668672aa299","year":2048},"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":39,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:7e9eb534cc08b6ec9d27ff89d77b2b7ddeabf67e4a2382e69db353b7c4b86069","observation_id":"42b46a13-dc4e-403d-a034-c93c97340b19","resolution":{"observed_at":"2026-05-12T09:58:29.259721Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"massive attention","venue":null,"work_id":"a9f05219-8dd2-4fb6-b0c9-9eac03562088","year":2000},"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":40,"source":"pdf_text","source_observed_at":"2026-05-12T09:58:29.057357Z"},"links":{"citing_paper":"/paper/2406.02069"},"observation_digest":"sha256:2bb99b7a6b24c152dbacaff3cad13b2d9bfee20942fae7d3594945157728db38","observation_id":"e240f58e-d419-471e-9083-4693443d7f50","resolution":{"observed_at":"2026-05-12T09:58:29.238044Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2406.02069","last_updated":"2025-05-15T17:18:12Z","latest_version":4,"primary_category":"cs.CL","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"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":1,"metadata_mismatch":4,"parse_uncertain":0,"unresolved":2,"verified_exact":18,"verified_fuzzy":15},"total_outbound_references":40},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 100 inbound Pith citation observations for arXiv:2406.02069."}