{"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":"/sota/machine-translation-on-wmt2014-english-french","task":{"name":"Machine Translation","url":"/task/machine-translation","note":null},"dataset":{"name":"WMT2014 English-French","url":"/dataset/wmt-2014"},"category":"Natural Language Processing","categories":["Natural Language Processing"],"category_note":null,"description":"**Machine translation** is the task of translating a sentence in a source language to a different target language.\r\n\r\nApproaches for machine translation can range from rule-based to statistical to neural-based. More recently, encoder-decoder attention-based architectures like BERT have attained major improvements in machine translation. \r\n\r\nOne of the most popular datasets used to benchmark machine translation systems is the WMT family of datasets. Some of the most commonly used evaluation metrics for machine translation systems include BLEU, METEOR, NIST, and others. \r\n\r\n<span style=\"color:grey; opacity: 0.6\">( Image credit: [Google seq2seq](https://github.com/google/seq2seq) )</span>","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["BLEU score","SacreBLEU","Hardware Burden","Operations per network pass"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction; the tokens 'score' and 'time' are not used on this page); null = not inferred, chart draws points only","by_metric":{"BLEU score":"higher","SacreBLEU":null,"Hardware Burden":null,"Operations per network pass":null}},"counts":{"rows":57,"rows_with_code":54,"rows_with_paper_page":56,"rows_dated":56,"rows_using_additional_data":6},"rows":[{"rank_in_archive_order":1,"model":"Transformer+BT (ADMIN init)","metrics":{"BLEU score":"46.4","SacreBLEU":"44.4"},"uses_additional_data":true,"paper_date":"2020-08-18","paper":"/paper/very-deep-transformers-for-neural-machine","paper_url":"https://arxiv.org/abs/2008.07772v2","paper_title":"Very Deep Transformers for Neural Machine Translation","code":"https://github.com/LiyuanLucasLiu/Transforemr-Clinic","n_code_links":4,"official":{"repos":["namisan/exdeep-nmt"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"syntology":{"n_ran":8,"n_constructed":2,"n_ran_checked":3,"n_instrument":5,"n_unverified":1,"n_samples":9,"n_pointer_only_licence":3,"sample_list":"/paper/very-deep-transformers-for-neural-machine#ran","syntology_url":"https://syntology.ai/paper/2008.07772","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.07772"}}}},{"rank_in_archive_order":2,"model":"Noisy back-translation","metrics":{"BLEU score":"45.6","Hardware Burden":"180G","SacreBLEU":"43.8"},"uses_additional_data":true,"paper_date":"2018-08-28","paper":"/paper/understanding-back-translation-at-scale","paper_url":"http://arxiv.org/abs/1808.09381v2","paper_title":"Understanding Back-Translation at Scale","code":"https://github.com/facebookresearch/fairseq","n_code_links":3,"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"]},"syntology":{"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":0,"sample_list":"/paper/understanding-back-translation-at-scale#ran","syntology_url":"https://syntology.ai/paper/1808.09381","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.09381"}}}},{"rank_in_archive_order":3,"model":"mRASP+Fine-Tune","metrics":{"BLEU score":"44.3","SacreBLEU":"41.7"},"uses_additional_data":true,"paper_date":"2020-10-07","paper":"/paper/pre-training-multilingual-neural-machine","paper_url":"https://arxiv.org/abs/2010.03142v3","paper_title":"Pre-training Multilingual Neural Machine Translation by Leveraging Alignment Information","code":"https://github.com/linzehui/mRASP","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":4,"model":"Transformer + R-Drop","metrics":{"BLEU score":"43.95"},"uses_additional_data":false,"paper_date":"2021-06-28","paper":"/paper/r-drop-regularized-dropout-for-neural","paper_url":"https://arxiv.org/abs/2106.14448v2","paper_title":"R-Drop: Regularized Dropout for Neural Networks","code":"https://github.com/dropreg/R-Drop","n_code_links":8,"official":{"repos":["dropreg/R-Drop"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"syntology":{"n_ran":4,"n_constructed":2,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_samples":6,"n_pointer_only_licence":0,"sample_list":"/paper/r-drop-regularized-dropout-for-neural#ran","syntology_url":"https://syntology.ai/paper/2106.14448","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.14448"}}}},{"rank_in_archive_order":5,"model":"Transformer (ADMIN init)","metrics":{"BLEU score":"43.8","SacreBLEU":"41.8"},"uses_additional_data":false,"paper_date":"2020-08-18","paper":"/paper/very-deep-transformers-for-neural-machine","paper_url":"https://arxiv.org/abs/2008.07772v2","paper_title":"Very Deep Transformers for Neural Machine Translation","code":"https://github.com/LiyuanLucasLiu/Transforemr-Clinic","n_code_links":4,"official":{"repos":["namisan/exdeep-nmt"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"syntology":{"n_ran":8,"n_constructed":2,"n_ran_checked":3,"n_instrument":5,"n_unverified":1,"n_samples":9,"n_pointer_only_licence":3,"sample_list":"/paper/very-deep-transformers-for-neural-machine#ran","syntology_url":"https://syntology.ai/paper/2008.07772","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.07772"}}}},{"rank_in_archive_order":6,"model":"Admin","metrics":{"BLEU score":"43.8"},"uses_additional_data":false,"paper_date":"2020-04-17","paper":"/paper/understanding-the-difficulty-of-training","paper_url":"https://arxiv.org/abs/2004.08249v3","paper_title":"Understanding the Difficulty of Training Transformers","code":"https://github.com/LiyuanLucasLiu/Transforemr-Clinic","n_code_links":2,"official":{"repos":["LiyuanLucasLiu/Transforemr-Clinic"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]},"syntology":{"n_ran":4,"n_constructed":2,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_samples":5,"n_pointer_only_licence":0,"sample_list":"/paper/understanding-the-difficulty-of-training#ran","syntology_url":"https://syntology.ai/paper/2004.08249","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.08249"}}}},{"rank_in_archive_order":7,"model":"BERT-fused NMT","metrics":{"BLEU score":"43.78"},"uses_additional_data":true,"paper_date":"2020-02-17","paper":"/paper/incorporating-bert-into-neural-machine-1","paper_url":"https://arxiv.org/abs/2002.06823v1","paper_title":"Incorporating BERT into Neural Machine Translation","code":"https://github.com/bert-nmt/bert-nmt","n_code_links":3,"official":null,"syntology":null},{"rank_in_archive_order":8,"model":"MUSE(Paralllel Multi-scale Attention)","metrics":{"BLEU score":"43.5"},"uses_additional_data":false,"paper_date":"2019-11-17","paper":"/paper/muse-parallel-multi-scale-attention-for","paper_url":"https://arxiv.org/abs/1911.09483v1","paper_title":"MUSE: Parallel Multi-Scale Attention for Sequence to Sequence Learning","code":"https://github.com/lancopku/MUSE","n_code_links":3,"official":{"repos":["lancopku/MUSE"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]},"syntology":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":1,"sample_list":"/paper/muse-parallel-multi-scale-attention-for#ran","syntology_url":"https://syntology.ai/paper/1911.09483","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.09483"}}}},{"rank_in_archive_order":9,"model":"T5","metrics":{"BLEU score":"43.4"},"uses_additional_data":true,"paper_date":"2019-10-23","paper":"/paper/exploring-the-limits-of-transfer-learning","paper_url":"https://arxiv.org/abs/1910.10683v4","paper_title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","code":"https://github.com/huggingface/transformers","n_code_links":57,"official":null,"syntology":{"n_ran":21,"n_constructed":0,"n_ran_checked":20,"n_instrument":1,"n_unverified":10,"n_samples":31,"n_pointer_only_licence":0,"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"}}}},{"rank_in_archive_order":10,"model":"Local Joint Self-attention","metrics":{"BLEU score":"43.3"},"uses_additional_data":false,"paper_date":"2019-05-16","paper":"/paper/190506596","paper_url":"https://arxiv.org/abs/1905.06596v1","paper_title":"Joint Source-Target Self Attention with Locality Constraints","code":"https://github.com/jarfo/joint","n_code_links":2,"official":null,"syntology":null},{"rank_in_archive_order":11,"model":"Depth Growing","metrics":{"BLEU score":"43.27","Hardware Burden":"24G"},"uses_additional_data":false,"paper_date":"2019-07-03","paper":"/paper/depth-growing-for-neural-machine-translation","paper_url":"https://arxiv.org/abs/1907.01968v1","paper_title":"Depth Growing for Neural Machine Translation","code":"https://github.com/apeterswu/Depth_Growing_NMT","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":12,"model":"Transformer Big","metrics":{"BLEU score":"43.2","Hardware Burden":"55G"},"uses_additional_data":false,"paper_date":"2018-06-01","paper":"/paper/scaling-neural-machine-translation","paper_url":"http://arxiv.org/abs/1806.00187v3","paper_title":"Scaling Neural Machine Translation","code":"https://github.com/facebookresearch/fairseq","n_code_links":5,"official":null,"syntology":null},{"rank_in_archive_order":13,"model":"DynamicConv","metrics":{"BLEU score":"43.2"},"uses_additional_data":false,"paper_date":"2019-01-29","paper":"/paper/pay-less-attention-with-lightweight-and","paper_url":"http://arxiv.org/abs/1901.10430v2","paper_title":"Pay Less Attention with Lightweight and Dynamic Convolutions","code":"https://github.com/pytorch/fairseq","n_code_links":3,"official":null,"syntology":null},{"rank_in_archive_order":14,"model":"TaLK Convolutions","metrics":{"BLEU score":"43.2"},"uses_additional_data":false,"paper_date":"2020-02-08","paper":"/paper/time-aware-large-kernel-convolutions","paper_url":"https://arxiv.org/abs/2002.03184v2","paper_title":"Time-aware Large Kernel Convolutions","code":"https://github.com/lioutasb/TaLKConvolutions","n_code_links":1,"official":{"repos":["lioutasb/TaLKConvolutions"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]},"syntology":{"n_ran":6,"n_constructed":2,"n_ran_checked":2,"n_instrument":4,"n_unverified":1,"n_samples":7,"n_pointer_only_licence":3,"sample_list":"/paper/time-aware-large-kernel-convolutions#ran","syntology_url":"https://syntology.ai/paper/2002.03184","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.03184"}}}},{"rank_in_archive_order":15,"model":"LightConv","metrics":{"BLEU score":"43.1"},"uses_additional_data":false,"paper_date":"2019-01-29","paper":"/paper/pay-less-attention-with-lightweight-and","paper_url":"http://arxiv.org/abs/1901.10430v2","paper_title":"Pay Less Attention with Lightweight and Dynamic Convolutions","code":"https://github.com/pytorch/fairseq","n_code_links":3,"official":null,"syntology":null},{"rank_in_archive_order":16,"model":"FLOATER-large","metrics":{"BLEU score":"42.7"},"uses_additional_data":false,"paper_date":"2020-03-13","paper":"/paper/learning-to-encode-position-for-transformer","paper_url":"https://arxiv.org/abs/2003.09229v1","paper_title":"Learning to Encode Position for Transformer with Continuous Dynamical Model","code":"https://github.com/xuanqing94/FLOATER","n_code_links":1,"official":null,"syntology":{"n_ran":3,"n_constructed":2,"n_ran_checked":0,"n_instrument":3,"n_unverified":3,"n_samples":6,"n_pointer_only_licence":6,"sample_list":"/paper/learning-to-encode-position-for-transformer#ran","syntology_url":"https://syntology.ai/paper/2003.09229","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.09229"}}}},{"rank_in_archive_order":17,"model":"OmniNetP","metrics":{"BLEU score":"42.6"},"uses_additional_data":false,"paper_date":"2021-03-01","paper":"/paper/omninet-omnidirectional-representations-from","paper_url":"https://arxiv.org/abs/2103.01075v1","paper_title":"OmniNet: Omnidirectional Representations from Transformers","code":"https://github.com/lucidrains/omninet-pytorch","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":18,"model":"Transformer Big + MoS","metrics":{"BLEU score":"42.1"},"uses_additional_data":false,"paper_date":"2018-09-25","paper":"/paper/fast-and-simple-mixture-of-softmaxes-with-bpe","paper_url":"https://arxiv.org/abs/1809.09296v2","paper_title":"Fast and Simple Mixture of Softmaxes with BPE and Hybrid-LightRNN for Language Generation","code":"https://github.com/shawnkx/Fast-MoS","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":19,"model":"T2R + Pretrain","metrics":{"BLEU score":"42.1"},"uses_additional_data":false,"paper_date":"2021-03-24","paper":"/paper/finetuning-pretrained-transformers-into-rnns","paper_url":"https://arxiv.org/abs/2103.13076v2","paper_title":"Finetuning Pretrained Transformers into RNNs","code":"https://github.com/hazyresearch/lolcats","n_code_links":2,"official":null,"syntology":{"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":5,"n_samples":8,"n_pointer_only_licence":4,"sample_list":"/paper/finetuning-pretrained-transformers-into-rnns#ran","syntology_url":"https://syntology.ai/paper/2103.13076","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.13076"}}}},{"rank_in_archive_order":20,"model":"Synthesizer (Random + Vanilla)","metrics":{"BLEU score":"41.85"},"uses_additional_data":false,"paper_date":"2020-05-02","paper":"/paper/synthesizer-rethinking-self-attention-in","paper_url":"https://arxiv.org/abs/2005.00743v3","paper_title":"Synthesizer: Rethinking Self-Attention in Transformer Models","code":"https://github.com/10-zin/Synthesizer","n_code_links":1,"official":null,"syntology":{"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":0,"sample_list":"/paper/synthesizer-rethinking-self-attention-in#ran","syntology_url":"https://syntology.ai/paper/2005.00743","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00743"}}}},{"rank_in_archive_order":21,"model":"Hardware Aware Transformer","metrics":{"BLEU score":"41.8"},"uses_additional_data":false,"paper_date":"2020-05-28","paper":"/paper/hat-hardware-aware-transformers-for-efficient","paper_url":"https://arxiv.org/abs/2005.14187v1","paper_title":"HAT: Hardware-Aware Transformers for Efficient Natural Language Processing","code":"https://github.com/mit-han-lab/hardware-aware-transformers","n_code_links":4,"official":null,"syntology":null},{"rank_in_archive_order":22,"model":"Transformer (big) + Relative Position Representations","metrics":{"BLEU score":"41.5"},"uses_additional_data":false,"paper_date":"2018-03-06","paper":"/paper/self-attention-with-relative-position","paper_url":"http://arxiv.org/abs/1803.02155v2","paper_title":"Self-Attention with Relative Position Representations","code":"https://github.com/tensorflow/tensor2tensor","n_code_links":13,"official":{"repos":["tensorflow/tensor2tensor"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"syntology":{"n_ran":13,"n_constructed":4,"n_ran_checked":8,"n_instrument":5,"n_unverified":10,"n_samples":23,"n_pointer_only_licence":3,"sample_list":"/paper/self-attention-with-relative-position#ran","syntology_url":"https://syntology.ai/paper/1803.02155","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.02155"}}}},{"rank_in_archive_order":23,"model":"Stack 4-layer RNNSearch + Dual Learning + Deliberation Network","metrics":{"BLEU score":"41.5"},"uses_additional_data":false,"paper_date":"2017-12-01","paper":"/paper/deliberation-networks-sequence-generation","paper_url":"http://papers.nips.cc/paper/6775-deliberation-networks-sequence-generation-beyond-one-pass-decoding","paper_title":"Deliberation Networks: Sequence Generation Beyond One-Pass Decoding","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":24,"model":"Weighted Transformer (large)","metrics":{"BLEU score":"41.4"},"uses_additional_data":false,"paper_date":"2017-11-06","paper":"/paper/weighted-transformer-network-for-machine","paper_url":"http://arxiv.org/abs/1711.02132v1","paper_title":"Weighted Transformer Network for Machine Translation","code":"https://github.com/JayParks/transformer","n_code_links":5,"official":null,"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_samples":2,"n_pointer_only_licence":2,"sample_list":"/paper/weighted-transformer-network-for-machine#ran","syntology_url":"https://syntology.ai/paper/1711.02132","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.02132"}}}},{"rank_in_archive_order":25,"model":"ConvS2S (ensemble)","metrics":{"BLEU score":"41.3"},"uses_additional_data":false,"paper_date":"2017-05-08","paper":"/paper/convolutional-sequence-to-sequence-learning","paper_url":"http://arxiv.org/abs/1705.03122v3","paper_title":"Convolutional Sequence to Sequence Learning","code":"https://github.com/facebookresearch/fairseq","n_code_links":37,"official":null,"syntology":null},{"rank_in_archive_order":26,"model":"Evolved Transformer Big","metrics":{"BLEU score":"41.3"},"uses_additional_data":false,"paper_date":"2019-01-30","paper":"/paper/the-evolved-transformer","paper_url":"https://arxiv.org/abs/1901.11117v4","paper_title":"The Evolved Transformer","code":"https://github.com/tensorflow/tensor2tensor","n_code_links":3,"official":null,"syntology":null},{"rank_in_archive_order":27,"model":"RNMT+","metrics":{"BLEU score":"41.0","Hardware Burden":"132G","Operations per network pass":"2.81G"},"uses_additional_data":false,"paper_date":"2018-04-26","paper":"/paper/the-best-of-both-worlds-combining-recent","paper_url":"http://arxiv.org/abs/1804.09849v2","paper_title":"The Best of Both Worlds: Combining Recent Advances in Neural Machine Translation","code":"https://github.com/tensorflow/lingvo","n_code_links":3,"official":null,"syntology":null},{"rank_in_archive_order":28,"model":"Transformer Big","metrics":{"BLEU score":"41.0","Hardware Burden":"23G","Operations per network pass":"2300000000.0G"},"uses_additional_data":true,"paper_date":"2017-06-12","paper":"/paper/attention-is-all-you-need","paper_url":"https://arxiv.org/abs/1706.03762v7","paper_title":"Attention Is All You Need","code":"https://github.com/huggingface/transformers","n_code_links":595,"official":{"repos":["tensorflow/tensor2tensor"],"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"]},"syntology":{"n_ran":610,"n_constructed":293,"n_ran_checked":529,"n_instrument":81,"n_unverified":336,"n_samples":946,"n_pointer_only_licence":451,"sample_list":"/paper/attention-is-all-you-need#ran","syntology_url":"https://syntology.ai/paper/1706.03762","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.03762"}}}},{"rank_in_archive_order":29,"model":"Evolved Transformer Base","metrics":{"BLEU score":"40.6"},"uses_additional_data":false,"paper_date":"2019-01-30","paper":"/paper/the-evolved-transformer","paper_url":"https://arxiv.org/abs/1901.11117v4","paper_title":"The Evolved Transformer","code":"https://github.com/tensorflow/tensor2tensor","n_code_links":3,"official":null,"syntology":null},{"rank_in_archive_order":30,"model":"ResMLP-12","metrics":{"BLEU score":"40.6"},"uses_additional_data":false,"paper_date":"2021-05-07","paper":"/paper/resmlp-feedforward-networks-for-image","paper_url":"https://arxiv.org/abs/2105.03404v2","paper_title":"ResMLP: Feedforward networks for image classification with data-efficient training","code":"https://github.com/rwightman/pytorch-image-models","n_code_links":19,"official":{"repos":["facebookresearch/deit"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"syntology":{"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_samples":7,"n_pointer_only_licence":0,"sample_list":"/paper/resmlp-feedforward-networks-for-image#ran","syntology_url":"https://syntology.ai/paper/2105.03404","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.03404"}}}},{"rank_in_archive_order":31,"model":"MoE","metrics":{"BLEU score":"40.56","Hardware Burden":"142G"},"uses_additional_data":false,"paper_date":"2017-01-23","paper":"/paper/outrageously-large-neural-networks-the","paper_url":"http://arxiv.org/abs/1701.06538v1","paper_title":"Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer","code":"https://github.com/davidmrau/mixture-of-experts","n_code_links":4,"official":null,"syntology":{"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_samples":6,"n_pointer_only_licence":6,"sample_list":"/paper/outrageously-large-neural-networks-the#ran","syntology_url":"https://syntology.ai/paper/1701.06538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.06538"}}}},{"rank_in_archive_order":32,"model":"Transformer","metrics":{"BLEU score":"40.5"},"uses_additional_data":false,"paper_date":"2019-01-30","paper":"/paper/memory-efficient-adaptive-optimization-for","paper_url":"https://arxiv.org/abs/1901.11150v2","paper_title":"Memory-Efficient Adaptive Optimization","code":"https://github.com/google-research/google-research/tree/master/sm3","n_code_links":4,"official":null,"syntology":null},{"rank_in_archive_order":33,"model":"ConvS2S","metrics":{"BLEU score":"40.46","Hardware Burden":"143G"},"uses_additional_data":false,"paper_date":"2017-05-08","paper":"/paper/convolutional-sequence-to-sequence-learning","paper_url":"http://arxiv.org/abs/1705.03122v3","paper_title":"Convolutional Sequence to Sequence Learning","code":"https://github.com/facebookresearch/fairseq","n_code_links":37,"official":null,"syntology":null},{"rank_in_archive_order":34,"model":"ResMLP-6","metrics":{"BLEU score":"40.3"},"uses_additional_data":false,"paper_date":"2021-05-07","paper":"/paper/resmlp-feedforward-networks-for-image","paper_url":"https://arxiv.org/abs/2105.03404v2","paper_title":"ResMLP: Feedforward networks for image classification with data-efficient training","code":"https://github.com/rwightman/pytorch-image-models","n_code_links":19,"official":{"repos":["facebookresearch/deit"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"syntology":{"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_samples":7,"n_pointer_only_licence":0,"sample_list":"/paper/resmlp-feedforward-networks-for-image#ran","syntology_url":"https://syntology.ai/paper/2105.03404","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.03404"}}}},{"rank_in_archive_order":35,"model":"TransformerBase + AutoDropout","metrics":{"BLEU score":"40"},"uses_additional_data":false,"paper_date":"2021-01-05","paper":"/paper/autodropout-learning-dropout-patterns-to","paper_url":"https://arxiv.org/abs/2101.01761v1","paper_title":"AutoDropout: Learning Dropout Patterns to Regularize Deep Networks","code":"https://github.com/google-research/google-research","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":36,"model":"GNMT+RL","metrics":{"BLEU score":"39.9","Hardware Burden":"279G"},"uses_additional_data":false,"paper_date":"2016-09-26","paper":"/paper/googles-neural-machine-translation-system","paper_url":"http://arxiv.org/abs/1609.08144v2","paper_title":"Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translation","code":"https://github.com/NVIDIA/DeepLearningExamples/tree/master/PyTorch/Translation/GNMT","n_code_links":28,"official":null,"syntology":{"n_ran":34,"n_constructed":4,"n_ran_checked":25,"n_instrument":9,"n_unverified":12,"n_samples":46,"n_pointer_only_licence":13,"sample_list":"/paper/googles-neural-machine-translation-system#ran","syntology_url":"https://syntology.ai/paper/1609.08144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.08144"}}}},{"rank_in_archive_order":37,"model":"Lite Transformer","metrics":{"BLEU score":"39.6"},"uses_additional_data":false,"paper_date":"2020-04-24","paper":"/paper/lite-transformer-with-long-short-range","paper_url":"https://arxiv.org/abs/2004.11886v1","paper_title":"Lite Transformer with Long-Short Range Attention","code":"https://github.com/mit-han-lab/lite-transformer","n_code_links":2,"official":null,"syntology":null},{"rank_in_archive_order":38,"model":"Deep-Att + PosUnk","metrics":{"BLEU score":"39.2","Hardware Burden":"119G"},"uses_additional_data":false,"paper_date":"2016-06-14","paper":"/paper/deep-recurrent-models-with-fast-forward","paper_url":"http://arxiv.org/abs/1606.04199v3","paper_title":"Deep Recurrent Models with Fast-Forward Connections for Neural Machine Translation","code":"https://github.com/fstahlberg/tensor2tensor-usr","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":39,"model":"Rfa-Gate-arccos","metrics":{"BLEU score":"39.2"},"uses_additional_data":false,"paper_date":"2021-03-03","paper":"/paper/random-feature-attention-1","paper_url":"https://arxiv.org/abs/2103.02143v2","paper_title":"Random Feature Attention","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":40,"model":"Transformer Base","metrics":{"BLEU score":"38.1","Hardware Burden":"23G","Operations per network pass":"330000000.0G"},"uses_additional_data":false,"paper_date":"2017-06-12","paper":"/paper/attention-is-all-you-need","paper_url":"https://arxiv.org/abs/1706.03762v7","paper_title":"Attention Is All You Need","code":"https://github.com/huggingface/transformers","n_code_links":595,"official":{"repos":["tensorflow/tensor2tensor"],"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"]},"syntology":{"n_ran":610,"n_constructed":293,"n_ran_checked":529,"n_instrument":81,"n_unverified":336,"n_samples":946,"n_pointer_only_licence":451,"sample_list":"/paper/attention-is-all-you-need#ran","syntology_url":"https://syntology.ai/paper/1706.03762","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.03762"}}}},{"rank_in_archive_order":41,"model":"LSTM6 + PosUnk","metrics":{"BLEU score":"37.5"},"uses_additional_data":false,"paper_date":"2014-10-30","paper":"/paper/addressing-the-rare-word-problem-in-neural","paper_url":"http://arxiv.org/abs/1410.8206v4","paper_title":"Addressing the Rare Word Problem in Neural Machine Translation","code":"https://github.com/atpaino/deep-text-corrector","n_code_links":5,"official":null,"syntology":null},{"rank_in_archive_order":42,"model":"PBMT","metrics":{"BLEU score":"37"},"uses_additional_data":false,"paper_date":null,"paper":null,"paper_url":null,"paper_title":"","code":null,"n_code_links":0,"official":null,"syntology":null},{"rank_in_archive_order":43,"model":"SMT+LSTM5","metrics":{"BLEU score":"36.5"},"uses_additional_data":false,"paper_date":"2014-09-10","paper":"/paper/sequence-to-sequence-learning-with-neural","paper_url":"http://arxiv.org/abs/1409.3215v3","paper_title":"Sequence to Sequence Learning with Neural Networks","code":"https://github.com/bentrevett/pytorch-seq2seq","n_code_links":74,"official":null,"syntology":{"n_ran":21,"n_constructed":0,"n_ran_checked":13,"n_instrument":8,"n_unverified":4,"n_samples":25,"n_pointer_only_licence":9,"sample_list":"/paper/sequence-to-sequence-learning-with-neural#ran","syntology_url":"https://syntology.ai/paper/1409.3215","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1409.3215"}}}},{"rank_in_archive_order":44,"model":"RNN-search50*","metrics":{"BLEU score":"36.2"},"uses_additional_data":false,"paper_date":"2014-09-01","paper":"/paper/neural-machine-translation-by-jointly","paper_url":"http://arxiv.org/abs/1409.0473v7","paper_title":"Neural Machine Translation by Jointly Learning to Align and Translate","code":"https://github.com/graykode/nlp-tutorial","n_code_links":124,"official":null,"syntology":{"n_ran":41,"n_constructed":2,"n_ran_checked":24,"n_instrument":17,"n_unverified":3,"n_samples":44,"n_pointer_only_licence":16,"sample_list":"/paper/neural-machine-translation-by-jointly#ran","syntology_url":"https://syntology.ai/paper/1409.0473","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1409.0473"}}}},{"rank_in_archive_order":45,"model":"Deep-Att","metrics":{"BLEU score":"35.9"},"uses_additional_data":false,"paper_date":"2016-06-14","paper":"/paper/deep-recurrent-models-with-fast-forward","paper_url":"http://arxiv.org/abs/1606.04199v3","paper_title":"Deep Recurrent Models with Fast-Forward Connections for Neural Machine Translation","code":"https://github.com/fstahlberg/tensor2tensor-usr","n_code_links":1,"official":null,"syntology":null},{"rank_in_archive_order":46,"model":"Deep Convolutional Encoder; single-layer decoder","metrics":{"BLEU score":"35.7"},"uses_additional_data":false,"paper_date":"2016-11-07","paper":"/paper/a-convolutional-encoder-model-for-neural","paper_url":"http://arxiv.org/abs/1611.02344v3","paper_title":"A Convolutional Encoder Model for Neural Machine Translation","code":"https://github.com/facebookresearch/fairseq","n_code_links":2,"official":null,"syntology":null},{"rank_in_archive_order":47,"model":"LSTM","metrics":{"BLEU score":"34.8"},"uses_additional_data":false,"paper_date":"2014-09-10","paper":"/paper/sequence-to-sequence-learning-with-neural","paper_url":"http://arxiv.org/abs/1409.3215v3","paper_title":"Sequence to Sequence Learning with Neural Networks","code":"https://github.com/bentrevett/pytorch-seq2seq","n_code_links":74,"official":null,"syntology":{"n_ran":21,"n_constructed":0,"n_ran_checked":13,"n_instrument":8,"n_unverified":4,"n_samples":25,"n_pointer_only_licence":9,"sample_list":"/paper/sequence-to-sequence-learning-with-neural#ran","syntology_url":"https://syntology.ai/paper/1409.3215","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1409.3215"}}}},{"rank_in_archive_order":48,"model":"CSLM + RNN + WP","metrics":{"BLEU score":"34.54"},"uses_additional_data":false,"paper_date":"2014-06-03","paper":"/paper/learning-phrase-representations-using-rnn","paper_url":"http://arxiv.org/abs/1406.1078v3","paper_title":"Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translation","code":"https://github.com/graykode/nlp-tutorial","n_code_links":42,"official":null,"syntology":{"n_ran":13,"n_constructed":6,"n_ran_checked":10,"n_instrument":3,"n_unverified":9,"n_samples":22,"n_pointer_only_licence":14,"sample_list":"/paper/learning-phrase-representations-using-rnn#ran","syntology_url":"https://syntology.ai/paper/1406.1078","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1406.1078"}}}},{"rank_in_archive_order":49,"model":"FLAN 137B (zero-shot)","metrics":{"BLEU score":"33.9"},"uses_additional_data":false,"paper_date":"2021-09-03","paper":"/paper/finetuned-language-models-are-zero-shot","paper_url":"https://arxiv.org/abs/2109.01652v5","paper_title":"Finetuned Language Models Are Zero-Shot Learners","code":"https://github.com/hiyouga/llama-efficient-tuning","n_code_links":8,"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":[]},"syntology":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0,"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"}}}},{"rank_in_archive_order":50,"model":"FLAN 137B (few-shot, k=9)","metrics":{"BLEU score":"33.8"},"uses_additional_data":false,"paper_date":"2021-09-03","paper":"/paper/finetuned-language-models-are-zero-shot","paper_url":"https://arxiv.org/abs/2109.01652v5","paper_title":"Finetuned Language Models Are Zero-Shot Learners","code":"https://github.com/hiyouga/llama-efficient-tuning","n_code_links":8,"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":[]},"syntology":{"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0,"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"}}}},{"rank_in_archive_order":51,"model":"Regularized LSTM","metrics":{"BLEU score":"29.03"},"uses_additional_data":false,"paper_date":"2014-09-08","paper":"/paper/recurrent-neural-network-regularization","paper_url":"http://arxiv.org/abs/1409.2329v5","paper_title":"Recurrent Neural Network Regularization","code":"https://github.com/wojzaremba/lstm","n_code_links":21,"official":{"repos":["wojzaremba/lstm"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"syntology":{"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":4,"n_samples":6,"n_pointer_only_licence":6,"sample_list":"/paper/recurrent-neural-network-regularization#ran","syntology_url":"https://syntology.ai/paper/1409.2329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1409.2329"}}}},{"rank_in_archive_order":52,"model":"Unsupervised PBSMT","metrics":{"BLEU score":"28.11"},"uses_additional_data":false,"paper_date":"2018-04-20","paper":"/paper/phrase-based-neural-unsupervised-machine","paper_url":"http://arxiv.org/abs/1804.07755v2","paper_title":"Phrase-Based & Neural Unsupervised Machine Translation","code":"https://github.com/huggingface/transformers","n_code_links":14,"official":null,"syntology":null},{"rank_in_archive_order":53,"model":"PBSMT + NMT","metrics":{"BLEU score":"27.6"},"uses_additional_data":false,"paper_date":"2018-04-20","paper":"/paper/phrase-based-neural-unsupervised-machine","paper_url":"http://arxiv.org/abs/1804.07755v2","paper_title":"Phrase-Based & Neural Unsupervised Machine Translation","code":"https://github.com/huggingface/transformers","n_code_links":14,"official":null,"syntology":null},{"rank_in_archive_order":54,"model":"GRU+Attention","metrics":{"BLEU score":"26.4"},"uses_additional_data":false,"paper_date":"2016-10-27","paper":"/paper/can-active-memory-replace-attention","paper_url":"http://arxiv.org/abs/1610.08613v2","paper_title":"Can Active Memory Replace Attention?","code":"https://github.com/tensorflow/models","n_code_links":2,"official":null,"syntology":null},{"rank_in_archive_order":55,"model":"SMT + iterative backtranslation (unsupervised)","metrics":{"BLEU score":"26.22"},"uses_additional_data":false,"paper_date":"2018-09-04","paper":"/paper/unsupervised-statistical-machine-translation","paper_url":"http://arxiv.org/abs/1809.01272v1","paper_title":"Unsupervised Statistical Machine Translation","code":"https://github.com/artetxem/vecmap","n_code_links":3,"official":null,"syntology":null},{"rank_in_archive_order":56,"model":"Unsupervised NMT + Transformer","metrics":{"BLEU score":"25.14"},"uses_additional_data":false,"paper_date":"2018-04-20","paper":"/paper/phrase-based-neural-unsupervised-machine","paper_url":"http://arxiv.org/abs/1804.07755v2","paper_title":"Phrase-Based & Neural Unsupervised Machine Translation","code":"https://github.com/huggingface/transformers","n_code_links":14,"official":null,"syntology":null},{"rank_in_archive_order":57,"model":"Unsupervised attentional encoder-decoder + BPE","metrics":{"BLEU score":"14.36"},"uses_additional_data":false,"paper_date":"2017-10-30","paper":"/paper/unsupervised-neural-machine-translation","paper_url":"http://arxiv.org/abs/1710.11041v2","paper_title":"Unsupervised Neural Machine Translation","code":"https://github.com/rsennrich/subword-nmt","n_code_links":2,"official":{"repos":["artetxem/undreamt","rsennrich/subword-nmt"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"syntology":{"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":0,"n_samples":6,"n_pointer_only_licence":6,"sample_list":"/paper/unsupervised-neural-machine-translation#ran","syntology_url":"https://syntology.ai/paper/1710.11041","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.11041"}}}}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"adjudicator":"Claude Opus 5.5","adjudicator_from":"groundwork/59_code_with_papers/LB_EXTRACTOR_PREREG.md (not recorded in lb_measurement.json; the file's frozen_commit, measured_on and counts equal the run the pre-registration records)","adjudicator_sensitivity":[69,70],"adjudicator_specificity":[101,103],"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication by a model (adjudicator) of accepted entries on a held-out split of archive papers, rules frozen before the test; adjudicator_sensitivity and adjudicator_specificity are its own controls as [judged right, of]; it was not measured on the newer papers placed here","measurement_sentence":"Measured before publishing, on held-out archive papers: the extractor was given 883 of them and produced output for 881 (the other 2 had no title and were excluded before any model call, so they are not part of this measurement). A model adjudicator (Claude Opus 5.5), blind to which entries were real, judged 108 of 110 accepted entries correct on those held-out archive papers; its own controls: 69 of 70 archive-confirmed entries judged true, 101 of 103 corrupted copies judged false. It was not measured on the newer papers whose results are placed on this site.","coverage":{"sentence":"Syntology has checked 8,886 of the 18,637 papers on this site that are newer than the archive (for 3,717 of them no archive leaderboard matched the paper's tables, so there was nothing further to check); 733 were read and have nothing to place (arXiv has no HTML version of the paper, or that version has no tables), 41 could not be read (the extractor's reply could not be parsed), and results from the other 8,977 appear after they are checked.","complete":false,"papers_newer_than_archive":18637,"papers_checked":8886,"papers_checked_no_leaderboard_matched":3717,"papers_read_nothing_to_place":733,"papers_could_not_be_read":41,"papers_could_not_be_read_by_status":{"unparseable":41},"papers_extracted_not_yet_verified":0,"boards_without_verdict":3,"papers_not_yet_extracted":8975},"board_status":{"sentence":"Of the 8,888 newer papers whose tables Syntology has read (8,886 checked in full and 2 with a leaderboard still awaiting a verdict), 2 had this board among the leaderboards the extractor considered for their tables (it keeps at most 10 boards per paper and 4 per dataset; the lists of 1,595 of the 8,888 were already full without this board, so if it was crowded out of them it is not counted), and none proposed a result, so none await a verdict and none were placed.","note":"papers, from the extractor's own records, over the newer papers whose tables were read; proposed = no_cell_passed_checks + rejected_by_independent_check + accepted_not_placed + awaiting_verdict + placed; counts, never a rate","eligible":true,"eligible_note":"false when the extractor never considers this board: it loads only boards with archive rows and at least one metric column (lb_extract.py Boards), so no newer paper can be proposed here; archive_rows and metric_columns say which","archive_rows":57,"metric_columns":4,"papers_read":8888,"papers_read_checked":8886,"papers_read_awaiting_verdict":2,"papers_read_verified":8888,"papers_read_not_yet_verified":0,"papers_read_at_candidate_cap":1596,"papers_read_list_full_without_this_board":1595,"candidates":2,"candidates_capped_note":"candidates = papers that had this board among the leaderboards the extractor considered for their tables; the extractor keeps at most 10 per paper and 4 per dataset, so a board crowded out of a paper's list is not counted and candidates is a floor; papers_read_list_full_without_this_board counts the read papers whose list did not hold this board and had reached 10, or held 4 boards of this board's dataset (the only papers that could have crowded it out); papers_read_at_candidate_cap counts, over every board, the papers whose list reached 10","proposed":0,"no_cell_passed_checks":0,"rejected_by_independent_check":0,"accepted_not_placed":0,"awaiting_verdict":0,"placed":0,"placed_entries_listed":0,"file_lines_unreadable_as_read":0,"since_line":"Since the archive (Syntology): none placed; no newer paper judged to report on this board so far"},"judged_to_report":{"heading":"Newer papers whose tables a model judged to report on this benchmark (a model's judgement, not a result; newest first by arXiv id)","judged_by":{"model":"a model","models_as_recorded":[],"a_record_without_a_model":false,"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","order":"newest first by arXiv id (the identifier's order, not a rank)","outcomes":{"placed":"placed","no_cell_passed_checks":"no cell passed the extractor's checks","refused_by_rule":"refused by a rule","rejected":"rejected by the independent check","accepted_not_placed":"accepted by the independent check but not placed by this site","awaiting":"awaiting a verdict"},"reason_note":"for refused_by_rule, the rules' plain words for the reason codes the record gives (never the quoted or the actual cell text); null for every other outcome","total":0,"shown_on_page":0,"no_cell_split":{"no_cell_passed_checks_in_ledger":0,"rows_refused_by_rule":0,"rows_no_cell_passed_checks":0},"rows":[]},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per row: of M harvested code samples from that row's paper, n_ran executed on a synthesized fixture (n_ran = n_ran_checked + n_instrument; n_instrument counts failures of Syntology's instrument, not of the code); the other M - n_ran are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","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)"},"rows_with_graph_line":27,"rows_with_any_sample_ran":24,"rows_with_a_run_with_no_instrument_failure":21,"official":{"state_rule":"the archive's official repositories have samples for this paper that ran: 'official (archive's flag): N ran' (N counts them, instrument failures included); they have samples, none ran: 'official: harvested, nothing ran'; they have no sample for this paper and another sample ran: 'community repositories only' when every sample that ran came from a repository the archive lists for the paper but neither marks official nor records as mentioned in it, or one Syntology harvested outside the archive's links, else 'official: no sample here; runs from other or unrecorded repositories' (a repository named in the paper or found in its text by Syntology, or no repository recorded); otherwise 'official: harvested for another paper' or 'official: not harvested'. Absent when the archive marks no repository official. Official is the archive's is_official flag, not an authorship verdict","flag":"the archive's is_official flag for the paper's code link; not a verdict on who wrote the code","rows_with_an_archive_official_repository":16,"rows_whose_official_repository_has_a_sample_that_ran":3,"rows_whose_official_repository_has_a_run_with_no_instrument_failure":3,"rows_community_repositories_only":8,"rows_runs_from_other_or_unrecorded_repositories":2,"note":"rows[].official, per row with a graph line: repos (marked official in the archive), state, n_ran and n_unverified (samples from those repositories), and ran_from_kinds (the kinds of repository the paper's samples that ran came from; 'unlocated' is no repository recorded)"},"filters":{"ran_modes":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"the page's filters hide rows and never renumber them; they read the Ran cell's counts, the same figures rows[].syntology and rows[].official carry"},"row_route":"rows[].syntology 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","distinct_papers_with_graph_line":22,"distinct_papers_with_any_sample_ran":20,"distinct_papers_with_a_run_with_no_instrument_failure":17,"samples_over_distinct_papers":{"n_ran":802,"n_constructed":325,"n_ran_checked":655,"n_instrument":147,"n_unverified":407,"n_samples":1209,"n_pointer_only_licence":543,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":1446,"n_constructed":620,"n_ran_checked":1205,"n_instrument":241,"n_unverified":751,"n_samples":2197,"n_pointer_only_licence":1006,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}},"record_sha256":"5e7fa1fb8146894961b50967cae50107da8845711b8d8f3355d50e362e31e798","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}