{"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":"/paper/learning-to-prompt-for-vision-language-models","title":"Learning to Prompt for Vision-Language Models","arxiv_id":"2109.01134","date":"2021-09-02","proceeding":null,"authors":["Kaiyang Zhou","Jingkang Yang","Chen Change Loy","Ziwei Liu"],"abstract":"Large pre-trained vision-language models like CLIP have shown great potential in learning representations that are transferable across a wide range of downstream tasks. Different from the traditional representation learning that is based mostly on discretized labels, vision-language pre-training aligns images and texts in a common feature space, which allows zero-shot transfer to a downstream task via prompting, i.e., classification weights are synthesized from natural language describing classes of interest. In this work, we show that a major challenge for deploying such models in practice is prompt engineering, which requires domain expertise and is extremely time-consuming -- one needs to spend a significant amount of time on words tuning since a slight change in wording could have a huge impact on performance. Inspired by recent advances in prompt learning research in natural language processing (NLP), we propose Context Optimization (CoOp), a simple approach specifically for adapting CLIP-like vision-language models for downstream image recognition. Concretely, CoOp models a prompt's context words with learnable vectors while the entire pre-trained parameters are kept fixed. To handle different image recognition tasks, we provide two implementations of CoOp: unified context and class-specific context. Through extensive experiments on 11 datasets, we demonstrate that CoOp requires as few as one or two shots to beat hand-crafted prompts with a decent margin and is able to gain significant improvements over prompt engineering with more shots, e.g., with 16 shots the average gain is around 15% (with the highest reaching over 45%). Despite being a learning-based approach, CoOp achieves superb domain generalization performance compared with the zero-shot model using hand-crafted prompts.","url_abs":"https://arxiv.org/abs/2109.01134v6","url_pdf":"https://arxiv.org/pdf/2109.01134v6.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"learning-to-prompt-for-vision-language-models","repo_url":"https://github.com/kaiyangzhou/coop","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"learning-to-prompt-for-vision-language-models","repo_url":"https://github.com/ArsenalCheng/Meta-Adapter","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"learning-to-prompt-for-vision-language-models","repo_url":"https://github.com/Gahyeonkim09/AAPL","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"learning-to-prompt-for-vision-language-models","repo_url":"https://github.com/ThomasWangY/2024-AAAI-HPT","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"learning-to-prompt-for-vision-language-models","repo_url":"https://github.com/Vill-Lab/2024-TIP-MetaPrompt","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"learning-to-prompt-for-vision-language-models","repo_url":"https://github.com/YangYongJin/APEX","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"learning-to-prompt-for-vision-language-models","repo_url":"https://github.com/azshue/TPT","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"learning-to-prompt-for-vision-language-models","repo_url":"https://github.com/farinamatteo/zero","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"learning-to-prompt-for-vision-language-models","repo_url":"https://github.com/healthx-lab/biomedcoop","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"learning-to-prompt-for-vision-language-models","repo_url":"https://github.com/hhenryd/tap","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"learning-to-prompt-for-vision-language-models","repo_url":"https://github.com/kaiyangzhou/on-device-dg","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"NOASSERTION"}},{"paper_slug":"learning-to-prompt-for-vision-language-models","repo_url":"https://github.com/kenomo/industrial-clip","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"learning-to-prompt-for-vision-language-models","repo_url":"https://github.com/mlvlab/dapt","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"learning-to-prompt-for-vision-language-models","repo_url":"https://github.com/muzairkhattak/multimodal-prompt-learning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"learning-to-prompt-for-vision-language-models","repo_url":"https://github.com/muzairkhattak/protext","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"learning-to-prompt-for-vision-language-models","repo_url":"https://github.com/saic-fi/bayesian-prompt-learning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"learning-to-prompt-for-vision-language-models","repo_url":"https://github.com/srvcodes/clap4clip","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"learning-to-prompt-for-vision-language-models","repo_url":"https://github.com/vill-lab/2024-aaai-hpt","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"domain-generalization","task_name":"Domain Generalization"},{"task_slug":"few-shot-age-estimation","task_name":"Few-shot Age Estimation"},{"task_slug":"prompt-engineering","task_name":"Prompt Engineering"},{"task_slug":"prompt-learning","task_name":"Prompt Learning"},{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[{"method_slug":"clip","method_name":"CLIP"},{"method_slug":"coop","method_name":"CoOp"}],"datasets_introduced":[],"methods_introduced":[{"slug":"coop","name":"CoOp","full_name":"Context Optimization"}],"results":[{"leaderboard":"/sota/few-shot-age-estimation-on-morph-album2","task":"Few-shot Age Estimation","dataset":"MORPH Album2","model":"CoOp","rank_in_archive_order":2,"of":2,"metrics":{"MAE":"5.09","MAE (16 shot)":"3.23","MAE (2 shot)":"4.50","MAE (4 shot)":"3.81","MAE (8 shot)":"3.57"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2109.01134","atlas_url":"https://app.syntology.ai/?focus=2109.01134","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.01134"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2109.01134"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2109.01134"},"call":"get_harvested_code_for_paper(arxiv_id=\"2109.01134\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2109.01134"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2109.01134\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2109.01134"},"call":"get_concepts_for_paper(arxiv_id=\"2109.01134\")"}],"by_repo":[{"repo":"kaiyangzhou/coop","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2303.13283"],"harvested_for_calls":[{"arxiv_id":"2303.13283","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2303.13283"},"call":"get_harvested_code_for_paper(arxiv_id=\"2303.13283\")"}]},{"repo":"ArsenalCheng/Meta-Adapter","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2207.09519"],"harvested_for_calls":[{"arxiv_id":"2207.09519","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2207.09519"},"call":"get_harvested_code_for_paper(arxiv_id=\"2207.09519\")"}]},{"repo":"Gahyeonkim09/AAPL","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2203.05557"],"harvested_for_calls":[{"arxiv_id":"2203.05557","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2203.05557"},"call":"get_harvested_code_for_paper(arxiv_id=\"2203.05557\")"}]},{"repo":"ThomasWangY/2024-AAAI-HPT","kind":"listed","samples":1,"ran":1,"instrument":0,"unverified":0},{"repo":"Vill-Lab/2024-TIP-MetaPrompt","kind":"listed","samples":1,"ran":0,"instrument":0,"unverified":1},{"repo":"YangYongJin/APEX","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"azshue/TPT","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2209.07511"],"harvested_for_calls":[{"arxiv_id":"2209.07511","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2209.07511"},"call":"get_harvested_code_for_paper(arxiv_id=\"2209.07511\")"}]},{"repo":"farinamatteo/zero","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2405.18330"],"harvested_for_calls":[{"arxiv_id":"2405.18330","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2405.18330"},"call":"get_harvested_code_for_paper(arxiv_id=\"2405.18330\")"}]},{"repo":"healthx-lab/biomedcoop","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["Koleilat_BiomedCoOp_Learning_to_Prompt_for_Biomedical_Vision-Language_Models_CVPR_2025_paper"],"harvested_for_calls":[]},{"repo":"hhenryd/tap","kind":"listed","samples":10,"ran":2,"instrument":1,"unverified":8},{"repo":"kaiyangzhou/on-device-dg","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"kenomo/industrial-clip","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2110.04544"],"harvested_for_calls":[{"arxiv_id":"2110.04544","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2110.04544"},"call":"get_harvested_code_for_paper(arxiv_id=\"2110.04544\")"}]},{"repo":"mlvlab/dapt","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2309.03406"],"harvested_for_calls":[{"arxiv_id":"2309.03406","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2309.03406"},"call":"get_harvested_code_for_paper(arxiv_id=\"2309.03406\")"}]},{"repo":"muzairkhattak/multimodal-prompt-learning","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2210.03117"],"harvested_for_calls":[{"arxiv_id":"2210.03117","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2210.03117"},"call":"get_harvested_code_for_paper(arxiv_id=\"2210.03117\")"}]},{"repo":"muzairkhattak/protext","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2401.02418"],"harvested_for_calls":[{"arxiv_id":"2401.02418","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2401.02418"},"call":"get_harvested_code_for_paper(arxiv_id=\"2401.02418\")"}]},{"repo":"saic-fi/bayesian-prompt-learning","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2210.02390"],"harvested_for_calls":[{"arxiv_id":"2210.02390","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2210.02390"},"call":"get_harvested_code_for_paper(arxiv_id=\"2210.02390\")"}]},{"repo":"srvcodes/clap4clip","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2403.19137"],"harvested_for_calls":[{"arxiv_id":"2403.19137","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2403.19137"},"call":"get_harvested_code_for_paper(arxiv_id=\"2403.19137\")"}]},{"repo":"vill-lab/2024-aaai-hpt","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["2312.06323","aaai_28387"],"harvested_for_calls":[{"arxiv_id":"2312.06323","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2312.06323"},"call":"get_harvested_code_for_paper(arxiv_id=\"2312.06323\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","assemblies":[{"assembly_sha256":"13d6da24a69a6b36","source_kind":"harvested","method_name":"Context Optimization (CoOp)","realizes_method":"Context Optimization (CoOp)","graph_method":"Context Optimization (CoOp)","realizes_severed":false,"claim":"Implements learnable text prompts for vision-language models to optimize context for downstream tasks.","centrality":"contribution","entry":"PromptLearner","entry_sha256":"8a2b72f24481ca15","n_bricks":1,"bricks":[{"entry":"PromptLearner","code_sha256":"8a2b72f24481ca15","role":"entry","order":0,"level":1,"status":"ran"}],"ran_individually":1,"ran_individually_constructed":1,"ran_individually_by_status":{"ran":1},"end_to_end":{"ran":false,"level":0},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"judge:global.anthropic.claude-sonnet-4-5-20250929-v1:0","claim_match_judges":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"label_verdict":"matches","label_verdict_judged":true,"suggested_method":null,"batch_at":"2026-09-09T22:44:46+00:00","sibling_group":"3f5c3d3cddb5","n_siblings":2,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"},{"assembly_sha256":"ac0e28cbbd7bfac9","source_kind":"harvested","method_name":"Context Optimization (CoOp)","realizes_method":"Context Optimization (CoOp)","graph_method":"Context Optimization (CoOp)","realizes_severed":false,"claim":"The code implements Context Optimization (CoOp), which learns continuous prompt representations for vision-language models instead of using fixed hand-crafted prompts.","centrality":"contribution","entry":"PromptLearner","entry_sha256":"39be90830c4c1621","n_bricks":1,"bricks":[{"entry":"PromptLearner","code_sha256":"39be90830c4c1621","role":"entry","order":0,"level":0,"status":"unverified"}],"ran_individually":0,"ran_individually_constructed":0,"ran_individually_by_status":{},"end_to_end":{"ran":false,"level":0},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"judge:global.anthropic.claude-sonnet-4-5-20250929-v1:0","claim_match_judges":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"label_verdict":"matches","label_verdict_judged":true,"suggested_method":null,"batch_at":"2026-09-09T22:44:46+00:00","sibling_group":"3f5c3d3cddb5","n_siblings":2,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"},{"assembly_sha256":"f6a59cd26cc14138","source_kind":"harvested","method_name":"Context Optimization (CoOp)","realizes_method":"Context Optimization (CoOp)","graph_method":"Context Optimization (CoOp)","realizes_severed":false,"claim":"The code implements Context Optimization (CoOp) by learning visual and text prompts for vision-language models to improve transferability to downstream tasks.","centrality":"contribution","entry":"CustomCLIP_TAP","entry_sha256":"7c02c9c890628418","n_bricks":13,"bricks":[{"entry":"CustomCLIP_TAP","code_sha256":"7c02c9c890628418","role":"entry","order":0,"level":0,"status":"unverified"},{"entry":"TextEncoder","code_sha256":"c1fabc9fbf753209","role":"model","order":1,"level":0,"status":"unverified"},{"entry":"TextPromptLearner","code_sha256":"0746a2da2f73c0eb","role":"model","order":2,"level":0,"status":"unverified"},{"entry":"VisualEncoder","code_sha256":"e1f5a7fb2fb95e19","role":"model","order":3,"level":0,"status":"unverified"},{"entry":"VisualPromptLearner","code_sha256":"d75235fc5acba1a6","role":"model","order":4,"level":0,"status":"unverified"},{"entry":"load_clip_to_cpu","code_sha256":"0f982cfc0f69d842","role":"helper","order":5,"level":0,"status":"unverified"},{"entry":"wordify","code_sha256":"1812ba359126089a","role":"helper","order":6,"level":1,"status":"ran_draft_wrong"},{"entry":"make_description_batch","code_sha256":"c568c664a705cfa6","role":"helper","order":7,"level":1,"status":"ran_draft_wrong"},{"entry":"load_gpt_descriptions","code_sha256":"bf5154cf822c8f6a","role":"helper","order":8,"level":0,"status":"unverified"},{"entry":"AttentionPooling","code_sha256":"e8079fe48af584cb","role":"model","order":9,"level":0,"status":"unverified"},{"entry":"LayerNorm","code_sha256":"4f7191c8173fb1eb","role":"helper","order":10,"level":1,"status":"ran"},{"entry":"load_json","code_sha256":"1069918b276d2855","role":"helper","order":11,"level":1,"status":"ran_draft_wrong"},{"entry":"CrossAttention","code_sha256":"aa2102c5842a8045","role":"model","order":12,"level":1,"status":"ran"}],"ran_individually":5,"ran_individually_constructed":1,"ran_individually_by_status":{"ran":2,"ran_draft_wrong":3},"end_to_end":{"ran":false,"level":0},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"judge:global.anthropic.claude-sonnet-4-5-20250929-v1:0","claim_match_judges":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"label_verdict":"matches","label_verdict_judged":true,"suggested_method":null,"batch_at":"2026-09-09T22:44:46+00:00","sibling_group":"3f5c3d3cddb5","n_siblings":2,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"}],"assembly_sibling_groups":[{"group":"3f5c3d3cddb5","realizes_method":"Context Optimization (CoOp)","source_kind":"harvested","batch_at":"2026-09-09T22:44:46+00:00","members":["13d6da24a69a6b36","ac0e28cbbd7bfac9","f6a59cd26cc14138"]}],"assemblies_is":{"about":"What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results.","harvested":"assembled from code harvested from a repository linked to the paper","generated":"generated from the paper text, not the repository's code","end_to_end":"for a harvested assembly, the assembly has not been run end-to-end; for a generated one, end_to_end.level is the assembly's own level and against_independent_peer says whether it ran against a peer: an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists","bricks_level":"each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level","ran_individually":"a COUNT of bricks that ran on their own on a fixture (split by status in ran_individually_by_status), not a level; instrument statuses are failures of Syntology's instrument, not of the code","siblings":"assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another","judged":"Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as \"by construction\" or \"not judged by a model\"","level_lowered":"a generated assembly whose level Syntology's graph lowered, with the level it had, the recorded reason and when","retention":"Syntology's spending triage for further verification, not a verdict","claim_match":"the claim_match vote: IMPLEMENTS, COMPONENT or UNCLEAR. Where claim_match_basis is \"judge:<model>\", it is one model's judgement of the assembly's label against the paper's claim (claim_match_rule single_judge, the model in claim_match_judges): not a verification and not a run. Where it is \"construction\", the value was set when the code was generated for this method and no model judged it, whatever claim_match_rule says. The page prints no claim match for any assembly","label_verdict":"whether the assembly's code is the method it is labelled with: matches, cannot_tell, mislabelled (suggested_method names what it looks like instead) or not_the_method; label_verdict_judged is true only when a model read the code (claim_match_basis \"judge:<model>\")","label_verdict_judged":"where true (claim_match_basis \"judge:<model>\"), label_verdict is a single model's judgement; not calibrated; not printed on the page; where false, it was set by construction, and the page prints it unless the node is shared with another paper (node_properties_written_for)","claim":"the claim text stored on the assembly node: for a harvested assembly, what the paper claims the code implements, as the lifting model wrote it; for a generated one, the specification the code was generated from. Not verified text","centrality":"how central the lifted method is to the paper, as the lifting step recorded it: contribution, component or incidental","v3_tests_passed_both_sides":"end_to_end.v3_tests_passed_both_sides: the number of property tests derived from the paper that passed on both implementations, as the attached report lists them; a level 3 card with 0 says its report lists none","ran_individually_constructed":"ran_individually_constructed: of the bricks counted in ran_individually, how many constructed an object rather than computing a result (Syntology's RAN record's rule, read from the graph-layer sample with the brick's code_sha256); a part of ran_individually, never subtracted from it and never a failure; null where a brick that ran has no sample in the graph layer this build read, so the figure was not counted"},"assemblies_call":{"tool":"assembly","arguments":{"arxiv_id":"2109.01134"},"call":"assembly(arxiv_id=\"2109.01134\")"},"read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2109.01134.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2109.01134.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/vill-lab/2024-aaai-hpt","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/kenomo/industrial-clip","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/hhenryd/tap","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/ArsenalCheng/Meta-Adapter","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/ThomasWangY/2024-AAAI-HPT","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/saic-fi/bayesian-prompt-learning","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/kaiyangzhou/coop","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/farinamatteo/zero","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Gahyeonkim09/AAPL","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/kaiyangzhou/on-device-dg","reach":{"status":"ok","spdx":"NOASSERTION"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/srvcodes/clap4clip","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/muzairkhattak/protext","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/healthx-lab/biomedcoop","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/YangYongJin/APEX","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/mlvlab/dapt","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Vill-Lab/2024-TIP-MetaPrompt","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/azshue/TPT","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/muzairkhattak/multimodal-prompt-learning","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":2,"ran_draft_wrong":1,"unverified":9},"n_samples":12,"n_ran":3,"n_constructed":1,"n_ran_checked":2,"n_instrument":1,"n_unverified":9,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_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_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)"},"by_repo_kind":{"listed":{"samples":12,"ran":3,"n_ran_checked":2,"n_instrument":1,"repositories":3}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"official_not_harvested":{"repositories":["kaiyangzhou/coop"],"harvested_for_other_papers":[1],"samples_from_other_repositories":12,"other_repositories":3,"samples_unlocated":0},"n_pointer_only_for_licence":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_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":3,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-22","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"aa2102c5842a8045","code_sha256_prefix":"aa2102c5842a8045","entry":"CrossAttention","repo":"hhenryd/tap","repo_kind":"listed","path":"trainers/TAP.py","file_url":"https://github.com/hhenryd/tap/blob/HEAD/trainers/TAP.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"signature":"x:Tensor/3/float, attn_mask:Tensor/2/float","fixture_out_type":"Tensor","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/crossattention","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"aa2102c5842a8045"}},{"code_sha256":"8a2b72f24481ca15","code_sha256_prefix":"8a2b72f24481ca15","entry":"PromptLearner","repo":"ThomasWangY/2024-AAAI-HPT","repo_kind":"listed","path":"trainers/hpt.py","file_url":"https://github.com/ThomasWangY/2024-AAAI-HPT/blob/HEAD/trainers/hpt.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"fixture_out_type":"PromptLearner","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/promptlearner","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"8a2b72f24481ca15"}},{"code_sha256":"c568c664a705cfa6","code_sha256_prefix":"c568c664a705cfa6","entry":"make_description_batch","repo":"hhenryd/tap","repo_kind":"listed","path":"trainers/TAP.py","file_url":"https://github.com/hhenryd/tap/blob/HEAD/trainers/TAP.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"descriptor_text_prompt:dict/0/?, max_len_quantile:float/0/float","fixture_out_type":"tuple","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"c568c664a705cfa6"}},{"code_sha256":"e8079fe48af584cb","code_sha256_prefix":"e8079fe48af584cb","entry":"AttentionPooling","repo":"hhenryd/tap","repo_kind":"listed","path":"trainers/TAP.py","file_url":"https://github.com/hhenryd/tap/blob/HEAD/trainers/TAP.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/attentionpooling","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"e8079fe48af584cb"}},{"code_sha256":"7c02c9c890628418","code_sha256_prefix":"7c02c9c890628418","entry":"CustomCLIP_TAP","repo":"hhenryd/tap","repo_kind":"listed","path":"trainers/TAP.py","file_url":"https://github.com/hhenryd/tap/blob/HEAD/trainers/TAP.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"7c02c9c890628418"}},{"code_sha256":"39be90830c4c1621","code_sha256_prefix":"39be90830c4c1621","entry":"PromptLearner","repo":"Vill-Lab/2024-TIP-MetaPrompt","repo_kind":"listed","path":"trainers/meta.py","file_url":"https://github.com/Vill-Lab/2024-TIP-MetaPrompt/blob/HEAD/trainers/meta.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/promptlearner","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"39be90830c4c1621"}},{"code_sha256":"c1fabc9fbf753209","code_sha256_prefix":"c1fabc9fbf753209","entry":"TextEncoder","repo":"hhenryd/tap","repo_kind":"listed","path":"trainers/TAP.py","file_url":"https://github.com/hhenryd/tap/blob/HEAD/trainers/TAP.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/textencoder","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"c1fabc9fbf753209"}},{"code_sha256":"0746a2da2f73c0eb","code_sha256_prefix":"0746a2da2f73c0eb","entry":"TextPromptLearner","repo":"hhenryd/tap","repo_kind":"listed","path":"trainers/TAP.py","file_url":"https://github.com/hhenryd/tap/blob/HEAD/trainers/TAP.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"0746a2da2f73c0eb"}},{"code_sha256":"e1f5a7fb2fb95e19","code_sha256_prefix":"e1f5a7fb2fb95e19","entry":"VisualEncoder","repo":"hhenryd/tap","repo_kind":"listed","path":"trainers/TAP.py","file_url":"https://github.com/hhenryd/tap/blob/HEAD/trainers/TAP.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"e1f5a7fb2fb95e19"}},{"code_sha256":"d75235fc5acba1a6","code_sha256_prefix":"d75235fc5acba1a6","entry":"VisualPromptLearner","repo":"hhenryd/tap","repo_kind":"listed","path":"trainers/TAP.py","file_url":"https://github.com/hhenryd/tap/blob/HEAD/trainers/TAP.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"d75235fc5acba1a6"}},{"code_sha256":"0f982cfc0f69d842","code_sha256_prefix":"0f982cfc0f69d842","entry":"load_clip_to_cpu","repo":"hhenryd/tap","repo_kind":"listed","path":"trainers/TAP.py","file_url":"https://github.com/hhenryd/tap/blob/HEAD/trainers/TAP.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/load-clip-to-cpu","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"0f982cfc0f69d842"}},{"code_sha256":"bf5154cf822c8f6a","code_sha256_prefix":"bf5154cf822c8f6a","entry":"load_gpt_descriptions","repo":"hhenryd/tap","repo_kind":"listed","path":"trainers/TAP.py","file_url":"https://github.com/hhenryd/tap/blob/HEAD/trainers/TAP.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"bf5154cf822c8f6a"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"a308a4f8218b51b51daec1650e51b69ff708d1af5e99ffa314d7fbe9c96c8ccc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}