Roy Schwartz, Michael Hassid, Matanel Oren, M Nir, Yarden Yossi
None of the 4 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (4 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/2401.06104.json · badge: /api/ran/2401.06104.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 |
|---|---|---|
| schwartz-lab-nlp/tova | canonical (classifier label) classifier basis: census |
0 ran · 3 no recorded run |
| schwartz-lab-NLP/TOVA | community Papers with Code archive |
0 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| tova_llama_attention_forward | Not yet run unverified (harvested, no recorded run) |
schwartz-lab-NLP/TOVA/src/convert_models/llama_custom.py code served (permissive licence) · get_code("54de72995b87c580") How it ranno invocation recorded. |
| tova_llama_prepare_inputs_for_generation_generation | Not yet run unverified (harvested, no recorded run) |
schwartz-lab-nlp/tova/src/convert_models/llama_custom.py code served (permissive licence) · get_code("f6c0299a5cc213e4") How it ranno invocation recorded. |
| tova_mistral_attention_forward | Not yet run unverified (harvested, no recorded run) |
schwartz-lab-nlp/tova/src/convert_models/mistral_custom.py code served (permissive licence) · get_code("a1ffc30c1fe8ddd4") How it ranno invocation recorded. |
| tova_mistral_prepare_inputs_for_generation_generation | Not yet run unverified (harvested, no recorded run) |
schwartz-lab-nlp/tova/src/convert_models/mistral_custom.py code served (permissive licence) · get_code("756d1d52f23e0c15") How it ranno invocation recorded. |
Of 4 samples lifted from this paper's linked repositories, 4 carry a function identity and 0 do not. Of the 4 distinct functions with an identity, 0 are also present in other papers whose code we hold (0 with at least one paper dated earlier, 0 the same month, 0 later) and 4 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.
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.
Transformers are considered conceptually different from the previous generation of stateof-the-art NLP models-recurrent neural networks (RNNs). In this work, we demonstrate that decoder-only transformers can in fact be conceptualized as unbounded multistate RNNs-an RNN variant with unlimited hidden state size. We further show that transformers can be converted into bounded multistate RNNs by fixing the size of their hidden state, effectively compressing their keyvalue cache. We introduce a novel, trainingfree compression policy-Token Omission Via Attention (TOVA). 1 Our experiments with four long range tasks and several LLMs show that TOVA outperforms several baseline compression policies. Particularly, our results are nearly on par with the full model, using in some cases only 1 /8 of the original cache size, which translates to 4.8X higher throughput. Our results shed light on the connection between transformers and RNNs, and help mitigate one of LLMs' most painful computational bottlenecks-the size of their key-value cache. 2 * Equal contribuation 1 Literally "good" in Hebrew. 2 https://github.com/schwartz-lab-NLP/TOVA
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2401.06104")
get_code_for_paper("2401.06104")
have("2401.06104")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2401.06104.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2401.06104)
Connect an agent — have() is free.