15 of 18 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 3 honoured the contract we drafted, 1 violated it and 0 have no contract verdict; 11 failures of our instrument; 3 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.
"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2402.02750.json · badge: /api/ran/2402.02750.svg
Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.
| Repository | Role | Ran |
|---|---|---|
| jy-yuan/kivi | canonical (classifier label) classifier basis: census |
15 ran · 3 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| build_chat | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
jy-yuan/kivi/pred_long_bench.py code served (permissive licence) · get_code("ef82bf5af4441329") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned str. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| calculate_zeros_width | Ran ran, honoured the contract we drafted |
jy-yuan/kivi/quant/qmodule.py code served (permissive licence) · get_code("fd8719af3db2c5ae") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned int, ndim 0, dtype family int, shape () as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| count_score | Ran ran, honoured the contract we drafted |
jy-yuan/kivi/metrics.py pointer only (licence: MIT); the stored copy get_code serves, from borealisai/radar-decoding, is pointer only (licence: LGPL-3.0) · get_code("b349b79d9cc2934b") How it ranThe body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from borealisai/radar-decoding, and LGPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| dequant_weight | Ran ran; our contract draft was wrong, not the code |
jy-yuan/kivi/quant/gemv.py code served (permissive licence) · get_code("a9baefdb784da628") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned Tensor, ndim 2, dtype family float, shape (4, 6) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| dequant_weight_outer | Ran ran; our contract draft was wrong, not the code |
jy-yuan/kivi/quant/gemv.py code served (permissive licence) · get_code("4d4c20e8d1e678ef") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned Tensor, ndim 3, dtype family float, shape (2, 3, 4) as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| make_divisible | Ran ran, honoured the contract we drafted |
jy-yuan/kivi/quant/qmodule.py code served (permissive licence) · get_code("ad85b288e9acb9c2") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned int, ndim 0, dtype family int, shape () as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| normalize_answer | Ran ran; our contract draft was wrong, not the code |
jy-yuan/kivi/metrics.py pointer only (licence: MIT); the stored copy get_code serves, from borealisai/radar-decoding, is pointer only (licence: LGPL-3.0) · get_code("e7e75981cb464788") How it ranThe body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from borealisai/radar-decoding, and LGPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| normalize_zh_answer | Ran ran; our contract draft was wrong, not the code |
jy-yuan/kivi/metrics.py pointer only (licence: MIT); the stored copy get_code serves, from borealisai/radar-decoding, is pointer only (licence: LGPL-3.0) · get_code("8c5c581f9264c810") How it ranThe body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from borealisai/radar-decoding, and LGPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| parse_args | Ran ran; our contract draft was wrong, not the code |
jy-yuan/kivi/eval_long_bench.py code served (permissive licence) · get_code("ca066a4c088c8cf5") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned Namespace. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| post_process | Ran ran, violated the contract we drafted |
jy-yuan/kivi/pred_long_bench.py code served (permissive licence) · get_code("4489113b536ca6eb") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned str. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| process_input | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
jy-yuan/kivi/models/utils_quant.py code served (permissive licence) · get_code("d54a29178ce3203f") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned tuple. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| quant_and_pack_kcache | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
jy-yuan/kivi/quant/new_pack.py code served (permissive licence) · get_code("901a3668958c9deb") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned tuple. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| quant_and_pack_vcache | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
jy-yuan/kivi/quant/new_pack.py code served (permissive licence) · get_code("95a9c97f6ea7d050") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned tuple. The image it ran in was not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| quantize_and_pack | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
jy-yuan/kivi/models/utils_quant.py code served (permissive licence) · get_code("4ed267d57146753e") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1, through the batch API) and returned tuple. The image it ran in was not recorded. The code mentions cuda, and the harness aliases cuda to the CPU for every sample; whether this run needed that is not recorded. If your copy returns the same type on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| repeat_kv_quant | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
jy-yuan/kivi/models/mistral_kivi.py pointer only (licence: MIT); the stored copy get_code serves, from sail-sg/simlayerkv, is pointer only (licence: NONE) · get_code("fa013be990ccedab") How it ranThe body of this sample is withheld: this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from sail-sg/simlayerkv, and GitHub detected no licence in that repository when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded. |
| dequantize_and_unpack | Not yet run unverified (harvested, no recorded run) |
jy-yuan/kivi/models/utils_quant.py code served (permissive licence) · get_code("1297b7d82f48928d") How it ranno invocation recorded. |
| get_pred | Not yet run unverified (harvested, no recorded run) |
jy-yuan/kivi/pred_long_bench.py code served (permissive licence) · get_code("1b63810f36de324d") How it ranno invocation recorded. |
| unpack_and_dequant_kcache | Not yet run unverified (harvested, no recorded run) |
jy-yuan/kivi/quant/new_pack.py code served (permissive licence) · get_code("e493c68ae46ac587") How it ranno invocation recorded. |
Of 18 samples lifted from this paper's linked repositories, 18 carry a function identity and 0 do not. Of the 18 distinct functions with an identity, 13 are also present in other papers whose code we hold (4 with at least one paper dated earlier, 5 the same month, 13 later) and 5 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).
Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| normalize_answer | 133 other papers 59 dated earlier, 8 the same month, 65 later, 1 undated · 1 only as an assembly brick |
1508.06615 (2015-08) Character-Aware Neural Language Models |
1606.05250 (2016-06) SQuAD: 100,000+ Questions for Machine Comprehension of Text 1608.07905 (2016-08) Machine Comprehension Using Match-LSTM and Answer Pointer and 130 more not named here |
| normalize_zh_answer | 28 other papers 2 dated earlier, 1 the same month, 23 later, 1 same year, order not determinable, 1 undated |
2311.04934 (2023-11) Prompt Cache: Modular Attention Reuse for Low-Latency Inference |
2311.09198 (2023-11) Never Lost in the Middle: Mastering Long-Context Question Answering with Position-Agnostic Decompositional Training 2024.findings-emnlp.230 (2024 (year only)) CLongEval: A Chinese Benchmark for Evaluating Long-Context Large Language Models and 25 more not named here |
| count_score | 24 other papers 2 dated earlier, 1 the same month, 20 later, 1 undated |
2311.04934 (2023-11) Prompt Cache: Modular Attention Reuse for Low-Latency Inference |
2311.09198 (2023-11) Never Lost in the Middle: Mastering Long-Context Question Answering with Position-Agnostic Decompositional Training 2402.04617 (2024-02) InfLLM: Training-Free Long-Context Extrapolation for LLMs with an Efficient Context Memory and 21 more not named here |
| post_process | 14 other papers 1 dated earlier, 13 later |
2311.09198 (2023-11) Never Lost in the Middle: Mastering Long-Context Question Answering with Position-Agnostic Decompositional Training |
2404.14469 (2024-04) SnapKV: LLM Knows What You are Looking for Before Generation 2405.04434 (2024-05) DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Model and 11 more not named here |
| calculate_zeros_width | 3 other papers 1 the same month, 2 later |
2402.10631 (2024-02) BitDistiller: Unleashing the Potential of Sub-4-Bit LLMs via Self-Distillation |
2403.05527 (2024-03) GEAR: An Efficient KV Cache Compression Recipe for Near-Lossless Generative Inference of LLM Li_MBQ_Modality-Balanced_Quantization_for_Large_Vision-Language_Models_CVPR_2025_paper (2025 (year only)) MBQ: Modality-Balanced Quantization for Large Vision-Language Models |
| make_divisible | 3 other papers 1 the same month, 2 later |
2402.10631 (2024-02) BitDistiller: Unleashing the Potential of Sub-4-Bit LLMs via Self-Distillation |
2403.05527 (2024-03) GEAR: An Efficient KV Cache Compression Recipe for Near-Lossless Generative Inference of LLM Li_MBQ_Modality-Balanced_Quantization_for_Large_Vision-Language_Models_CVPR_2025_paper (2025 (year only)) MBQ: Modality-Balanced Quantization for Large Vision-Language Models |
| parse_args | 3 other papers 3 later |
2406.03482 (2024-06) QJL: 1-Bit Quantized JL Transform for KV Cache Quantization with Zero Overhead |
2409.12181 (2024-09) A Controlled Study on Long Context Extension and Generalization in LLMs 2505.22913 (2025-05) MUSTAFAR: Promoting Unstructured Sparsity for KV Cache Pruning in LLM Inference |
| repeat_kv_quant | 2 other papers 2 later |
2406.03482 (2024-06) QJL: 1-Bit Quantized JL Transform for KV Cache Quantization with Zero Overhead |
2410.13846 (2024-10) LightTransfer: Your Long-Context LLM is Secretly a Hybrid Model with Effortless Adaptation |
| dequant_weight | 1 other paper 1 later |
2403.05527 (2024-03) GEAR: An Efficient KV Cache Compression Recipe for Near-Lossless Generative Inference of LLM |
|
| dequant_weight_outer | 1 other paper 1 later |
2403.05527 (2024-03) GEAR: An Efficient KV Cache Compression Recipe for Near-Lossless Generative Inference of LLM |
|
| quant_and_pack_kcache | 1 other paper 1 later |
2403.05527 (2024-03) GEAR: An Efficient KV Cache Compression Recipe for Near-Lossless Generative Inference of LLM |
|
| quant_and_pack_vcache | 1 other paper 1 later |
2403.05527 (2024-03) GEAR: An Efficient KV Cache Compression Recipe for Near-Lossless Generative Inference of LLM |
|
| unpack_and_dequant_kcache | 1 other paper 1 later |
2403.05527 (2024-03) GEAR: An Efficient KV Cache Compression Recipe for Near-Lossless Generative Inference of LLM |
Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Efficiently serving large language models (LLMs) requires batching of many requests to reduce the cost per request. Yet, with larger batch sizes and longer context lengths, the key-value (KV) cache, which stores attention keys and values to avoid re-computations, significantly increases memory demands and becomes the new bottleneck in speed and memory usage. Additionally, the loading of the KV cache causes the computational core to be idle, which limits the inference speed. A straightforward and effective solution to reduce KV cache size is quantization, which decreases the total bytes taken by KV cache. However, there is a lack of in-depth studies that explore the element distribution of KV cache to understand the hardness and limitation of KV cache quantization. To fill the gap, we conducted a comprehensive study on the element distribution in KV cache of popular LLMs. Our findings indicate that the key cache should be quantized per-channel, i.e., group elements along the channel dimension and quantize them together. In contrast, the value cache should be quantized per-token. From this analysis, we developed a tuning-free 2bit KV cache quantization algorithm named KIVI. With hardware-friendly implementation, KIVI can enable Llama, Falcon, and Mistral models to maintain almost the same quality while using $\mathbf{2.6\times}$ less peak memory (including model weight). This reduction in memory usage enables up to $\mathbf{4\times}$ larger batch size, bringing $\mathbf{2.35\times \sim 3.47\times}$ throughput on real LLM inference workload. The source code is available at https://github.com/jy-yuan/KIVI.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2402.02750")
get_code_for_paper("2402.02750")
have("2402.02750")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2402.02750.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2402.02750)
Connect an agent — have() is free.