{"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/generating-wikipedia-by-summarizing-long","title":"Generating Wikipedia by Summarizing Long Sequences","arxiv_id":"1801.10198","date":"2018-01-30","proceeding":"ICLR 2018 1","authors":["Peter J. Liu","Mohammad Saleh","Etienne Pot","Ben Goodrich","Ryan Sepassi","Lukasz Kaiser","Noam Shazeer"],"abstract":"We show that generating English Wikipedia articles can be approached as a\nmulti- document summarization of source documents. We use extractive\nsummarization to coarsely identify salient information and a neural abstractive\nmodel to generate the article. For the abstractive model, we introduce a\ndecoder-only architecture that can scalably attend to very long sequences, much\nlonger than typical encoder- decoder architectures used in sequence\ntransduction. We show that this model can generate fluent, coherent\nmulti-sentence paragraphs and even whole Wikipedia articles. When given\nreference documents, we show it can extract relevant factual information as\nreflected in perplexity, ROUGE scores and human evaluations.","url_abs":"http://arxiv.org/abs/1801.10198v1","url_pdf":"http://arxiv.org/pdf/1801.10198v1.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":"generating-wikipedia-by-summarizing-long","repo_url":"https://github.com/tensorflow/tensor2tensor","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"generating-wikipedia-by-summarizing-long","repo_url":"https://github.com/aseidelo/wiki_generator","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"generating-wikipedia-by-summarizing-long","repo_url":"https://github.com/brsarah20/Alphafold2","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"generating-wikipedia-by-summarizing-long","repo_url":"https://github.com/lucidrains/memory-compressed-attention","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"articles","task_name":"Articles"},{"task_slug":"decoder","task_name":"Decoder"},{"task_slug":"document-summarization","task_name":"Document Summarization"},{"task_slug":"extractive-summarization","task_name":"Extractive Summarization"},{"task_slug":"multi-document-summarization","task_name":"Multi-Document Summarization"},{"task_slug":"sentence","task_name":"Sentence"}],"methods":[{"method_slug":"t-d","method_name":"T-D"}],"datasets_introduced":[{"slug":"wikisum","name":"WikiSum","full_name":"WikiSum"},{"slug":"wikipedia-generation","name":"Wikipedia Generation","full_name":"Wikipedia Generation"}],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1801.10198","atlas_url":"https://app.syntology.ai/?focus=1801.10198","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1801.10198"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1801.10198\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1801.10198"},"call":"get_concepts_for_paper(arxiv_id=\"1801.10198\")"}],"by_repo":[{"repo":"tensorflow/tensor2tensor","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":3,"harvested_for":["1803.07416","1903.00374","2005.11197"],"harvested_for_calls":[{"arxiv_id":"1803.07416","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1803.07416"},"call":"get_harvested_code_for_paper(arxiv_id=\"1803.07416\")"},{"arxiv_id":"1903.00374","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1903.00374"},"call":"get_harvested_code_for_paper(arxiv_id=\"1903.00374\")"},{"arxiv_id":"2005.11197","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2005.11197"},"call":"get_harvested_code_for_paper(arxiv_id=\"2005.11197\")"}]},{"repo":"aseidelo/wiki_generator","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"brsarah20/Alphafold2","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2102.13419"],"harvested_for_calls":[{"arxiv_id":"2102.13419","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2102.13419"},"call":"get_harvested_code_for_paper(arxiv_id=\"2102.13419\")"}]},{"repo":"lucidrains/memory-compressed-attention","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"002327307a8d75693b582efd200e67b80479957abcfe0197adf6e312b717e605","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}