{"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/multinli/papers/ran/1","list_of":"/dataset/multinli","dataset":"MultiNLI","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","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)"},"order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","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.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","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,"rows":[1,21],"of":21,"counts":{"papers_with_a_benchmark_row":40,"with_a_code_link":35,"where_syntology_ran_a_sample":21,"not_listed_spam_title":0,"listed":40,"listed_where_code_ran":21,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":20,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":20,"listed_every_run_a_failure_of_syntologys_instrument":1,"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"},"first_page":"/dataset/multinli/papers/ran/1","prev":null,"next":null,"papers":[{"paper":"/paper/generative-pretrained-structured-transformers","slug":"generative-pretrained-structured-transformers","title":"Generative Pretrained Structured Transformers: Unsupervised Syntactic Language Models at Scale","date":"2024-03-13","arxiv_id":"2403.08293","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":7,"samples_ran":4,"samples_constructed":2,"samples_ran_checked":3,"samples_ran_instrument_failed":1,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["ant-research/structuredlm_rtdt"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/generative-pretrained-structured-transformers#ran","syntology_url":"https://syntology.ai/paper/2403.08293","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.08293"}}}},{"paper":"/paper/llm-int8-8-bit-matrix-multiplication-for","slug":"llm-int8-8-bit-matrix-multiplication-for","title":"LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scale","date":"2022-08-15","arxiv_id":"2208.07339","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":5,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":2,"official":{"repos":["timdettmers/bitsandbytes"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/llm-int8-8-bit-matrix-multiplication-for#ran","syntology_url":"https://syntology.ai/paper/2208.07339","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.07339"}}}},{"paper":"/paper/charformer-fast-character-transformers-via","slug":"charformer-fast-character-transformers-via","title":"Charformer: Fast Character Transformers via Gradient-based Subword Tokenization","date":"2021-06-23","arxiv_id":"2106.12672","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":10,"samples_ran":7,"samples_constructed":3,"samples_ran_checked":4,"samples_ran_instrument_failed":3,"samples_unverified":3,"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/charformer-fast-character-transformers-via#ran","syntology_url":"https://syntology.ai/paper/2106.12672","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.12672"}}}},{"paper":"/paper/pay-attention-to-mlps","slug":"pay-attention-to-mlps","title":"Pay Attention to MLPs","date":"2021-05-17","arxiv_id":"2105.08050","rows_on_this_dataset":1,"code_links":20,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":44,"samples_ran":34,"samples_constructed":15,"samples_ran_checked":31,"samples_ran_instrument_failed":3,"samples_unverified":10,"pointer_only_for_licence":11,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/pay-attention-to-mlps#ran","syntology_url":"https://syntology.ai/paper/2105.08050","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.08050"}}}},{"paper":"/paper/fnet-mixing-tokens-with-fourier-transforms","slug":"fnet-mixing-tokens-with-fourier-transforms","title":"FNet: Mixing Tokens with Fourier Transforms","date":"2021-05-09","arxiv_id":"2105.03824","rows_on_this_dataset":2,"code_links":12,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"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/fnet-mixing-tokens-with-fourier-transforms#ran","syntology_url":"https://syntology.ai/paper/2105.03824","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.03824"}}}},{"paper":"/paper/a-statistical-framework-for-low-bitwidth","slug":"a-statistical-framework-for-low-bitwidth","title":"A Statistical Framework for Low-bitwidth Training of Deep Neural Networks","date":"2020-10-27","arxiv_id":"2010.14298","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":4,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":3,"pointer_only_for_licence":1,"official":{"repos":["cjf00000/StatQuant"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-statistical-framework-for-low-bitwidth#ran","syntology_url":"https://syntology.ai/paper/2010.14298","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.14298"}}}},{"paper":"/paper/big-bird-transformers-for-longer-sequences","slug":"big-bird-transformers-for-longer-sequences","title":"Big Bird: Transformers for Longer Sequences","date":"2020-07-28","arxiv_id":"2007.14062","rows_on_this_dataset":1,"code_links":14,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":15,"samples_ran":10,"samples_constructed":1,"samples_ran_checked":2,"samples_ran_instrument_failed":8,"samples_unverified":5,"pointer_only_for_licence":11,"official":{"repos":["google-research/bigbird"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/big-bird-transformers-for-longer-sequences#ran","syntology_url":"https://syntology.ai/paper/2007.14062","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.14062"}}}},{"paper":"/paper/squeezebert-what-can-computer-vision-teach","slug":"squeezebert-what-can-computer-vision-teach","title":"SqueezeBERT: What can computer vision teach NLP about efficient neural networks?","date":"2020-06-19","arxiv_id":"2006.11316","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-09-28T10:30:06+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":["huggingface/transformers"],"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/squeezebert-what-can-computer-vision-teach#ran","syntology_url":"https://syntology.ai/paper/2006.11316","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.11316"}}}},{"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-09-28T10:30:06+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/smart-robust-and-efficient-fine-tuning-for","slug":"smart-robust-and-efficient-fine-tuning-for","title":"SMART: Robust and Efficient Fine-Tuning for Pre-trained Natural Language Models through Principled Regularized Optimization","date":"2019-11-08","arxiv_id":"1911.03437","rows_on_this_dataset":6,"code_links":6,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":8,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["namisan/mt-dnn"],"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/smart-robust-and-efficient-fine-tuning-for#ran","syntology_url":"https://syntology.ai/paper/1911.03437","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03437"}}}},{"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":7,"code_links":57,"syntology":{"read_at":"2026-09-28T10:30:06+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/q8bert-quantized-8bit-bert","slug":"q8bert-quantized-8bit-bert","title":"Q8BERT: Quantized 8Bit BERT","date":"2019-10-14","arxiv_id":"1910.06188","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":11,"samples_ran":10,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":3,"official":{"repos":["intellabs/model-compression-research-package","NervanaSystems/nlp-architect"],"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","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/q8bert-quantized-8bit-bert#ran","syntology_url":"https://syntology.ai/paper/1910.06188","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.06188"}}}},{"paper":"/paper/albert-a-lite-bert-for-self-supervised","slug":"albert-a-lite-bert-for-self-supervised","title":"ALBERT: A Lite BERT for Self-supervised Learning of Language Representations","date":"2019-09-26","arxiv_id":"1909.11942","rows_on_this_dataset":1,"code_links":48,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":126,"samples_ran":81,"samples_constructed":17,"samples_ran_checked":59,"samples_ran_instrument_failed":22,"samples_unverified":45,"pointer_only_for_licence":28,"official":{"repos":["google-research/ALBERT"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/albert-a-lite-bert-for-self-supervised#ran","syntology_url":"https://syntology.ai/paper/1909.11942","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.11942"}}}},{"paper":"/paper/roberta-a-robustly-optimized-bert-pretraining","slug":"roberta-a-robustly-optimized-bert-pretraining","title":"RoBERTa: A Robustly Optimized BERT Pretraining Approach","date":"2019-07-26","arxiv_id":"1907.11692","rows_on_this_dataset":2,"code_links":67,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":48,"samples_ran":37,"samples_constructed":11,"samples_ran_checked":36,"samples_ran_instrument_failed":1,"samples_unverified":11,"pointer_only_for_licence":24,"official":{"repos":["pytorch/fairseq"],"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/roberta-a-robustly-optimized-bert-pretraining#ran","syntology_url":"https://syntology.ai/paper/1907.11692","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.11692"}}}},{"paper":"/paper/spanbert-improving-pre-training-by","slug":"spanbert-improving-pre-training-by","title":"SpanBERT: Improving Pre-training by Representing and Predicting Spans","date":"2019-07-24","arxiv_id":"1907.10529","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":15,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":3,"samples_unverified":6,"pointer_only_for_licence":6,"official":{"repos":["facebookresearch/SpanBERT"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/spanbert-improving-pre-training-by#ran","syntology_url":"https://syntology.ai/paper/1907.10529","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.10529"}}}},{"paper":"/paper/xlnet-generalized-autoregressive-pretraining","slug":"xlnet-generalized-autoregressive-pretraining","title":"XLNet: Generalized Autoregressive Pretraining for Language Understanding","date":"2019-06-19","arxiv_id":"1906.08237","rows_on_this_dataset":1,"code_links":27,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":24,"samples_ran":15,"samples_constructed":2,"samples_ran_checked":10,"samples_ran_instrument_failed":5,"samples_unverified":9,"pointer_only_for_licence":4,"official":{"repos":["zihangdai/xlnet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/xlnet-generalized-autoregressive-pretraining#ran","syntology_url":"https://syntology.ai/paper/1906.08237","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.08237"}}}},{"paper":"/paper/ernie-enhanced-language-representation-with","slug":"ernie-enhanced-language-representation-with","title":"ERNIE: Enhanced Language Representation with Informative Entities","date":"2019-05-17","arxiv_id":"1905.07129","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["thunlp/ERNIE"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/ernie-enhanced-language-representation-with#ran","syntology_url":"https://syntology.ai/paper/1905.07129","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.07129"}}}},{"paper":"/paper/multi-task-deep-neural-networks-for-natural","slug":"multi-task-deep-neural-networks-for-natural","title":"Multi-Task Deep Neural Networks for Natural Language Understanding","date":"2019-01-31","arxiv_id":"1901.11504","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":13,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":3,"samples_unverified":4,"pointer_only_for_licence":4,"official":{"repos":["namisan/mt-dnn"],"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/multi-task-deep-neural-networks-for-natural#ran","syntology_url":"https://syntology.ai/paper/1901.11504","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.11504"}}}},{"paper":"/paper/bert-pre-training-of-deep-bidirectional","slug":"bert-pre-training-of-deep-bidirectional","title":"BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding","date":"2018-10-11","arxiv_id":"1810.04805","rows_on_this_dataset":1,"code_links":534,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":659,"samples_ran":300,"samples_constructed":75,"samples_ran_checked":235,"samples_ran_instrument_failed":65,"samples_unverified":359,"pointer_only_for_licence":164,"official":{"repos":["google-research/bert"],"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/bert-pre-training-of-deep-bidirectional#ran","syntology_url":"https://syntology.ai/paper/1810.04805","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.04805"}}}},{"paper":"/paper/glue-a-multi-task-benchmark-and-analysis","slug":"glue-a-multi-task-benchmark-and-analysis","title":"GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understanding","date":"2018-04-20","arxiv_id":"1804.07461","rows_on_this_dataset":1,"code_links":11,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":14,"samples_ran":14,"samples_constructed":0,"samples_ran_checked":12,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/glue-a-multi-task-benchmark-and-analysis#ran","syntology_url":"https://syntology.ai/paper/1804.07461","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.07461"}}}},{"paper":"/paper/learning-general-purpose-distributed-sentence","slug":"learning-general-purpose-distributed-sentence","title":"Learning General Purpose Distributed Sentence Representations via Large Scale Multi-task Learning","date":"2018-03-30","arxiv_id":"1804.00079","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":3,"official":{"repos":["facebookresearch/SentEval","Maluuba/gensen"],"state":"official (archive's flag): 3 ran","n_ran":3,"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/learning-general-purpose-distributed-sentence#ran","syntology_url":"https://syntology.ai/paper/1804.00079","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.00079"}}}}],"record_sha256":"0988a70312062e38ff294d38f2167f0d07743fe5a017e67ee2ad443f6b4ef60b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}