{"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/cnn-daily-mail-1/papers/ran/1","list_of":"/dataset/cnn-daily-mail-1","dataset":"CNN/Daily Mail","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,30],"of":30,"counts":{"papers_with_a_benchmark_row":89,"with_a_code_link":63,"where_syntology_ran_a_sample":30,"not_listed_spam_title":0,"listed":89,"listed_where_code_ran":30,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":24,"every_run_a_failure_of_syntologys_instrument":6,"listed_with_a_run_with_no_instrument_failure":24,"listed_every_run_a_failure_of_syntologys_instrument":6,"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/cnn-daily-mail-1/papers/ran/1","prev":null,"next":null,"papers":[{"paper":"/paper/textbox-2-0-a-text-generation-library-with","slug":"textbox-2-0-a-text-generation-library-with","title":"TextBox 2.0: A Text Generation Library with Pre-trained Language Models","date":"2022-12-26","arxiv_id":"2212.13005","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":["RUCAIBox/TextBox"],"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/textbox-2-0-a-text-generation-library-with#ran","syntology_url":"https://syntology.ai/paper/2212.13005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.13005"}}}},{"paper":"/paper/brio-bringing-order-to-abstractive","slug":"brio-bringing-order-to-abstractive","title":"BRIO: Bringing Order to Abstractive Summarization","date":"2022-03-31","arxiv_id":"2203.16804","rows_on_this_dataset":1,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":10,"samples_ran":7,"samples_constructed":0,"samples_ran_checked":7,"samples_ran_instrument_failed":0,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["yixinl7/brio"],"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/brio-bringing-order-to-abstractive#ran","syntology_url":"https://syntology.ai/paper/2203.16804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.16804"}}}},{"paper":"/paper/summareranker-a-multi-task-mixture-of-experts-1","slug":"summareranker-a-multi-task-mixture-of-experts-1","title":"SummaReranker: A Multi-Task Mixture-of-Experts Re-ranking Framework for Abstractive Summarization","date":"2022-03-13","arxiv_id":"2203.06569","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":2,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["ntunlp/summareranker"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/summareranker-a-multi-task-mixture-of-experts-1#ran","syntology_url":"https://syntology.ai/paper/2203.06569","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.06569"}}}},{"paper":"/paper/longt5-efficient-text-to-text-transformer-for","slug":"longt5-efficient-text-to-text-transformer-for","title":"LongT5: Efficient Text-To-Text Transformer for Long Sequences","date":"2021-12-15","arxiv_id":"2112.07916","rows_on_this_dataset":1,"code_links":4,"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":["google-research/longt5"],"state":"official (archive's flag): 1 ran","n_ran":1,"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/longt5-efficient-text-to-text-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2112.07916","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.07916"}}}},{"paper":"/paper/fastformer-additive-attention-is-all-you-need","slug":"fastformer-additive-attention-is-all-you-need","title":"Fastformer: Additive Attention Can Be All You Need","date":"2021-08-20","arxiv_id":"2108.09084","rows_on_this_dataset":1,"code_links":13,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":4,"samples_ran":4,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":2,"samples_unverified":0,"pointer_only_for_licence":3,"official":{"repos":["wuch15/Fastformer"],"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/fastformer-additive-attention-is-all-you-need#ran","syntology_url":"https://syntology.ai/paper/2108.09084","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.09084"}}}},{"paper":"/paper/r-drop-regularized-dropout-for-neural","slug":"r-drop-regularized-dropout-for-neural","title":"R-Drop: Regularized Dropout for Neural Networks","date":"2021-06-28","arxiv_id":"2106.14448","rows_on_this_dataset":1,"code_links":8,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":6,"samples_ran":4,"samples_constructed":2,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":0,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/simcls-a-simple-framework-for-contrastive","slug":"simcls-a-simple-framework-for-contrastive","title":"SimCLS: A Simple Framework for Contrastive Learning of Abstractive Summarization","date":"2021-06-03","arxiv_id":"2106.01890","rows_on_this_dataset":1,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":6,"samples_ran":4,"samples_constructed":3,"samples_ran_checked":4,"samples_ran_instrument_failed":0,"samples_unverified":2,"pointer_only_for_licence":1,"official":{"repos":["yixinL7/SimCLS"],"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/simcls-a-simple-framework-for-contrastive#ran","syntology_url":"https://syntology.ai/paper/2106.01890","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.01890"}}}},{"paper":"/paper/mask-attention-networks-rethinking-and","slug":"mask-attention-networks-rethinking-and","title":"Mask Attention Networks: Rethinking and Strengthen Transformer","date":"2021-03-25","arxiv_id":"2103.13597","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":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/mask-attention-networks-rethinking-and#ran","syntology_url":"https://syntology.ai/paper/2103.13597","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.13597"}}}},{"paper":"/paper/all-nlp-tasks-are-generation-tasks-a-general","slug":"all-nlp-tasks-are-generation-tasks-a-general","title":"GLM: General Language Model Pretraining with Autoregressive Blank Infilling","date":"2021-03-18","arxiv_id":"2103.10360","rows_on_this_dataset":2,"code_links":8,"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":0,"official":{"repos":["THUDM/GLM"],"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/all-nlp-tasks-are-generation-tasks-a-general#ran","syntology_url":"https://syntology.ai/paper/2103.10360","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.10360"}}}},{"paper":"/paper/big-bird-transformers-for-longer-sequences","slug":"big-bird-transformers-for-longer-sequences","title":"Big Bird: Transformers for Longer Sequences","date":"2020-07-28","arxiv_id":"2007.14062","rows_on_this_dataset":1,"code_links":14,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":15,"samples_ran":10,"samples_constructed":1,"samples_ran_checked":2,"samples_ran_instrument_failed":8,"samples_unverified":5,"pointer_only_for_licence":11,"official":{"repos":["google-research/bigbird"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/big-bird-transformers-for-longer-sequences#ran","syntology_url":"https://syntology.ai/paper/2007.14062","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.14062"}}}},{"paper":"/paper/synthesizer-rethinking-self-attention-in","slug":"synthesizer-rethinking-self-attention-in","title":"Synthesizer: Rethinking Self-Attention in Transformer Models","date":"2020-05-02","arxiv_id":"2005.00743","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":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/unilmv2-pseudo-masked-language-models-for","slug":"unilmv2-pseudo-masked-language-models-for","title":"UniLMv2: Pseudo-Masked Language Models for Unified Language Model Pre-Training","date":"2020-02-28","arxiv_id":"2002.12804","rows_on_this_dataset":1,"code_links":3,"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":0,"official":{"repos":["microsoft/unilm"],"state":"official (archive's flag): 1 ran","n_ran":1,"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/unilmv2-pseudo-masked-language-models-for#ran","syntology_url":"https://syntology.ai/paper/2002.12804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.12804"}}}},{"paper":"/paper/time-aware-large-kernel-convolutions","slug":"time-aware-large-kernel-convolutions","title":"Time-aware Large Kernel Convolutions","date":"2020-02-08","arxiv_id":"2002.03184","rows_on_this_dataset":2,"code_links":1,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":7,"samples_ran":6,"samples_constructed":2,"samples_ran_checked":2,"samples_ran_instrument_failed":4,"samples_unverified":1,"pointer_only_for_licence":3,"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"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","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"}}}},{"paper":"/paper/pegasus-pre-training-with-extracted-gap","slug":"pegasus-pre-training-with-extracted-gap","title":"PEGASUS: Pre-training with Extracted Gap-sentences for Abstractive Summarization","date":"2019-12-18","arxiv_id":"1912.08777","rows_on_this_dataset":1,"code_links":19,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":19,"samples_ran":16,"samples_constructed":0,"samples_ran_checked":15,"samples_ran_instrument_failed":1,"samples_unverified":3,"pointer_only_for_licence":0,"official":{"repos":["google-research/pegasus"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/pegasus-pre-training-with-extracted-gap#ran","syntology_url":"https://syntology.ai/paper/1912.08777","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.08777"}}}},{"paper":"/paper/bart-denoising-sequence-to-sequence-pre","slug":"bart-denoising-sequence-to-sequence-pre","title":"BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehension","date":"2019-10-29","arxiv_id":"1910.13461","rows_on_this_dataset":1,"code_links":47,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":53,"samples_ran":40,"samples_constructed":7,"samples_ran_checked":31,"samples_ran_instrument_failed":9,"samples_unverified":13,"pointer_only_for_licence":13,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/bart-denoising-sequence-to-sequence-pre#ran","syntology_url":"https://syntology.ai/paper/1910.13461","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.13461"}}}},{"paper":"/paper/exploring-the-limits-of-transfer-learning","slug":"exploring-the-limits-of-transfer-learning","title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","date":"2019-10-23","arxiv_id":"1910.10683","rows_on_this_dataset":2,"code_links":57,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":31,"samples_ran":21,"samples_constructed":0,"samples_ran_checked":20,"samples_ran_instrument_failed":1,"samples_unverified":10,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/exploring-the-limits-of-transfer-learning#ran","syntology_url":"https://syntology.ai/paper/1910.10683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.10683"}}}},{"paper":"/paper/text-summarization-with-pretrained-encoders","slug":"text-summarization-with-pretrained-encoders","title":"Text Summarization with Pretrained Encoders","date":"2019-08-22","arxiv_id":"1908.08345","rows_on_this_dataset":2,"code_links":19,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":21,"samples_ran":13,"samples_constructed":0,"samples_ran_checked":12,"samples_ran_instrument_failed":1,"samples_unverified":8,"pointer_only_for_licence":5,"official":{"repos":["nlpyang/PreSumm"],"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/text-summarization-with-pretrained-encoders#ran","syntology_url":"https://syntology.ai/paper/1908.08345","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.08345"}}}},{"paper":"/paper/fine-tune-bert-for-extractive-summarization","slug":"fine-tune-bert-for-extractive-summarization","title":"Fine-tune BERT for Extractive Summarization","date":"2019-03-25","arxiv_id":"1903.10318","rows_on_this_dataset":1,"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":4,"samples_ran_instrument_failed":1,"samples_unverified":0,"pointer_only_for_licence":1,"official":{"repos":["nlpyang/BertSum"],"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/fine-tune-bert-for-extractive-summarization#ran","syntology_url":"https://syntology.ai/paper/1903.10318","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.10318"}}}},{"paper":"/paper/pretraining-based-natural-language-generation","slug":"pretraining-based-natural-language-generation","title":"Pretraining-Based Natural Language Generation for Text Summarization","date":"2019-02-25","arxiv_id":"1902.09243","rows_on_this_dataset":1,"code_links":4,"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/pretraining-based-natural-language-generation#ran","syntology_url":"https://syntology.ai/paper/1902.09243","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.09243"}}}},{"paper":"/paper/bottom-up-abstractive-summarization","slug":"bottom-up-abstractive-summarization","title":"Bottom-Up Abstractive Summarization","date":"2018-08-31","arxiv_id":"1808.10792","rows_on_this_dataset":2,"code_links":5,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":6,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":5,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["sebastianGehrmann/bottom-up-summary"],"state":"official (archive's flag): 5 ran","n_ran":5,"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/bottom-up-abstractive-summarization#ran","syntology_url":"https://syntology.ai/paper/1808.10792","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.10792"}}}},{"paper":"/paper/fast-abstractive-summarization-with-reinforce","slug":"fast-abstractive-summarization-with-reinforce","title":"Fast Abstractive Summarization with Reinforce-Selected Sentence Rewriting","date":"2018-05-28","arxiv_id":"1805.11080","rows_on_this_dataset":3,"code_links":3,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":3,"samples_constructed":0,"samples_ran_checked":0,"samples_ran_instrument_failed":3,"samples_unverified":0,"pointer_only_for_licence":2,"official":{"repos":["ChenRocks/fast_abs_rl"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/fast-abstractive-summarization-with-reinforce#ran","syntology_url":"https://syntology.ai/paper/1805.11080","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.11080"}}}},{"paper":"/paper/a-unified-model-for-extractive-and","slug":"a-unified-model-for-extractive-and","title":"A Unified Model for Extractive and Abstractive Summarization using Inconsistency Loss","date":"2018-05-16","arxiv_id":"1805.06266","rows_on_this_dataset":1,"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":2,"samples_ran_instrument_failed":1,"samples_unverified":4,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/a-unified-model-for-extractive-and#ran","syntology_url":"https://syntology.ai/paper/1805.06266","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.06266"}}}},{"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/get-to-the-point-summarization-with-pointer","slug":"get-to-the-point-summarization-with-pointer","title":"Get To The Point: Summarization with Pointer-Generator Networks","date":"2017-04-14","arxiv_id":"1704.04368","rows_on_this_dataset":5,"code_links":39,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":64,"samples_ran":30,"samples_constructed":11,"samples_ran_checked":25,"samples_ran_instrument_failed":5,"samples_unverified":34,"pointer_only_for_licence":44,"official":{"repos":["abisee/pointer-generator"],"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/get-to-the-point-summarization-with-pointer#ran","syntology_url":"https://syntology.ai/paper/1704.04368","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.04368"}}}},{"paper":"/paper/summarunner-a-recurrent-neural-network-based","slug":"summarunner-a-recurrent-neural-network-based","title":"SummaRuNNer: A Recurrent Neural Network based Sequence Model for Extractive Summarization of Documents","date":"2016-11-14","arxiv_id":"1611.04230","rows_on_this_dataset":2,"code_links":7,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":7,"samples_ran":6,"samples_constructed":0,"samples_ran_checked":6,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/summarunner-a-recurrent-neural-network-based#ran","syntology_url":"https://syntology.ai/paper/1611.04230","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.04230"}}}},{"paper":"/paper/bidirectional-attention-flow-for-machine","slug":"bidirectional-attention-flow-for-machine","title":"Bidirectional Attention Flow for Machine Comprehension","date":"2016-11-05","arxiv_id":"1611.01603","rows_on_this_dataset":1,"code_links":27,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":11,"samples_ran":9,"samples_constructed":0,"samples_ran_checked":4,"samples_ran_instrument_failed":5,"samples_unverified":2,"pointer_only_for_licence":7,"official":{"repos":["allenai/bi-att-flow"],"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/bidirectional-attention-flow-for-machine#ran","syntology_url":"https://syntology.ai/paper/1611.01603","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.01603"}}}},{"paper":"/paper/gated-attention-readers-for-text","slug":"gated-attention-readers-for-text","title":"Gated-Attention Readers for Text Comprehension","date":"2016-06-05","arxiv_id":"1606.01549","rows_on_this_dataset":1,"code_links":4,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":3,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":1,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["bdhingra/ga-reader"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed","official"]},"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/gated-attention-readers-for-text#ran","syntology_url":"https://syntology.ai/paper/1606.01549","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1606.01549"}}}},{"paper":"/paper/text-understanding-with-the-attention-sum","slug":"text-understanding-with-the-attention-sum","title":"Text Understanding with the Attention Sum Reader Network","date":"2016-03-04","arxiv_id":"1603.01547","rows_on_this_dataset":2,"code_links":2,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":10,"samples_ran":2,"samples_constructed":0,"samples_ran_checked":2,"samples_ran_instrument_failed":0,"samples_unverified":8,"pointer_only_for_licence":1,"official":{"repos":["rkadlec/asreader"],"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/text-understanding-with-the-attention-sum#ran","syntology_url":"https://syntology.ai/paper/1603.01547","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.01547"}}}},{"paper":"/paper/abstractive-text-summarization-using-sequence","slug":"abstractive-text-summarization-using-sequence","title":"Abstractive Text Summarization Using Sequence-to-Sequence RNNs and Beyond","date":"2016-02-19","arxiv_id":"1602.06023","rows_on_this_dataset":2,"code_links":4,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":6,"samples_ran":5,"samples_constructed":0,"samples_ran_checked":3,"samples_ran_instrument_failed":2,"samples_unverified":1,"pointer_only_for_licence":0,"official":null,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim.","sample_list":"/paper/abstractive-text-summarization-using-sequence#ran","syntology_url":"https://syntology.ai/paper/1602.06023","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1602.06023"}}}},{"paper":"/paper/teaching-machines-to-read-and-comprehend","slug":"teaching-machines-to-read-and-comprehend","title":"Teaching Machines to Read and Comprehend","date":"2015-06-10","arxiv_id":"1506.03340","rows_on_this_dataset":3,"code_links":12,"syntology":{"read_at":"2026-09-28T10:30:06+00:00","samples_harvested":2,"samples_ran":1,"samples_constructed":0,"samples_ran_checked":1,"samples_ran_instrument_failed":0,"samples_unverified":1,"pointer_only_for_licence":0,"official":{"repos":["deepmind/rc-data"],"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/teaching-machines-to-read-and-comprehend#ran","syntology_url":"https://syntology.ai/paper/1506.03340","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1506.03340"}}}}],"record_sha256":"e000d0b73ef1ccc5b3eafe4fa87cf03f5e8026df5dc8bf0ee7e9990147761c57","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}