{"url":"/sota/language-modelling-on-enwiki8","task":{"name":"Language Modelling","url":"/task/language-modelling","note":null},"dataset":{"name":"enwik8","url":null},"category":"Natural Language Processing","categories":["Medical","Miscellaneous","Natural Language Processing"],"category_note":null,"description":"A language model is a model of natural language. Language models are useful for a variety of tasks, including speech recognition, machine translation, natural language generation (generating more human-like text), optical character recognition, route optimization, handwriting recognition, grammar induction, and information retrieval.\r\n\r\nLarge language models (LLMs), currently their most advanced form, are predominantly based on transformers trained on larger datasets (frequently using words scraped from the public internet). They have superseded recurrent neural network-based models, which had previously superseded the purely statistical models, such as word n-gram language model. \r\n\r\nSource: [Wikipedia](https://en.wikipedia.org/wiki/Language_model)","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":["Bit per Character (BPC)","Number of params"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"Bit per Character (BPC)":null,"Number of params":"lower"}},"counts":{"rows":42,"rows_with_code":40,"rows_with_paper_page":42,"rows_dated":42,"rows_using_additional_data":2},"rows":[{"rank_in_archive_order":1,"model":"GPT-2 (48 layers, h=1600)","metrics":{"Bit per Character (BPC)":"0.93","Number of params":"1542M"},"uses_additional_data":true,"paper_date":"2019-02-14","paper":"/paper/language-models-are-unsupervised-multitask","paper_url":"https://d4mucfpksywv.cloudfront.net/better-language-models/language-models.pdf","paper_title":"Language Models are Unsupervised Multitask Learners","code":"https://github.com/huggingface/transformers","n_code_links":21,"syntology":null},{"rank_in_archive_order":2,"model":"Transformer-XL (24 layers, RMS dynamic eval, decay)","metrics":{"Bit per Character (BPC)":"0.940","Number of params":"277M"},"uses_additional_data":true,"paper_date":"2019-04-17","paper":"/paper/dynamic-evaluation-of-transformer-language","paper_url":"http://arxiv.org/abs/1904.08378v1","paper_title":"Dynamic Evaluation of Transformer Language Models","code":"https://github.com/benkrause/dynamiceval-transformer","n_code_links":1,"syntology":null},{"rank_in_archive_order":3,"model":"Focus","metrics":{"Bit per Character (BPC)":"0.940","Number of params":"22M"},"uses_additional_data":false,"paper_date":"2023-05-24","paper":"/paper/2305-14952","paper_url":"https://arxiv.org/abs/2305.14952v2","paper_title":"Focus Your Attention (with Adaptive IIR Filters)","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":4,"model":"Expire-Span (24 layers)","metrics":{"Bit per Character (BPC)":"0.95","Number of params":"208M"},"uses_additional_data":false,"paper_date":"2021-05-13","paper":"/paper/not-all-memories-are-created-equal-learning-1","paper_url":"https://arxiv.org/abs/2105.06548v2","paper_title":"Not All Memories are Created Equal: Learning to Forget by Expiring","code":"https://github.com/facebookresearch/transformer-sequential","n_code_links":1,"syntology":null},{"rank_in_archive_order":5,"model":"SRU++ Large","metrics":{"Bit per Character (BPC)":"0.95","Number of params":"195M"},"uses_additional_data":false,"paper_date":"2021-02-24","paper":"/paper/when-attention-meets-fast-recurrence-training","paper_url":"https://arxiv.org/abs/2102.12459v3","paper_title":"When Attention Meets Fast Recurrence: Training Language Models with Reduced Compute","code":"https://github.com/asappresearch/sru","n_code_links":1,"syntology":null},{"rank_in_archive_order":6,"model":"Feedback Transformer","metrics":{"Bit per Character (BPC)":"0.96","Number of params":"77M"},"uses_additional_data":false,"paper_date":"2020-02-21","paper":"/paper/accessing-higher-level-representations-in","paper_url":"https://arxiv.org/abs/2002.09402v3","paper_title":"Addressing Some Limitations of Transformers with Feedback Memory","code":"https://github.com/labmlai/annotated_deep_learning_paper_implementations","n_code_links":4,"syntology":{"n_ran":3,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":2}},{"rank_in_archive_order":7,"model":"Sandwich Transformer (adaptive span)","metrics":{"Bit per Character (BPC)":"0.968","Number of params":"209M"},"uses_additional_data":false,"paper_date":"2019-11-10","paper":"/paper/improving-transformer-models-by-reordering","paper_url":"https://arxiv.org/abs/1911.03864v2","paper_title":"Improving Transformer Models by Reordering their Sublayers","code":"https://github.com/ofirpress/sandwich_transformer","n_code_links":2,"syntology":null},{"rank_in_archive_order":8,"model":"Compressive Transformer (24 layers)","metrics":{"Bit per Character (BPC)":"0.97","Number of params":"277M"},"uses_additional_data":false,"paper_date":"2019-11-13","paper":"/paper/compressive-transformers-for-long-range-1","paper_url":"https://arxiv.org/abs/1911.05507v1","paper_title":"Compressive Transformers for Long-Range Sequence Modelling","code":"https://github.com/labmlai/annotated_deep_learning_paper_implementations","n_code_links":6,"syntology":{"n_ran":6,"n_unverified":5,"n_samples":11,"n_pointer_only_licence":0}},{"rank_in_archive_order":9,"model":"Transformer-LS (large)","metrics":{"Bit per Character (BPC)":"0.97","Number of params":"110M"},"uses_additional_data":false,"paper_date":"2021-07-05","paper":"/paper/long-short-transformer-efficient-transformers","paper_url":"https://arxiv.org/abs/2107.02192v3","paper_title":"Long-Short Transformer: Efficient Transformers for Language and Vision","code":"https://github.com/keonlee9420/Comprehensive-Transformer-TTS","n_code_links":3,"syntology":{"n_ran":4,"n_unverified":0,"n_samples":4,"n_pointer_only_licence":2}},{"rank_in_archive_order":10,"model":"SRU++ Base","metrics":{"Bit per Character (BPC)":"0.97","Number of params":"108M"},"uses_additional_data":false,"paper_date":"2021-02-24","paper":"/paper/when-attention-meets-fast-recurrence-training","paper_url":"https://arxiv.org/abs/2102.12459v3","paper_title":"When Attention Meets Fast Recurrence: Training Language Models with Reduced Compute","code":"https://github.com/asappresearch/sru","n_code_links":1,"syntology":null},{"rank_in_archive_order":11,"model":"Transformer (24 layers, 8k adaptive span)","metrics":{"Bit per Character (BPC)":"0.98","Number of params":"209M"},"uses_additional_data":false,"paper_date":"2019-05-19","paper":"/paper/adaptive-attention-span-in-transformers","paper_url":"https://arxiv.org/abs/1905.07799v2","paper_title":"Adaptive Attention Span in Transformers","code":"https://github.com/facebookresearch/adaptive-span","n_code_links":8,"syntology":null},{"rank_in_archive_order":12,"model":"Transformer-XL (24 layers)","metrics":{"Bit per Character (BPC)":"0.99","Number of params":"277M"},"uses_additional_data":false,"paper_date":"2019-01-09","paper":"/paper/transformer-xl-attentive-language-models","paper_url":"https://arxiv.org/abs/1901.02860v3","paper_title":"Transformer-XL: Attentive Language Models Beyond a Fixed-Length Context","code":"https://github.com/huggingface/transformers","n_code_links":37,"syntology":{"n_ran":65,"n_unverified":78,"n_samples":143,"n_pointer_only_licence":43}},{"rank_in_archive_order":13,"model":"Longformer (30 layers, h=512)","metrics":{"Bit per Character (BPC)":"0.99","Number of params":"102M"},"uses_additional_data":false,"paper_date":"2020-04-10","paper":"/paper/longformer-the-long-document-transformer","paper_url":"https://arxiv.org/abs/2004.05150v2","paper_title":"Longformer: The Long-Document Transformer","code":"https://github.com/huggingface/transformers","n_code_links":22,"syntology":{"n_ran":22,"n_unverified":13,"n_samples":35,"n_pointer_only_licence":5}},{"rank_in_archive_order":14,"model":"Sparse Transformer (30 layers, fixed attn)","metrics":{"Bit per Character (BPC)":"0.99","Number of params":"95M"},"uses_additional_data":false,"paper_date":"2019-04-23","paper":"/paper/190410509","paper_url":"http://arxiv.org/abs/1904.10509v1","paper_title":"Generating Long Sequences with Sparse Transformers","code":"https://github.com/mistralai/mistral-src","n_code_links":7,"syntology":{"n_ran":5,"n_unverified":1,"n_samples":6,"n_pointer_only_licence":0}},{"rank_in_archive_order":15,"model":"Routing Transformer (12 layers)","metrics":{"Bit per Character (BPC)":"0.99"},"uses_additional_data":false,"paper_date":"2020-03-12","paper":"/paper/efficient-content-based-sparse-attention-with-1","paper_url":"https://arxiv.org/abs/2003.05997v5","paper_title":"Efficient Content-Based Sparse Attention with Routing Transformers","code":"https://github.com/lucidrains/local-attention","n_code_links":2,"syntology":{"n_ran":3,"n_unverified":0,"n_samples":3,"n_pointer_only_licence":2}},{"rank_in_archive_order":16,"model":"Transformer-LS (small)","metrics":{"Bit per Character (BPC)":"0.99"},"uses_additional_data":false,"paper_date":"2021-07-05","paper":"/paper/long-short-transformer-efficient-transformers","paper_url":"https://arxiv.org/abs/2107.02192v3","paper_title":"Long-Short Transformer: Efficient Transformers for Language and Vision","code":"https://github.com/keonlee9420/Comprehensive-Transformer-TTS","n_code_links":3,"syntology":{"n_ran":4,"n_unverified":0,"n_samples":4,"n_pointer_only_licence":2}},{"rank_in_archive_order":17,"model":"Hourglass","metrics":{"Bit per Character (BPC)":"0.997"},"uses_additional_data":false,"paper_date":"2021-10-26","paper":"/paper/hierarchical-transformers-are-more-efficient","paper_url":"https://arxiv.org/abs/2110.13711v2","paper_title":"Hierarchical Transformers Are More Efficient Language Models","code":"https://github.com/labmlai/annotated_deep_learning_paper_implementations","n_code_links":3,"syntology":{"n_ran":3,"n_unverified":1,"n_samples":4,"n_pointer_only_licence":2}},{"rank_in_archive_order":18,"model":"Longformer (12 layers, h=512)","metrics":{"Bit per Character (BPC)":"1.00","Number of params":"41M"},"uses_additional_data":false,"paper_date":"2020-04-10","paper":"/paper/longformer-the-long-document-transformer","paper_url":"https://arxiv.org/abs/2004.05150v2","paper_title":"Longformer: The Long-Document Transformer","code":"https://github.com/huggingface/transformers","n_code_links":22,"syntology":{"n_ran":22,"n_unverified":13,"n_samples":35,"n_pointer_only_licence":5}},{"rank_in_archive_order":19,"model":"All-attention network (18 layers)","metrics":{"Bit per Character (BPC)":"1.01","Number of params":"39M"},"uses_additional_data":false,"paper_date":"2019-07-02","paper":"/paper/augmenting-self-attention-with-persistent","paper_url":"https://arxiv.org/abs/1907.01470v1","paper_title":"Augmenting Self-attention with Persistent Memory","code":"https://github.com/lucidrains/x-transformers","n_code_links":2,"syntology":{"n_ran":5,"n_unverified":0,"n_samples":5,"n_pointer_only_licence":4}},{"rank_in_archive_order":20,"model":"Transformer (12 layers, 8k adaptive span)","metrics":{"Bit per Character (BPC)":"1.02","Number of params":"39M"},"uses_additional_data":false,"paper_date":"2019-05-19","paper":"/paper/adaptive-attention-span-in-transformers","paper_url":"https://arxiv.org/abs/1905.07799v2","paper_title":"Adaptive Attention Span in Transformers","code":"https://github.com/facebookresearch/adaptive-span","n_code_links":8,"syntology":null},{"rank_in_archive_order":21,"model":"BP-Transformer (12 layers)","metrics":{"Bit per Character (BPC)":"1.02","Number of params":"38M"},"uses_additional_data":false,"paper_date":"2019-11-11","paper":"/paper/bp-transformer-modelling-long-range-context","paper_url":"https://arxiv.org/abs/1911.04070v1","paper_title":"BP-Transformer: Modelling Long-Range Context via Binary Partitioning","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/transformer","n_code_links":2,"syntology":{"n_ran":0,"n_unverified":7,"n_samples":7,"n_pointer_only_licence":0}},{"rank_in_archive_order":22,"model":"Transformer+SSA","metrics":{"Bit per Character (BPC)":"1.024"},"uses_additional_data":false,"paper_date":"2023-06-02","paper":"/paper/the-information-pathways-hypothesis","paper_url":"https://arxiv.org/abs/2306.01705v1","paper_title":"The Information Pathways Hypothesis: Transformers are Dynamic Self-Ensembles","code":"https://github.com/shamim-hussain/ssa","n_code_links":1,"syntology":null},{"rank_in_archive_order":23,"model":"Transformer-XL (18 layers)","metrics":{"Bit per Character (BPC)":"1.03","Number of params":"88M"},"uses_additional_data":false,"paper_date":"2019-01-09","paper":"/paper/transformer-xl-attentive-language-models","paper_url":"https://arxiv.org/abs/1901.02860v3","paper_title":"Transformer-XL: Attentive Language Models Beyond a Fixed-Length Context","code":"https://github.com/huggingface/transformers","n_code_links":37,"syntology":{"n_ran":65,"n_unverified":78,"n_samples":143,"n_pointer_only_licence":43}},{"rank_in_archive_order":24,"model":"Skip Cross-Head Transformer-XL","metrics":{"Bit per Character (BPC)":"1.033","Number of params":"41M"},"uses_additional_data":false,"paper_date":"2023-11-14","paper":"/paper/memory-efficient-stochastic-methods-for","paper_url":"https://arxiv.org/abs/2311.08123v1","paper_title":"Memory-efficient Stochastic methods for Memory-based Transformers","code":"https://github.com/vishwajit-vishnu/memory-efficient-stochastic-methods-for-memory-based-transformers","n_code_links":1,"syntology":null},{"rank_in_archive_order":25,"model":"Transformer (64 layers)","metrics":{"Bit per Character (BPC)":"1.06","Number of params":"235M"},"uses_additional_data":false,"paper_date":"2018-08-09","paper":"/paper/character-level-language-modeling-with-deeper","paper_url":"http://arxiv.org/abs/1808.04444v2","paper_title":"Character-Level Language Modeling with Deeper Self-Attention","code":"https://github.com/facebookresearch/code-prediction-transformer","n_code_links":1,"syntology":null},{"rank_in_archive_order":26,"model":"Transformer-XL (12 layers)","metrics":{"Bit per Character (BPC)":"1.06","Number of params":"41M"},"uses_additional_data":false,"paper_date":"2019-01-09","paper":"/paper/transformer-xl-attentive-language-models","paper_url":"https://arxiv.org/abs/1901.02860v3","paper_title":"Transformer-XL: Attentive Language Models Beyond a Fixed-Length Context","code":"https://github.com/huggingface/transformers","n_code_links":37,"syntology":{"n_ran":65,"n_unverified":78,"n_samples":143,"n_pointer_only_licence":43}},{"rank_in_archive_order":27,"model":"SHA-RNN (4 layers, h=1024, attention head per layer)","metrics":{"Bit per Character (BPC)":"1.068","Number of params":"54M"},"uses_additional_data":false,"paper_date":"2019-11-26","paper":"/paper/single-headed-attention-rnn-stop-thinking","paper_url":"https://arxiv.org/abs/1911.11423v2","paper_title":"Single Headed Attention RNN: Stop Thinking With Your Head","code":"https://github.com/Smerity/sha-rnn","n_code_links":5,"syntology":null},{"rank_in_archive_order":28,"model":"SHA-RNN (4 layers, h=1024, single attention head)","metrics":{"Bit per Character (BPC)":"1.076","Number of params":"52M"},"uses_additional_data":false,"paper_date":"2019-11-26","paper":"/paper/single-headed-attention-rnn-stop-thinking","paper_url":"https://arxiv.org/abs/1911.11423v2","paper_title":"Single Headed Attention RNN: Stop Thinking With Your Head","code":"https://github.com/Smerity/sha-rnn","n_code_links":5,"syntology":null},{"rank_in_archive_order":29,"model":"64-layer Character Transformer Model","metrics":{"Bit per Character (BPC)":"1.11","Number of params":"44M"},"uses_additional_data":false,"paper_date":"2018-08-09","paper":"/paper/character-level-language-modeling-with-deeper","paper_url":"http://arxiv.org/abs/1808.04444v2","paper_title":"Character-Level Language Modeling with Deeper Self-Attention","code":"https://github.com/facebookresearch/code-prediction-transformer","n_code_links":1,"syntology":null},{"rank_in_archive_order":30,"model":"Mogrifier LSTM","metrics":{"Bit per Character (BPC)":"1.146","Number of params":"48M"},"uses_additional_data":false,"paper_date":"2019-09-04","paper":"/paper/mogrifier-lstm","paper_url":"https://arxiv.org/abs/1909.01792v2","paper_title":"Mogrifier LSTM","code":"https://github.com/deepmind/lamb","n_code_links":3,"syntology":null},{"rank_in_archive_order":31,"model":"LSTM","metrics":{"Bit per Character (BPC)":"1.195","Number of params":"48M"},"uses_additional_data":false,"paper_date":"2019-09-04","paper":"/paper/mogrifier-lstm","paper_url":"https://arxiv.org/abs/1909.01792v2","paper_title":"Mogrifier LSTM","code":"https://github.com/deepmind/lamb","n_code_links":3,"syntology":null},{"rank_in_archive_order":32,"model":"Cluster-Former (#C=512)","metrics":{"Bit per Character (BPC)":"1.22"},"uses_additional_data":false,"paper_date":"2020-09-13","paper":"/paper/cluster-former-clustering-based-sparse","paper_url":"https://arxiv.org/abs/2009.06097v2","paper_title":"Cluster-Former: Clustering-based Sparse Transformer for Long-Range Dependency Encoding","code":null,"n_code_links":0,"syntology":null},{"rank_in_archive_order":33,"model":"AWD-LSTM (3 layers)","metrics":{"Bit per Character (BPC)":"1.232","Number of params":"47M"},"uses_additional_data":false,"paper_date":"2018-03-22","paper":"/paper/an-analysis-of-neural-language-modeling-at","paper_url":"http://arxiv.org/abs/1803.08240v1","paper_title":"An Analysis of Neural Language Modeling at Multiple Scales","code":"https://github.com/salesforce/awd-lstm-lm","n_code_links":12,"syntology":{"n_ran":3,"n_unverified":15,"n_samples":18,"n_pointer_only_licence":0}},{"rank_in_archive_order":34,"model":"Large mLSTM","metrics":{"Bit per Character (BPC)":"1.24","Number of params":"46M"},"uses_additional_data":false,"paper_date":"2016-09-26","paper":"/paper/multiplicative-lstm-for-sequence-modelling","paper_url":"http://arxiv.org/abs/1609.07959v3","paper_title":"Multiplicative LSTM for sequence modelling","code":"https://github.com/astakara48/python_project","n_code_links":1,"syntology":null},{"rank_in_archive_order":35,"model":"Large FS-LSTM-4","metrics":{"Bit per Character (BPC)":" 1.25","Number of params":"47M"},"uses_additional_data":false,"paper_date":"2017-05-24","paper":"/paper/fast-slow-recurrent-neural-networks","paper_url":"http://arxiv.org/abs/1705.08639v2","paper_title":"Fast-Slow Recurrent Neural Networks","code":"https://github.com/amujika/Fast-Slow-LSTM","n_code_links":1,"syntology":null},{"rank_in_archive_order":36,"model":"Recurrent Highway Networks","metrics":{"Bit per Character (BPC)":"1.27","Number of params":"46M"},"uses_additional_data":false,"paper_date":"2016-07-12","paper":"/paper/recurrent-highway-networks","paper_url":"http://arxiv.org/abs/1607.03474v5","paper_title":"Recurrent Highway Networks","code":"https://github.com/labmlai/annotated_deep_learning_paper_implementations","n_code_links":6,"syntology":{"n_ran":1,"n_unverified":4,"n_samples":5,"n_pointer_only_licence":0}},{"rank_in_archive_order":37,"model":"ByteNet","metrics":{"Bit per Character (BPC)":"1.31"},"uses_additional_data":false,"paper_date":"2016-10-31","paper":"/paper/neural-machine-translation-in-linear-time","paper_url":"http://arxiv.org/abs/1610.10099v2","paper_title":"Neural Machine Translation in Linear Time","code":"https://github.com/paarthneekhara/byteNet-tensorflow","n_code_links":11,"syntology":null},{"rank_in_archive_order":38,"model":"LN HM-LSTM","metrics":{"Bit per Character (BPC)":"1.32","Number of params":"35M"},"uses_additional_data":false,"paper_date":"2016-09-06","paper":"/paper/hierarchical-multiscale-recurrent-neural","paper_url":"http://arxiv.org/abs/1609.01704v7","paper_title":"Hierarchical Multiscale Recurrent Neural Networks","code":"https://github.com/bolducp/hierarchical-rnn","n_code_links":3,"syntology":null},{"rank_in_archive_order":39,"model":"SHA-LSTM (4 layers, h=1024, no attention head)","metrics":{"Bit per Character (BPC)":"1.33","Number of params":"51M"},"uses_additional_data":false,"paper_date":"2019-11-26","paper":"/paper/single-headed-attention-rnn-stop-thinking","paper_url":"https://arxiv.org/abs/1911.11423v2","paper_title":"Single Headed Attention RNN: Stop Thinking With Your Head","code":"https://github.com/Smerity/sha-rnn","n_code_links":5,"syntology":null},{"rank_in_archive_order":40,"model":"Hypernetworks","metrics":{"Bit per Character (BPC)":"1.34","Number of params":"27M"},"uses_additional_data":false,"paper_date":"2016-09-27","paper":"/paper/hypernetworks","paper_url":"http://arxiv.org/abs/1609.09106v4","paper_title":"HyperNetworks","code":"https://github.com/labmlai/annotated_deep_learning_paper_implementations","n_code_links":10,"syntology":{"n_ran":3,"n_unverified":1,"n_samples":4,"n_pointer_only_licence":3}},{"rank_in_archive_order":41,"model":"LSTM (7 layers)","metrics":{"Bit per Character (BPC)":"1.67"},"uses_additional_data":false,"paper_date":"2013-08-04","paper":"/paper/generating-sequences-with-recurrent-neural","paper_url":"http://arxiv.org/abs/1308.0850v5","paper_title":"Generating Sequences With Recurrent Neural Networks","code":"https://github.com/karpathy/char-rnn","n_code_links":59,"syntology":{"n_ran":7,"n_unverified":30,"n_samples":37,"n_pointer_only_licence":4}},{"rank_in_archive_order":42,"model":"All-attention network (36 layers)","metrics":{"Number of params":"114M"},"uses_additional_data":false,"paper_date":"2019-07-02","paper":"/paper/augmenting-self-attention-with-persistent","paper_url":"https://arxiv.org/abs/1907.01470v1","paper_title":"Augmenting Self-attention with Persistent Memory","code":"https://github.com/lucidrains/x-transformers","n_code_links":2,"syntology":{"n_ran":5,"n_unverified":0,"n_samples":5,"n_pointer_only_licence":4}}],"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,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,885 of the 9,623 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9623,"papers_checked":6885,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":2737},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-25T09:33:49+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N 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).","rows_with_graph_line":19,"rows_with_any_sample_ran":18,"distinct_papers_with_graph_line":14,"distinct_papers_with_any_sample_ran":13,"samples_over_distinct_papers":{"n_ran":130,"n_unverified":155,"n_samples":285,"n_pointer_only_licence":67,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":291,"n_unverified":324,"n_samples":615,"n_pointer_only_licence":164,"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"}}}