{"as_of":"2026-08-19T21:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e6e6318eb6cad8cb930d469c4d5bee221a1b5c59c01c95a8be71516507915fb7","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T14:43:53.797719Z","state":"measured"},{"denominator":16,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":16,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2412.11741/citation-record","integrity":"/paper/2412.11741/integrity","json":"/paper/2412.11741/citation-record.json","paper":"/paper/2412.11741"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.15805","last_updated":"2024-05-31T14:02:24Z","snapshot_observed_at":"2026-08-16T15:29:51.606768Z","submitted_at":"2023-05-25T07:39:41Z","title":"Dynamic Context Pruning for Efficient and Interpretable Autoregressive Transformers","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.15805","snapshot_observed_at":"2026-08-11T14:43:53.709821Z","title":"ArXiv, abs/2305.15805","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.11741","last_updated":"2024-12-16T13:01:53Z","snapshot_observed_at":"2026-08-16T10:05:25.610271Z","submitted_at":"2024-12-16T13:01:53Z","title":"CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T14:43:53.709821Z"},"links":{"cited_paper":"/paper/2305.15805","citing_paper":"/paper/2412.11741"},"observation_digest":"sha256:2ea0614c5b9886b0794436b79315964270c353ad2b2ddce7c1ab02564c402266","observation_id":"b9289772-99e8-4efc-9892-b3ee2d6ca185","resolution":{"observed_at":"2026-08-11T14:43:53.709821Z","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-11T14:43:53.715839Z","title":"arXiv:2308.14508","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.11741","last_updated":"2024-12-16T13:01:53Z","snapshot_observed_at":"2026-08-16T10:05:25.610271Z","submitted_at":"2024-12-16T13:01:53Z","title":"CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T14:43:53.715839Z"},"links":{"cited_paper":"/paper/2308.14508","citing_paper":"/paper/2412.11741"},"observation_digest":"sha256:cad8e15e87a01d5f839276cc7946c164143fc0c3b2eb9da024c4088bc94fdf36","observation_id":"ee4d82f8-9a04-4fd8-843e-b3a55794e058","resolution":{"observed_at":"2026-08-11T14:43:53.715839Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.10305","last_updated":"2025-04-17T08:34:42Z","snapshot_observed_at":"2026-08-14T19:59:05.307983Z","submitted_at":"2023-09-19T04:13:22Z","title":"Baichuan 2: Open Large-scale Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.10305","snapshot_observed_at":"2026-08-11T14:43:53.722734Z","title":"arXiv preprint arXiv:2309.10305","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.11741","last_updated":"2024-12-16T13:01:53Z","snapshot_observed_at":"2026-08-16T10:05:25.610271Z","submitted_at":"2024-12-16T13:01:53Z","title":"CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T14:43:53.722734Z"},"links":{"cited_paper":"/paper/2309.10305","citing_paper":"/paper/2412.11741"},"observation_digest":"sha256:b3283f3c183d6fed7a1b6a9169562bb61966a8153919ef7e6b703e0515fc54d8","observation_id":"1e787753-0b0b-4c04-b87f-c954b614000b","resolution":{"observed_at":"2026-08-11T14:43:53.722734Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.01801","last_updated":"2024-10-29T18:26:09Z","snapshot_observed_at":"2026-08-14T11:45:47.400186Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.01801","snapshot_observed_at":"2026-08-11T14:43:53.729030Z","title":"arXiv preprint arXiv:2310.01801","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.11741","last_updated":"2024-12-16T13:01:53Z","snapshot_observed_at":"2026-08-16T10:05:25.610271Z","submitted_at":"2024-12-16T13:01:53Z","title":"CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T14:43:53.729030Z"},"links":{"cited_paper":"/paper/2310.01801","citing_paper":"/paper/2412.11741"},"observation_digest":"sha256:c990ecc3087922ef565deec21bd4b2c9614c445b491aaf1ba7dd7f53b9e76adc","observation_id":"4c3b0708-f790-4b6c-97f4-f21b155f0b3f","resolution":{"observed_at":"2026-08-11T14:43:53.729030Z","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-11T14:43:54.171807Z","title":"Furthermore, the loss function value after conver- gence is also reduced","venue":null,"work_id":"748e69e6-9544-45e3-8a8c-1349264f662b","year":null},"citing_paper":{"arxiv_id":"2412.11741","last_updated":"2024-12-16T13:01:53Z","snapshot_observed_at":"2026-08-16T10:05:25.610271Z","submitted_at":"2024-12-16T13:01:53Z","title":"CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T14:43:53.797719Z"},"links":{"citing_paper":"/paper/2412.11741"},"observation_digest":"sha256:846c2d844d3fc0e76adff9cc5d24d0d26422222983ccf9ec0d1f4173724c6ab9","observation_id":"124bbbee-dcc2-4039-995d-2b3982158af9","resolution":{"observed_at":"2026-08-11T14:43:54.179098Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.05527","last_updated":"2024-09-30T22:44:58Z","snapshot_observed_at":"2026-08-16T14:11:31.440997Z","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-11T14:43:53.743169Z","title":"arXiv preprint arXiv:2403.05527","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.11741","last_updated":"2024-12-16T13:01:53Z","snapshot_observed_at":"2026-08-16T10:05:25.610271Z","submitted_at":"2024-12-16T13:01:53Z","title":"CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T14:43:53.743169Z"},"links":{"cited_paper":"/paper/2403.05527","citing_paper":"/paper/2412.11741"},"observation_digest":"sha256:9ec35ec7f43d80703a3f3f74caddbc9302b69f46a1019426eb6f77c5552f18fe","observation_id":"e6f96a3d-b421-445a-84a6-69172711e76a","resolution":{"observed_at":"2026-08-11T14:43:53.743169Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.17118","last_updated":"2023-08-28T22:48:46Z","snapshot_observed_at":"2026-08-16T15:29:12.941440Z","submitted_at":"2023-05-26T17:39:58Z","title":"Scissorhands: Exploiting the Persistence of Importance Hypothesis for LLM KV Cache Compression at Test Time","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.17118","snapshot_observed_at":"2026-08-11T14:43:53.749385Z","title":"ArXiv, abs/2305.17118","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.11741","last_updated":"2024-12-16T13:01:53Z","snapshot_observed_at":"2026-08-16T10:05:25.610271Z","submitted_at":"2024-12-16T13:01:53Z","title":"CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T14:43:53.749385Z"},"links":{"cited_paper":"/paper/2305.17118","citing_paper":"/paper/2412.11741"},"observation_digest":"sha256:38277abdfd7037fad4b59184e27e3813eee09f1c6b433c713d2446f715f7f471","observation_id":"57d83c8c-5038-4e0d-a04c-13433517ff8d","resolution":{"observed_at":"2026-08-11T14:43:53.749385Z","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-11T14:43:53.754734Z","title":"ArXiv, abs/2402.02750","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.11741","last_updated":"2024-12-16T13:01:53Z","snapshot_observed_at":"2026-08-16T10:05:25.610271Z","submitted_at":"2024-12-16T13:01:53Z","title":"CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T14:43:53.754734Z"},"links":{"cited_paper":"/paper/2402.02750","citing_paper":"/paper/2412.11741"},"observation_digest":"sha256:2d03ab2db89949ff9fecdb63f44e4fa3e19bcadd6b0ef06db8b8df41cef6d8a6","observation_id":"566c5b7d-e28a-43bc-b05d-9b8afe8dd65e","resolution":{"observed_at":"2026-08-11T14:43:53.754734Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.17453","last_updated":"2024-04-07T00:56:53Z","snapshot_observed_at":"2026-08-14T06:01:54.549199Z","submitted_at":"2023-09-29T17:59:56Z","title":"Efficient Streaming Language Models with Attention Sinks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.17453","snapshot_observed_at":"2026-08-11T14:43:53.770822Z","title":"ArXiv, abs/2309.17453","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.11741","last_updated":"2024-12-16T13:01:53Z","snapshot_observed_at":"2026-08-16T10:05:25.610271Z","submitted_at":"2024-12-16T13:01:53Z","title":"CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T14:43:53.770822Z"},"links":{"cited_paper":"/paper/2309.17453","citing_paper":"/paper/2412.11741"},"observation_digest":"sha256:ed3b549f7c4399412e862c24975223b876fbcf40288650049abcc0bbc7a4a347","observation_id":"fc392518-0553-480c-a901-50d0e07a6205","resolution":{"observed_at":"2026-08-11T14:43:53.770822Z","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-17T06:09:40.445654Z","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-11T14:43:53.776469Z","title":"ArXiv, abs/2402.12065","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.11741","last_updated":"2024-12-16T13:01:53Z","snapshot_observed_at":"2026-08-16T10:05:25.610271Z","submitted_at":"2024-12-16T13:01:53Z","title":"CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T14:43:53.776469Z"},"links":{"cited_paper":"/paper/2402.12065","citing_paper":"/paper/2412.11741"},"observation_digest":"sha256:aeaec9632e327ea17c016eebe4396405fb72c44b120c903c1904d99353fec914","observation_id":"4db7bc57-5109-48d0-903c-fbf371e3a1cb","resolution":{"observed_at":"2026-08-11T14:43:53.776469Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.14048","last_updated":"2023-12-18T19:10:00Z","snapshot_observed_at":"2026-08-06T19:19:02.165567Z","submitted_at":"2023-06-24T20:11:14Z","title":"H$_2$O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.14048","snapshot_observed_at":"2026-08-11T14:43:53.783183Z","title":"ArXiv, abs/2306.14048","venue":null,"work_id":null,"year":1935},"citing_paper":{"arxiv_id":"2412.11741","last_updated":"2024-12-16T13:01:53Z","snapshot_observed_at":"2026-08-16T10:05:25.610271Z","submitted_at":"2024-12-16T13:01:53Z","title":"CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T14:43:53.783183Z"},"links":{"cited_paper":"/paper/2306.14048","citing_paper":"/paper/2412.11741"},"observation_digest":"sha256:dcdfe097219ad0fdd47e26b4c937da7b794673e38af224b3b658348e70c04fa1","observation_id":"f671878b-7e42-4f69-9731-49a272cbc782","resolution":{"observed_at":"2026-08-11T14:43:53.783183Z","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-11T14:43:54.194575Z","title":"In ad- dition, the decrease in loss caused by continuing to increase the offline size is not obvious","venue":null,"work_id":"c8883ac9-91ec-4cf9-8814-df8e7bb4dd42","year":null},"citing_paper":{"arxiv_id":"2412.11741","last_updated":"2024-12-16T13:01:53Z","snapshot_observed_at":"2026-08-16T10:05:25.610271Z","submitted_at":"2024-12-16T13:01:53Z","title":"CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T14:43:53.789948Z"},"links":{"citing_paper":"/paper/2412.11741"},"observation_digest":"sha256:ee4267cac89ad4cfbaddcd780183a67e4dc3fe7edde0b7e1f89c91bf65cd964f","observation_id":"929145ce-abde-4a8c-a5ad-262801f91292","resolution":{"observed_at":"2026-08-11T14:43:54.202822Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1609.07843","last_updated":"2016-09-26T04:06:13Z","snapshot_observed_at":"2026-08-17T01:46:43.513643Z","submitted_at":"2016-09-26T04:06:13Z","title":"Pointer Sentinel Mixture Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1609.07843","snapshot_observed_at":"2026-08-11T14:43:53.759422Z","title":"arXiv:1609.07843","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.11741","last_updated":"2024-12-16T13:01:53Z","snapshot_observed_at":"2026-08-16T10:05:25.610271Z","submitted_at":"2024-12-16T13:01:53Z","title":"CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-11T14:43:53.759422Z"},"links":{"cited_paper":"/paper/1609.07843","citing_paper":"/paper/2412.11741"},"observation_digest":"sha256:55251f16214dd7c8cfafaba3541665ed02567cea3567383720d7bce1b1d6a681","observation_id":"5c4d1625-4577-4207-bedf-4533e0ffa479","resolution":{"observed_at":"2026-08-11T14:43:53.759422Z","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-11T14:43:53.764456Z","title":"ArXiv, abs/1911.02150","venue":null,"work_id":null,"year":1911},"citing_paper":{"arxiv_id":"2412.11741","last_updated":"2024-12-16T13:01:53Z","snapshot_observed_at":"2026-08-16T10:05:25.610271Z","submitted_at":"2024-12-16T13:01:53Z","title":"CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-11T14:43:53.764456Z"},"links":{"cited_paper":"/paper/1911.02150","citing_paper":"/paper/2412.11741"},"observation_digest":"sha256:9492537d6f638c4a015c9510bfa6c8b0efddc1c11d2125fb439e2133f16a3c11","observation_id":"31ffbbf1-a38c-4a57-80e6-2f83b6a20c00","resolution":{"observed_at":"2026-08-11T14:43:53.764456Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.13245","last_updated":"2023-12-23T17:55:11Z","snapshot_observed_at":"2026-08-15T06:28:09.529747Z","submitted_at":"2023-05-22T17:16:38Z","title":"GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpoints","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.13245","snapshot_observed_at":"2026-08-11T14:43:53.703363Z","title":"ArXiv, abs/2305.13245","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.11741","last_updated":"2024-12-16T13:01:53Z","snapshot_observed_at":"2026-08-16T10:05:25.610271Z","submitted_at":"2024-12-16T13:01:53Z","title":"CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-11T14:43:53.703363Z"},"links":{"cited_paper":"/paper/2305.13245","citing_paper":"/paper/2412.11741"},"observation_digest":"sha256:cba0390b21acb489ecd17f2f5aef1465938daad3e1ee66f53098cf77e2cd693d","observation_id":"f7fc109f-c43f-4887-8387-2f9dc83f4700","resolution":{"observed_at":"2026-08-11T14:43:53.703363Z","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-17T08:27:45.946180Z","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-11T14:43:53.736238Z","title":"ArXiv, abs/2401.18079","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.11741","last_updated":"2024-12-16T13:01:53Z","snapshot_observed_at":"2026-08-16T10:05:25.610271Z","submitted_at":"2024-12-16T13:01:53Z","title":"CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-11T14:43:53.736238Z"},"links":{"cited_paper":"/paper/2401.18079","citing_paper":"/paper/2412.11741"},"observation_digest":"sha256:f33d575dd5fcbbbe33cff14935822e22780678873ddf3dda74118b9939a70e67","observation_id":"c0a4b25d-8ab6-4d48-a875-382b2a14a53b","resolution":{"observed_at":"2026-08-11T14:43:53.736238Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.11741","last_updated":"2024-12-16T13:01:53Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-16T10:05:25.610271Z","submitted_at":"2024-12-16T13:01:53Z","title":"CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":0,"verified_fuzzy":2},"total_outbound_references":16},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 0 inbound Pith citation observations for arXiv:2412.11741."}