{"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/apply-rotary-pos-emb-single","entry":"apply_rotary_pos_emb_single","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":11,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":4,"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":9,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":4,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":7,"n_places_pointer_only_link_open":1,"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":4,"ran":3,"unverified":2},"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":"2603.04759","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-04759","title":"Stacked from One: Multi-Scale Self-Injection for Context Window Extension","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"Clement25/SharedLLM","path":"modeling/modeling_llama_sharedllm_flash.py","file_url":"https://github.com/Clement25/SharedLLM/blob/HEAD/modeling/modeling_llama_sharedllm_flash.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, Clement25/SharedLLM when it was checked","code_sha256":"e8582b3a91d38ecb","code_sha256_prefix":"e8582b3a91d38ecb","mcp_get_code":{"code_sha256":"e8582b3a91d38ecb"}},{"arxiv_id":"2502.17599","arxiv_id_is_arxiv":true,"paper":"/paper/meda-dynamic-kv-cache-allocation-for","title":"MEDA: Dynamic KV Cache Allocation for Efficient Multimodal Long-Context Inference","date":"2025-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aiot-mlsys-lab/meda","path":"Dynamic-MLLMs/LLaVA-mix_merge_v1/llava/model/kv_token_merge/modify_llama.py","file_url":"https://github.com/aiot-mlsys-lab/meda/blob/HEAD/Dynamic-MLLMs/LLaVA-mix_merge_v1/llava/model/kv_token_merge/modify_llama.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c0fa64892f2fc8ee","code_sha256_prefix":"c0fa64892f2fc8ee","mcp_get_code":{"code_sha256":"c0fa64892f2fc8ee"}},{"arxiv_id":"2502.11089","arxiv_id_is_arxiv":true,"paper":"/paper/native-sparse-attention-hardware-aligned-and","title":"Native Sparse Attention: Hardware-Aligned and Natively Trainable Sparse Attention","date":"2025-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/seerattention","path":"seer_attn/modules/common.py","file_url":"https://github.com/microsoft/seerattention/blob/HEAD/seer_attn/modules/common.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"89cf2076c1b8ce86","code_sha256_prefix":"89cf2076c1b8ce86","mcp_get_code":{"code_sha256":"89cf2076c1b8ce86"}},{"arxiv_id":"2410.13846","arxiv_id_is_arxiv":true,"paper":"/paper/simlayerkv-a-simple-framework-for-layer-level","title":"SimLayerKV: A Simple Framework for Layer-Level KV Cache Reduction","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sail-sg/simlayerkv","path":"LongBench/SimLayerKV_attention_llama.py","file_url":"https://github.com/sail-sg/simlayerkv/blob/HEAD/LongBench/SimLayerKV_attention_llama.py","status":"ran","verification_level":1,"contract_check":null,"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, sail-sg/simlayerkv when it was checked","code_sha256":"109fdfadb74e7b7e","code_sha256_prefix":"109fdfadb74e7b7e","mcp_get_code":{"code_sha256":"109fdfadb74e7b7e"}},{"arxiv_id":"2407.09709","arxiv_id_is_arxiv":true,"paper":"/paper/gofa-a-generative-one-for-all-model-for-joint","title":"GOFA: A Generative One-For-All Model for Joint Graph Language Modeling","date":"2024-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiaruifeng/gofa","path":"modules/gofa/gnn.py","file_url":"https://github.com/jiaruifeng/gofa/blob/HEAD/modules/gofa/gnn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0ad3b2ccd6dc5318","code_sha256_prefix":"0ad3b2ccd6dc5318","mcp_get_code":{"code_sha256":"0ad3b2ccd6dc5318"}},{"arxiv_id":"2407.03157","arxiv_id_is_arxiv":true,"paper":"/paper/let-the-code-llm-edit-itself-when-you-edit","title":"Let the Code LLM Edit Itself When You Edit the Code","date":"2024-07-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhenyuhe00/PIE","path":"my_modeling_llama_recomputedynamic.py","file_url":"https://github.com/zhenyuhe00/PIE/blob/HEAD/my_modeling_llama_recomputedynamic.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b270c2cdb145449c","code_sha256_prefix":"b270c2cdb145449c","mcp_get_code":{"code_sha256":"b270c2cdb145449c"}},{"arxiv_id":"2406.12018","arxiv_id_is_arxiv":true,"paper":"/paper/citrus-chunked-instruction-aware-state","title":"CItruS: Chunked Instruction-aware State Eviction for Long Sequence Modeling","date":"2024-06-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ybai-nlp/CItruS","path":"src/citrus_methods.py","file_url":"https://github.com/ybai-nlp/CItruS/blob/HEAD/src/citrus_methods.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, ybai-nlp/CItruS when it was checked","code_sha256":"feb1b3f32d2a6b1d","code_sha256_prefix":"feb1b3f32d2a6b1d","mcp_get_code":{"code_sha256":"feb1b3f32d2a6b1d"}},{"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/pos_shift/modify_llama.py","file_url":"https://github.com/zoeyyao27/sirllm/blob/HEAD/sir_llm/pos_shift/modify_llama.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":"feb1b3f32d2a6b1d","code_sha256_prefix":"feb1b3f32d2a6b1d","mcp_get_code":{"code_sha256":"feb1b3f32d2a6b1d"}},{"arxiv_id":"2404.11912","arxiv_id_is_arxiv":true,"paper":"/paper/triforce-lossless-acceleration-of-long","title":"TriForce: Lossless Acceleration of Long Sequence Generation with Hierarchical Speculative Decoding","date":"2024-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Infini-AI-Lab/TriForce","path":"models/modeling_llama_68m.py","file_url":"https://github.com/Infini-AI-Lab/TriForce/blob/HEAD/models/modeling_llama_68m.py","status":"ran","verification_level":1,"contract_check":null,"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, Infini-AI-Lab/TriForce when it was checked","code_sha256":"f101335059827a99","code_sha256_prefix":"f101335059827a99","mcp_get_code":{"code_sha256":"f101335059827a99"}},{"arxiv_id":"2403.13372","arxiv_id_is_arxiv":true,"paper":"/paper/llamafactory-unified-efficient-fine-tuning-of","title":"LlamaFactory: Unified Efficient Fine-Tuning of 100+ Language Models","date":"2024-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Rcrossmeister/RLQG","path":"model/src/api/attn_and_long_ctx_patches.py","file_url":"https://github.com/Rcrossmeister/RLQG/blob/HEAD/model/src/api/attn_and_long_ctx_patches.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from wuyike2000/retrieve-rewrite-answer, and GitHub detected no licence in that repository when it was checked","code_sha256":"5067a5823022c273","code_sha256_prefix":"5067a5823022c273","mcp_get_code":{"code_sha256":"5067a5823022c273"}},{"arxiv_id":"2309.11206","arxiv_id_is_arxiv":true,"paper":"/paper/retrieve-rewrite-answer-a-kg-to-text-enhanced","title":"Retrieve-Rewrite-Answer: A KG-to-Text Enhanced LLMs Framework for Knowledge Graph Question Answering","date":"2023-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wuyike2000/retrieve-rewrite-answer","path":"KGQA-MetaQA/answer/attn_and_long_ctx_patches.py","file_url":"https://github.com/wuyike2000/retrieve-rewrite-answer/blob/HEAD/KGQA-MetaQA/answer/attn_and_long_ctx_patches.py","status":"ran","verification_level":1,"contract_check":null,"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, wuyike2000/retrieve-rewrite-answer when it was checked","code_sha256":"5067a5823022c273","code_sha256_prefix":"5067a5823022c273","mcp_get_code":{"code_sha256":"5067a5823022c273"}}],"record_sha256":"bc5c7123a37443119d02df1db0a46d17af848c281bf7ba65dfda6e620ffcb6c6","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}