{"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":"/dataset/boolq","name":"BoolQ","full_name":"Boolean Questions","description_markdown":"**BoolQ** is a question answering dataset for yes/no questions containing 15942 examples. These questions are naturally occurring – they are generated in unprompted and unconstrained settings.\r\nEach example is a triplet of (question, passage, answer), with the title of the page as optional additional context.\r\n\r\nQuestions are gathered from anonymized, aggregated queries to the Google search engine. Queries that are likely to be yes/no questions are heuristically identified and questions are only kept if a Wikipedia page is returned as one of the first five results, in which case the question and Wikipedia page are given to a human annotator for further processing. Annotators label question/article pairs in a three-step process. First, they decide if the question is good, meaning it is comprehensible, unambiguous, and requesting factual information. This judgment is made before the annotator sees the Wikipedia page. Next, for good questions, annotators find a passage within the document that contains enough information to answer the question. Annotators can mark questions as “not answerable” if the Wikipedia article does not contain the requested information. Finally, annotators mark whether the question’s answer is “yes” or “no”. Only questions that were marked as having a yes/no answer are used, and each question is paired with the selected passage instead of the entire document.\r\n\r\nSource: [https://github.com/google-research-datasets/boolean-questions](https://github.com/google-research-datasets/boolean-questions)\r\nImage Source: [BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questions](https://paperswithcode.com/paper/boolq-exploring-the-surprising-difficulty-of/)","description_withheld":null,"homepage":"https://github.com/google-research-datasets/boolean-questions","introduced_date":"2019-01-01","introduced_date_note":null,"introduced_by":{"paper":"/paper/boolq-exploring-the-surprising-difficulty-of","title":"BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questions","first_author":"Christopher Clark","url":null},"license":{"name":"CC BY-SA 3.0","url":"https://creativecommons.org/licenses/by-sa/3.0/"},"modalities":[{"name":"Texts","url":"/datasets/modality/texts"}],"tasks":[{"name":"Classification","url":"/task/classification-1","datasets_with_task":"/datasets/task/classification-1"},{"name":"Question Answering","url":"/task/question-answering","datasets_with_task":"/datasets/task/question-answering"},{"name":"Text Classification","url":"/task/text-classification","datasets_with_task":"/datasets/task/text-classification"},{"name":"Text Generation","url":"/task/text-generation","datasets_with_task":"/datasets/task/text-generation"},{"name":"parameter-efficient fine-tuning","url":"/task/parameter-efficient-fine-tuning","datasets_with_task":"/datasets/task/parameter-efficient-fine-tuning"}],"languages":[{"name":"English","url":"/datasets/language/english"}],"variants":["BoolQ"],"data_loaders":[{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/d0rj/boolq-ru","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/boolq","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/1-800-SHARED-TASKS/boolq-TrueFalse-Instruct","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/Hindi-Gemma/boolq-TrueFalse-Instruct","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/huggingface/datasets","url":"https://huggingface.co/datasets/google/boolq","frameworks":["tf","pytorch","jax"]},{"repo":"https://github.com/tensorflow/datasets","url":"https://www.tensorflow.org/datasets/catalog/bool_q","frameworks":["tf","jax"]},{"repo":"https://github.com/google-research-datasets/boolean-questions","url":"https://github.com/google-research-datasets/boolean-questions","frameworks":[]}],"num_papers_in_archive":701,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/question-answering-on-boolq","task":"Question Answering","dataset_variant":"BoolQ","rows":65,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"Mistral-Nemo 12B (HPT)","paper":"/paper/hierarchical-prompting-taxonomy-a-universal","metrics":{"Accuracy":"99.87"},"code_links":[{"title":"devichand579/HPT","url":"https://github.com/devichand579/HPT"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/parameter-efficient-fine-tuning-on-boolq","task":"parameter-efficient fine-tuning","dataset_variant":"BoolQ","rows":4,"metrics":["Accuracy (% )"],"first_row_in_archive_order":{"model":"LLaMA2-7b","paper":"/paper/qlora-efficient-finetuning-of-quantized-llms","metrics":{"Accuracy (% )":"82.63"},"code_links":[{"title":"qwenlm/qwen","url":"https://github.com/qwenlm/qwen"},{"title":"QwenLM/Qwen-7B","url":"https://github.com/QwenLM/Qwen-7B"},{"title":"artidoro/qlora","url":"https://github.com/artidoro/qlora"},{"title":"huggingface/text-generation-inference","url":"https://github.com/huggingface/text-generation-inference"},{"title":"timdettmers/bitsandbytes","url":"https://github.com/timdettmers/bitsandbytes"},{"title":"qwenlm/qwen-vl","url":"https://github.com/qwenlm/qwen-vl"},{"title":"internlm/xtuner","url":"https://github.com/internlm/xtuner"},{"title":"openmedlab/pulse","url":"https://github.com/openmedlab/pulse"},{"title":"flagai-open/aquila2","url":"https://github.com/flagai-open/aquila2"},{"title":"pilancilab/caldera","url":"https://github.com/pilancilab/caldera"},{"title":"daniel-furman/sft-demos","url":"https://github.com/daniel-furman/sft-demos"},{"title":"ist-daslab/rosa","url":"https://github.com/ist-daslab/rosa"},{"title":"cornell-zhang/llm-datatypes","url":"https://github.com/cornell-zhang/llm-datatypes"},{"title":"brandon3964/multimodal-task-vector","url":"https://github.com/brandon3964/multimodal-task-vector"},{"title":"BatsResearch/LexC-Gen","url":"https://github.com/BatsResearch/LexC-Gen"},{"title":"jerrywu-code/susgen","url":"https://github.com/jerrywu-code/susgen"},{"title":"12kimih/hicupid","url":"https://github.com/12kimih/hicupid"},{"title":"Luohh5/Chain-of-Exemplar","url":"https://github.com/Luohh5/Chain-of-Exemplar"},{"title":"erikaawang/probing-multilingual-dynamics","url":"https://github.com/erikaawang/probing-multilingual-dynamics"},{"title":"Rain9876/ShareLoRA","url":"https://github.com/Rain9876/ShareLoRA"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/classification-on-boolq","task":"Classification","dataset_variant":"BoolQ","rows":2,"metrics":["Test Accuracy"],"first_row_in_archive_order":{"model":"OPT-1.3B","paper":"/paper/achieving-dimension-free-communication-in","metrics":{"Test Accuracy":"62.5%"},"code_links":[{"title":"ZidongLiu/DeComFL","url":"https://github.com/ZidongLiu/DeComFL"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/text-classification-on-boolq","task":"Text Classification","dataset_variant":"BoolQ","rows":0,"metrics":["Accuracy"],"first_row_in_archive_order":null,"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/text-generation-on-boolq","task":"Text Generation","dataset_variant":"BoolQ","rows":0,"metrics":["acc"],"first_row_in_archive_order":null,"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"shown":32,"of":32,"counts":{"papers_with_a_benchmark_row":32,"with_a_code_link":30,"where_syntology_ran_a_sample":22,"not_listed_spam_title":0,"listed":32,"listed_where_code_ran":22,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":18,"every_run_a_failure_of_syntologys_instrument":4,"listed_with_a_run_with_no_instrument_failure":18,"listed_every_run_a_failure_of_syntologys_instrument":4,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"paper":"/paper/shakti-a-2-5-billion-parameter-small-language","slug":"shakti-a-2-5-billion-parameter-small-language","title":"SHAKTI: A 2.5 Billion Parameter Small Language Model Optimized for Edge AI and Low-Resource Environments","date":"2024-10-15","arxiv_id":"2410.11331","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/gift-sw-gaussian-noise-injected-fine-tuning","slug":"gift-sw-gaussian-noise-injected-fine-tuning","title":"GIFT-SW: Gaussian noise Injected Fine-Tuning of Salient Weights for LLMs","date":"2024-08-27","arxiv_id":"2408.15300","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":5,"official":{"repos":["On-Point-RND/GIFT_SW"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/gift-sw-gaussian-noise-injected-fine-tuning#ran","syntology_url":"https://syntology.ai/paper/2408.15300","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.15300"}}}},{"paper":"/paper/hierarchical-prompting-taxonomy-a-universal","slug":"hierarchical-prompting-taxonomy-a-universal","title":"Hierarchical Prompting Taxonomy: A Universal Evaluation Framework for Large Language Models Aligned with Human Cognitive Principles","date":"2024-06-18","arxiv_id":"2406.12644","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/mixture-of-subspaces-in-low-rank-adaptation","slug":"mixture-of-subspaces-in-low-rank-adaptation","title":"Mixture-of-Subspaces in Low-Rank Adaptation","date":"2024-06-16","arxiv_id":"2406.11909","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":3,"samples_unverified":2,"pointer_only_for_licence":6,"official":{"repos":["wutaiqiang/moslora"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/mixture-of-subspaces-in-low-rank-adaptation#ran","syntology_url":"https://syntology.ai/paper/2406.11909","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.11909"}}}},{"paper":"/paper/achieving-dimension-free-communication-in","slug":"achieving-dimension-free-communication-in","title":"Achieving Dimension-Free Communication in Federated Learning via Zeroth-Order Optimization","date":"2024-05-24","arxiv_id":"2405.15861","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["ZidongLiu/DeComFL"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/achieving-dimension-free-communication-in#ran","syntology_url":"https://syntology.ai/paper/2405.15861","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.15861"}}}},{"paper":"/paper/mixlora-enhancing-large-language-models-fine","slug":"mixlora-enhancing-large-language-models-fine","title":"MixLoRA: Enhancing Large Language Models Fine-Tuning with LoRA-based Mixture of Experts","date":"2024-04-22","arxiv_id":"2404.15159","rows_on_this_dataset":3,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":3,"samples_unverified":5,"pointer_only_for_licence":0,"official":{"repos":["TUDB-Labs/MixLoRA","mikecovlee/mLoRA"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/mixlora-enhancing-large-language-models-fine#ran","syntology_url":"https://syntology.ai/paper/2404.15159","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.15159"}}}},{"paper":"/paper/dora-weight-decomposed-low-rank-adaptation","slug":"dora-weight-decomposed-low-rank-adaptation","title":"DoRA: Weight-Decomposed Low-Rank Adaptation","date":"2024-02-14","arxiv_id":"2402.09353","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":8,"samples_unverified":7,"pointer_only_for_licence":14,"official":{"repos":["NVlabs/DoRA","nbasyl/DoRA"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":7,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/dora-weight-decomposed-low-rank-adaptation#ran","syntology_url":"https://syntology.ai/paper/2402.09353","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.09353"}}}},{"paper":"/paper/llama-2-open-foundation-and-fine-tuned-chat","slug":"llama-2-open-foundation-and-fine-tuned-chat","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","date":"2023-07-18","arxiv_id":"2307.09288","rows_on_this_dataset":4,"code_links":19,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":52,"samples_ran":33,"samples_constructed":7,"samples_ran_checked":20,"samples_ran_instrument_failed":13,"samples_unverified":19,"pointer_only_for_licence":20,"official":{"repos":["facebookresearch/llama"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/llama-2-open-foundation-and-fine-tuned-chat#ran","syntology_url":"https://syntology.ai/paper/2307.09288","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.09288"}}}},{"paper":"/paper/qlora-efficient-finetuning-of-quantized-llms","slug":"qlora-efficient-finetuning-of-quantized-llms","title":"QLoRA: Efficient Finetuning of Quantized LLMs","date":"2023-05-23","arxiv_id":"2305.14314","rows_on_this_dataset":1,"code_links":20,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":26,"samples_ran":18,"samples_constructed":1,"samples_ran_checked":6,"samples_ran_instrument_failed":12,"samples_unverified":8,"pointer_only_for_licence":17,"official":{"repos":["artidoro/qlora","timdettmers/bitsandbytes"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["community","listed","official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/qlora-efficient-finetuning-of-quantized-llms#ran","syntology_url":"https://syntology.ai/paper/2305.14314","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.14314"}}}},{"paper":"/paper/palm-2-technical-report-1","slug":"palm-2-technical-report-1","title":"PaLM 2 Technical Report","date":"2023-05-17","arxiv_id":"2305.10403","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/bloomberggpt-a-large-language-model-for","slug":"bloomberggpt-a-large-language-model-for","title":"BloombergGPT: A Large Language Model for Finance","date":"2023-03-30","arxiv_id":"2303.17564","rows_on_this_dataset":4,"code_links":2,"syntology":null},{"paper":"/paper/llama-open-and-efficient-foundation-language-1","slug":"llama-open-and-efficient-foundation-language-1","title":"LLaMA: Open and Efficient Foundation Language Models","date":"2023-02-27","arxiv_id":"2302.13971","rows_on_this_dataset":4,"code_links":57,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":58,"samples_ran":37,"samples_constructed":9,"samples_ran_checked":25,"samples_ran_instrument_failed":12,"samples_unverified":21,"pointer_only_for_licence":4,"official":{"repos":["facebookresearch/llama"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/llama-open-and-efficient-foundation-language-1#ran","syntology_url":"https://syntology.ai/paper/2302.13971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.13971"}}}},{"paper":"/paper/hyena-hierarchy-towards-larger-convolutional","slug":"hyena-hierarchy-towards-larger-convolutional","title":"Hyena Hierarchy: Towards Larger Convolutional Language Models","date":"2023-02-21","arxiv_id":"2302.10866","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":5,"samples_unverified":0,"pointer_only_for_licence":4,"official":{"repos":["hazyresearch/safari"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hyena-hierarchy-towards-larger-convolutional#ran","syntology_url":"https://syntology.ai/paper/2302.10866","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.10866"}}}},{"paper":"/paper/hungry-hungry-hippos-towards-language","slug":"hungry-hungry-hippos-towards-language","title":"Hungry Hungry Hippos: Towards Language Modeling with State Space Models","date":"2022-12-28","arxiv_id":"2212.14052","rows_on_this_dataset":5,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":4,"samples_unverified":8,"pointer_only_for_licence":0,"official":{"repos":["hazyresearch/h3"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hungry-hungry-hippos-towards-language#ran","syntology_url":"https://syntology.ai/paper/2212.14052","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.14052"}}}},{"paper":"/paper/opt-iml-scaling-language-model-instruction","slug":"opt-iml-scaling-language-model-instruction","title":"OPT-IML: Scaling Language Model Instruction Meta Learning through the Lens of Generalization","date":"2022-12-22","arxiv_id":"2212.12017","rows_on_this_dataset":6,"code_links":1,"syntology":null},{"paper":"/paper/toward-efficient-language-model-pretraining","slug":"toward-efficient-language-model-pretraining","title":"Toward Efficient Language Model Pretraining and Downstream Adaptation via Self-Evolution: A Case Study on SuperGLUE","date":"2022-12-04","arxiv_id":"2212.01853","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/ask-me-anything-a-simple-strategy-for","slug":"ask-me-anything-a-simple-strategy-for","title":"Ask Me Anything: A simple strategy for prompting language models","date":"2022-10-05","arxiv_id":"2210.02441","rows_on_this_dataset":3,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["hazyresearch/ama_prompting"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/ask-me-anything-a-simple-strategy-for#ran","syntology_url":"https://syntology.ai/paper/2210.02441","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.02441"}}}},{"paper":"/paper/alexatm-20b-few-shot-learning-using-a-large","slug":"alexatm-20b-few-shot-learning-using-a-large","title":"AlexaTM 20B: Few-Shot Learning Using a Large-Scale Multilingual Seq2Seq Model","date":"2022-08-02","arxiv_id":"2208.01448","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/alexatm-20b-few-shot-learning-using-a-large#ran","syntology_url":"https://syntology.ai/paper/2208.01448","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.01448"}}}},{"paper":"/paper/n-grammer-augmenting-transformers-with-latent-1","slug":"n-grammer-augmenting-transformers-with-latent-1","title":"N-Grammer: Augmenting Transformers with latent n-grams","date":"2022-07-13","arxiv_id":"2207.06366","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["tensorflow/lingvo"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/n-grammer-augmenting-transformers-with-latent-1#ran","syntology_url":"https://syntology.ai/paper/2207.06366","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.06366"}}}},{"paper":"/paper/unifying-language-learning-paradigms","slug":"unifying-language-learning-paradigms","title":"UL2: Unifying Language Learning Paradigms","date":"2022-05-10","arxiv_id":"2205.05131","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":16,"samples_ran":15,"samples_constructed":0,"samples_ran_checked":15,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["google-research/google-research"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unifying-language-learning-paradigms#ran","syntology_url":"https://syntology.ai/paper/2205.05131","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.05131"}}}},{"paper":"/paper/palm-scaling-language-modeling-with-pathways-1","slug":"palm-scaling-language-modeling-with-pathways-1","title":"PaLM: Scaling Language Modeling with Pathways","date":"2022-04-05","arxiv_id":"2204.02311","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":37,"samples_ran":32,"samples_constructed":16,"samples_ran_checked":24,"samples_ran_instrument_failed":8,"samples_unverified":5,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/palm-scaling-language-modeling-with-pathways-1#ran","syntology_url":"https://syntology.ai/paper/2204.02311","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.02311"}}}},{"paper":"/paper/training-compute-optimal-large-language","slug":"training-compute-optimal-large-language","title":"Training Compute-Optimal Large Language Models","date":"2022-03-29","arxiv_id":"2203.15556","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":8,"samples_constructed":3,"samples_ran_checked":5,"samples_ran_instrument_failed":3,"samples_unverified":3,"pointer_only_for_licence":4,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/training-compute-optimal-large-language#ran","syntology_url":"https://syntology.ai/paper/2203.15556","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.15556"}}}},{"paper":"/paper/designing-effective-sparse-expert-models","slug":"designing-effective-sparse-expert-models","title":"ST-MoE: Designing Stable and Transferable Sparse Expert Models","date":"2022-02-17","arxiv_id":"2202.08906","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":5,"official":{"repos":["tensorflow/mesh"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/designing-effective-sparse-expert-models#ran","syntology_url":"https://syntology.ai/paper/2202.08906","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.08906"}}}},{"paper":"/paper/scaling-language-models-methods-analysis-1","slug":"scaling-language-models-methods-analysis-1","title":"Scaling Language Models: Methods, Analysis & Insights from Training Gopher","date":"2021-12-08","arxiv_id":"2112.11446","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/finetuned-language-models-are-zero-shot","slug":"finetuned-language-models-are-zero-shot","title":"Finetuned Language Models Are Zero-Shot Learners","date":"2021-09-03","arxiv_id":"2109.01652","rows_on_this_dataset":3,"code_links":8,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["google-research/flan"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/finetuned-language-models-are-zero-shot#ran","syntology_url":"https://syntology.ai/paper/2109.01652","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.01652"}}}},{"paper":"/paper/lora-low-rank-adaptation-of-large-language","slug":"lora-low-rank-adaptation-of-large-language","title":"LoRA: Low-Rank Adaptation of Large Language Models","date":"2021-06-17","arxiv_id":"2106.09685","rows_on_this_dataset":1,"code_links":74,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":84,"samples_ran":51,"samples_constructed":19,"samples_ran_checked":43,"samples_ran_instrument_failed":8,"samples_unverified":33,"pointer_only_for_licence":30,"official":{"repos":["microsoft/LoRA"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/lora-low-rank-adaptation-of-large-language#ran","syntology_url":"https://syntology.ai/paper/2106.09685","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.09685"}}}},{"paper":"/paper/entailment-as-few-shot-learner","slug":"entailment-as-few-shot-learner","title":"Entailment as Few-Shot Learner","date":"2021-04-29","arxiv_id":"2104.14690","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/entailment-as-few-shot-learner#ran","syntology_url":"https://syntology.ai/paper/2104.14690","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.14690"}}}},{"paper":"/paper/muppet-massive-multi-task-representations","slug":"muppet-massive-multi-task-representations","title":"Muppet: Massive Multi-task Representations with Pre-Finetuning","date":"2021-01-26","arxiv_id":"2101.11038","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/deberta-decoding-enhanced-bert-with","slug":"deberta-decoding-enhanced-bert-with","title":"DeBERTa: Decoding-enhanced BERT with Disentangled Attention","date":"2020-06-05","arxiv_id":"2006.03654","rows_on_this_dataset":1,"code_links":14,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":1,"samples_unverified":9,"pointer_only_for_licence":3,"official":{"repos":["microsoft/DeBERTa"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","named_in_paper","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deberta-decoding-enhanced-bert-with#ran","syntology_url":"https://syntology.ai/paper/2006.03654","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.03654"}}}},{"paper":"/paper/language-models-are-few-shot-learners","slug":"language-models-are-few-shot-learners","title":"Language Models are Few-Shot Learners","date":"2020-05-28","arxiv_id":"2005.14165","rows_on_this_dataset":2,"code_links":67,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":65,"samples_ran":45,"samples_constructed":0,"samples_ran_checked":37,"samples_ran_instrument_failed":8,"samples_unverified":20,"pointer_only_for_licence":7,"official":{"repos":["openai/gpt-3"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/language-models-are-few-shot-learners#ran","syntology_url":"https://syntology.ai/paper/2005.14165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.14165"}}}},{"paper":"/paper/exploring-the-limits-of-transfer-learning","slug":"exploring-the-limits-of-transfer-learning","title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","date":"2019-10-23","arxiv_id":"1910.10683","rows_on_this_dataset":4,"code_links":57,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":31,"samples_ran":21,"samples_constructed":0,"samples_ran_checked":20,"samples_ran_instrument_failed":1,"samples_unverified":10,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/exploring-the-limits-of-transfer-learning#ran","syntology_url":"https://syntology.ai/paper/1910.10683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.10683"}}}},{"paper":"/paper/boolq-exploring-the-surprising-difficulty-of","slug":"boolq-exploring-the-surprising-difficulty-of","title":"BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questions","date":"2019-05-24","arxiv_id":"1905.10044","rows_on_this_dataset":5,"code_links":1,"syntology":null}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/shakti-a-2-5-billion-parameter-small-language","slug":"shakti-a-2-5-billion-parameter-small-language","title":"SHAKTI: A 2.5 Billion Parameter Small Language Model Optimized for Edge AI and Low-Resource Environments","date":"2024-10-15","arxiv_id":"2410.11331","rows_on_this_dataset":1,"code_links":0,"syntology":null},{"paper":"/paper/gift-sw-gaussian-noise-injected-fine-tuning","slug":"gift-sw-gaussian-noise-injected-fine-tuning","title":"GIFT-SW: Gaussian noise Injected Fine-Tuning of Salient Weights for LLMs","date":"2024-08-27","arxiv_id":"2408.15300","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":5,"official":{"repos":["On-Point-RND/GIFT_SW"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/gift-sw-gaussian-noise-injected-fine-tuning#ran","syntology_url":"https://syntology.ai/paper/2408.15300","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.15300"}}}},{"paper":"/paper/hierarchical-prompting-taxonomy-a-universal","slug":"hierarchical-prompting-taxonomy-a-universal","title":"Hierarchical Prompting Taxonomy: A Universal Evaluation Framework for Large Language Models Aligned with Human Cognitive Principles","date":"2024-06-18","arxiv_id":"2406.12644","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/mixture-of-subspaces-in-low-rank-adaptation","slug":"mixture-of-subspaces-in-low-rank-adaptation","title":"Mixture-of-Subspaces in Low-Rank Adaptation","date":"2024-06-16","arxiv_id":"2406.11909","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":3,"samples_unverified":2,"pointer_only_for_licence":6,"official":{"repos":["wutaiqiang/moslora"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/mixture-of-subspaces-in-low-rank-adaptation#ran","syntology_url":"https://syntology.ai/paper/2406.11909","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.11909"}}}},{"paper":"/paper/achieving-dimension-free-communication-in","slug":"achieving-dimension-free-communication-in","title":"Achieving Dimension-Free Communication in Federated Learning via Zeroth-Order Optimization","date":"2024-05-24","arxiv_id":"2405.15861","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["ZidongLiu/DeComFL"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/achieving-dimension-free-communication-in#ran","syntology_url":"https://syntology.ai/paper/2405.15861","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.15861"}}}},{"paper":"/paper/mixlora-enhancing-large-language-models-fine","slug":"mixlora-enhancing-large-language-models-fine","title":"MixLoRA: Enhancing Large Language Models Fine-Tuning with LoRA-based Mixture of Experts","date":"2024-04-22","arxiv_id":"2404.15159","rows_on_this_dataset":3,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":3,"samples_unverified":5,"pointer_only_for_licence":0,"official":{"repos":["TUDB-Labs/MixLoRA","mikecovlee/mLoRA"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/mixlora-enhancing-large-language-models-fine#ran","syntology_url":"https://syntology.ai/paper/2404.15159","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.15159"}}}},{"paper":"/paper/dora-weight-decomposed-low-rank-adaptation","slug":"dora-weight-decomposed-low-rank-adaptation","title":"DoRA: Weight-Decomposed Low-Rank Adaptation","date":"2024-02-14","arxiv_id":"2402.09353","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":8,"samples_unverified":7,"pointer_only_for_licence":14,"official":{"repos":["NVlabs/DoRA","nbasyl/DoRA"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":7,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/dora-weight-decomposed-low-rank-adaptation#ran","syntology_url":"https://syntology.ai/paper/2402.09353","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.09353"}}}},{"paper":"/paper/llama-2-open-foundation-and-fine-tuned-chat","slug":"llama-2-open-foundation-and-fine-tuned-chat","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","date":"2023-07-18","arxiv_id":"2307.09288","rows_on_this_dataset":4,"code_links":19,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":52,"samples_ran":33,"samples_constructed":7,"samples_ran_checked":20,"samples_ran_instrument_failed":13,"samples_unverified":19,"pointer_only_for_licence":20,"official":{"repos":["facebookresearch/llama"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/llama-2-open-foundation-and-fine-tuned-chat#ran","syntology_url":"https://syntology.ai/paper/2307.09288","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.09288"}}}},{"paper":"/paper/qlora-efficient-finetuning-of-quantized-llms","slug":"qlora-efficient-finetuning-of-quantized-llms","title":"QLoRA: Efficient Finetuning of Quantized LLMs","date":"2023-05-23","arxiv_id":"2305.14314","rows_on_this_dataset":1,"code_links":20,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":26,"samples_ran":18,"samples_constructed":1,"samples_ran_checked":6,"samples_ran_instrument_failed":12,"samples_unverified":8,"pointer_only_for_licence":17,"official":{"repos":["artidoro/qlora","timdettmers/bitsandbytes"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["community","listed","official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/qlora-efficient-finetuning-of-quantized-llms#ran","syntology_url":"https://syntology.ai/paper/2305.14314","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.14314"}}}},{"paper":"/paper/palm-2-technical-report-1","slug":"palm-2-technical-report-1","title":"PaLM 2 Technical Report","date":"2023-05-17","arxiv_id":"2305.10403","rows_on_this_dataset":3,"code_links":1,"syntology":null},{"paper":"/paper/bloomberggpt-a-large-language-model-for","slug":"bloomberggpt-a-large-language-model-for","title":"BloombergGPT: A Large Language Model for Finance","date":"2023-03-30","arxiv_id":"2303.17564","rows_on_this_dataset":4,"code_links":2,"syntology":null},{"paper":"/paper/llama-open-and-efficient-foundation-language-1","slug":"llama-open-and-efficient-foundation-language-1","title":"LLaMA: Open and Efficient Foundation Language Models","date":"2023-02-27","arxiv_id":"2302.13971","rows_on_this_dataset":4,"code_links":57,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":58,"samples_ran":37,"samples_constructed":9,"samples_ran_checked":25,"samples_ran_instrument_failed":12,"samples_unverified":21,"pointer_only_for_licence":4,"official":{"repos":["facebookresearch/llama"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/llama-open-and-efficient-foundation-language-1#ran","syntology_url":"https://syntology.ai/paper/2302.13971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.13971"}}}},{"paper":"/paper/hyena-hierarchy-towards-larger-convolutional","slug":"hyena-hierarchy-towards-larger-convolutional","title":"Hyena Hierarchy: Towards Larger Convolutional Language Models","date":"2023-02-21","arxiv_id":"2302.10866","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":5,"samples_unverified":0,"pointer_only_for_licence":4,"official":{"repos":["hazyresearch/safari"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hyena-hierarchy-towards-larger-convolutional#ran","syntology_url":"https://syntology.ai/paper/2302.10866","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.10866"}}}},{"paper":"/paper/hungry-hungry-hippos-towards-language","slug":"hungry-hungry-hippos-towards-language","title":"Hungry Hungry Hippos: Towards Language Modeling with State Space Models","date":"2022-12-28","arxiv_id":"2212.14052","rows_on_this_dataset":5,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":15,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":4,"samples_unverified":8,"pointer_only_for_licence":0,"official":{"repos":["hazyresearch/h3"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hungry-hungry-hippos-towards-language#ran","syntology_url":"https://syntology.ai/paper/2212.14052","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.14052"}}}},{"paper":"/paper/opt-iml-scaling-language-model-instruction","slug":"opt-iml-scaling-language-model-instruction","title":"OPT-IML: Scaling Language Model Instruction Meta Learning through the Lens of Generalization","date":"2022-12-22","arxiv_id":"2212.12017","rows_on_this_dataset":6,"code_links":1,"syntology":null},{"paper":"/paper/toward-efficient-language-model-pretraining","slug":"toward-efficient-language-model-pretraining","title":"Toward Efficient Language Model Pretraining and Downstream Adaptation via Self-Evolution: A Case Study on SuperGLUE","date":"2022-12-04","arxiv_id":"2212.01853","rows_on_this_dataset":2,"code_links":0,"syntology":null},{"paper":"/paper/ask-me-anything-a-simple-strategy-for","slug":"ask-me-anything-a-simple-strategy-for","title":"Ask Me Anything: A simple strategy for prompting language models","date":"2022-10-05","arxiv_id":"2210.02441","rows_on_this_dataset":3,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["hazyresearch/ama_prompting"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/ask-me-anything-a-simple-strategy-for#ran","syntology_url":"https://syntology.ai/paper/2210.02441","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.02441"}}}},{"paper":"/paper/alexatm-20b-few-shot-learning-using-a-large","slug":"alexatm-20b-few-shot-learning-using-a-large","title":"AlexaTM 20B: Few-Shot Learning Using a Large-Scale Multilingual Seq2Seq Model","date":"2022-08-02","arxiv_id":"2208.01448","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/alexatm-20b-few-shot-learning-using-a-large#ran","syntology_url":"https://syntology.ai/paper/2208.01448","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.01448"}}}},{"paper":"/paper/n-grammer-augmenting-transformers-with-latent-1","slug":"n-grammer-augmenting-transformers-with-latent-1","title":"N-Grammer: Augmenting Transformers with latent n-grams","date":"2022-07-13","arxiv_id":"2207.06366","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":6,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["tensorflow/lingvo"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/n-grammer-augmenting-transformers-with-latent-1#ran","syntology_url":"https://syntology.ai/paper/2207.06366","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.06366"}}}},{"paper":"/paper/unifying-language-learning-paradigms","slug":"unifying-language-learning-paradigms","title":"UL2: Unifying Language Learning Paradigms","date":"2022-05-10","arxiv_id":"2205.05131","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":16,"samples_ran":15,"samples_constructed":0,"samples_ran_checked":15,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["google-research/google-research"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/unifying-language-learning-paradigms#ran","syntology_url":"https://syntology.ai/paper/2205.05131","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.05131"}}}},{"paper":"/paper/palm-scaling-language-modeling-with-pathways-1","slug":"palm-scaling-language-modeling-with-pathways-1","title":"PaLM: Scaling Language Modeling with Pathways","date":"2022-04-05","arxiv_id":"2204.02311","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":37,"samples_ran":32,"samples_constructed":16,"samples_ran_checked":24,"samples_ran_instrument_failed":8,"samples_unverified":5,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/palm-scaling-language-modeling-with-pathways-1#ran","syntology_url":"https://syntology.ai/paper/2204.02311","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.02311"}}}},{"paper":"/paper/training-compute-optimal-large-language","slug":"training-compute-optimal-large-language","title":"Training Compute-Optimal Large Language Models","date":"2022-03-29","arxiv_id":"2203.15556","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":8,"samples_constructed":3,"samples_ran_checked":5,"samples_ran_instrument_failed":3,"samples_unverified":3,"pointer_only_for_licence":4,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/training-compute-optimal-large-language#ran","syntology_url":"https://syntology.ai/paper/2203.15556","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.15556"}}}},{"paper":"/paper/designing-effective-sparse-expert-models","slug":"designing-effective-sparse-expert-models","title":"ST-MoE: Designing Stable and Transferable Sparse Expert Models","date":"2022-02-17","arxiv_id":"2202.08906","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":5,"official":{"repos":["tensorflow/mesh"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/designing-effective-sparse-expert-models#ran","syntology_url":"https://syntology.ai/paper/2202.08906","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.08906"}}}},{"paper":"/paper/scaling-language-models-methods-analysis-1","slug":"scaling-language-models-methods-analysis-1","title":"Scaling Language Models: Methods, Analysis & Insights from Training Gopher","date":"2021-12-08","arxiv_id":"2112.11446","rows_on_this_dataset":1,"code_links":3,"syntology":null},{"paper":"/paper/finetuned-language-models-are-zero-shot","slug":"finetuned-language-models-are-zero-shot","title":"Finetuned Language Models Are Zero-Shot Learners","date":"2021-09-03","arxiv_id":"2109.01652","rows_on_this_dataset":3,"code_links":8,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["google-research/flan"],"state":"official: harvested for another paper","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/finetuned-language-models-are-zero-shot#ran","syntology_url":"https://syntology.ai/paper/2109.01652","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.01652"}}}},{"paper":"/paper/lora-low-rank-adaptation-of-large-language","slug":"lora-low-rank-adaptation-of-large-language","title":"LoRA: Low-Rank Adaptation of Large Language Models","date":"2021-06-17","arxiv_id":"2106.09685","rows_on_this_dataset":1,"code_links":74,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":84,"samples_ran":51,"samples_constructed":19,"samples_ran_checked":43,"samples_ran_instrument_failed":8,"samples_unverified":33,"pointer_only_for_licence":30,"official":{"repos":["microsoft/LoRA"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/lora-low-rank-adaptation-of-large-language#ran","syntology_url":"https://syntology.ai/paper/2106.09685","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.09685"}}}},{"paper":"/paper/entailment-as-few-shot-learner","slug":"entailment-as-few-shot-learner","title":"Entailment as Few-Shot Learner","date":"2021-04-29","arxiv_id":"2104.14690","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":3,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/entailment-as-few-shot-learner#ran","syntology_url":"https://syntology.ai/paper/2104.14690","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.14690"}}}},{"paper":"/paper/muppet-massive-multi-task-representations","slug":"muppet-massive-multi-task-representations","title":"Muppet: Massive Multi-task Representations with Pre-Finetuning","date":"2021-01-26","arxiv_id":"2101.11038","rows_on_this_dataset":2,"code_links":2,"syntology":null},{"paper":"/paper/deberta-decoding-enhanced-bert-with","slug":"deberta-decoding-enhanced-bert-with","title":"DeBERTa: Decoding-enhanced BERT with Disentangled Attention","date":"2020-06-05","arxiv_id":"2006.03654","rows_on_this_dataset":1,"code_links":14,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":13,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":1,"samples_unverified":9,"pointer_only_for_licence":3,"official":{"repos":["microsoft/DeBERTa"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","named_in_paper","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deberta-decoding-enhanced-bert-with#ran","syntology_url":"https://syntology.ai/paper/2006.03654","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.03654"}}}},{"paper":"/paper/language-models-are-few-shot-learners","slug":"language-models-are-few-shot-learners","title":"Language Models are Few-Shot Learners","date":"2020-05-28","arxiv_id":"2005.14165","rows_on_this_dataset":2,"code_links":67,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":65,"samples_ran":45,"samples_constructed":0,"samples_ran_checked":37,"samples_ran_instrument_failed":8,"samples_unverified":20,"pointer_only_for_licence":7,"official":{"repos":["openai/gpt-3"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/language-models-are-few-shot-learners#ran","syntology_url":"https://syntology.ai/paper/2005.14165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.14165"}}}},{"paper":"/paper/exploring-the-limits-of-transfer-learning","slug":"exploring-the-limits-of-transfer-learning","title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","date":"2019-10-23","arxiv_id":"1910.10683","rows_on_this_dataset":4,"code_links":57,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":31,"samples_ran":21,"samples_constructed":0,"samples_ran_checked":20,"samples_ran_instrument_failed":1,"samples_unverified":10,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/exploring-the-limits-of-transfer-learning#ran","syntology_url":"https://syntology.ai/paper/1910.10683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.10683"}}}},{"paper":"/paper/boolq-exploring-the-surprising-difficulty-of","slug":"boolq-exploring-the-surprising-difficulty-of","title":"BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questions","date":"2019-05-24","arxiv_id":"1905.10044","rows_on_this_dataset":5,"code_links":1,"syntology":null}],"papers_where_code_ran":22,"papers_where_code_ran_first_page":"/dataset/boolq/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/dataset/boolq/papers/ran/1","json":"/dataset/boolq/papers/ran/1.json","rows":22}],"row_route":"each paper's syntology object carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":23,"samples_harvested":469,"samples_ran":315,"samples_constructed":55,"samples_ran_checked":218,"samples_ran_instrument_failed":97,"samples_unverified":154,"pointer_only_for_licence":119,"papers_with_no_sample_that_ran":1,"papers_with_a_sample_that_ran":22,"papers_with_a_run_with_no_instrument_failure":18,"papers_where_every_run_was_an_instrument_failure":4,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"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'","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)"},"since_archive_judged":{"papers":41,"papers_placed":0,"judged_by":{"model":"Claude Sonnet 4.5","models_as_recorded":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[{"leaderboard":"/sota/question-answering-on-boolq","since_archive":"/sota/question-answering-on-boolq#since-judged","papers_judged":31,"placed":0},{"leaderboard":"/sota/parameter-efficient-fine-tuning-on-boolq","since_archive":"/sota/parameter-efficient-fine-tuning-on-boolq#since-judged","papers_judged":16,"placed":0}]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"6184c4378832da0b35b99e78cb17434e9732b0641b902a5dc77354c1d0ce0b26","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}