{"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/find-best-lrwd","entry":"find_best_lrwd","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":6,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":13,"n_places_pointer_only":12,"n_places_pointer_only_link_open":3,"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":5,"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":"2411.01327","arxiv_id_is_arxiv":true,"paper":"/paper/visual-fourier-prompt-tuning","title":"Visual Fourier Prompt Tuning","date":"2024-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"runtsang/VFPT","path":"tune_fgvc_final.py","file_url":"https://github.com/runtsang/VFPT/blob/HEAD/tune_fgvc_final.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"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, runtsang/VFPT (NOASSERTION)","code_sha256":"3e009472c0d2fa50","code_sha256_prefix":"3e009472c0d2fa50","mcp_get_code":{"code_sha256":"3e009472c0d2fa50"}},{"arxiv_id":"2401.12902","arxiv_id_is_arxiv":true,"paper":"/paper/facing-the-elephant-in-the-room-visual-prompt","title":"Facing the Elephant in the Room: Visual Prompt Tuning or Full Finetuning?","date":"2024-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChengHan111/VPT-or-FT","path":"tune_vtab_PruningRewind_CVK_imagenet1k.py","file_url":"https://github.com/ChengHan111/VPT-or-FT/blob/HEAD/tune_vtab_PruningRewind_CVK_imagenet1k.py","status":"ran","verification_level":1,"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, ChengHan111/VPT-or-FT when it was checked","code_sha256":"3e009472c0d2fa50","code_sha256_prefix":"3e009472c0d2fa50","mcp_get_code":{"code_sha256":"3e009472c0d2fa50"}},{"arxiv_id":"2401.12902","arxiv_id_is_arxiv":true,"paper":"/paper/facing-the-elephant-in-the-room-visual-prompt","title":"Facing the Elephant in the Room: Visual Prompt Tuning or Full Finetuning?","date":"2024-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChengHan111/VPT-or-FT","path":"five_runs_fgvc.py","file_url":"https://github.com/ChengHan111/VPT-or-FT/blob/HEAD/five_runs_fgvc.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"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, ChengHan111/VPT-or-FT (NOASSERTION)","code_sha256":"f24fe10a4c3795a2","code_sha256_prefix":"f24fe10a4c3795a2","mcp_get_code":{"code_sha256":"f24fe10a4c3795a2"}},{"arxiv_id":"2401.12902","arxiv_id_is_arxiv":true,"paper":"/paper/facing-the-elephant-in-the-room-visual-prompt","title":"Facing the Elephant in the Room: Visual Prompt Tuning or Full Finetuning?","date":"2024-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChengHan111/VPT-or-FT","path":"tune_fgvc_fiveRuns.py","file_url":"https://github.com/ChengHan111/VPT-or-FT/blob/HEAD/tune_fgvc_fiveRuns.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"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, ChengHan111/VPT-or-FT (NOASSERTION)","code_sha256":"0f806382f4ff9673","code_sha256_prefix":"0f806382f4ff9673","mcp_get_code":{"code_sha256":"0f806382f4ff9673"}},{"arxiv_id":"2401.12902","arxiv_id_is_arxiv":true,"paper":"/paper/facing-the-elephant-in-the-room-visual-prompt","title":"Facing the Elephant in the Room: Visual Prompt Tuning or Full Finetuning?","date":"2024-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChengHan111/VPT-or-FT","path":"tune_vtab_AS.py","file_url":"https://github.com/ChengHan111/VPT-or-FT/blob/HEAD/tune_vtab_AS.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"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, ChengHan111/VPT-or-FT (NOASSERTION)","code_sha256":"96cd94d7836ffe52","code_sha256_prefix":"96cd94d7836ffe52","mcp_get_code":{"code_sha256":"96cd94d7836ffe52"}},{"arxiv_id":"2312.10376","arxiv_id_is_arxiv":true,"paper":"/paper/sa-2-vp-spatially-aligned-and-adapted-visual","title":"SA$^2$VP: Spatially Aligned-and-Adapted Visual Prompt","date":"2023-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tommy-xq/sa2vp","path":"vpt_main/tune_vtab.py","file_url":"https://github.com/tommy-xq/sa2vp/blob/HEAD/vpt_main/tune_vtab.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from runtsang/VFPT, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"3e009472c0d2fa50","code_sha256_prefix":"3e009472c0d2fa50","mcp_get_code":{"code_sha256":"3e009472c0d2fa50"}},{"arxiv_id":"2307.13770","arxiv_id_is_arxiv":true,"paper":"/paper/e-2vpt-an-effective-and-efficient-approach","title":"E^2VPT: An Effective and Efficient Approach for Visual Prompt Tuning","date":"2023-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenghan111/e2vpt","path":"tune_vtab_PruningRewind_CVK_imagenet1k.py","file_url":"https://github.com/chenghan111/e2vpt/blob/HEAD/tune_vtab_PruningRewind_CVK_imagenet1k.py","status":"ran","verification_level":1,"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, chenghan111/e2vpt when it was checked","code_sha256":"3e009472c0d2fa50","code_sha256_prefix":"3e009472c0d2fa50","mcp_get_code":{"code_sha256":"3e009472c0d2fa50"}},{"arxiv_id":"2307.13770","arxiv_id_is_arxiv":true,"paper":"/paper/e-2vpt-an-effective-and-efficient-approach","title":"E^2VPT: An Effective and Efficient Approach for Visual Prompt Tuning","date":"2023-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenghan111/e2vpt","path":"five_runs_fgvc.py","file_url":"https://github.com/chenghan111/e2vpt/blob/HEAD/five_runs_fgvc.py","status":"ran","verification_level":1,"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, chenghan111/e2vpt when it was checked","code_sha256":"f24fe10a4c3795a2","code_sha256_prefix":"f24fe10a4c3795a2","mcp_get_code":{"code_sha256":"f24fe10a4c3795a2"}},{"arxiv_id":"2307.13770","arxiv_id_is_arxiv":true,"paper":"/paper/e-2vpt-an-effective-and-efficient-approach","title":"E^2VPT: An Effective and Efficient Approach for Visual Prompt Tuning","date":"2023-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenghan111/e2vpt","path":"tune_fgvc_fiveRuns.py","file_url":"https://github.com/chenghan111/e2vpt/blob/HEAD/tune_fgvc_fiveRuns.py","status":"ran","verification_level":1,"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, chenghan111/e2vpt when it was checked","code_sha256":"0f806382f4ff9673","code_sha256_prefix":"0f806382f4ff9673","mcp_get_code":{"code_sha256":"0f806382f4ff9673"}},{"arxiv_id":"2307.13770","arxiv_id_is_arxiv":true,"paper":"/paper/e-2vpt-an-effective-and-efficient-approach","title":"E^2VPT: An Effective and Efficient Approach for Visual Prompt Tuning","date":"2023-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenghan111/e2vpt","path":"tune_vtab_AS.py","file_url":"https://github.com/chenghan111/e2vpt/blob/HEAD/tune_vtab_AS.py","status":"ran","verification_level":1,"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, chenghan111/e2vpt when it was checked","code_sha256":"96cd94d7836ffe52","code_sha256_prefix":"96cd94d7836ffe52","mcp_get_code":{"code_sha256":"96cd94d7836ffe52"}},{"arxiv_id":"2212.03220","arxiv_id_is_arxiv":true,"paper":"/paper/visual-query-tuning-towards-effective-usage","title":"Visual Query Tuning: Towards Effective Usage of Intermediate Representations for Parameter and Memory Efficient Transfer Learning","date":"2022-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andytu28/VQT","path":"tune_vtab.py","file_url":"https://github.com/andytu28/VQT/blob/HEAD/tune_vtab.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (BSD-3-Clause), but get_code serves the stored copy, first harvested from runtsang/VFPT, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"3e009472c0d2fa50","code_sha256_prefix":"3e009472c0d2fa50","mcp_get_code":{"code_sha256":"3e009472c0d2fa50"}},{"arxiv_id":"2212.03220","arxiv_id_is_arxiv":true,"paper":"/paper/visual-query-tuning-towards-effective-usage","title":"Visual Query Tuning: Towards Effective Usage of Intermediate Representations for Parameter and Memory Efficient Transfer Learning","date":"2022-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andytu28/VQT","path":"head2toe_sparsity_train.py","file_url":"https://github.com/andytu28/VQT/blob/HEAD/head2toe_sparsity_train.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"51201372d14e1a56","code_sha256_prefix":"51201372d14e1a56","mcp_get_code":{"code_sha256":"51201372d14e1a56"}},{"arxiv_id":"aaai_28243","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_28243","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"tommy-xq/SA2VP","path":"vpt_main/tune_vtab.py","file_url":"https://github.com/tommy-xq/SA2VP/blob/HEAD/vpt_main/tune_vtab.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from runtsang/VFPT, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"3e009472c0d2fa50","code_sha256_prefix":"3e009472c0d2fa50","mcp_get_code":{"code_sha256":"3e009472c0d2fa50"}}],"record_sha256":"c1cfceada4346be1a172490b7eaed1f7cc2f255978215610d1e7ab330cb1ad34","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}