Lefei Zhang, Hai Zhao, Luohe Shi, Baoyuan Qi, Guoming Liu, Z. Li
1 of 1 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; 0 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 1 failure of our instrument; 0 no recorded run); 1 of them was also run on the host, not in the jail, by the peer-agreement lane that set its level, measured 2026-11-21; 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/2507.11273.json · badge: /api/ran/2507.11273.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 |
|---|---|---|
| ShiLuohe/KV-Latent | canonical (classifier label) classifier basis not recorded on the link |
1 ran · 0 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| repeat_kv | Ran ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT) |
ShiLuohe/KV-Latent/modelcodes/modeling_llama3.py pointer only (licence: NONE) · get_code("30d7eec482ebf6b1") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, ShiLuohe/KV-Latent 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. |
Of 1 samples lifted from this paper's linked repositories, 1 carry a function identity and 0 do not. Of the 1 distinct functions with an identity, 1 are also present in other papers whose code we hold (1 with at least one paper dated earlier, 1 the same month, 1 later) and 0 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 |
|---|---|---|---|
| repeat_kv | 243 other papers 198 dated earlier, 5 the same month, 34 later, 4 same year, order not determinable, 2 undated · 22 only as an assembly brick |
1901.02860 (2019-01) Transformer-XL: Attentive Language Models Beyond a Fixed-Length Context |
2203.08913 (2022-03) Memorizing Transformers 2305.17888 (2023-05) LLM-QAT: Data-Free Quantization Aware Training for Large Language Models and 240 more not named here |
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-21.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Large language models (LLMs) based on Transformer Decoders have become the preferred choice for conversational generative AI. Despite the overall superiority of the Decoder architecture, the gradually increasing Key-Value (KV) cache during inference has emerged as a primary efficiency bottleneck, both in aspects of memory consumption and data transfer bandwidth limitations. To address these challenges, we propose a paradigm called KV-Latent. By down-sampling the Key-Value vector dimensions into a latent space, we can significantly reduce the KV Cache footprint and improve inference speed, only with a small amount of extra training, less than 1% of pretraining takes. Besides, we enhanced the stability of Rotary Positional Embedding applied on lower-dimensional vectors by modifying its frequency sampling mechanism, avoiding noise introduced by higher frequencies while retaining position attenuation. Our experiments, including both models with Grouped Query Attention and those without, have yielded satisfactory results. Finally, we conducted comparative experiments to study the impact of separately reducing Key and Value components on model's performance. Our approach allows for the construction of more efficient language model systems, and opens the new possibility on KV Cache saving and efficient LLMs. Our code is available at https://github.com/ShiLuohe/KV-Latent.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2507.11273")
get_code_for_paper("2507.11273")
have("2507.11273")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2507.11273.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2507.11273)
Connect an agent — have() is free.