{"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/a-divide-and-conquer-approach-to-the","title":"A Divide-and-Conquer Approach to the Summarization of Long Documents","arxiv_id":"2004.06190","date":"2020-04-13","proceeding":null,"authors":["Alexios Gidiotis","Grigorios Tsoumakas"],"abstract":"We present a novel divide-and-conquer method for the neural summarization of long documents. Our method exploits the discourse structure of the document and uses sentence similarity to split the problem into an ensemble of smaller summarization problems. In particular, we break a long document and its summary into multiple source-target pairs, which are used for training a model that learns to summarize each part of the document separately. These partial summaries are then combined in order to produce a final complete summary. With this approach we can decompose the problem of long document summarization into smaller and simpler problems, reducing computational complexity and creating more training examples, which at the same time contain less noise in the target summaries compared to the standard approach. We demonstrate that this approach paired with different summarization models, including sequence-to-sequence RNNs and Transformers, can lead to improved summarization performance. Our best models achieve results that are on par with the state-of-the-art in two two publicly available datasets of academic articles.","url_abs":"https://arxiv.org/abs/2004.06190v3","url_pdf":"https://arxiv.org/pdf/2004.06190v3.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":"a-divide-and-conquer-approach-to-the","repo_url":"https://github.com/AlexGidiotis/DANCER-summ","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"articles","task_name":"Articles"},{"task_slug":"document-summarization","task_name":"Document Summarization"},{"task_slug":"sentence","task_name":"Sentence"},{"task_slug":"sentence-similarity","task_name":"Sentence Similarity"},{"task_slug":"text-summarization","task_name":"Text Summarization"}],"methods":[{"method_slug":"lstm","method_name":"LSTM"},{"method_slug":"sigmoid-activation","method_name":"Sigmoid Activation"},{"method_slug":"tanh-activation","method_name":"Tanh Activation"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/text-summarization-on-arxiv","task":"Text Summarization","dataset":"Arxiv HEP-TH citation graph","model":"DANCER PEGASUS","rank_in_archive_order":15,"of":28,"metrics":{"ROUGE-1":"45.01","ROUGE-2":"17.6","ROUGE-L":"40.56"},"uses_additional_data":true},{"leaderboard":"/sota/text-summarization-on-arxiv","task":"Text Summarization","dataset":"Arxiv HEP-TH citation graph","model":"DANCER RUM","rank_in_archive_order":21,"of":28,"metrics":{"ROUGE-1":"42.7","ROUGE-2":"16.54","ROUGE-L":"38.44"},"uses_additional_data":false},{"leaderboard":"/sota/text-summarization-on-arxiv","task":"Text Summarization","dataset":"Arxiv HEP-TH citation graph","model":"DANCER LSTM","rank_in_archive_order":24,"of":28,"metrics":{"ROUGE-1":"41.87","ROUGE-2":"15.92","ROUGE-L":"37.61"},"uses_additional_data":false},{"leaderboard":"/sota/text-summarization-on-pubmed-1","task":"Text Summarization","dataset":"Pubmed","model":"DANCER PEGASUS","rank_in_archive_order":14,"of":29,"metrics":{"ROUGE-1":"46.34","ROUGE-2":"19.97","ROUGE-L":"42.42"},"uses_additional_data":true},{"leaderboard":"/sota/text-summarization-on-pubmed-1","task":"Text Summarization","dataset":"Pubmed","model":"DANCER LSTM","rank_in_archive_order":21,"of":29,"metrics":{"ROUGE-1":"44.09","ROUGE-2":"17.69","ROUGE-L":"40.27"},"uses_additional_data":false},{"leaderboard":"/sota/text-summarization-on-pubmed-1","task":"Text Summarization","dataset":"Pubmed","model":"DANCER RUM","rank_in_archive_order":22,"of":29,"metrics":{"ROUGE-1":"43.98","ROUGE-2":"17.65","ROUGE-L":"40.25"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2004.06190","atlas_url":"https://app.syntology.ai/?focus=2004.06190","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":"2004.06190"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2004.06190\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2004.06190"},"call":"get_concepts_for_paper(arxiv_id=\"2004.06190\")"}],"by_repo":[{"repo":"AlexGidiotis/DANCER-summ","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1804.05685"],"harvested_for_calls":[{"arxiv_id":"1804.05685","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1804.05685"},"call":"get_harvested_code_for_paper(arxiv_id=\"1804.05685\")"}]}],"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":"aca6f7a79cf3d96ae6ac84bdbc3de5cf57afd5f45e72ac96cf3508d07df1034e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}