{"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/penn-treebank/papers/ran/1","list_of":"/dataset/penn-treebank","dataset":"Penn Treebank","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","key_notes":{"samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this dataset or check it against this dataset's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","population":"every paper with a leaderboard row on this dataset's benchmarks (the benchmark-backed subset): the archive's own papers-using-this-dataset list was never published, so this is not that list; num_papers_in_archive is the archive's own count","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,41],"of":41,"counts":{"papers_with_a_benchmark_row":108,"with_a_code_link":93,"where_syntology_ran_a_sample":41,"not_listed_spam_title":0,"listed":108,"listed_where_code_ran":41,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":34,"every_run_a_failure_of_syntologys_instrument":7,"listed_with_a_run_with_no_instrument_failure":34,"listed_every_run_a_failure_of_syntologys_instrument":7,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers with at least one leaderboard row on this dataset's benchmarks; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/dataset/penn-treebank/papers/ran/1","prev":null,"next":null,"papers":[{"paper":"/paper/deepstruct-pretraining-of-language-models-for-1","slug":"deepstruct-pretraining-of-language-models-for-1","title":"DeepStruct: Pretraining of Language Models for Structure Prediction","date":"2022-05-21","arxiv_id":"2205.10475","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":13,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":10,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":3,"official":{"repos":["cgraywang/deepstruct"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deepstruct-pretraining-of-language-models-for-1#ran","syntology_url":"https://syntology.ai/paper/2205.10475","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10475"}}}},{"paper":"/paper/learning-associative-inference-using-fast-1","slug":"learning-associative-inference-using-fast-1","title":"Learning Associative Inference Using Fast Weight Memory","date":"2020-11-16","arxiv_id":"2011.07831","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["ischlag/Fast-Weight-Memory-public"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/learning-associative-inference-using-fast-1#ran","syntology_url":"https://syntology.ai/paper/2011.07831","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.07831"}}}},{"paper":"/paper/strongly-incremental-constituency-parsing","slug":"strongly-incremental-constituency-parsing","title":"Strongly Incremental Constituency Parsing with Graph Neural Networks","date":"2020-10-27","arxiv_id":"2010.14568","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":5,"samples_ran":2,"samples_constructed":1,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["princeton-vl/attach-juxtapose-parser"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/strongly-incremental-constituency-parsing#ran","syntology_url":"https://syntology.ai/paper/2010.14568","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.14568"}}}},{"paper":"/paper/improving-constituency-parsing-with-span","slug":"improving-constituency-parsing-with-span","title":"Improving Constituency Parsing with Span Attention","date":"2020-10-15","arxiv_id":"2010.07543","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":1,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["cuhksz-nlp/SAPar"],"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":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/improving-constituency-parsing-with-span#ran","syntology_url":"https://syntology.ai/paper/2010.07543","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.07543"}}}},{"paper":"/paper/fast-and-accurate-neural-crf-constituency-1","slug":"fast-and-accurate-neural-crf-constituency-1","title":"Fast and Accurate Neural CRF Constituency Parsing","date":"2020-08-09","arxiv_id":"2008.03736","rows_on_this_dataset":3,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":2,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["yzhangcs/crfpar"],"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":["found_in_text","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/fast-and-accurate-neural-crf-constituency-1#ran","syntology_url":"https://syntology.ai/paper/2008.03736","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.03736"}}}},{"paper":"/paper/language-models-are-few-shot-learners","slug":"language-models-are-few-shot-learners","title":"Language Models are Few-Shot Learners","date":"2020-05-28","arxiv_id":"2005.14165","rows_on_this_dataset":1,"code_links":67,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":65,"samples_ran":45,"samples_constructed":0,"samples_ran_checked":40,"samples_ran_instrument_failed":5,"samples_unverified":20,"pointer_only_for_licence":7,"official":{"repos":["openai/gpt-3"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/language-models-are-few-shot-learners#ran","syntology_url":"https://syntology.ai/paper/2005.14165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.14165"}}}},{"paper":"/paper/efficient-second-order-treecrf-for-neural","slug":"efficient-second-order-treecrf-for-neural","title":"Efficient Second-Order TreeCRF for Neural Dependency Parsing","date":"2020-05-03","arxiv_id":"2005.00975","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["yzhangcs/crfpar"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/efficient-second-order-treecrf-for-neural#ran","syntology_url":"https://syntology.ai/paper/2005.00975","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00975"}}}},{"paper":"/paper/accessing-higher-level-representations-in","slug":"accessing-higher-level-representations-in","title":"Addressing Some Limitations of Transformers with Feedback Memory","date":"2020-02-21","arxiv_id":"2002.09402","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["facebookresearch/transformer-sequential"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/accessing-higher-level-representations-in#ran","syntology_url":"https://syntology.ai/paper/2002.09402","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.09402"}}}},{"paper":"/paper/seq-u-net-a-one-dimensional-causal-u-net-for","slug":"seq-u-net-a-one-dimensional-causal-u-net-for","title":"Seq-U-Net: A One-Dimensional Causal U-Net for Efficient Sequence Modelling","date":"2019-11-14","arxiv_id":"1911.06393","rows_on_this_dataset":4,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":6,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"official":{"repos":["f90/Seq-U-Net"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/seq-u-net-a-one-dimensional-causal-u-net-for#ran","syntology_url":"https://syntology.ai/paper/1911.06393","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.06393"}}}},{"paper":"/paper/rethinking-self-attention-an-interpretable","slug":"rethinking-self-attention-an-interpretable","title":"Rethinking Self-Attention: Towards Interpretability in Neural Parsing","date":"2019-11-10","arxiv_id":"1911.03875","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":2,"pointer_only_for_licence":3,"official":{"repos":["KhalilMrini/LAL-Parser"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/rethinking-self-attention-an-interpretable#ran","syntology_url":"https://syntology.ai/paper/1911.03875","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03875"}}}},{"paper":"/paper/deep-equilibrium-models","slug":"deep-equilibrium-models","title":"Deep Equilibrium Models","date":"2019-09-03","arxiv_id":"1909.01377","rows_on_this_dataset":1,"code_links":11,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":12,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":2,"samples_unverified":3,"pointer_only_for_licence":4,"official":{"repos":["locuslab/deq"],"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/deep-equilibrium-models#ran","syntology_url":"https://syntology.ai/paper/1909.01377","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.01377"}}}},{"paper":"/paper/r-transformer-recurrent-neural-network","slug":"r-transformer-recurrent-neural-network","title":"R-Transformer: Recurrent Neural Network Enhanced Transformer","date":"2019-07-12","arxiv_id":"1907.05572","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["DSE-MSU/R-transformer"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/r-transformer-recurrent-neural-network#ran","syntology_url":"https://syntology.ai/paper/1907.05572","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.05572"}}}},{"paper":"/paper/head-driven-phrase-structure-grammar-parsing","slug":"head-driven-phrase-structure-grammar-parsing","title":"Head-Driven Phrase Structure Grammar Parsing on Penn Treebank","date":"2019-07-05","arxiv_id":"1907.02684","rows_on_this_dataset":3,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":9,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["DoodleJZ/HPSG-Neural-Parser"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/head-driven-phrase-structure-grammar-parsing#ran","syntology_url":"https://syntology.ai/paper/1907.02684","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.02684"}}}},{"paper":"/paper/190409408","slug":"190409408","title":"Language Models with Transformers","date":"2019-04-20","arxiv_id":"1904.09408","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["cgraywang/gluon-nlp-1"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/190409408#ran","syntology_url":"https://syntology.ai/paper/1904.09408","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.09408"}}}},{"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":1,"code_links":37,"syntology":{"read_at":"2026-09-28T10:30:06+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/trellis-networks-for-sequence-modeling","slug":"trellis-networks-for-sequence-modeling","title":"Trellis Networks for Sequence Modeling","date":"2018-10-15","arxiv_id":"1810.06682","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":8,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":2,"official":{"repos":["locuslab/trellisnet"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/trellis-networks-for-sequence-modeling#ran","syntology_url":"https://syntology.ai/paper/1810.06682","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.06682"}}}},{"paper":"/paper/darts-differentiable-architecture-search","slug":"darts-differentiable-architecture-search","title":"DARTS: Differentiable Architecture Search","date":"2018-06-24","arxiv_id":"1806.09055","rows_on_this_dataset":1,"code_links":59,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":156,"samples_ran":74,"samples_constructed":30,"samples_ran_checked":60,"samples_ran_instrument_failed":14,"samples_unverified":82,"pointer_only_for_licence":54,"official":{"repos":["quark0/darts"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/darts-differentiable-architecture-search#ran","syntology_url":"https://syntology.ai/paper/1806.09055","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.09055"}}}},{"paper":"/paper/ncrf-an-open-source-neural-sequence-labeling","slug":"ncrf-an-open-source-neural-sequence-labeling","title":"NCRF++: An Open-source Neural Sequence Labeling Toolkit","date":"2018-06-14","arxiv_id":"1806.05626","rows_on_this_dataset":2,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":9,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["jiesutd/NCRFpp"],"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/ncrf-an-open-source-neural-sequence-labeling#ran","syntology_url":"https://syntology.ai/paper/1806.05626","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.05626"}}}},{"paper":"/paper/sentence-state-lstm-for-text-representation","slug":"sentence-state-lstm-for-text-representation","title":"Sentence-State LSTM for Text Representation","date":"2018-05-07","arxiv_id":"1805.02474","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/sentence-state-lstm-for-text-representation#ran","syntology_url":"https://syntology.ai/paper/1805.02474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.02474"}}}},{"paper":"/paper/constituency-parsing-with-a-self-attentive","slug":"constituency-parsing-with-a-self-attentive","title":"Constituency Parsing with a Self-Attentive Encoder","date":"2018-05-02","arxiv_id":"1805.01052","rows_on_this_dataset":1,"code_links":5,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":14,"samples_ran":11,"samples_constructed":0,"samples_ran_checked":11,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["nikitakit/self-attentive-parser"],"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/constituency-parsing-with-a-self-attentive#ran","syntology_url":"https://syntology.ai/paper/1805.01052","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.01052"}}}},{"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":2,"code_links":12,"syntology":{"read_at":"2026-09-28T10:30:06+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/independently-recurrent-neural-network-indrnn","slug":"independently-recurrent-neural-network-indrnn","title":"Independently Recurrent Neural Network (IndRNN): Building A Longer and Deeper RNN","date":"2018-03-13","arxiv_id":"1803.04831","rows_on_this_dataset":1,"code_links":11,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["Sunnydreamrain/IndRNN_Theano_Lasagne"],"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/independently-recurrent-neural-network-indrnn#ran","syntology_url":"https://syntology.ai/paper/1803.04831","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.04831"}}}},{"paper":"/paper/an-empirical-evaluation-of-generic","slug":"an-empirical-evaluation-of-generic","title":"An Empirical Evaluation of Generic Convolutional and Recurrent Networks for Sequence Modeling","date":"2018-03-04","arxiv_id":"1803.01271","rows_on_this_dataset":3,"code_links":35,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":10,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":1,"official":{"repos":["locuslab/TCN"],"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-empirical-evaluation-of-generic#ran","syntology_url":"https://syntology.ai/paper/1803.01271","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.01271"}}}},{"paper":"/paper/efficient-neural-architecture-search-via-1","slug":"efficient-neural-architecture-search-via-1","title":"Efficient Neural Architecture Search via Parameter Sharing","date":"2018-02-09","arxiv_id":"1802.03268","rows_on_this_dataset":1,"code_links":28,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":38,"samples_ran":18,"samples_constructed":10,"samples_ran_checked":12,"samples_ran_instrument_failed":6,"samples_unverified":20,"pointer_only_for_licence":25,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/efficient-neural-architecture-search-via-1#ran","syntology_url":"https://syntology.ai/paper/1802.03268","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.03268"}}}},{"paper":"/paper/breaking-the-softmax-bottleneck-a-high-rank","slug":"breaking-the-softmax-bottleneck-a-high-rank","title":"Breaking the Softmax Bottleneck: A High-Rank RNN Language Model","date":"2017-11-10","arxiv_id":"1711.03953","rows_on_this_dataset":2,"code_links":9,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":23,"samples_ran":12,"samples_constructed":0,"samples_ran_checked":11,"samples_ran_instrument_failed":1,"samples_unverified":11,"pointer_only_for_licence":1,"official":{"repos":["zihangdai/mos"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/breaking-the-softmax-bottleneck-a-high-rank#ran","syntology_url":"https://syntology.ai/paper/1711.03953","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.03953"}}}},{"paper":"/paper/regularizing-and-optimizing-lstm-language","slug":"regularizing-and-optimizing-lstm-language","title":"Regularizing and Optimizing LSTM Language Models","date":"2017-08-07","arxiv_id":"1708.02182","rows_on_this_dataset":2,"code_links":45,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":7,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":4,"samples_unverified":1,"pointer_only_for_licence":7,"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/regularizing-and-optimizing-lstm-language#ran","syntology_url":"https://syntology.ai/paper/1708.02182","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1708.02182"}}}},{"paper":"/paper/attention-is-all-you-need","slug":"attention-is-all-you-need","title":"Attention Is All You Need","date":"2017-06-12","arxiv_id":"1706.03762","rows_on_this_dataset":1,"code_links":595,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":946,"samples_ran":610,"samples_constructed":293,"samples_ran_checked":529,"samples_ran_instrument_failed":81,"samples_unverified":336,"pointer_only_for_licence":451,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/transfer-learning-for-sequence-tagging-with","slug":"transfer-learning-for-sequence-tagging-with","title":"Transfer Learning for Sequence Tagging with Hierarchical Recurrent Networks","date":"2017-03-18","arxiv_id":"1703.06345","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":8,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":{"repos":["kimiyoung/transfer"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/transfer-learning-for-sequence-tagging-with#ran","syntology_url":"https://syntology.ai/paper/1703.06345","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.06345"}}}},{"paper":"/paper/deep-biaffine-attention-for-neural-dependency","slug":"deep-biaffine-attention-for-neural-dependency","title":"Deep Biaffine Attention for Neural Dependency Parsing","date":"2016-11-06","arxiv_id":"1611.01734","rows_on_this_dataset":2,"code_links":26,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":19,"samples_ran":14,"samples_constructed":0,"samples_ran_checked":12,"samples_ran_instrument_failed":2,"samples_unverified":5,"pointer_only_for_licence":2,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/deep-biaffine-attention-for-neural-dependency#ran","syntology_url":"https://syntology.ai/paper/1611.01734","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01734"}}}},{"paper":"/paper/neural-architecture-search-with-reinforcement","slug":"neural-architecture-search-with-reinforcement","title":"Neural Architecture Search with Reinforcement Learning","date":"2016-11-05","arxiv_id":"1611.01578","rows_on_this_dataset":2,"code_links":12,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":5,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":3,"official":{"repos":["tensorflow/models"],"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/neural-architecture-search-with-reinforcement#ran","syntology_url":"https://syntology.ai/paper/1611.01578","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01578"}}}},{"paper":"/paper/a-joint-many-task-model-growing-a-neural","slug":"a-joint-many-task-model-growing-a-neural","title":"A Joint Many-Task Model: Growing a Neural Network for Multiple NLP Tasks","date":"2016-11-05","arxiv_id":"1611.01587","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":1,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["hassyGo/charNgram2vec"],"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/a-joint-many-task-model-growing-a-neural#ran","syntology_url":"https://syntology.ai/paper/1611.01587","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01587"}}}},{"paper":"/paper/hypernetworks","slug":"hypernetworks","title":"HyperNetworks","date":"2016-09-27","arxiv_id":"1609.09106","rows_on_this_dataset":1,"code_links":10,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":4,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":3,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/hypernetworks#ran","syntology_url":"https://syntology.ai/paper/1609.09106","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1609.09106"}}}},{"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":1,"code_links":6,"syntology":{"read_at":"2026-09-28T10:30:06+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"}}}},{"paper":"/paper/multilingual-part-of-speech-tagging-with","slug":"multilingual-part-of-speech-tagging-with","title":"Multilingual Part-of-Speech Tagging with Bidirectional Long Short-Term Memory Models and Auxiliary Loss","date":"2016-04-19","arxiv_id":"1604.05529","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":4,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["bplank/bilstm-aux"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/multilingual-part-of-speech-tagging-with#ran","syntology_url":"https://syntology.ai/paper/1604.05529","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1604.05529"}}}},{"paper":"/paper/simple-and-accurate-dependency-parsing-using","slug":"simple-and-accurate-dependency-parsing-using","title":"Simple and Accurate Dependency Parsing Using Bidirectional LSTM Feature Representations","date":"2016-03-14","arxiv_id":"1603.04351","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":7,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":4,"pointer_only_for_licence":0,"official":{"repos":["elikip/bist-parser"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/simple-and-accurate-dependency-parsing-using#ran","syntology_url":"https://syntology.ai/paper/1603.04351","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.04351"}}}},{"paper":"/paper/end-to-end-sequence-labeling-via-bi","slug":"end-to-end-sequence-labeling-via-bi","title":"End-to-end Sequence Labeling via Bi-directional LSTM-CNNs-CRF","date":"2016-03-04","arxiv_id":"1603.01354","rows_on_this_dataset":1,"code_links":25,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":24,"samples_ran":24,"samples_constructed":0,"samples_ran_checked":22,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":3,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/end-to-end-sequence-labeling-via-bi#ran","syntology_url":"https://syntology.ai/paper/1603.01354","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.01354"}}}},{"paper":"/paper/recurrent-neural-network-grammars","slug":"recurrent-neural-network-grammars","title":"Recurrent Neural Network Grammars","date":"2016-02-25","arxiv_id":"1602.07776","rows_on_this_dataset":1,"code_links":6,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":10,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":5,"samples_unverified":2,"pointer_only_for_licence":6,"official":{"repos":["clab/rnng"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/recurrent-neural-network-grammars#ran","syntology_url":"https://syntology.ai/paper/1602.07776","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1602.07776"}}}},{"paper":"/paper/a-theoretically-grounded-application-of","slug":"a-theoretically-grounded-application-of","title":"A Theoretically Grounded Application of Dropout in Recurrent Neural Networks","date":"2015-12-16","arxiv_id":"1512.05287","rows_on_this_dataset":2,"code_links":14,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-theoretically-grounded-application-of#ran","syntology_url":"https://syntology.ai/paper/1512.05287","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1512.05287"}}}},{"paper":"/paper/bidirectional-lstm-crf-models-for-sequence","slug":"bidirectional-lstm-crf-models-for-sequence","title":"Bidirectional LSTM-CRF Models for Sequence Tagging","date":"2015-08-09","arxiv_id":"1508.01991","rows_on_this_dataset":1,"code_links":25,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":8,"samples_ran":8,"samples_constructed":0,"samples_ran_checked":8,"samples_ran_instrument_failed":0,"samples_unverified":0,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/bidirectional-lstm-crf-models-for-sequence#ran","syntology_url":"https://syntology.ai/paper/1508.01991","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1508.01991"}}}},{"paper":"/paper/grammar-as-a-foreign-language","slug":"grammar-as-a-foreign-language","title":"Grammar as a Foreign Language","date":"2014-12-23","arxiv_id":"1412.7449","rows_on_this_dataset":1,"code_links":7,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":17,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":9,"samples_ran_instrument_failed":0,"samples_unverified":8,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/grammar-as-a-foreign-language#ran","syntology_url":"https://syntology.ai/paper/1412.7449","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1412.7449"}}}},{"paper":"/paper/recurrent-neural-network-regularization","slug":"recurrent-neural-network-regularization","title":"Recurrent Neural Network Regularization","date":"2014-09-08","arxiv_id":"1409.2329","rows_on_this_dataset":2,"code_links":21,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":6,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":2,"samples_unverified":4,"pointer_only_for_licence":6,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}}],"record_sha256":"8dd0e68b939b56c71f4a7cd50bc2b172b16ea35eac141e404fbf8aa8ef2d9050","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}