{"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/hutter-prize","name":"Hutter Prize","full_name":null,"description_markdown":"The Hutter Prize Wikipedia dataset, also known as enwiki8, is a byte-level dataset consisting of the first 100 million bytes of a Wikipedia XML dump. For simplicity we shall refer to it as a character-level dataset. Within these 100 million bytes are 205 unique tokens.\r\n\r\nSource: [NLP Progress](http://nlpprogress.com/english/language_modeling.html)","description_withheld":null,"homepage":"http://prize.hutter1.net/","introduced_date":null,"introduced_date_note":null,"introduced_by":null,"license":null,"modalities":[{"name":"Texts","url":"/datasets/modality/texts"}],"tasks":[{"name":"Language Modelling","url":"/task/language-modelling","datasets_with_task":"/datasets/task/language-modelling"}],"languages":[{"name":"English","url":"/datasets/language/english"}],"variants":["Hutter Prize"],"data_loaders":[],"num_papers_in_archive":12,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/language-modelling-on-hutter-prize","task":"Language Modelling","dataset_variant":"Hutter Prize","rows":18,"metrics":["Bit per Character (BPC)","Number of params"],"first_row_in_archive_order":{"model":"Transformer-XL + RMS dynamic eval","paper":"/paper/dynamic-evaluation-of-transformer-language","metrics":{"Bit per Character (BPC)":"0.94","Number of params":"277M"},"code_links":[{"title":"benkrause/dynamiceval-transformer","url":"https://github.com/benkrause/dynamiceval-transformer"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers":{"order":"date (newest first), then slug","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"shown":11,"of":11,"counts":{"papers_with_a_benchmark_row":11,"with_a_code_link":11,"where_syntology_ran_a_sample":5,"not_listed_spam_title":0,"listed":11,"listed_where_code_ran":5,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":4,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":4,"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"},"items":[{"paper":"/paper/longformer-the-long-document-transformer","slug":"longformer-the-long-document-transformer","title":"Longformer: The Long-Document Transformer","date":"2020-04-10","arxiv_id":"2004.05150","rows_on_this_dataset":2,"code_links":22,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":35,"samples_ran":22,"samples_constructed":4,"samples_ran_checked":14,"samples_ran_instrument_failed":8,"samples_unverified":13,"pointer_only_for_licence":5,"official":{"repos":["allenai/longformer"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/longformer-the-long-document-transformer#ran","syntology_url":"https://syntology.ai/paper/2004.05150","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.05150"}}}},{"paper":"/paper/compressive-transformers-for-long-range-1","slug":"compressive-transformers-for-long-range-1","title":"Compressive Transformers for Long-Range Sequence Modelling","date":"2019-11-13","arxiv_id":"1911.05507","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":1,"samples_unverified":5,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/compressive-transformers-for-long-range-1#ran","syntology_url":"https://syntology.ai/paper/1911.05507","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.05507"}}}},{"paper":"/paper/mogrifier-lstm","slug":"mogrifier-lstm","title":"Mogrifier LSTM","date":"2019-09-04","arxiv_id":"1909.01792","rows_on_this_dataset":2,"code_links":3,"syntology":null},{"paper":"/paper/dynamic-evaluation-of-transformer-language","slug":"dynamic-evaluation-of-transformer-language","title":"Dynamic Evaluation of Transformer Language Models","date":"2019-04-17","arxiv_id":"1904.08378","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/transformer-xl-attentive-language-models","slug":"transformer-xl-attentive-language-models","title":"Transformer-XL: Attentive Language Models Beyond a Fixed-Length Context","date":"2019-01-09","arxiv_id":"1901.02860","rows_on_this_dataset":3,"code_links":37,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":143,"samples_ran":67,"samples_constructed":37,"samples_ran_checked":49,"samples_ran_instrument_failed":18,"samples_unverified":76,"pointer_only_for_licence":43,"official":{"repos":["kimiyoung/transformer-xl"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":7,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["listed","official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/transformer-xl-attentive-language-models#ran","syntology_url":"https://syntology.ai/paper/1901.02860","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.02860"}}}},{"paper":"/paper/character-level-language-modeling-with-deeper","slug":"character-level-language-modeling-with-deeper","title":"Character-Level Language Modeling with Deeper Self-Attention","date":"2018-08-09","arxiv_id":"1808.04444","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/an-analysis-of-neural-language-modeling-at","slug":"an-analysis-of-neural-language-modeling-at","title":"An Analysis of Neural Language Modeling at Multiple Scales","date":"2018-03-22","arxiv_id":"1803.08240","rows_on_this_dataset":1,"code_links":12,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":18,"samples_ran":14,"samples_constructed":0,"samples_ran_checked":13,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":4,"official":{"repos":["salesforce/awd-lstm-lm"],"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/an-analysis-of-neural-language-modeling-at#ran","syntology_url":"https://syntology.ai/paper/1803.08240","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.08240"}}}},{"paper":"/paper/dynamic-evaluation-of-neural-sequence-models","slug":"dynamic-evaluation-of-neural-sequence-models","title":"Dynamic Evaluation of Neural Sequence Models","date":"2017-09-21","arxiv_id":"1709.07432","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["benkrause/dynamic-evaluation"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/dynamic-evaluation-of-neural-sequence-models#ran","syntology_url":"https://syntology.ai/paper/1709.07432","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.07432"}}}},{"paper":"/paper/fast-slow-recurrent-neural-networks","slug":"fast-slow-recurrent-neural-networks","title":"Fast-Slow Recurrent Neural Networks","date":"2017-05-24","arxiv_id":"1705.08639","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/multiplicative-lstm-for-sequence-modelling","slug":"multiplicative-lstm-for-sequence-modelling","title":"Multiplicative LSTM for sequence modelling","date":"2016-09-26","arxiv_id":"1609.07959","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/recurrent-highway-networks","slug":"recurrent-highway-networks","title":"Recurrent Highway Networks","date":"2016-07-12","arxiv_id":"1607.03474","rows_on_this_dataset":2,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":0,"official":{"repos":["julian121266/RecurrentHighwayNetworks"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/recurrent-highway-networks#ran","syntology_url":"https://syntology.ai/paper/1607.03474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1607.03474"}}}}],"full_list":"papers_with_a_benchmark_row: every listed paper, in this order"},"papers_with_a_benchmark_row":[{"paper":"/paper/longformer-the-long-document-transformer","slug":"longformer-the-long-document-transformer","title":"Longformer: The Long-Document Transformer","date":"2020-04-10","arxiv_id":"2004.05150","rows_on_this_dataset":2,"code_links":22,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":35,"samples_ran":22,"samples_constructed":4,"samples_ran_checked":14,"samples_ran_instrument_failed":8,"samples_unverified":13,"pointer_only_for_licence":5,"official":{"repos":["allenai/longformer"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/longformer-the-long-document-transformer#ran","syntology_url":"https://syntology.ai/paper/2004.05150","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.05150"}}}},{"paper":"/paper/compressive-transformers-for-long-range-1","slug":"compressive-transformers-for-long-range-1","title":"Compressive Transformers for Long-Range Sequence Modelling","date":"2019-11-13","arxiv_id":"1911.05507","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":11,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":5,"samples_ran_instrument_failed":1,"samples_unverified":5,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/compressive-transformers-for-long-range-1#ran","syntology_url":"https://syntology.ai/paper/1911.05507","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.05507"}}}},{"paper":"/paper/mogrifier-lstm","slug":"mogrifier-lstm","title":"Mogrifier LSTM","date":"2019-09-04","arxiv_id":"1909.01792","rows_on_this_dataset":2,"code_links":3,"syntology":null},{"paper":"/paper/dynamic-evaluation-of-transformer-language","slug":"dynamic-evaluation-of-transformer-language","title":"Dynamic Evaluation of Transformer Language Models","date":"2019-04-17","arxiv_id":"1904.08378","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/transformer-xl-attentive-language-models","slug":"transformer-xl-attentive-language-models","title":"Transformer-XL: Attentive Language Models Beyond a Fixed-Length Context","date":"2019-01-09","arxiv_id":"1901.02860","rows_on_this_dataset":3,"code_links":37,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":143,"samples_ran":67,"samples_constructed":37,"samples_ran_checked":49,"samples_ran_instrument_failed":18,"samples_unverified":76,"pointer_only_for_licence":43,"official":{"repos":["kimiyoung/transformer-xl"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":7,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["listed","official","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/transformer-xl-attentive-language-models#ran","syntology_url":"https://syntology.ai/paper/1901.02860","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.02860"}}}},{"paper":"/paper/character-level-language-modeling-with-deeper","slug":"character-level-language-modeling-with-deeper","title":"Character-Level Language Modeling with Deeper Self-Attention","date":"2018-08-09","arxiv_id":"1808.04444","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/an-analysis-of-neural-language-modeling-at","slug":"an-analysis-of-neural-language-modeling-at","title":"An Analysis of Neural Language Modeling at Multiple Scales","date":"2018-03-22","arxiv_id":"1803.08240","rows_on_this_dataset":1,"code_links":12,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":18,"samples_ran":14,"samples_constructed":0,"samples_ran_checked":13,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":4,"official":{"repos":["salesforce/awd-lstm-lm"],"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/an-analysis-of-neural-language-modeling-at#ran","syntology_url":"https://syntology.ai/paper/1803.08240","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.08240"}}}},{"paper":"/paper/dynamic-evaluation-of-neural-sequence-models","slug":"dynamic-evaluation-of-neural-sequence-models","title":"Dynamic Evaluation of Neural Sequence Models","date":"2017-09-21","arxiv_id":"1709.07432","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":1,"samples_ran":0,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["benkrause/dynamic-evaluation"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/dynamic-evaluation-of-neural-sequence-models#ran","syntology_url":"https://syntology.ai/paper/1709.07432","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1709.07432"}}}},{"paper":"/paper/fast-slow-recurrent-neural-networks","slug":"fast-slow-recurrent-neural-networks","title":"Fast-Slow Recurrent Neural Networks","date":"2017-05-24","arxiv_id":"1705.08639","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/multiplicative-lstm-for-sequence-modelling","slug":"multiplicative-lstm-for-sequence-modelling","title":"Multiplicative LSTM for sequence modelling","date":"2016-09-26","arxiv_id":"1609.07959","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/recurrent-highway-networks","slug":"recurrent-highway-networks","title":"Recurrent Highway Networks","date":"2016-07-12","arxiv_id":"1607.03474","rows_on_this_dataset":2,"code_links":6,"syntology":{"read_at":"2026-10-05T00:36:11+00:00","samples_harvested":5,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":0,"official":{"repos":["julian121266/RecurrentHighwayNetworks"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/recurrent-highway-networks#ran","syntology_url":"https://syntology.ai/paper/1607.03474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1607.03474"}}}}],"papers_where_code_ran":5,"papers_where_code_ran_first_page":"/dataset/hutter-prize/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/dataset/hutter-prize/papers/ran/1","json":"/dataset/hutter-prize/papers/ran/1.json","rows":5}],"row_route":"each paper's syntology object carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers","syntology_totals":{"read_at":"2026-10-05T00:36:11+00:00","papers_with_samples":6,"samples_harvested":213,"samples_ran":110,"samples_constructed":41,"samples_ran_checked":81,"samples_ran_instrument_failed":29,"samples_unverified":103,"pointer_only_for_licence":52,"papers_with_no_sample_that_ran":1,"papers_with_a_sample_that_ran":5,"papers_with_a_run_with_no_instrument_failure":4,"papers_where_every_run_was_an_instrument_failure":1,"note":"the per-paper counts of every listed paper (all pages), summed; not a rate"},"key_notes":{"samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks.","record_sha256":"cbc35046e2730d045ce341f821f6cabdc630e8871cd4892d27cbf22ca3a0787d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}