{"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/eager-attention-forward","entry":"eager_attention_forward","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":8,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":2,"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":8,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":5,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":4,"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":4,"ran_fixture":1,"ran":2,"unverified":1},"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":"2605.10537","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-10537","title":"Mela: Test-Time Memory Consolidation based on Transformation Hypothesis","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Musubi-ai/Mela","path":"mela/model/modeling_mela.py","file_url":"https://github.com/Musubi-ai/Mela/blob/HEAD/mela/model/modeling_mela.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e0f7e52d8d40e0e1","code_sha256_prefix":"e0f7e52d8d40e0e1","mcp_get_code":{"code_sha256":"e0f7e52d8d40e0e1"}},{"arxiv_id":"2603.08185","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-08185","title":"SERQ: Saliency-Aware Low-Rank Error Reconstruction for LLM Quantization SERQ: SALIENCY-AWARE LOW-RANK ERROR RECONSTRUCTION FOR LLM QUANTIZATION","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"acalabys/SERQ","path":"modeling/modeling_phi3.py","file_url":"https://github.com/acalabys/SERQ/blob/HEAD/modeling/modeling_phi3.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, acalabys/SERQ when it was checked","code_sha256":"3ae16020ca016a74","code_sha256_prefix":"3ae16020ca016a74","mcp_get_code":{"code_sha256":"3ae16020ca016a74"}},{"arxiv_id":"2603.00188","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-00188","title":"ST-Lite: Training-Free KV Cache Compression with Spatio-Trajectory Guidance for Long-Horizon GUI Agents","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"94wen94/ST-Lite","path":"eval/attention_helpers.py","file_url":"https://github.com/94wen94/ST-Lite/blob/HEAD/eval/attention_helpers.py","status":"unverified","verification_level":0,"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, 94wen94/ST-Lite when it was checked","code_sha256":"ab9b58138b59f8ab","code_sha256_prefix":"ab9b58138b59f8ab","mcp_get_code":{"code_sha256":"ab9b58138b59f8ab"}},{"arxiv_id":"2601.02569","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-02569","title":"LoRA-Drop: Temporal LoRA Decoding for Efficient LLM Inference","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"hosseinbv/LoRA-Drop","path":"src/llamafactory/my_models/qwen2_lora_drop/modeling_qwen2_lora_drop.py","file_url":"https://github.com/hosseinbv/LoRA-Drop/blob/HEAD/src/llamafactory/my_models/qwen2_lora_drop/modeling_qwen2_lora_drop.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7019040ccf80940c","code_sha256_prefix":"7019040ccf80940c","mcp_get_code":{"code_sha256":"7019040ccf80940c"}},{"arxiv_id":"2507.01949","arxiv_id_is_arxiv":true,"paper":"/paper/kwai-keye-vl-technical-report","title":"Kwai Keye-VL Technical Report","date":"2025-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kwai-keye/keye","path":"keye-vl-8b-preview/modeling_keye.py","file_url":"https://github.com/kwai-keye/keye/blob/HEAD/keye-vl-8b-preview/modeling_keye.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, kwai-keye/keye when it was checked","code_sha256":"ca192302458c9c1f","code_sha256_prefix":"ca192302458c9c1f","mcp_get_code":{"code_sha256":"ca192302458c9c1f"}},{"arxiv_id":"2506.15220","arxiv_id_is_arxiv":true,"paper":"/paper/video-salmonn-2-captioning-enhanced-audio","title":"video-SALMONN 2: Captioning-Enhanced Audio-Visual Large Language Models","date":"2025-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bytedance/video-salmonn-2","path":"video_SALMONN2_pro/qwenvl/model/modeling_whisper.py","file_url":"https://github.com/bytedance/video-salmonn-2/blob/HEAD/video_SALMONN2_pro/qwenvl/model/modeling_whisper.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5126650c89c15a91","code_sha256_prefix":"5126650c89c15a91","mcp_get_code":{"code_sha256":"5126650c89c15a91"}},{"arxiv_id":"2503.10996","arxiv_id_is_arxiv":true,"paper":"/paper/taming-knowledge-conflicts-in-language-models","title":"Taming Knowledge Conflicts in Language Models","date":"2025-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GaotangLi/JUICE","path":"src/attention_head_utils_Gemma.py","file_url":"https://github.com/GaotangLi/JUICE/blob/HEAD/src/attention_head_utils_Gemma.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, GaotangLi/JUICE when it was checked","code_sha256":"91cd28171ff228ab","code_sha256_prefix":"91cd28171ff228ab","mcp_get_code":{"code_sha256":"91cd28171ff228ab"}},{"arxiv_id":"2406.03496","arxiv_id_is_arxiv":true,"paper":"/paper/wings-learning-multimodal-llms-without-text","title":"Wings: Learning Multimodal LLMs without Text-only Forgetting","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aidc-ai/ovis","path":"ovis/model/vit/modeling_siglip2_navit.py","file_url":"https://github.com/aidc-ai/ovis/blob/HEAD/ovis/model/vit/modeling_siglip2_navit.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3a22b2959d42fc14","code_sha256_prefix":"3a22b2959d42fc14","mcp_get_code":{"code_sha256":"3a22b2959d42fc14"}}],"record_sha256":"545190460bc6c2ea46a3613a79eb82910dbb2bb940d8988cf50ecd46b0bcf2b6","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}