{"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/making-pre-trained-language-models-better-few","title":"Making Pre-trained Language Models Better Few-shot Learners","arxiv_id":"2012.15723","date":"2020-12-31","proceeding":"ACL 2021 5","authors":["Tianyu Gao","Adam Fisch","Danqi Chen"],"abstract":"The recent GPT-3 model (Brown et al., 2020) achieves remarkable few-shot performance solely by leveraging a natural-language prompt and a few task demonstrations as input context. Inspired by their findings, we study few-shot learning in a more practical scenario, where we use smaller language models for which fine-tuning is computationally efficient. We present LM-BFF--better few-shot fine-tuning of language models--a suite of simple and complementary techniques for fine-tuning language models on a small number of annotated examples. Our approach includes (1) prompt-based fine-tuning together with a novel pipeline for automating prompt generation; and (2) a refined strategy for dynamically and selectively incorporating demonstrations into each context. Finally, we present a systematic evaluation for analyzing few-shot performance on a range of NLP tasks, including classification and regression. Our experiments demonstrate that our methods combine to dramatically outperform standard fine-tuning procedures in this low resource setting, achieving up to 30% absolute improvement, and 11% on average across all tasks. Our approach makes minimal assumptions on task resources and domain expertise, and hence constitutes a strong task-agnostic method for few-shot learning.","url_abs":"https://arxiv.org/abs/2012.15723v2","url_pdf":"https://arxiv.org/pdf/2012.15723v2.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":"making-pre-trained-language-models-better-few","repo_url":"https://github.com/princeton-nlp/LM-BFF","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"making-pre-trained-language-models-better-few","repo_url":"https://github.com/abdumaa/hiqualprop","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"making-pre-trained-language-models-better-few","repo_url":"https://github.com/alrope123/prompt-waywardness","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"making-pre-trained-language-models-better-few","repo_url":"https://github.com/facebookresearch/perfect","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"making-pre-trained-language-models-better-few","repo_url":"https://github.com/hannight/amulap","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"making-pre-trained-language-models-better-few","repo_url":"https://github.com/matthewcym/sflm","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"making-pre-trained-language-models-better-few","repo_url":"https://github.com/ucsb-nlp-chang/promptboosting","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"making-pre-trained-language-models-better-few","repo_url":"https://github.com/ukplab/emnlp2021-prompt-ft-heuristics","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"making-pre-trained-language-models-better-few","repo_url":"https://github.com/zhengxiangshi/powerfulpromptft","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"few-shot-learning","task_name":"Few-Shot Learning"},{"task_slug":"zero-shot-text-classification","task_name":"Zero-Shot Text Classification"}],"methods":[{"method_slug":"adam","method_name":"Adam"},{"method_slug":"attention","method_name":"Attention"},{"method_slug":"attention-dropout","method_name":"Attention Dropout"},{"method_slug":"bpe","method_name":"BPE"},{"method_slug":"cosine-annealing","method_name":"Cosine Annealing"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"dropout","method_name":"Dropout"},{"method_slug":"gpt-3","method_name":"GPT-3"},{"method_slug":"layer-normalization","method_name":"Layer Normalization"},{"method_slug":"linear-layer","method_name":"Linear Layer"},{"method_slug":"linear-warmup-with-cosine-annealing","method_name":"Linear Warmup With Cosine Annealing"},{"method_slug":"multi-head-attention","method_name":"Multi-Head Attention"},{"method_slug":"residual-connection","method_name":"Residual Connection"},{"method_slug":"softmax","method_name":"Softmax"},{"method_slug":"weight-decay","method_name":"Weight Decay"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2012.15723","atlas_url":"https://app.syntology.ai/?focus=2012.15723","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.15723"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2012.15723"},"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":"2012.15723"},"call":"get_harvested_code_for_paper(arxiv_id=\"2012.15723\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2012.15723"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2012.15723\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2012.15723"},"call":"get_concepts_for_paper(arxiv_id=\"2012.15723\")"}],"by_repo":[{"repo":"princeton-nlp/LM-BFF","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"abdumaa/hiqualprop","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1907.11692"],"harvested_for_calls":[{"arxiv_id":"1907.11692","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1907.11692"},"call":"get_harvested_code_for_paper(arxiv_id=\"1907.11692\")"}]},{"repo":"alrope123/prompt-waywardness","kind":"listed","samples":1,"ran":0,"instrument":0,"unverified":1},{"repo":"facebookresearch/perfect","kind":"listed","samples":1,"ran":1,"instrument":0,"unverified":0},{"repo":"hannight/amulap","kind":"listed","samples":1,"ran":0,"instrument":0,"unverified":1},{"repo":"matthewcym/sflm","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2110.01256"],"harvested_for_calls":[{"arxiv_id":"2110.01256","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2110.01256"},"call":"get_harvested_code_for_paper(arxiv_id=\"2110.01256\")"}]},{"repo":"ucsb-nlp-chang/promptboosting","kind":"listed","samples":6,"ran":1,"instrument":0,"unverified":5},{"repo":"ukplab/emnlp2021-prompt-ft-heuristics","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"zhengxiangshi/powerfulpromptft","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["2305.01711","2309.05173"],"harvested_for_calls":[{"arxiv_id":"2305.01711","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2305.01711"},"call":"get_harvested_code_for_paper(arxiv_id=\"2305.01711\")"},{"arxiv_id":"2309.05173","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2309.05173"},"call":"get_harvested_code_for_paper(arxiv_id=\"2309.05173\")"}]}],"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":"2ce1155be4c2f2b5","source_kind":"harvested","method_name":"LM-BFF","realizes_method":"LM-BFF","graph_method":"LM-BFF","realizes_severed":false,"claim":"This class implements LM-BFF, a method for making pre-trained language models better few-shot learners through prompt-based fine-tuning","centrality":"contribution","entry":"RobertaForPromptFinetuning","entry_sha256":"13e2332945c4e127","n_bricks":1,"bricks":[{"entry":"RobertaForPromptFinetuning","code_sha256":"13e2332945c4e127","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":"8b5a3f059047","n_siblings":3,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"},{"assembly_sha256":"bb79a7631fa2f9e6","source_kind":"harvested","method_name":"LM-BFF","realizes_method":"LM-BFF","graph_method":"LM-BFF","realizes_severed":false,"claim":"This code implements the LM-BFF method's prompt-based few-shot learning via an AdaBoost-style boosting approach (PromptBoosting) to improve few-shot performance of smaller language models using prompt tuning and verbalizers.","centrality":"contribution","entry":"PromptBoostingTrainer","entry_sha256":"2d2563d117bf30eb","n_bricks":8,"bricks":[{"entry":"PromptBoostingTrainer","code_sha256":"2d2563d117bf30eb","role":"entry","order":0,"level":0,"status":"unverified"},{"entry":"BaseMuticlsTrainer","code_sha256":"bf0624569417a8a0","role":"helper","order":1,"level":0,"status":"unverified"},{"entry":"RoBERTaVTuningClassification","code_sha256":"a61da81d2fd7eec9","role":"model","order":2,"level":0,"status":"unverified"},{"entry":"SentenceTemplate","code_sha256":"307acb49942e47f3","role":"helper","order":3,"level":1,"status":"ran"},{"entry":"TestPredictionSaver","code_sha256":"d6b16c1ebf5bf7fe","role":"helper","order":4,"level":0,"status":"unverified"},{"entry":"generate_multicls_l1_label_set_with_cache","code_sha256":"7424c5b4dbe4fa38","role":"helper","order":5,"level":0,"status":"unverified"},{"entry":"BaseModel","code_sha256":"3f1f55bc76a0d531","role":"helper","order":6,"level":1,"status":"ran"},{"entry":"VTuningOutput","code_sha256":"39f6235b4ac9a14c","role":"helper","order":7,"level":1,"status":"ran"}],"ran_individually":3,"ran_individually_constructed":2,"ran_individually_by_status":{"ran":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":"8b5a3f059047","n_siblings":3,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"},{"assembly_sha256":"d92152ceeb3b6fa3","source_kind":"harvested","method_name":"LM-BFF","realizes_method":"LM-BFF","graph_method":"LM-BFF","realizes_severed":false,"claim":"The paper claims this code implements the LM-BFF method, specifically the adapter layers that enable few-shot learning by fine-tuning pre-trained language models with minimal task-specific parameters.","centrality":"contribution","entry":"Adapter","entry_sha256":"848dfe9da2a6b283","n_bricks":2,"bricks":[{"entry":"Adapter","code_sha256":"848dfe9da2a6b283","role":"entry","order":0,"level":1,"status":"ran"},{"entry":"Activations","code_sha256":"0e80a734a30c23b9","role":"helper","order":1,"level":1,"status":"ran"}],"ran_individually":2,"ran_individually_constructed":1,"ran_individually_by_status":{"ran":2},"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":"8b5a3f059047","n_siblings":3,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"},{"assembly_sha256":"e28723874ff20c20","source_kind":"harvested","method_name":"LM-BFF","realizes_method":"LM-BFF","graph_method":"LM-BFF","realizes_severed":false,"claim":"The code implements prompt tuning for few-shot learning by adding trainable prompt embeddings to a pre-trained language model.","centrality":"contribution","entry":"MyEmbedding","entry_sha256":"bfe6f1322cece789","n_bricks":1,"bricks":[{"entry":"MyEmbedding","code_sha256":"bfe6f1322cece789","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":"8b5a3f059047","n_siblings":3,"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":"8b5a3f059047","realizes_method":"LM-BFF","source_kind":"harvested","batch_at":"2026-09-09T22:44:46+00:00","members":["2ce1155be4c2f2b5","bb79a7631fa2f9e6","d92152ceeb3b6fa3","e28723874ff20c20"]}],"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":"2012.15723"},"call":"assembly(arxiv_id=\"2012.15723\")"},"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/2012.15723.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/2012.15723.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/ucsb-nlp-chang/promptboosting","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/princeton-nlp/LM-BFF","reach":{"status":"unanswered"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/alrope123/prompt-waywardness","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/zhengxiangshi/powerfulpromptft","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/facebookresearch/perfect","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/matthewcym/sflm","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/abdumaa/hiqualprop","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/hannight/amulap","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/ukplab/emnlp2021-prompt-ft-heuristics","reach":{"status":"ok"}}],"summary":{"ran":2,"unverified":7},"n_samples":9,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":7,"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":9,"ran":2,"n_ran_checked":2,"n_instrument":0,"repositories":4}},"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":["princeton-nlp/LM-BFF"],"harvested_for_other_papers":[0],"samples_from_other_repositories":9,"other_repositories":4,"samples_unlocated":0},"n_pointer_only_for_licence":7,"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":2,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-24","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":"848dfe9da2a6b283","code_sha256_prefix":"848dfe9da2a6b283","entry":"Adapter","repo":"facebookresearch/perfect","repo_kind":"listed","path":"fewshot/adapters/adapter_modeling.py","file_url":"https://github.com/facebookresearch/perfect/blob/HEAD/fewshot/adapters/adapter_modeling.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/2/float","fixture_out_type":"Tensor","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/adapter","census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"848dfe9da2a6b283"}},{"code_sha256":"307acb49942e47f3","code_sha256_prefix":"307acb49942e47f3","entry":"SentenceTemplate","repo":"ucsb-nlp-chang/promptboosting","repo_kind":"listed","path":"src/multicls_trainer.py","file_url":"https://github.com/ucsb-nlp-chang/promptboosting/blob/HEAD/src/multicls_trainer.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"fixture_out_type":"str","level_recorded_at":"2026-09-24T15:16:18.137819+00:00","code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ucsb-nlp-chang/promptboosting when it was checked","mcp_get_code":{"code_sha256":"307acb49942e47f3"}},{"code_sha256":"bf0624569417a8a0","code_sha256_prefix":"bf0624569417a8a0","entry":"BaseMuticlsTrainer","repo":"ucsb-nlp-chang/promptboosting","repo_kind":"listed","path":"src/multicls_trainer.py","file_url":"https://github.com/ucsb-nlp-chang/promptboosting/blob/HEAD/src/multicls_trainer.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":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ucsb-nlp-chang/promptboosting when it was checked","mcp_get_code":{"code_sha256":"bf0624569417a8a0"}},{"code_sha256":"bfe6f1322cece789","code_sha256_prefix":"bfe6f1322cece789","entry":"MyEmbedding","repo":"alrope123/prompt-waywardness","repo_kind":"listed","path":"model_util.py","file_url":"https://github.com/alrope123/prompt-waywardness/blob/HEAD/model_util.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":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, alrope123/prompt-waywardness when it was checked","mcp_get_code":{"code_sha256":"bfe6f1322cece789"}},{"code_sha256":"2d2563d117bf30eb","code_sha256_prefix":"2d2563d117bf30eb","entry":"PromptBoostingTrainer","repo":"ucsb-nlp-chang/promptboosting","repo_kind":"listed","path":"src/multicls_trainer.py","file_url":"https://github.com/ucsb-nlp-chang/promptboosting/blob/HEAD/src/multicls_trainer.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":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ucsb-nlp-chang/promptboosting when it was checked","mcp_get_code":{"code_sha256":"2d2563d117bf30eb"}},{"code_sha256":"a61da81d2fd7eec9","code_sha256_prefix":"a61da81d2fd7eec9","entry":"RoBERTaVTuningClassification","repo":"ucsb-nlp-chang/promptboosting","repo_kind":"listed","path":"src/multicls_trainer.py","file_url":"https://github.com/ucsb-nlp-chang/promptboosting/blob/HEAD/src/multicls_trainer.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":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ucsb-nlp-chang/promptboosting when it was checked","mcp_get_code":{"code_sha256":"a61da81d2fd7eec9"}},{"code_sha256":"13e2332945c4e127","code_sha256_prefix":"13e2332945c4e127","entry":"RobertaForPromptFinetuning","repo":"hannight/amulap","repo_kind":"listed","path":"models.py","file_url":"https://github.com/hannight/amulap/blob/HEAD/models.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":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"13e2332945c4e127"}},{"code_sha256":"d6b16c1ebf5bf7fe","code_sha256_prefix":"d6b16c1ebf5bf7fe","entry":"TestPredictionSaver","repo":"ucsb-nlp-chang/promptboosting","repo_kind":"listed","path":"src/multicls_trainer.py","file_url":"https://github.com/ucsb-nlp-chang/promptboosting/blob/HEAD/src/multicls_trainer.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":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ucsb-nlp-chang/promptboosting when it was checked","mcp_get_code":{"code_sha256":"d6b16c1ebf5bf7fe"}},{"code_sha256":"7424c5b4dbe4fa38","code_sha256_prefix":"7424c5b4dbe4fa38","entry":"generate_multicls_l1_label_set_with_cache","repo":"ucsb-nlp-chang/promptboosting","repo_kind":"listed","path":"src/multicls_trainer.py","file_url":"https://github.com/ucsb-nlp-chang/promptboosting/blob/HEAD/src/multicls_trainer.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":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ucsb-nlp-chang/promptboosting when it was checked","mcp_get_code":{"code_sha256":"7424c5b4dbe4fa38"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"1ad1b9c46d56bc07c4c1902fa3a4a8bfa425cd835ed73f9578c31dc53776223b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}