{"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/bart-it-an-efficient-sequence-to-sequence","title":"BART-IT: An Efficient Sequence-to-Sequence Model for Italian Text Summarization","arxiv_id":null,"date":"2022-12-27","proceeding":"Future Internet 2022 12","authors":["La Quatra Moreno","Cagliero Luca"],"abstract":"The emergence of attention-based architectures has led to significant improvements in the performance of neural sequence-to-sequence models for text summarization. Although these models have proved to be effective in summarizing English-written documents, their portability to other languages is limited thus leaving plenty of room for improvement. In this paper, we present BART-IT, a sequence-to-sequence model, based on the BART architecture that is specifically tailored to the Italian language. The model is pre-trained on a large corpus of Italian-written pieces of text to learn language-specific features and then fine-tuned on several benchmark datasets established for abstractive summarization. The experimental results show that BART-IT outperforms other state-of-the-art models in terms of ROUGE scores in spite of a significantly smaller number of parameters. The use of BART-IT can foster the development of interesting NLP applications for the Italian language. Beyond releasing the model to the research community to foster further research and applications, we also discuss the ethical implications behind the use of abstractive summarization models.","url_abs":"https://www.mdpi.com/1999-5903/15/1/15","url_pdf":"https://www.mdpi.com/1999-5903/15/1/15/pdf?version=1673418752","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":"bart-it-an-efficient-sequence-to-sequence","repo_url":"https://github.com/MorenoLaQuatra/bart-it","is_official":0,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"abstractive-text-summarization","task_name":"Abstractive Text Summarization"},{"task_slug":"text-summarization","task_name":"Text Summarization"}],"methods":[{"method_slug":"adam","method_name":"Adam"},{"method_slug":"attention","method_name":"Attention"},{"method_slug":"bart","method_name":"BART"},{"method_slug":"bpe","method_name":"BPE"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"dropout","method_name":"Dropout"},{"method_slug":"layer-normalization","method_name":"Layer Normalization"},{"method_slug":"linear-layer","method_name":"Linear Layer"},{"method_slug":"multi-head-attention","method_name":"Multi-Head Attention"},{"method_slug":"residual-connection","method_name":"Residual Connection"},{"method_slug":"softmax","method_name":"Softmax"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/abstractive-text-summarization-on-abstractive","task":"Abstractive Text Summarization","dataset":"Abstractive Text Summarization from Fanpage","model":"mBART","rank_in_archive_order":1,"of":6,"metrics":{"# Parameters":"610","BERTScore":"73.4","ROUGE-1":"36.52","ROUGE-2":"17.52","ROUGE-L":"26.14"},"uses_additional_data":false},{"leaderboard":"/sota/abstractive-text-summarization-on-abstractive","task":"Abstractive Text Summarization","dataset":"Abstractive Text Summarization from Fanpage","model":"BART-IT","rank_in_archive_order":3,"of":6,"metrics":{"# Parameters":"140","BERTScore":"73.24","ROUGE-1":"35.42","ROUGE-2":"15.88","ROUGE-L":"25.12"},"uses_additional_data":false},{"leaderboard":"/sota/abstractive-text-summarization-on-abstractive","task":"Abstractive Text Summarization","dataset":"Abstractive Text Summarization from Fanpage","model":"mT5","rank_in_archive_order":4,"of":6,"metrics":{"# Parameters":"390","BERTScore":"72.77","ROUGE-1":"34.13","ROUGE-2":"15.76","ROUGE-L":"24.84"},"uses_additional_data":false},{"leaderboard":"/sota/abstractive-text-summarization-on-abstractive","task":"Abstractive Text Summarization","dataset":"Abstractive Text Summarization from Fanpage","model":"IT5-base","rank_in_archive_order":5,"of":6,"metrics":{"# Parameters":"220","BERTScore":"70.3","ROUGE-1":"33.99","ROUGE-2":"15.59","ROUGE-L":"24.91"},"uses_additional_data":false},{"leaderboard":"/sota/abstractive-text-summarization-on-abstractive-1","task":"Abstractive Text Summarization","dataset":"Abstractive Text Summarization from Il Post","model":"mBART","rank_in_archive_order":1,"of":8,"metrics":{"BERTScore":"75.86","ROUGE-1":"38.91","ROUGE-2":"21.41","ROUGE-L":"32.08"},"uses_additional_data":false},{"leaderboard":"/sota/abstractive-text-summarization-on-abstractive-1","task":"Abstractive Text Summarization","dataset":"Abstractive Text Summarization from Il Post","model":"BART-IT","rank_in_archive_order":3,"of":8,"metrics":{"BERTScore":"75.36","ROUGE-1":"37.31","ROUGE-2":"19.44","ROUGE-L":"30.41"},"uses_additional_data":false},{"leaderboard":"/sota/abstractive-text-summarization-on-abstractive-1","task":"Abstractive Text Summarization","dataset":"Abstractive Text Summarization from Il Post","model":"mT5","rank_in_archive_order":4,"of":8,"metrics":{"BERTScore":"74.69","ROUGE-1":"35.04","ROUGE-2":"17.41","ROUGE-L":"28.68"},"uses_additional_data":false},{"leaderboard":"/sota/abstractive-text-summarization-on-abstractive-1","task":"Abstractive Text Summarization","dataset":"Abstractive Text Summarization from Il Post","model":"IT5-base","rank_in_archive_order":6,"of":8,"metrics":{"BERTScore":"71.06","ROUGE-1":"32.88","ROUGE-2":"15.53","ROUGE-L":"26.7"},"uses_additional_data":false},{"leaderboard":"/sota/abstractive-text-summarization-on-wits","task":"Abstractive Text Summarization","dataset":"WITS","model":"BART-IT","rank_in_archive_order":1,"of":4,"metrics":{"BERTScore":"79.28","ROUGE-1":"42.32","ROUGE-2":"28.83","ROUGE-L":"38.84"},"uses_additional_data":false},{"leaderboard":"/sota/abstractive-text-summarization-on-wits","task":"Abstractive Text Summarization","dataset":"WITS","model":"mT5","rank_in_archive_order":2,"of":4,"metrics":{"BERTScore":"80.73","ROUGE-1":"40.6","ROUGE-2":"26.9","ROUGE-L":"37.43"},"uses_additional_data":false},{"leaderboard":"/sota/abstractive-text-summarization-on-wits","task":"Abstractive Text Summarization","dataset":"WITS","model":"mBART","rank_in_archive_order":3,"of":4,"metrics":{"BERTScore":"78.65","ROUGE-1":"39.32","ROUGE-2":"26.18","ROUGE-L":"35.9"},"uses_additional_data":false},{"leaderboard":"/sota/abstractive-text-summarization-on-wits","task":"Abstractive Text Summarization","dataset":"WITS","model":"IT5-base","rank_in_archive_order":4,"of":4,"metrics":{"BERTScore":"77.14","ROUGE-1":"37.98","ROUGE-2":"24.32","ROUGE-L":"34.94"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"MorenoLaQuatra/bart-it","kind":"named_in_paper","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2010.11934"],"harvested_for_calls":[{"arxiv_id":"2010.11934","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2010.11934"},"call":"get_harvested_code_for_paper(arxiv_id=\"2010.11934\")"}]}],"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":"c11f61b6751ecfccf3b7647bf8c28f58ce94d394146f5970494a1e5d29bc8bee","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}