Pith. sign in

Paper Citation Record · LEDGER

CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation

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.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2412.11741 v1

Coverage vector

measured 16 of 16 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-11T14:43:53.797719Z

measured 16 of 16 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

16 of 16 outbound references displayed

  • verified exact0
  • verified fuzzy2
  • unresolved14
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation b9289772-99e8-4efc-9892-b3ee2d6ca185 · outbound

This paper cites Dynamic Context Pruning for Efficient and Interpretable Autoregressive Transformers.

CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation Dynamic Context Pruning for Efficient and Interpretable Autoregressive Transformers

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-11T14:43:53.709821Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T14:43:53.709821Z digest=sha256:2ea0614c5b9886b0794436b79315964270c353ad2b2ddce7c1ab02564c402266

Observation ee4d82f8-9a04-4fd8-843e-b3a55794e058 · outbound

This paper cites LongBench: A Bilingual, Multitask Benchmark for Long Context Understanding.

CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation LongBench: A Bilingual, Multitask Benchmark for Long Context Understanding

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-11T14:43:53.715839Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T14:43:53.715839Z digest=sha256:cad8e15e87a01d5f839276cc7946c164143fc0c3b2eb9da024c4088bc94fdf36

Observation 1e787753-0b0b-4c04-b87f-c954b614000b · outbound

This paper cites Baichuan 2: Open Large-scale Language Models.

CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation Baichuan 2: Open Large-scale Language Models

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-11T14:43:53.722734Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T14:43:53.722734Z digest=sha256:b3283f3c183d6fed7a1b6a9169562bb61966a8153919ef7e6b703e0515fc54d8

Observation 4c3b0708-f790-4b6c-97f4-f21b155f0b3f · outbound

This paper cites Model Tells You What to Discard: Adaptive KV Cache Compression for LLMs.

CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation Model Tells You What to Discard: Adaptive KV Cache Compression for LLMs

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-11T14:43:53.729030Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T14:43:53.729030Z digest=sha256:c990ecc3087922ef565deec21bd4b2c9614c445b491aaf1ba7dd7f53b9e76adc

Observation 124bbbee-dcc2-4039-995d-2b3982158af9 · outbound

This paper cites Furthermore, the loss function value after conver- gence is also reduced.

CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation Furthermore, the loss function value after conver- gence is also reduced

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T14:43:54.179098Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-11T14:43:53.797719Z digest=sha256:846c2d844d3fc0e76adff9cc5d24d0d26422222983ccf9ec0d1f4173724c6ab9

Observation e6f96a3d-b421-445a-84a6-69172711e76a · outbound

This paper cites GEAR: An Efficient KV Cache Compression Recipe for Near-Lossless Generative Inference of LLM.

CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation GEAR: An Efficient KV Cache Compression Recipe for Near-Lossless Generative Inference of LLM

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-11T14:43:53.743169Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T14:43:53.743169Z digest=sha256:9ec35ec7f43d80703a3f3f74caddbc9302b69f46a1019426eb6f77c5552f18fe

Observation 57d83c8c-5038-4e0d-a04c-13433517ff8d · outbound

This paper cites Scissorhands: Exploiting the Persistence of Importance Hypothesis for LLM KV Cache Compression at Test Time.

CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation Scissorhands: Exploiting the Persistence of Importance Hypothesis for LLM KV Cache Compression at Test Time

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-11T14:43:53.749385Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T14:43:53.749385Z digest=sha256:38277abdfd7037fad4b59184e27e3813eee09f1c6b433c713d2446f715f7f471

Observation 566c5b7d-e28a-43bc-b05d-9b8afe8dd65e · outbound

This paper cites KIVI: A Tuning-Free Asymmetric 2bit Quantization for KV Cache.

CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation KIVI: A Tuning-Free Asymmetric 2bit Quantization for KV Cache

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-11T14:43:53.754734Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T14:43:53.754734Z digest=sha256:2d03ab2db89949ff9fecdb63f44e4fa3e19bcadd6b0ef06db8b8df41cef6d8a6

Observation fc392518-0553-480c-a901-50d0e07a6205 · outbound

This paper cites Efficient Streaming Language Models with Attention Sinks.

CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation Efficient Streaming Language Models with Attention Sinks

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-11T14:43:53.770822Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T14:43:53.770822Z digest=sha256:ed3b549f7c4399412e862c24975223b876fbcf40288650049abcc0bbc7a4a347

Observation 4db7bc57-5109-48d0-903c-fbf371e3a1cb · outbound

This paper cites WKVQuant: Quantizing Weight and Key/Value Cache for Large Language Models Gains More.

CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation WKVQuant: Quantizing Weight and Key/Value Cache for Large Language Models Gains More

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-11T14:43:53.776469Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T14:43:53.776469Z digest=sha256:aeaec9632e327ea17c016eebe4396405fb72c44b120c903c1904d99353fec914

Observation f671878b-7e42-4f69-9731-49a272cbc782 · outbound

This paper cites H$_2$O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Models.

CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation H$_2$O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Models

Reference 14

Resolution
unresolved
no resolver link, observed 2026-08-11T14:43:53.783183Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T14:43:53.783183Z digest=sha256:dcdfe097219ad0fdd47e26b4c937da7b794673e38af224b3b658348e70c04fa1

Observation 929145ce-abde-4a8c-a5ad-262801f91292 · outbound

This paper cites In ad- dition, the decrease in loss caused by continuing to increase the offline size is not obvious.

CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation In ad- dition, the decrease in loss caused by continuing to increase the offline size is not obvious

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-11T14:43:54.202822Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.

source=pdf_text observed=2026-08-11T14:43:53.789948Z digest=sha256:ee4267cac89ad4cfbaddcd780183a67e4dc3fe7edde0b7e1f89c91bf65cd964f

Observation 5c4d1625-4577-4207-bedf-4533e0ffa479 · outbound

This paper cites Pointer Sentinel Mixture Models.

CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation Pointer Sentinel Mixture Models

Reference 2016

Resolution
unresolved
no resolver link, observed 2026-08-11T14:43:53.759422Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T14:43:53.759422Z digest=sha256:55251f16214dd7c8cfafaba3541665ed02567cea3567383720d7bce1b1d6a681

Observation 31ffbbf1-a38c-4a57-80e6-2f83b6a20c00 · outbound

This paper cites Fast Transformer Decoding: One Write-Head is All You Need.

CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation Fast Transformer Decoding: One Write-Head is All You Need

Reference 2019

Resolution
unresolved
no resolver link, observed 2026-08-11T14:43:53.764456Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T14:43:53.764456Z digest=sha256:9492537d6f638c4a015c9510bfa6c8b0efddc1c11d2125fb439e2133f16a3c11

Observation f7fc109f-c43f-4887-8387-2f9dc83f4700 · outbound

This paper cites GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpoints.

CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpoints

Reference 2023

Resolution
unresolved
no resolver link, observed 2026-08-11T14:43:53.703363Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T14:43:53.703363Z digest=sha256:cba0390b21acb489ecd17f2f5aef1465938daad3e1ee66f53098cf77e2cd693d

Observation c0a4b25d-8ab6-4d48-a875-382b2a14a53b · outbound

This paper cites KVQuant: Towards 10 Million Context Length LLM Inference with KV Cache Quantization.

CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation KVQuant: Towards 10 Million Context Length LLM Inference with KV Cache Quantization

Reference 2024

Resolution
unresolved
no resolver link, observed 2026-08-11T14:43:53.736238Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-11T14:43:53.736238Z digest=sha256:f33d575dd5fcbbbe33cff14935822e22780678873ddf3dda74118b9939a70e67

Pith citing papers

No inbound Pith citation observations are available.