{"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/cls-acc","entry":"cls_acc","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":14,"n_papers_ran":1,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":0,"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":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":15,"n_places_pointer_only":5,"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":0,"ran_fixture":0,"ran":1,"unverified":4},"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":"2607.14125","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-14125","title":"CARPRT: Class-Aware Zero-Shot Prompt Reweighting for Black-Box Vision-Language Models","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"tmlr-group/CARPRT","path":"utils.py","file_url":"https://github.com/tmlr-group/CARPRT/blob/HEAD/utils.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, tmlr-group/CARPRT when it was checked","code_sha256":"f2a0a5061e7c204e","code_sha256_prefix":"f2a0a5061e7c204e","mcp_get_code":{"code_sha256":"f2a0a5061e7c204e"}},{"arxiv_id":"2603.24181","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-24181","title":"Unlocking Few-Shot Capabilities in LVLMs via Prompt Conditioning and Head Selection","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"gaopengcuhk/Tip-Adapter","path":"utils.py","file_url":"https://github.com/gaopengcuhk/Tip-Adapter/blob/HEAD/utils.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, gaopengcuhk/Tip-Adapter when it was checked","code_sha256":"f2a0a5061e7c204e","code_sha256_prefix":"f2a0a5061e7c204e","mcp_get_code":{"code_sha256":"f2a0a5061e7c204e"}},{"arxiv_id":"2603.24181","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-24181","title":"Unlocking Few-Shot Capabilities in LVLMs via Prompt Conditioning and Head Selection","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"ybendou/ProKeR","path":"utils.py","file_url":"https://github.com/ybendou/ProKeR/blob/HEAD/utils.py","status":"unverified","verification_level":0,"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":"7d02d5cb2c679f65","code_sha256_prefix":"7d02d5cb2c679f65","mcp_get_code":{"code_sha256":"7d02d5cb2c679f65"}},{"arxiv_id":"2507.04511","arxiv_id_is_arxiv":true,"paper":"/paper/fa-forced-prompt-learning-of-vision-language","title":"FA: Forced Prompt Learning of Vision-Language Models for Out-of-Distribution Detection","date":"2025-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"0xFAFA/FA","path":"utils.py","file_url":"https://github.com/0xFAFA/FA/blob/HEAD/utils.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, 0xFAFA/FA when it was checked","code_sha256":"f2a0a5061e7c204e","code_sha256_prefix":"f2a0a5061e7c204e","mcp_get_code":{"code_sha256":"f2a0a5061e7c204e"}},{"arxiv_id":"2506.20990","arxiv_id_is_arxiv":true,"paper":"/paper/sharpzo-hybrid-sharpness-aware-vision","title":"SharpZO: Hybrid Sharpness-Aware Vision Language Model Prompt Tuning via Forward-Only Passes","date":"2025-06-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yifanycc/sharpzo","path":"utils.py","file_url":"https://github.com/yifanycc/sharpzo/blob/HEAD/utils.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":"f2a0a5061e7c204e","code_sha256_prefix":"f2a0a5061e7c204e","mcp_get_code":{"code_sha256":"f2a0a5061e7c204e"}},{"arxiv_id":"2503.11609","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-few-shot-adaptation-of-vision","title":"Rethinking Few-Shot Adaptation of Vision-Language Models in Two Stages","date":"2025-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FarinaMatteo/rethinking_fewshot_vlms","path":"fs/twostage.py","file_url":"https://github.com/FarinaMatteo/rethinking_fewshot_vlms/blob/HEAD/fs/twostage.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":"f2a0a5061e7c204e","code_sha256_prefix":"f2a0a5061e7c204e","mcp_get_code":{"code_sha256":"f2a0a5061e7c204e"}},{"arxiv_id":"2406.00345","arxiv_id_is_arxiv":true,"paper":"/paper/decoop-robust-prompt-tuning-with-out-of","title":"DeCoOp: Robust Prompt Tuning with Out-of-Distribution Detection","date":"2024-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WNJXYK/DeCoOp","path":"utils/util_algo.py","file_url":"https://github.com/WNJXYK/DeCoOp/blob/HEAD/utils/util_algo.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":"f2a0a5061e7c204e","code_sha256_prefix":"f2a0a5061e7c204e","mcp_get_code":{"code_sha256":"f2a0a5061e7c204e"}},{"arxiv_id":"2404.17753","arxiv_id_is_arxiv":true,"paper":"/paper/leveraging-cross-modal-neighbor","title":"Leveraging Cross-Modal Neighbor Representation for Improved CLIP Classification","date":"2024-04-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ycaigogogo/cvpr24-coder","path":"utils.py","file_url":"https://github.com/ycaigogogo/cvpr24-coder/blob/HEAD/utils.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, ycaigogogo/cvpr24-coder when it was checked","code_sha256":"f2a0a5061e7c204e","code_sha256_prefix":"f2a0a5061e7c204e","mcp_get_code":{"code_sha256":"f2a0a5061e7c204e"}},{"arxiv_id":"2403.17589","arxiv_id_is_arxiv":true,"paper":"/paper/dual-memory-networks-a-versatile-adaptation","title":"Dual Memory Networks: A Versatile Adaptation Approach for Vision-Language Models","date":"2024-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YBZh/DMN","path":"dmn_main.py","file_url":"https://github.com/YBZh/DMN/blob/HEAD/dmn_main.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":"f2a0a5061e7c204e","code_sha256_prefix":"f2a0a5061e7c204e","mcp_get_code":{"code_sha256":"f2a0a5061e7c204e"}},{"arxiv_id":"2403.12964","arxiv_id_is_arxiv":true,"paper":"/paper/negative-yields-positive-unified-dual-path","title":"Enhancing Vision-Language Few-Shot Adaptation with Negative Learning","date":"2024-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangce01/dualadapter","path":"utils.py","file_url":"https://github.com/zhangce01/dualadapter/blob/HEAD/utils.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":"f2a0a5061e7c204e","code_sha256_prefix":"f2a0a5061e7c204e","mcp_get_code":{"code_sha256":"f2a0a5061e7c204e"}},{"arxiv_id":"2403.02649","arxiv_id_is_arxiv":true,"paper":"/paper/few-shot-learner-parameterization-by","title":"Few-shot Learner Parameterization by Diffusion Time-steps","date":"2024-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yue-zhongqi/tif","path":"inference/methods/utils.py","file_url":"https://github.com/yue-zhongqi/tif/blob/HEAD/inference/methods/utils.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, yue-zhongqi/tif when it was checked","code_sha256":"9e8ac1cb3c9bd571","code_sha256_prefix":"9e8ac1cb3c9bd571","mcp_get_code":{"code_sha256":"9e8ac1cb3c9bd571"}},{"arxiv_id":"2211.14946","arxiv_id_is_arxiv":true,"paper":"/paper/self-destructing-models-increasing-the-costs","title":"Self-Destructing Models: Increasing the Costs of Harmful Dual Uses of Foundation Models","date":"2022-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"breakend/selfdestructingmodels","path":"losses.py","file_url":"https://github.com/breakend/selfdestructingmodels/blob/HEAD/losses.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6f267b477822c370","code_sha256_prefix":"6f267b477822c370","mcp_get_code":{"code_sha256":"6f267b477822c370"}},{"arxiv_id":"2210.01253","arxiv_id_is_arxiv":true,"paper":"/paper/prompt-learning-with-optimal-transport-for","title":"PLOT: Prompt Learning with Optimal Transport for Vision-Language Models","date":"2022-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CHENGY12/PLOT","path":"plot-adapter/utils.py","file_url":"https://github.com/CHENGY12/PLOT/blob/HEAD/plot-adapter/utils.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":"f2a0a5061e7c204e","code_sha256_prefix":"f2a0a5061e7c204e","mcp_get_code":{"code_sha256":"f2a0a5061e7c204e"}},{"arxiv_id":"1907.10915","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-domain-adaptation-for","title":"Self-supervised Domain Adaptation for Computer Vision Tasks","date":"2019-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jiaolong/self-supervised-da","path":"utils/utils.py","file_url":"https://github.com/Jiaolong/self-supervised-da/blob/HEAD/utils/utils.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":"6cb84574882c7a60","code_sha256_prefix":"6cb84574882c7a60","mcp_get_code":{"code_sha256":"6cb84574882c7a60"}},{"arxiv_id":"ijcai2025_0115","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2025_0115","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Gwxer/Hierarchical-Adapter","path":"tda_help.py","file_url":"https://github.com/Gwxer/Hierarchical-Adapter/blob/HEAD/tda_help.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":"f2a0a5061e7c204e","code_sha256_prefix":"f2a0a5061e7c204e","mcp_get_code":{"code_sha256":"f2a0a5061e7c204e"}}],"record_sha256":"9ae5da6eafad256126689b051790ff0e7265591fa921185c00042a36b7c52415","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}