{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/code/cache-2","entry":"Cache","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":1,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":5,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":4},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2503.00979","paper":null,"title":"arXiv:2503.00979","date":null,"month_inferred_from_arxiv_id":"2025-03","title_source":null,"repo":"ghadiaravi13/MorphKV","path":"morphkv/morph_cache.py","file_url":"https://github.com/ghadiaravi13/MorphKV/blob/HEAD/morphkv/morph_cache.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"92081088253c410a","mcp_get_code":{"code_sha256":"92081088253c410a"}},{"arxiv_id":"2412.00876","paper":"/paper/dynamic-llava-efficient-multimodal-large","title":"Dynamic-LLaVA: Efficient Multimodal Large Language Models via Dynamic Vision-language Context Sparsification","date":"2024-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"osilly/dynamic_llava","path":"llava/model/language_model/dynamic_modeling_llama.py","file_url":"https://github.com/osilly/dynamic_llava/blob/HEAD/llava/model/language_model/dynamic_modeling_llama.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"d866787c2702613f","mcp_get_code":{"code_sha256":"d866787c2702613f"}},{"arxiv_id":"2407.15176","paper":"/paper/farewell-to-length-extrapolation-a-training","title":"ReAttention: Training-Free Infinite Context with Finite Attention Scope","date":"2024-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OpenMOSS/ReAttention","path":"re_attention/re_attention_internlm2.py","file_url":"https://github.com/OpenMOSS/ReAttention/blob/HEAD/re_attention/re_attention_internlm2.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f6aa9e46f3abe262","mcp_get_code":{"code_sha256":"f6aa9e46f3abe262"}},{"arxiv_id":"2309.17453","paper":"/paper/efficient-streaming-language-models-with","title":"Efficient Streaming Language Models with Attention Sinks","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"squeezeailab/kvquant","path":"gradients/src/transformers/cache_utils.py","file_url":"https://github.com/squeezeailab/kvquant/blob/HEAD/gradients/src/transformers/cache_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1b72723f50079a16","mcp_get_code":{"code_sha256":"1b72723f50079a16"}},{"arxiv_id":"2209.00588","paper":"/paper/transformers-are-sample-efficient-world","title":"Transformers are Sample-Efficient World Models","date":"2022-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eloialonso/iris","path":"src/models/world_model.py","file_url":"https://github.com/eloialonso/iris/blob/HEAD/src/models/world_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"256e6e8e5c0039da","mcp_get_code":{"code_sha256":"256e6e8e5c0039da"}}]}