{"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/make-causal-mask","entry":"_make_causal_mask","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":8,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":7,"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":8,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":7,"n_samples_unverified":0,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":7,"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":"2601.14060","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-14060","title":"Fine-Grained Zero-Shot Composed Image Retrieval with Complementary Visual-Semantic Integration","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"yyc6631/CVSI","path":"utils/encode_with_pseudo_tokens.py","file_url":"https://github.com/yyc6631/CVSI/blob/HEAD/utils/encode_with_pseudo_tokens.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":"60149179400572ab","code_sha256_prefix":"60149179400572ab","mcp_get_code":{"code_sha256":"60149179400572ab"}},{"arxiv_id":"2506.13366","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-goal-oriented-proactive-dialogue","title":"Enhancing Goal-oriented Proactive Dialogue Systems via Consistency Reflection and Correction","date":"2025-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhyidi/CRC","path":"model/Planner.py","file_url":"https://github.com/zhyidi/CRC/blob/HEAD/model/Planner.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1251c9ca621f80d2","code_sha256_prefix":"1251c9ca621f80d2","mcp_get_code":{"code_sha256":"1251c9ca621f80d2"}},{"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_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f3114ee33d500c6c","code_sha256_prefix":"f3114ee33d500c6c","mcp_get_code":{"code_sha256":"f3114ee33d500c6c"}},{"arxiv_id":"2502.12623","arxiv_id_is_arxiv":true,"paper":"/paper/deepresonance-enhancing-multimodal-music","title":"DeepResonance: Enhancing Multimodal Music Understanding via Music-centric Multi-way Instruction Tuning","date":"2025-02-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sony/DeepResonance","path":"code/model/deepresonance.py","file_url":"https://github.com/sony/DeepResonance/blob/HEAD/code/model/deepresonance.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c5c590da5a7c2a3f","code_sha256_prefix":"c5c590da5a7c2a3f","mcp_get_code":{"code_sha256":"c5c590da5a7c2a3f"}},{"arxiv_id":"2411.05289","arxiv_id_is_arxiv":true,"paper":"/paper/spechub-provable-acceleration-to-multi-draft","title":"SpecHub: Provable Acceleration to Multi-Draft Speculative Decoding","date":"2024-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mastergodzilla/speculative_decoding_ot","path":"Sequoia/Tree/SpecTree.py","file_url":"https://github.com/mastergodzilla/speculative_decoding_ot/blob/HEAD/Sequoia/Tree/SpecTree.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, mastergodzilla/speculative_decoding_ot when it was checked","code_sha256":"3d5d12b34c6bc8f3","code_sha256_prefix":"3d5d12b34c6bc8f3","mcp_get_code":{"code_sha256":"3d5d12b34c6bc8f3"}},{"arxiv_id":"2406.12246","arxiv_id_is_arxiv":true,"paper":"/paper/trol-traversal-of-layers-for-large-language","title":"TroL: Traversal of Layers for Large Language and Vision Models","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ByungKwanLee/TroL","path":"trol/arch_internlm2/modeling_trol.py","file_url":"https://github.com/ByungKwanLee/TroL/blob/HEAD/trol/arch_internlm2/modeling_trol.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, ByungKwanLee/TroL when it was checked","code_sha256":"3a68636f8c901f91","code_sha256_prefix":"3a68636f8c901f91","mcp_get_code":{"code_sha256":"3a68636f8c901f91"}},{"arxiv_id":"2404.16710","arxiv_id_is_arxiv":true,"paper":"/paper/layer-skip-enabling-early-exit-inference-and","title":"LayerSkip: Enabling Early Exit Inference and Self-Speculative Decoding","date":"2024-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/layerskip","path":"self_speculation/llama_model_utils.py","file_url":"https://github.com/facebookresearch/layerskip/blob/HEAD/self_speculation/llama_model_utils.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, facebookresearch/layerskip (NOASSERTION)","code_sha256":"72d28356d328b1e1","code_sha256_prefix":"72d28356d328b1e1","mcp_get_code":{"code_sha256":"72d28356d328b1e1"}},{"arxiv_id":"2402.05140","arxiv_id_is_arxiv":true,"paper":"/paper/tag-llm-repurposing-general-purpose-llms-for","title":"Tag-LLM: Repurposing General-Purpose LLMs for Specialized Domains","date":"2024-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sjunhongshen/tag-llm","path":"src/tag_llama.py","file_url":"https://github.com/sjunhongshen/tag-llm/blob/HEAD/src/tag_llama.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, sjunhongshen/tag-llm when it was checked","code_sha256":"c0290d783d0faae8","code_sha256_prefix":"c0290d783d0faae8","mcp_get_code":{"code_sha256":"c0290d783d0faae8"}}],"record_sha256":"844bae36e2bc405d23322792bcf73d2bb7fc07005173d86bfbd629837caace6d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}