{"as_of":"2026-08-23T03:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f8bade6748a1614bd2206c613ee411ebbe91da5846fd2457f705d2058184e7cb","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T17:32:39.990624Z","state":"measured"},{"denominator":32,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":32,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-22T06:32:14.747728+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T13:26:55.395701Z","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-07-04T18:40:03.257305Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.08890","snapshot_observed_at":"2026-08-09T13:26:55.395701Z","title":"Lexico: Extreme kv cache compression via sparse coding over universal dictionaries","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.02617","last_updated":"2025-02-04T08:52:13Z","snapshot_observed_at":"2026-08-15T21:58:34.589761Z","submitted_at":"2025-02-04T08:52:13Z","title":"PolarQuant: Quantizing KV Caches with Polar Transformation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T13:26:55.395701Z"},"links":{"cited_paper":"/paper/2412.08890","citing_paper":"/paper/2502.02617"},"observation_digest":"sha256:eaaac6dc7ae30b96bd50964eb12a83eb69721da4ce3e4adac2c2781986277605","observation_id":"e0d28393-71b5-46a6-a19d-bb518fb9b178","resolution":{"observed_at":"2026-08-09T13:26:55.395701Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"cited_work":{"arxiv_id":"2412.08890","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.08890","snapshot_observed_at":"2026-07-04T18:40:03.257305Z","title":"Lexico: Extreme kv cache compression via sparse coding over universal dictionaries","venue":null,"work_id":"c52a030e-6a60-45de-a455-e80e59fd07ed","year":2024},"citing_paper":{"arxiv_id":"2504.19874","last_updated":"2025-04-28T15:05:35Z","snapshot_observed_at":"2026-08-21T15:16:21.985758Z","submitted_at":"2025-04-28T15:05:35Z","title":"TurboQuant: Online Vector Quantization with Near-optimal Distortion Rate","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-20T08:09:22.226608Z"},"links":{"cited_paper":"/paper/2412.08890","citing_paper":"/paper/2504.19874"},"observation_digest":"sha256:595e44e45c32cb256bef76c92fe4ac011a78a42bc45ad3e58db36a3fdc5099dc","observation_id":"624879cc-1d29-4d46-85a0-ca699718236c","resolution":{"observed_at":"2026-05-20T08:09:22.270351Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.08890","snapshot_observed_at":"2026-08-07T06:04:31.436604Z","title":"Lexico: Extreme kv cache compression via sparse coding over universal dictionaries.arXiv preprint arXiv:2412.08890, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06266","last_updated":"2025-06-13T17:58:55Z","snapshot_observed_at":"2026-08-16T06:23:05.141323Z","submitted_at":"2025-06-06T17:48:23Z","title":"Cartridges: Lightweight and general-purpose long context representations via self-study","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T06:04:31.436604Z"},"links":{"cited_paper":"/paper/2412.08890","citing_paper":"/paper/2506.06266"},"observation_digest":"sha256:b91f406dbea051e6cd19e75d6aa55f8325811d5c9ef141f76e9fdc74d5b4661f","observation_id":"1916c9f4-cb6c-49b4-b9f7-9d002151684e","resolution":{"observed_at":"2026-08-07T06:04:31.436604Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"cited_work":{"arxiv_id":"2412.08890","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.08890","snapshot_observed_at":"2026-07-04T18:40:03.257305Z","title":"Lexico: Extreme kv cache compression via sparse coding over universal dictionaries","venue":null,"work_id":"c52a030e-6a60-45de-a455-e80e59fd07ed","year":2024},"citing_paper":{"arxiv_id":"2605.05365","last_updated":"2026-05-06T18:44:08Z","snapshot_observed_at":"2026-08-16T18:16:47.637991Z","submitted_at":"2026-05-06T18:44:08Z","title":"ZAYA1-8B Technical Report","version":1},"reference_index":142,"source":"arxiv_source","source_observed_at":"2026-05-08T17:36:37.182196Z"},"links":{"cited_paper":"/paper/2412.08890","citing_paper":"/paper/2605.05365"},"observation_digest":"sha256:acf03488c77f976f85e7c32266763b2117fd4c79a1fff4d31207889d36fe53db","observation_id":"d94ec039-2f70-4e0b-ae55-9c8fedb922fe","resolution":{"observed_at":"2026-05-11T17:26:05.138038Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"cited_work":{"arxiv_id":"2412.08890","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.08890","snapshot_observed_at":"2026-07-04T18:40:03.257305Z","title":"Lexico: Extreme kv cache compression via sparse coding over universal dictionaries","venue":null,"work_id":"c52a030e-6a60-45de-a455-e80e59fd07ed","year":2024},"citing_paper":{"arxiv_id":"2606.24320","last_updated":"2026-06-25T20:48:22Z","snapshot_observed_at":"2026-07-06T23:58:54.018557Z","submitted_at":"2026-06-23T08:57:34Z","title":"ZONOS2 Technical Report","version":1},"reference_index":167,"source":"arxiv_source","source_observed_at":"2026-06-25T22:37:15.072758Z"},"links":{"cited_paper":"/paper/2412.08890","citing_paper":"/paper/2606.24320"},"observation_digest":"sha256:5e74b112523929e563d554aceaf46e63450d5dbcde9617e5b90887b2fce06c8c","observation_id":"28d8da42-9c4a-465a-9895-a050ec8cdefa","resolution":{"observed_at":"2026-07-04T18:40:03.258656Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"cited_work":{"arxiv_id":"2412.08890","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.08890","snapshot_observed_at":"2026-07-04T18:40:03.257305Z","title":"Lexico: Extreme kv cache compression via sparse coding over universal dictionaries","venue":null,"work_id":"c52a030e-6a60-45de-a455-e80e59fd07ed","year":2024},"citing_paper":{"arxiv_id":"2606.24320","last_updated":"2026-06-25T20:48:22Z","snapshot_observed_at":"2026-07-06T23:58:54.018557Z","submitted_at":"2026-06-23T08:57:34Z","title":"ZONOS2 Technical Report","version":2},"reference_index":167,"source":"arxiv_source","source_observed_at":"2026-06-29T02:07:31.791835Z"},"links":{"cited_paper":"/paper/2412.08890","citing_paper":"/paper/2606.24320"},"observation_digest":"sha256:06ee88053498b1f384cc1305134053395704404592b8a64692ad52da557686f0","observation_id":"81229a86-7276-4c50-9de8-532cb996de2a","resolution":{"observed_at":"2026-07-01T18:15:59.119424Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.08890","snapshot_observed_at":"2026-08-01T09:52:04.379792Z","title":"arXiv preprint arXiv:2412.08890 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27308","last_updated":"2026-07-29T17:49:04Z","snapshot_observed_at":"2026-08-05T10:53:49.344314Z","submitted_at":"2026-07-29T17:49:04Z","title":"ZUNA1.1: A more flexible EEG foundation model for Denoising and Super-resolution","version":1},"reference_index":152,"source":"arxiv_source","source_observed_at":"2026-08-01T09:52:04.379792Z"},"links":{"cited_paper":"/paper/2412.08890","citing_paper":"/paper/2607.27308"},"observation_digest":"sha256:bc38ec2de3755d6c9216e8cf273474cc6b12c595ac13541ad6f7a909ac2d6113","observation_id":"b3d8b8f7-8db9-4516-91fe-ce7f84b53e57","resolution":{"observed_at":"2026-08-01T09:52:04.379792Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2412.08890/citation-record","integrity":"/paper/2412.08890/integrity","json":"/paper/2412.08890/citation-record.json","paper":"/paper/2412.08890"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T17:32:39.921656Z","title":"Gqa: Training generalized multi-query transformer models from multi-head check- points","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T17:32:39.921656Z"},"links":{"citing_paper":"/paper/2412.08890"},"observation_digest":"sha256:fb48475bd7e976703513dd30956ae17d04d77aa25e26255af56fe3bf4eb1db34","observation_id":"6996c122-ee75-4e9d-a5c2-89085e9018f3","resolution":{"observed_at":"2026-08-11T17:32:39.921656Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.05150","last_updated":"2020-12-02T17:52:35Z","snapshot_observed_at":"2026-07-31T17:17:17.205582Z","submitted_at":"2020-04-10T17:54:09Z","title":"Longformer: The Long-Document Transformer","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.05150","snapshot_observed_at":"2026-08-11T17:32:39.928529Z","title":"Longformer: The long-document transformer","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T17:32:39.928529Z"},"links":{"cited_paper":"/paper/2004.05150","citing_paper":"/paper/2412.08890"},"observation_digest":"sha256:e06f56b2e4ac5a8fa5caa7738e5f307da2b0249f3339567bdbc1fde62bc88a7a","observation_id":"7304570a-1d63-4f0b-a935-fde0456f0668","resolution":{"observed_at":"2026-08-11T17:32:39.928529Z","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-08-13T04:39:30.300015Z","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-11T17:32:39.931782Z","title":"Pyramidkv: Dynamic kv cache compression based on pyramidal information funneling","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T17:32:39.931782Z"},"links":{"cited_paper":"/paper/2406.02069","citing_paper":"/paper/2412.08890"},"observation_digest":"sha256:84f63d2fed4ced1d67d51ab47001c049cc2cf1b8e133b274b32c4172923a0eb9","observation_id":"16760b27-39cb-4865-a6f4-e8cb8057b340","resolution":{"observed_at":"2026-08-11T17:32:39.931782Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.14256","last_updated":"2024-05-23T07:37:16Z","snapshot_observed_at":"2026-08-16T13:50:20.836322Z","submitted_at":"2024-05-23T07:37:16Z","title":"ZipCache: Accurate and Efficient KV Cache Quantization with Salient Token Identification","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.14256","snapshot_observed_at":"2026-08-11T17:32:39.944609Z","title":"Zipcache: Accurate and efficient kv cache quantization with salient token identification","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T17:32:39.944609Z"},"links":{"cited_paper":"/paper/2405.14256","citing_paper":"/paper/2412.08890"},"observation_digest":"sha256:2729a4c7d6c999485561f6922c6a3fce90494296136532f3c2e9e39e7b8b928a","observation_id":"2a14adf7-5e1a-4605-a1b1-e1e792b0d052","resolution":{"observed_at":"2026-08-11T17:32:39.944609Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.18079","last_updated":"2025-05-28T18:58:29Z","snapshot_observed_at":"2026-08-20T02:16:11.463896Z","submitted_at":"2024-01-31T18:58:14Z","title":"KVQuant: Towards 10 Million Context Length LLM Inference with KV Cache Quantization","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.18079","snapshot_observed_at":"2026-08-11T17:32:39.947554Z","title":"Coleman Hooper, Sehoon Kim, Hiva Mohammadzadeh, Michael W Mahoney, Yakun Sophia Shao, Kurt Keutzer, and Amir Gholami","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T17:32:39.947554Z"},"links":{"cited_paper":"/paper/2401.18079","citing_paper":"/paper/2412.08890"},"observation_digest":"sha256:e20c983eabdf52be9e041ff81aeb189b2907e76dba5b7d58735c5ed185709073","observation_id":"ad012494-5137-4507-bdda-9643a54b41c4","resolution":{"observed_at":"2026-08-11T17:32:39.947554Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.05527","last_updated":"2024-09-30T22:44:58Z","snapshot_observed_at":"2026-08-19T23:26:45.859034Z","submitted_at":"2024-03-08T18:48:30Z","title":"GEAR: An Efficient KV Cache Compression Recipe for Near-Lossless Generative Inference of LLM","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.05527","snapshot_observed_at":"2026-08-11T17:32:39.949962Z","title":"Gear: An efficient kv cache compression recipefor near-lossless generative inference of llm","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T17:32:39.949962Z"},"links":{"cited_paper":"/paper/2403.05527","citing_paper":"/paper/2412.08890"},"observation_digest":"sha256:1c2dcf7bbbca20379c0231a65af4e7a01ef4f18dfe7cb039869092089f8d2184","observation_id":"44398d71-fd32-41e3-987c-c6fb764c9fef","resolution":{"observed_at":"2026-08-11T17:32:39.949962Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-17T19:26:44.032537Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-11T17:32:39.952337Z","title":"Adam: A method for stochastic optimization","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T17:32:39.952337Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/2412.08890"},"observation_digest":"sha256:828ded16c0e6b897db5444ecb14407e8e89db6b41d978ec9c25cdb22b044e98f","observation_id":"a6e0556e-6d30-467b-90d9-eb08435f1879","resolution":{"observed_at":"2026-08-11T17:32:39.952337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14469","last_updated":"2024-06-17T03:01:58Z","snapshot_observed_at":"2026-08-14T12:21:04.886717Z","submitted_at":"2024-04-22T17:42:58Z","title":"SnapKV: LLM Knows What You are Looking for Before Generation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.14469","snapshot_observed_at":"2026-08-11T17:32:39.954480Z","title":"Snapkv: Llm knows what you are looking for before generation","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T17:32:39.954480Z"},"links":{"cited_paper":"/paper/2404.14469","citing_paper":"/paper/2412.08890"},"observation_digest":"sha256:922902691e004f7e29a0962a42c92e3e17689ab7d842638294f9e88286ff5c2d","observation_id":"9a573994-344b-4f0a-9c48-6cd4df391568","resolution":{"observed_at":"2026-08-11T17:32:39.954480Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02669","last_updated":"2024-07-04T15:12:54Z","snapshot_observed_at":"2026-08-17T04:58:55.259763Z","submitted_at":"2024-01-05T06:53:00Z","title":"Infinite-LLM: Efficient LLM Service for Long Context with DistAttention and Distributed KVCache","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.02669","snapshot_observed_at":"2026-08-11T17:32:39.956930Z","title":"Infinite-llm: Efficient llm service for long context with distattention and distributed kvcache","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T17:32:39.956930Z"},"links":{"cited_paper":"/paper/2401.02669","citing_paper":"/paper/2412.08890"},"observation_digest":"sha256:c2f075e3db9810a9de608c1bdf65f6f82ec7eb4092f8202404a039f82e082b60","observation_id":"3ff7a8d3-7e33-4302-a0d9-1ceac9c3347d","resolution":{"observed_at":"2026-08-11T17:32:39.956930Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.02750","snapshot_observed_at":"2026-08-11T17:32:39.959695Z","title":"Scissorhands: Exploiting the persistence of importance hypothesis for llm kv cache compression at test time.Advances in Neural Information Processing Systems, 36, 2024a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T17:32:39.959695Z"},"links":{"cited_paper":"/paper/2402.02750","citing_paper":"/paper/2412.08890"},"observation_digest":"sha256:f861f27f4075e29ae57d1723b81bdb86c37fdb656497de468af471f1ae582fb8","observation_id":"940f14fa-18b7-4b36-ba3f-0d9e6e88aca2","resolution":{"observed_at":"2026-08-11T17:32:39.959695Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1312.5663","last_updated":"2014-03-22T17:12:07Z","snapshot_observed_at":"2026-08-19T08:54:08.827507Z","submitted_at":"2013-12-19T17:46:46Z","title":"k-Sparse Autoencoders","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.5663","snapshot_observed_at":"2026-08-11T17:32:39.962371Z","title":"K-sparse autoencoders.arXiv preprint arXiv:1312.5663,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T17:32:39.962371Z"},"links":{"cited_paper":"/paper/1312.5663","citing_paper":"/paper/2412.08890"},"observation_digest":"sha256:4b67b837f35315b429bbe5b57874687549b5f4cfe8051cb2ed1f2c4deaa2b7b3","observation_id":"0325c185-17c6-478f-8446-98063aa181c8","resolution":{"observed_at":"2026-08-11T17:32:39.962371Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.00079","last_updated":"2025-09-03T14:56:29Z","snapshot_observed_at":"2026-08-17T18:39:57.612444Z","submitted_at":"2024-06-24T02:05:32Z","title":"Mooncake: A KVCache-centric Disaggregated Architecture for LLM Serving","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.00079","snapshot_observed_at":"2026-08-11T17:32:39.965032Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T17:32:39.965032Z"},"links":{"cited_paper":"/paper/2407.00079","citing_paper":"/paper/2412.08890"},"observation_digest":"sha256:5b66427da53b6ec4a311edaef6135a82e1d9e7f8c6c9a973844e6e926aa2b845","observation_id":"04eba951-ee5d-4c55-9cf5-612fecbf5103","resolution":{"observed_at":"2026-08-11T17:32:39.965032Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.02150","last_updated":"2019-11-06T00:19:05Z","snapshot_observed_at":"2026-07-06T08:35:01.386074Z","submitted_at":"2019-11-06T00:19:05Z","title":"Fast Transformer Decoding: One Write-Head is All You Need","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.02150","snapshot_observed_at":"2026-08-11T17:32:39.967735Z","title":"Fast transformer decoding: One write-head is all you need","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T17:32:39.967735Z"},"links":{"cited_paper":"/paper/1911.02150","citing_paper":"/paper/2412.08890"},"observation_digest":"sha256:3cfc33fdf90bc50aed4b8dd11b8f748b602a0812a895330d73dbb5ce4e90dead","observation_id":"de5dc1e6-9709-4b4c-aa49-54da6f37c8c2","resolution":{"observed_at":"2026-08-11T17:32:39.967735Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.05254","last_updated":"2024-05-09T14:12:45Z","snapshot_observed_at":"2026-08-20T14:01:44.201219Z","submitted_at":"2024-05-08T17:57:39Z","title":"You Only Cache Once: Decoder-Decoder Architectures for Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.05254","snapshot_observed_at":"2026-08-11T17:32:39.973242Z","title":"You only cache once: Decoder-decoder architectures for language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T17:32:39.973242Z"},"links":{"cited_paper":"/paper/2405.05254","citing_paper":"/paper/2412.08890"},"observation_digest":"sha256:2cefe7a43cadea9989f896795c2f4817828992fdd04a2e75d4d5e3c7d3cffd5d","observation_id":"9c290bd5-84e9-4430-ac12-2e7c84472eb9","resolution":{"observed_at":"2026-08-11T17:32:39.973242Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T17:32:40.148789Z","title":"Attention is all you need","venue":null,"work_id":"2b670781-8967-44fa-b843-550dd6584644","year":2017},"citing_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T17:32:39.976451Z"},"links":{"citing_paper":"/paper/2412.08890"},"observation_digest":"sha256:2682940c597f1dc5abb9f4fd71bf253d29261e74dd0452f45b0e2c5100b58b05","observation_id":"565271d7-35bb-44d4-841d-f0e363bb956c","resolution":{"observed_at":"2026-08-11T17:32:40.151637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.15220","last_updated":"2024-08-01T07:51:25Z","snapshot_observed_at":"2026-08-16T14:15:57.940906Z","submitted_at":"2024-02-23T09:29:19Z","title":"ChunkAttention: Efficient Self-Attention with Prefix-Aware KV Cache and Two-Phase Partition","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.15220","snapshot_observed_at":"2026-08-11T17:32:39.982079Z","title":"Chunkattention: Efficient self-attention with prefix-aware kv cache and two-phase partition","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T17:32:39.982079Z"},"links":{"cited_paper":"/paper/2402.15220","citing_paper":"/paper/2412.08890"},"observation_digest":"sha256:807cc0e911f8177b4cfce99a6023b7e6a975d9b3d3e047da567c6fa6b153850b","observation_id":"7704faf6-a812-4e49-99c2-178b456a92d9","resolution":{"observed_at":"2026-08-11T17:32:39.982079Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.12065","last_updated":"2024-02-20T08:48:24Z","snapshot_observed_at":"2026-08-20T11:54:55.339157Z","submitted_at":"2024-02-19T11:33:21Z","title":"WKVQuant: Quantizing Weight and Key/Value Cache for Large Language Models Gains More","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.12065","snapshot_observed_at":"2026-08-11T17:32:39.987580Z","title":"Wkvquant: Quantizing weight and key/value cache for large language models gains more","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T17:32:39.987580Z"},"links":{"cited_paper":"/paper/2402.12065","citing_paper":"/paper/2412.08890"},"observation_digest":"sha256:1d4b8947889683b404eaccadf89079bfdc31fd18eb90f080dfb67a4ebef4f371","observation_id":"f8b489a9-e388-4c65-9016-444ae4d34c70","resolution":{"observed_at":"2026-08-11T17:32:39.987580Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14168","last_updated":"2021-11-18T00:23:45Z","snapshot_observed_at":"2026-08-14T02:43:01.480086Z","submitted_at":"2021-10-27T04:49:45Z","title":"Training Verifiers to Solve Math Word Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14168","snapshot_observed_at":"2026-08-11T17:32:39.935049Z","title":"Training verifiers to solve math word problems","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-11T17:32:39.935049Z"},"links":{"cited_paper":"/paper/2110.14168","citing_paper":"/paper/2412.08890"},"observation_digest":"sha256:864c1f2159becb999ad39ceaf7b14bdc24dc3612045a164864449b93ec2a5087","observation_id":"b7a2ab87-7f4b-483f-8907-2113a51c0c9b","resolution":{"observed_at":"2026-08-11T17:32:39.935049Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.01574","last_updated":"2024-11-06T02:54:00Z","snapshot_observed_at":"2026-08-20T16:26:42.002863Z","submitted_at":"2024-06-03T17:53:00Z","title":"MMLU-Pro: A More Robust and Challenging Multi-Task Language Understanding Benchmark","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.01574","snapshot_observed_at":"2026-08-11T17:32:39.979186Z","title":"Yubo Wang, Xueguang Ma, Ge Zhang, Yuansheng Ni, Abhranil Chandra, Shiguang Guo, Weiming Ren, Aaran Arulraj, Xuan He, Ziyan Jiang, et al","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-11T17:32:39.979186Z"},"links":{"cited_paper":"/paper/2406.01574","citing_paper":"/paper/2412.08890"},"observation_digest":"sha256:39ae0285a00c403989ba1939d255f7c1f854a8f828139f46dfc5b3c2e0638fc8","observation_id":"cebab9c8-3e35-4a9e-8c79-c79e017138a2","resolution":{"observed_at":"2026-08-11T17:32:39.979186Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.02542","last_updated":"2024-11-07T18:58:50Z","snapshot_observed_at":"2026-08-17T23:57:41.888384Z","submitted_at":"2024-06-04T17:58:03Z","title":"Loki: Low-rank Keys for Efficient Sparse Attention","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.02542","snapshot_observed_at":"2026-08-11T17:32:39.970666Z","title":"Loki: Low-rank keys for efficient sparse attention","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-11T17:32:39.970666Z"},"links":{"cited_paper":"/paper/2406.02542","citing_paper":"/paper/2412.08890"},"observation_digest":"sha256:e71831b3b6694d2e1283c2367eacb43f61492befb5c2de6bdc2eb60228222b18","observation_id":"2fe16acb-c6c4-42fa-9764-69071f0ef38a","resolution":{"observed_at":"2026-08-11T17:32:39.970666Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T17:32:40.138532Z","title":"APPENDIX A I MPLEMENTATION DETAILS Algorithm 1 illustrates a naive implementation of OMP for understanding","venue":null,"work_id":"020bb96c-df26-4e85-853b-994ece250c94","year":2020},"citing_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-11T17:32:39.990624Z"},"links":{"citing_paper":"/paper/2412.08890"},"observation_digest":"sha256:a688253b2225efa11cb5310902a9f7420111c861bd3d61da11702d8f6df7d5d7","observation_id":"adb11b81-00c7-4e26-8c6f-2ee114404806","resolution":{"observed_at":"2026-08-11T17:32:40.143729Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.06066","last_updated":"2024-01-11T17:31:42Z","snapshot_observed_at":"2026-08-18T13:55:31.813413Z","submitted_at":"2024-01-11T17:31:42Z","title":"DeepSeekMoE: Towards Ultimate Expert Specialization in Mixture-of-Experts Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.06066","snapshot_observed_at":"2026-08-11T17:32:39.938181Z","title":"Deepseekmoe: Towards ultimate expert specialization in mixture- of-experts language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-11T17:32:39.938181Z"},"links":{"cited_paper":"/paper/2401.06066","citing_paper":"/paper/2412.08890"},"observation_digest":"sha256:78301face9e9764224a2c1922b614fcdbd132250c8071d745ba6ffde83d6371d","observation_id":"7ca79eb1-e2b5-4e91-8f93-196b6704489d","resolution":{"observed_at":"2026-08-11T17:32:39.938181Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.07056","last_updated":"2024-06-11T08:37:33Z","snapshot_observed_at":"2026-08-16T13:44:16.024792Z","submitted_at":"2024-06-11T08:37:33Z","title":"Effectively Compress KV Heads for LLM","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.07056","snapshot_observed_at":"2026-08-11T17:32:39.984824Z","title":"Effectively compress kv heads for llm","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-11T17:32:39.984824Z"},"links":{"cited_paper":"/paper/2406.07056","citing_paper":"/paper/2412.08890"},"observation_digest":"sha256:a14cc12ebafee6b87322e05c5b59f284c178e819a9485009511f6701f0d90b94","observation_id":"79b0f42e-f2ec-4eca-8a4e-b02232bc8564","resolution":{"observed_at":"2026-08-11T17:32:39.984824Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.14508","last_updated":"2024-06-19T04:00:32Z","snapshot_observed_at":"2026-08-08T03:49:18.086396Z","submitted_at":"2023-08-28T11:53:40Z","title":"LongBench: A Bilingual, Multitask Benchmark for Long Context Understanding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.14508","snapshot_observed_at":"2026-08-11T17:32:39.924932Z","title":"Longbench: A bilingual, multitask benchmark for long context understanding","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-11T17:32:39.924932Z"},"links":{"cited_paper":"/paper/2308.14508","citing_paper":"/paper/2412.08890"},"observation_digest":"sha256:36015e218c0991d3ca466e94f42a26c2d72663e4a0c2243e4284f03797eb2888","observation_id":"633141e6-7103-42f7-8519-27a5ba51c752","resolution":{"observed_at":"2026-08-11T17:32:39.924932Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.11430","last_updated":"2024-11-03T09:42:35Z","snapshot_observed_at":"2026-08-16T13:42:18.939109Z","submitted_at":"2024-06-17T11:35:16Z","title":"A Simple and Effective $L_2$ Norm-Based Strategy for KV Cache Compression","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.11430","snapshot_observed_at":"2026-08-11T17:32:39.941220Z","title":"A simple and effective l 2 norm-based strategy for kv cache compression","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-11T17:32:39.941220Z"},"links":{"cited_paper":"/paper/2406.11430","citing_paper":"/paper/2412.08890"},"observation_digest":"sha256:d61f7a46a4d274ffa2cc75e5e80bd416863f73b9ce2343f8dde494eebdc4226c","observation_id":"dcea4b12-2e86-4870-a977-e26441bb3c7c","resolution":{"observed_at":"2026-08-11T17:32:39.941220Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.08890","last_updated":"2024-12-12T03:00:29Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-22T18:51:42.814963Z","submitted_at":"2024-12-12T03:00:29Z","title":"Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":23,"verified_exact":0,"verified_fuzzy":2},"total_outbound_references":25},"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-22T06:32:14.747728+00:00","source":"crossref"},{"observed_at":"2026-08-22T06:32:06.552537+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 7 inbound Pith citation observations for arXiv:2412.08890."}