{"as_of":"2026-08-23T09:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8243bc58c1ab8cc0e05112bc86d305bee8c1334f1c79f5a5204c4dcf395df76e","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":11,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":11,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":11,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":11,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T18:49:24.139988Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-30T11:34:37.883253Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2407.01527","last_updated":"2024-10-08T19:34:03Z","snapshot_observed_at":"2026-08-21T19:23:48.498204Z","submitted_at":"2024-07-01T17:59:47Z","title":"KV Cache Compression, But What Must We Give in Return? A Comprehensive Benchmark of Long Context Capable Approaches","version":2},"cited_work":{"arxiv_id":"2407.01527","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.01527","snapshot_observed_at":"2026-06-30T11:34:37.883253Z","title":"Kv cache compression, but what must we give in return? a compre- hensive benchmark of long context capable approaches","venue":null,"work_id":"bd590ff7-ac83-451f-b803-204796d882d5","year":2024},"citing_paper":{"arxiv_id":"2402.02750","last_updated":"2024-07-25T09:16:05Z","snapshot_observed_at":"2026-08-12T17:03:50.984887Z","submitted_at":"2024-02-05T06:06:47Z","title":"KIVI: A Tuning-Free Asymmetric 2bit Quantization for KV Cache","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-12T08:53:12.253243Z"},"links":{"cited_paper":"/paper/2407.01527","citing_paper":"/paper/2402.02750"},"observation_digest":"sha256:8e95ce352e5069e7aa2a4a730706e04f52d093192f009d25586cd5c002f28f2a","observation_id":"6eaad53a-1dea-4a58-b2c0-1d0cc028d836","resolution":{"observed_at":"2026-05-12T08:53:12.291106Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01527","last_updated":"2024-10-08T19:34:03Z","snapshot_observed_at":"2026-08-21T19:23:48.498204Z","submitted_at":"2024-07-01T17:59:47Z","title":"KV Cache Compression, But What Must We Give in Return? A Comprehensive Benchmark of Long Context Capable Approaches","version":2},"cited_work":{"arxiv_id":"2407.01527","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.01527","snapshot_observed_at":"2026-06-30T11:34:37.883253Z","title":"Kv cache compression, but what must we give in return? a compre- hensive benchmark of long context capable approaches","venue":null,"work_id":"bd590ff7-ac83-451f-b803-204796d882d5","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":37,"source":"pdf_text","source_observed_at":"2026-05-23T18:31:35.391674Z"},"links":{"cited_paper":"/paper/2407.01527","citing_paper":"/paper/2410.13846"},"observation_digest":"sha256:f7d9710ab75b19d8f56540134114dee7adbddbe52f9c777fb8efdb03a27b966e","observation_id":"7e9c5c10-0239-4f84-985a-a16e0eaf480f","resolution":{"observed_at":"2026-05-23T18:33:19.433383Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01527","last_updated":"2024-10-08T19:34:03Z","snapshot_observed_at":"2026-08-21T19:23:48.498204Z","submitted_at":"2024-07-01T17:59:47Z","title":"KV Cache Compression, But What Must We Give in Return? A Comprehensive Benchmark of Long Context Capable Approaches","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.01527","snapshot_observed_at":"2026-08-11T11:53:40.281833Z","title":"Kv cache compres- sion, but what must we give in return? a comprehensive benchmark of long context capable approaches,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.14847","last_updated":"2025-01-05T13:54:06Z","snapshot_observed_at":"2026-08-16T11:04:22.250433Z","submitted_at":"2024-12-19T13:39:24Z","title":"A Survey of RWKV","version":2},"reference_index":188,"source":"pdf_text","source_observed_at":"2026-08-11T11:53:40.281833Z"},"links":{"cited_paper":"/paper/2407.01527","citing_paper":"/paper/2412.14847"},"observation_digest":"sha256:8c31a81ac12ddba8164b24a745cf23e11edbcd521f775a7bd922bee0bcb1e5b6","observation_id":"a06b379c-6c56-4a4f-894a-75cb18495229","resolution":{"observed_at":"2026-08-11T11:53:40.281833Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01527","last_updated":"2024-10-08T19:34:03Z","snapshot_observed_at":"2026-08-21T19:23:48.498204Z","submitted_at":"2024-07-01T17:59:47Z","title":"KV Cache Compression, But What Must We Give in Return? A Comprehensive Benchmark of Long Context Capable Approaches","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.01527","snapshot_observed_at":"2026-08-11T00:38:46.750007Z","title":"Kv cache com- pression, but what must we give in return? a comprehensive benchmark of long context capable approaches,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.19442","last_updated":"2025-07-30T05:24:46Z","snapshot_observed_at":"2026-08-20T14:01:46.841630Z","submitted_at":"2024-12-27T04:17:57Z","title":"A Survey on Large Language Model Acceleration based on KV Cache Management","version":3},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-11T00:38:46.750007Z"},"links":{"cited_paper":"/paper/2407.01527","citing_paper":"/paper/2412.19442"},"observation_digest":"sha256:6e6a181954b6ba695c0ffd20417f761654d70223f206c0a0960e0957541204b0","observation_id":"bfcea103-884a-4ce3-99ff-e220d655e7d2","resolution":{"observed_at":"2026-08-11T00:38:46.750007Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01527","last_updated":"2024-10-08T19:34:03Z","snapshot_observed_at":"2026-08-21T19:23:48.498204Z","submitted_at":"2024-07-01T17:59:47Z","title":"KV Cache Compression, But What Must We Give in Return? A Comprehensive Benchmark of Long Context Capable Approaches","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.01527","snapshot_observed_at":"2026-08-09T19:42:41.433628Z","title":"Kv cache compression, but what must we give in return? a comprehensive benchmark of long context capable approaches","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.00258","last_updated":"2025-06-23T21:39:56Z","snapshot_observed_at":"2026-08-18T22:47:53.608129Z","submitted_at":"2025-02-01T01:35:23Z","title":"ProxSparse: Regularized Learning of Semi-Structured Sparsity Masks for Pretrained LLMs","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-09T19:42:41.433628Z"},"links":{"cited_paper":"/paper/2407.01527","citing_paper":"/paper/2502.00258"},"observation_digest":"sha256:6117a31ef19e9d0cff9aba0f54e06c84947751694225b88f3dc23ab2b303400e","observation_id":"3fee9afb-2407-4e3f-9155-b9a192ac264e","resolution":{"observed_at":"2026-08-09T19:42:41.433628Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01527","last_updated":"2024-10-08T19:34:03Z","snapshot_observed_at":"2026-08-21T19:23:48.498204Z","submitted_at":"2024-07-01T17:59:47Z","title":"KV Cache Compression, But What Must We Give in Return? A Comprehensive Benchmark of Long Context Capable Approaches","version":2},"cited_work":{"arxiv_id":"2407.01527","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.01527","snapshot_observed_at":"2026-06-30T11:34:37.883253Z","title":"Kv cache compression, but what must we give in return? a compre- hensive benchmark of long context capable approaches","venue":null,"work_id":"bd590ff7-ac83-451f-b803-204796d882d5","year":2024},"citing_paper":{"arxiv_id":"2502.01941","last_updated":"2026-05-12T08:04:27Z","snapshot_observed_at":"2026-08-14T08:23:35.104382Z","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":71,"source":"pdf_text","source_observed_at":"2026-05-23T04:15:36.906263Z"},"links":{"cited_paper":"/paper/2407.01527","citing_paper":"/paper/2502.01941"},"observation_digest":"sha256:b155f34b0583e129bcaabd81b7dac2c636259eb63ae6c87fdd709feb6d34d6a3","observation_id":"1b3b9b87-cb69-445e-b9f9-e1b62e74d189","resolution":{"observed_at":"2026-05-23T04:17:31.317978Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01527","last_updated":"2024-10-08T19:34:03Z","snapshot_observed_at":"2026-08-21T19:23:48.498204Z","submitted_at":"2024-07-01T17:59:47Z","title":"KV Cache Compression, But What Must We Give in Return? A Comprehensive Benchmark of Long Context Capable Approaches","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.01527","snapshot_observed_at":"2026-08-07T12:39:06.015867Z","title":"Kv cache compression, but what must we give in return? a comprehensive benchmark of long context capable approaches,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24179","last_updated":"2025-05-30T03:40:24Z","snapshot_observed_at":"2026-08-16T15:53:16.092360Z","submitted_at":"2025-05-30T03:40:24Z","title":"SALE : Low-bit Estimation for Efficient Sparse Attention in Long-context LLM Prefilling","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T12:39:06.015867Z"},"links":{"cited_paper":"/paper/2407.01527","citing_paper":"/paper/2505.24179"},"observation_digest":"sha256:9c71145f13a825afd5156e797c277987ecdba53ff78d104b197165c5de415987","observation_id":"54ad1def-52a4-41d4-9065-0738cec69d22","resolution":{"observed_at":"2026-08-07T12:39:06.015867Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01527","last_updated":"2024-10-08T19:34:03Z","snapshot_observed_at":"2026-08-21T19:23:48.498204Z","submitted_at":"2024-07-01T17:59:47Z","title":"KV Cache Compression, But What Must We Give in Return? A Comprehensive Benchmark of Long Context Capable Approaches","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.01527","snapshot_observed_at":"2026-08-15T18:49:24.139988Z","title":"Kv cache compression, but what must we give in return? a compre- hensive benchmark of long context capable approaches","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.18879","last_updated":"2025-06-23T17:50:11Z","snapshot_observed_at":"2026-08-16T01:51:29.045572Z","submitted_at":"2025-06-23T17:50:11Z","title":"CommVQ: Commutative Vector Quantization for KV Cache Compression","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T18:49:24.139988Z"},"links":{"cited_paper":"/paper/2407.01527","citing_paper":"/paper/2506.18879"},"observation_digest":"sha256:b9cf3f84ea385bdbe260f0607b5dd05748c621509c70db237d854ab85463bff4","observation_id":"361296f1-a515-4717-a4d0-4c83f08c7bc0","resolution":{"observed_at":"2026-08-15T18:49:24.139988Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01527","last_updated":"2024-10-08T19:34:03Z","snapshot_observed_at":"2026-08-21T19:23:48.498204Z","submitted_at":"2024-07-01T17:59:47Z","title":"KV Cache Compression, But What Must We Give in Return? A Comprehensive Benchmark of Long Context Capable Approaches","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.01527","snapshot_observed_at":"2026-08-03T20:59:00.082015Z","title":"Kv cache compression, but what must we give in return? a comprehensive benchmark of long context capable approaches","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.17826","last_updated":"2026-05-29T02:47:21Z","snapshot_observed_at":"2026-08-16T06:54:32.897692Z","submitted_at":"2025-11-21T22:40:00Z","title":"Deterministic Inference across Tensor Parallel Sizes That Eliminates Training-Inference Mismatch","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-03T20:59:00.082015Z"},"links":{"cited_paper":"/paper/2407.01527","citing_paper":"/paper/2511.17826"},"observation_digest":"sha256:4c03d61ab9195353077a255ea38af0cc21bb8b089b627e18b71a32416ba4bf2b","observation_id":"5e415aeb-b03f-48cf-a217-5a16486d97fb","resolution":{"observed_at":"2026-08-03T20:59:00.082015Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01527","last_updated":"2024-10-08T19:34:03Z","snapshot_observed_at":"2026-08-21T19:23:48.498204Z","submitted_at":"2024-07-01T17:59:47Z","title":"KV Cache Compression, But What Must We Give in Return? A Comprehensive Benchmark of Long Context Capable Approaches","version":2},"cited_work":{"arxiv_id":"2407.01527","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.01527","snapshot_observed_at":"2026-06-30T11:34:37.883253Z","title":"Kv cache compression, but what must we give in return? a compre- hensive benchmark of long context capable approaches","venue":null,"work_id":"bd590ff7-ac83-451f-b803-204796d882d5","year":2024},"citing_paper":{"arxiv_id":"2604.18567","last_updated":"2026-04-20T17:53:33Z","snapshot_observed_at":"2026-08-14T05:06:32.011946Z","submitted_at":"2026-04-20T17:53:33Z","title":"Latent Phase-Shift Rollback: Inference-Time Error Correction via Residual Stream Monitoring and KV-Cache Steering","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-10T05:08:37.690706Z"},"links":{"cited_paper":"/paper/2407.01527","citing_paper":"/paper/2604.18567"},"observation_digest":"sha256:47d78201b37d3df7dba1b29e4ab6f2862737e4c525576b4d94fa70a43b7e6016","observation_id":"bffa546f-140b-457c-87d9-4460599c9269","resolution":{"observed_at":"2026-05-10T09:48:47.930295Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.01527","last_updated":"2024-10-08T19:34:03Z","snapshot_observed_at":"2026-08-21T19:23:48.498204Z","submitted_at":"2024-07-01T17:59:47Z","title":"KV Cache Compression, But What Must We Give in Return? A Comprehensive Benchmark of Long Context Capable Approaches","version":2},"cited_work":{"arxiv_id":"2407.01527","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2407.01527","snapshot_observed_at":"2026-06-30T11:34:37.883253Z","title":"Kv cache compression, but what must we give in return? a compre- hensive benchmark of long context capable approaches","venue":null,"work_id":"bd590ff7-ac83-451f-b803-204796d882d5","year":2024},"citing_paper":{"arxiv_id":"2606.28349","last_updated":"2026-06-03T07:15:11Z","snapshot_observed_at":"2026-08-18T16:03:52.014313Z","submitted_at":"2026-06-03T07:15:11Z","title":"HMARS: A Hierarchical Multi-Agent Memory System for Long-Context Reasoning","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-06-30T11:30:52.871762Z"},"links":{"cited_paper":"/paper/2407.01527","citing_paper":"/paper/2606.28349"},"observation_digest":"sha256:b30f14df49d5abed87d5eb383309764cec1d030e38c636d8a1569841d203fc6c","observation_id":"981a64ee-da79-4d7b-8dcb-cdf351a99d60","resolution":{"observed_at":"2026-06-30T11:34:37.884717Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2407.01527/citation-record","integrity":"/paper/2407.01527/integrity","json":"/paper/2407.01527/citation-record.json","paper":"/paper/2407.01527"},"outbound":[],"paper":{"arxiv_id":"2407.01527","last_updated":"2024-10-08T19:34:03Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-21T19:23:48.498204Z","submitted_at":"2024-07-01T17:59:47Z","title":"KV Cache Compression, But What Must We Give in Return? A Comprehensive Benchmark of Long Context Capable Approaches"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 11 inbound Pith citation observations for arXiv:2407.01527."}