{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/clipattention","entry":"CLIPAttention","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":3,"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":5,"n_samples_ran":3,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":2},"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":"2502.11431","paper":"/paper/any-information-is-just-worth-one-single","title":"Any Information Is Just Worth One Single Screenshot: Unifying Search With Visualized Information Retrieval","date":"2025-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VectorSpaceLab/MegaPairs","path":"modeling_MMRet_CLIP.py","file_url":"https://github.com/VectorSpaceLab/MegaPairs/blob/HEAD/modeling_MMRet_CLIP.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"4683a9a2727a0c39","mcp_get_code":{"code_sha256":"4683a9a2727a0c39"}},{"arxiv_id":"2409.15657","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2fac88833404a422","mcp_get_code":{"code_sha256":"2fac88833404a422"}},{"arxiv_id":"2403.20231","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"558cf5130888f74c","mcp_get_code":{"code_sha256":"558cf5130888f74c"}},{"arxiv_id":"2308.07648","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4c0e317bbad36a96","mcp_get_code":{"code_sha256":"4c0e317bbad36a96"}},{"arxiv_id":"2210.00312","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"bc71a7b0ac64e193","mcp_get_code":{"code_sha256":"bc71a7b0ac64e193"}}]}