{"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/slice1d","entry":"slice1d","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":5,"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":3,"n_samples_ran":3,"n_samples_fingerprinted":2,"n_places":5,"n_places_pointer_only":1,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":0,"unverified":0},"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":"2412.03409","paper":"/paper/prefixkv-adaptive-prefix-kv-cache-is-what","title":"PrefixKV: Adaptive Prefix KV Cache is What Vision Instruction-Following Models Need for Efficient Generation","date":"2024-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-mig/prefixkv","path":"prefixkv.py","file_url":"https://github.com/thu-mig/prefixkv/blob/HEAD/prefixkv.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"727f447af4c6cf17","mcp_get_code":{"code_sha256":"727f447af4c6cf17"}},{"arxiv_id":"2407.18121","paper":"/paper/efficient-inference-of-vision-instruction","title":"Efficient Inference of Vision Instruction-Following Models with Elastic Cache","date":"2024-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuzuyan/elasticcache","path":"kv_cache.py","file_url":"https://github.com/liuzuyan/elasticcache/blob/HEAD/kv_cache.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2564045c0e65006b","mcp_get_code":{"code_sha256":"2564045c0e65006b"}},{"arxiv_id":"2405.12528","paper":"/paper/sirllm-streaming-infinite-retentive-llm","title":"SirLLM: Streaming Infinite Retentive LLM","date":"2024-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zoeyyao27/SirLLM","path":"sir_llm/kv_cache.py","file_url":"https://github.com/Zoeyyao27/SirLLM/blob/HEAD/sir_llm/kv_cache.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d9184aa1916b26b6","mcp_get_code":{"code_sha256":"d9184aa1916b26b6"}},{"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":"mit-han-lab/streaming-llm","path":"streaming_llm/kv_cache.py","file_url":"https://github.com/mit-han-lab/streaming-llm/blob/HEAD/streaming_llm/kv_cache.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2564045c0e65006b","mcp_get_code":{"code_sha256":"2564045c0e65006b"}},{"arxiv_id":"2309.14717","paper":"/paper/qa-lora-quantization-aware-low-rank","title":"QA-LoRA: Quantization-Aware Low-Rank Adaptation of Large Language Models","date":"2023-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"intel-analytics/BigDL","path":"python/llm/portable-zip/kv_cache.py","file_url":"https://github.com/intel-analytics/BigDL/blob/HEAD/python/llm/portable-zip/kv_cache.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"2564045c0e65006b","mcp_get_code":{"code_sha256":"2564045c0e65006b"}}]}