{"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/expand-mask","entry":"_expand_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":13,"n_papers_ran":13,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":13,"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":13,"n_samples_ran":13,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":13,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":13,"n_places_pointer_only":8,"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":13,"ran_fixture":0,"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":"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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9feb0283a043b65c","code_sha256_prefix":"9feb0283a043b65c","mcp_get_code":{"code_sha256":"9feb0283a043b65c"}},{"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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"61ecf291f8900bce","code_sha256_prefix":"61ecf291f8900bce","mcp_get_code":{"code_sha256":"61ecf291f8900bce"}},{"arxiv_id":"2502.00791","arxiv_id_is_arxiv":true,"paper":"/paper/vision-centric-token-compression-in-large","title":"Vision-centric Token Compression in Large Language Model","date":"2025-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CSU-JPG/VIST","path":"multimodal_model/model_architecture.py","file_url":"https://github.com/CSU-JPG/VIST/blob/HEAD/multimodal_model/model_architecture.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, CSU-JPG/VIST when it was checked","code_sha256":"3f110f8fcd0e3d4e","code_sha256_prefix":"3f110f8fcd0e3d4e","mcp_get_code":{"code_sha256":"3f110f8fcd0e3d4e"}},{"arxiv_id":"2409.15657","arxiv_id_is_arxiv":true,"paper":"/paper/mmpt-multimodal-prompt-tuning-for-zero-shot","title":"M$^2$PT: Multimodal Prompt Tuning for Zero-shot Instruction Learning","date":"2024-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"william-wang618/m2pt","path":"M2PT/model/llava_archPT.py","file_url":"https://github.com/william-wang618/m2pt/blob/HEAD/M2PT/model/llava_archPT.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, william-wang618/m2pt when it was checked","code_sha256":"0bac4ffb06162f12","code_sha256_prefix":"0bac4ffb06162f12","mcp_get_code":{"code_sha256":"0bac4ffb06162f12"}},{"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_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, ByungKwanLee/TroL when it was checked","code_sha256":"3794e953547aa39d","code_sha256_prefix":"3794e953547aa39d","mcp_get_code":{"code_sha256":"3794e953547aa39d"}},{"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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","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":"fc6b3d6f55e1835e","code_sha256_prefix":"fc6b3d6f55e1835e","mcp_get_code":{"code_sha256":"fc6b3d6f55e1835e"}},{"arxiv_id":"2403.20231","arxiv_id_is_arxiv":true,"paper":"/paper/u-vap-user-specified-visual-appearance","title":"U-VAP: User-specified Visual Appearance Personalization via Decoupled Self Augmentation","date":"2024-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ictmcg/u-vap","path":"models/modeling_clip.py","file_url":"https://github.com/ictmcg/u-vap/blob/HEAD/models/modeling_clip.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, ictmcg/u-vap when it was checked","code_sha256":"93c6887621a9f47c","code_sha256_prefix":"93c6887621a9f47c","mcp_get_code":{"code_sha256":"93c6887621a9f47c"}},{"arxiv_id":"2402.09611","arxiv_id_is_arxiv":true,"paper":"/paper/towards-privacy-aware-sign-language","title":"Towards Privacy-Aware Sign Language Translation at Scale","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/ssvp_slt","path":"src/ssvp_slt/modeling/sign_bart.py","file_url":"https://github.com/facebookresearch/ssvp_slt/blob/HEAD/src/ssvp_slt/modeling/sign_bart.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","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/ssvp_slt (NOASSERTION)","code_sha256":"24b08fbedd93aff0","code_sha256_prefix":"24b08fbedd93aff0","mcp_get_code":{"code_sha256":"24b08fbedd93aff0"}},{"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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","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":"a85227444bd04c75","code_sha256_prefix":"a85227444bd04c75","mcp_get_code":{"code_sha256":"a85227444bd04c75"}},{"arxiv_id":"2308.07648","arxiv_id_is_arxiv":true,"paper":"/paper/prompt-switch-efficient-clip-adaptation-for","title":"Prompt Switch: Efficient CLIP Adaptation for Text-Video Retrieval","date":"2023-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bladewaltz1/promptswitch","path":"model/prompt_clip.py","file_url":"https://github.com/bladewaltz1/promptswitch/blob/HEAD/model/prompt_clip.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, bladewaltz1/promptswitch when it was checked","code_sha256":"749dd08d5d7409f2","code_sha256_prefix":"749dd08d5d7409f2","mcp_get_code":{"code_sha256":"749dd08d5d7409f2"}},{"arxiv_id":"2210.00312","arxiv_id_is_arxiv":true,"paper":"/paper/multimodal-analogical-reasoning-over","title":"Multimodal Analogical Reasoning over Knowledge Graphs","date":"2022-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjunlp/MKG_Analogy","path":"MarT/models/modeling_clip.py","file_url":"https://github.com/zjunlp/MKG_Analogy/blob/HEAD/MarT/models/modeling_clip.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4b1fb3ae6a6d23fd","code_sha256_prefix":"4b1fb3ae6a6d23fd","mcp_get_code":{"code_sha256":"4b1fb3ae6a6d23fd"}},{"arxiv_id":"2204.05999","arxiv_id_is_arxiv":true,"paper":"/paper/incoder-a-generative-model-for-code-infilling","title":"InCoder: A Generative Model for Code Infilling and Synthesis","date":"2022-04-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eth-sri/sven","path":"sven/model.py","file_url":"https://github.com/eth-sri/sven/blob/HEAD/sven/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"775a840572f4ed73","code_sha256_prefix":"775a840572f4ed73","mcp_get_code":{"code_sha256":"775a840572f4ed73"}},{"arxiv_id":"1910.13461","arxiv_id_is_arxiv":true,"paper":"/paper/bart-denoising-sequence-to-sequence-pre","title":"BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehension","date":"2019-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qywu/memformers","path":"memformers/models/membart/modeling_membart.py","file_url":"https://github.com/qywu/memformers/blob/HEAD/memformers/models/membart/modeling_membart.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ff8c2ca593924bd0","code_sha256_prefix":"ff8c2ca593924bd0","mcp_get_code":{"code_sha256":"ff8c2ca593924bd0"}}],"record_sha256":"dcad60b61cc7178da11eac8c57f898d381efa76ba5bd7cd4ab0cd78ed178ab12","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}