{"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":"/paper/bottom-up-abstractive-summarization","title":"Bottom-Up Abstractive Summarization","arxiv_id":"1808.10792","date":"2018-08-31","proceeding":"EMNLP 2018 10","authors":["Sebastian Gehrmann","Yuntian Deng","Alexander M. Rush"],"abstract":"Neural network-based methods for abstractive summarization produce outputs\nthat are more fluent than other techniques, but which can be poor at content\nselection. This work proposes a simple technique for addressing this issue: use\na data-efficient content selector to over-determine phrases in a source\ndocument that should be part of the summary. We use this selector as a\nbottom-up attention step to constrain the model to likely phrases. We show that\nthis approach improves the ability to compress text, while still generating\nfluent summaries. This two-step process is both simpler and higher performing\nthan other end-to-end content selection models, leading to significant\nimprovements on ROUGE for both the CNN-DM and NYT corpus. Furthermore, the\ncontent selector can be trained with as little as 1,000 sentences, making it\neasy to transfer a trained summarizer to a new domain.","url_abs":"http://arxiv.org/abs/1808.10792v2","url_pdf":"http://arxiv.org/pdf/1808.10792v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"bottom-up-abstractive-summarization","repo_url":"https://github.com/sebastianGehrmann/bottom-up-summary","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"bottom-up-abstractive-summarization","repo_url":"https://github.com/W4ngatang/qags","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"bottom-up-abstractive-summarization","repo_url":"https://github.com/j40903272/bottom-up-summary","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"bottom-up-abstractive-summarization","repo_url":"https://github.com/mythicalhacker/Text-Summarization","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok"}},{"paper_slug":"bottom-up-abstractive-summarization","repo_url":"https://github.com/prashanth41/text-summarization","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"NOASSERTION"}}],"tasks":[{"task_slug":"abstractive-text-summarization","task_name":"Abstractive Text Summarization"},{"task_slug":"document-summarization","task_name":"Document Summarization"},{"task_slug":"multi-document-summarization","task_name":"Multi-Document Summarization"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/abstractive-text-summarization-on-cnn-daily","task":"Abstractive Text Summarization","dataset":"CNN / Daily Mail","model":"Bottom-Up Summarization","rank_in_archive_order":35,"of":53,"metrics":{"ROUGE-1":"41.22","ROUGE-2":"18.68","ROUGE-L":"38.34"},"uses_additional_data":false},{"leaderboard":"/sota/document-summarization-on-cnn-daily-mail","task":"Document Summarization","dataset":"CNN / Daily Mail","model":"Bottom-Up Sum","rank_in_archive_order":16,"of":26,"metrics":{"PPL":"32.75","ROUGE-1":"41.22","ROUGE-2":"18.68","ROUGE-L":"38.34"},"uses_additional_data":false},{"leaderboard":"/sota/multi-document-summarization-on-multi-news","task":"Multi-Document Summarization","dataset":"Multi-News","model":"CopyTransformer","rank_in_archive_order":4,"of":6,"metrics":{"ROUGE-1":"43.57","ROUGE-2":"14.03","ROUGE-SU4":"17.37"},"uses_additional_data":false},{"leaderboard":"/sota/multi-document-summarization-on-multi-news","task":"Multi-Document Summarization","dataset":"Multi-News","model":"PG-BRNN","rank_in_archive_order":6,"of":6,"metrics":{"ROUGE-1":"42.80","ROUGE-2":"14.19","ROUGE-SU4":"16.75"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1808.10792","atlas_url":"https://app.syntology.ai/?focus=1808.10792","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.10792"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1808.10792"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1808.10792"},"call":"get_harvested_code_for_paper(arxiv_id=\"1808.10792\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1808.10792"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1808.10792\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1808.10792"},"call":"get_concepts_for_paper(arxiv_id=\"1808.10792\")"}],"by_repo":[{"repo":"sebastianGehrmann/bottom-up-summary","kind":"official","samples":6,"ran":5,"instrument":5,"unverified":1},{"repo":"W4ngatang/qags","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"j40903272/bottom-up-summary","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"mythicalhacker/Text-Summarization","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"prashanth41/text-summarization","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/1808.10792.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/1808.10792.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/W4ngatang/qags","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/sebastianGehrmann/bottom-up-summary","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/prashanth41/text-summarization","reach":{"status":"ok","spdx":"NOASSERTION"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/mythicalhacker/Text-Summarization","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/j40903272/bottom-up-summary","reach":{"status":"ok"}}],"summary":{"ran_draft_wrong":3,"ran_fixture":2,"unverified":1},"n_samples":6,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":1,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":true,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":6,"ran":5,"n_ran_checked":0,"n_instrument":5,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":5,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-22","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"17692adbeaedd54d","code_sha256_prefix":"17692adbeaedd54d","entry":"compile_substring","repo":"sebastianGehrmann/bottom-up-summary","repo_kind":"official","path":"preprocess_copy.py","file_url":"https://github.com/sebastianGehrmann/bottom-up-summary/blob/HEAD/preprocess_copy.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"signature":"start:int/0/int, end:int/0/int, split:list/1/str","fixture_out_type":"str","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"17692adbeaedd54d"},"code_page":null,"census":null,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"17692adbeaedd54d"}},{"code_sha256":"1489df8b19518049","code_sha256_prefix":"1489df8b19518049","entry":"format_json","repo":"sebastianGehrmann/bottom-up-summary","repo_kind":"official","path":"preprocess_copy.py","file_url":"https://github.com/sebastianGehrmann/bottom-up-summary/blob/HEAD/preprocess_copy.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"signature":"s:str/0/str","fixture_out_type":"str","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"1489df8b19518049"},"code_page":null,"census":null,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"1489df8b19518049"}},{"code_sha256":"6b890c90cd5ecfa6","code_sha256_prefix":"6b890c90cd5ecfa6","entry":"get_sents","repo":"sebastianGehrmann/bottom-up-summary","repo_kind":"official","path":"prediction_to_text.py","file_url":"https://github.com/sebastianGehrmann/bottom-up-summary/blob/HEAD/prediction_to_text.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"signature":"words:list/1/str, tags:list/1/int, probs:list/1/float","fixture_out_type":"str","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"6b890c90cd5ecfa6"},"code_page":null,"census":null,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"6b890c90cd5ecfa6"}},{"code_sha256":"20cb63f02f26da92","code_sha256_prefix":"20cb63f02f26da92","entry":"get_three","repo":"sebastianGehrmann/bottom-up-summary","repo_kind":"official","path":"prediction_to_text.py","file_url":"https://github.com/sebastianGehrmann/bottom-up-summary/blob/HEAD/prediction_to_text.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"words:list/1/str, outf:StringIO/0/?, probs:list/1/float","fixture_out_type":"str","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"20cb63f02f26da92"}},{"code_sha256":"12d9e8622f8706e2","code_sha256_prefix":"12d9e8622f8706e2","entry":"splits","repo":"sebastianGehrmann/bottom-up-summary","repo_kind":"official","path":"preprocess_copy.py","file_url":"https://github.com/sebastianGehrmann/bottom-up-summary/blob/HEAD/preprocess_copy.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"signature":"s:str/0/str, num:int/0/int","fixture_out_type":"list","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","retrieve_with":{"tool":"get_code","code_sha256":"12d9e8622f8706e2"},"code_page":"/code/splits","census":null,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"12d9e8622f8706e2"}},{"code_sha256":"e378ee2b26dd8ebc","code_sha256_prefix":"e378ee2b26dd8ebc","entry":"get_phrases","repo":"sebastianGehrmann/bottom-up-summary","repo_kind":"official","path":"prediction_to_text.py","file_url":"https://github.com/sebastianGehrmann/bottom-up-summary/blob/HEAD/prediction_to_text.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"e378ee2b26dd8ebc"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"035cdfb80a4c779b68eabd34a3eeeb115f051e713373c28d1330318204929b32","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}