{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/slice3d","entry":"slice3d","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":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_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":1,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":3,"ran":0,"unverified":0},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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","arxiv_id_is_arxiv":true,"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"349c21c206f3e211","code_sha256_prefix":"349c21c206f3e211","mcp_get_code":{"code_sha256":"349c21c206f3e211"}},{"arxiv_id":"2407.18121","arxiv_id_is_arxiv":true,"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8884022644d5af82","code_sha256_prefix":"8884022644d5af82","mcp_get_code":{"code_sha256":"8884022644d5af82"}},{"arxiv_id":"2405.12528","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Zoeyyao27/SirLLM when it was checked","code_sha256":"cb805c8b7c94bf90","code_sha256_prefix":"cb805c8b7c94bf90","mcp_get_code":{"code_sha256":"cb805c8b7c94bf90"}},{"arxiv_id":"2309.17453","arxiv_id_is_arxiv":true,"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8884022644d5af82","code_sha256_prefix":"8884022644d5af82","mcp_get_code":{"code_sha256":"8884022644d5af82"}},{"arxiv_id":"2309.14717","arxiv_id_is_arxiv":true,"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8884022644d5af82","code_sha256_prefix":"8884022644d5af82","mcp_get_code":{"code_sha256":"8884022644d5af82"}}],"record_sha256":"3142056974ad18234ba730f89521bcc261c5059ec23befe6bbebede40c50dd15","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}