Naver-News-KO: A Korean News Summarization Dataset for Open-Source Fine-Tuning of Summarization Models

• URL: http://arxiv.org/abs/2607.20442v1
• Date: Tue, 12 May 2026 12:25:49 GMT
• Title: Naver-News-KO: A Korean News Summarization Dataset for Open-Source Fine-Tuning of Summarization Models
• Abstract summary: This dataset is a Korean news summarization dataset of 27,400 (document, summary) pairs collected from Naver News over a ten-day window in July 2022.<n>The dataset has been publicly hosted on the Hugging Face Hub since January 2023 and, as of May 2026, receives approximately 33,000 downloads per month.<n>The goal is to provide a citable reference for downstream work that already uses this dataset, not to propose a new benchmark.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We release Naver-News-KO, a Korean news summarization dataset of 27,400 (document, summary) pairs collected from Naver News over a ten-day window in July 2022 across two categories (Economy and IT/Science; 77/23 split), with train/validation/test partitions of 22,194 / 2,466 / 2,740 and a mean per-record document-to-summary character-compression ratio of 6.03x. The dataset has been publicly hosted on the Hugging Face Hub since January 2023 and, as of May 2026, receives approximately 33,000 downloads per month; community-maintained Korean summarization models fine-tuned on it include Gemma-2B-ko and Gemma2-9B variants. This technical report (i) documents the collection protocol, the column schema, and the split construction, (ii) reports corpus-level statistics (length distributions, compression ratio, and a measured 16.8% near-duplicate title-Jaccard overlap between test and train that users should be aware of), (iii) positions the resource against other open Korean summarization corpora, (iv) provides a Lead-3 extractive reference point (ROUGE-1 55.1, ROUGE-L 50.6) and two reproducible fine-tuned baselines -- KoBART (R-1 56.6, BERTScore-F1 81.5) and Gemma-2B-ko with LoRA (R-1 55.3, BERTScore-F1 78.3) -- with release-time training scripts, and (v) clarifies the licensing and intended-use scope of the resource. The goal is to provide a citable reference for downstream work that already uses this dataset, not to propose a new benchmark.

Related papers

• PaperGym: Rubric-Centered Evolution for Research-Plan Generation [69.5921878728483]
  We introduce PaperGym, a unified framework that turns each research paper into a complete training environment.<n>PaperGym exploits the structure of a paper: the question is synthesized from the research goal and background, while the criteria are derived from the method and experiments.<n>With the recipe held fixed, models trained on PaperGym-20k win 58.1% of three-way comparisons, against 28.2% forHub Science.
  arXiv  Detail & Related papers  (2026-08-31T17:31:18Z)
• Annotated Surrogate Retrieval for Polish Statutory Law [0.0]
  We present a family of retrieval methods for Polish statutory law built on document surrogates.<n>ASCR is a surrogate cascade with reranking; ASCR-H fuses a dense list into that cascade; and DTF replaces both language-model stages with three lexical and dense retrievers.<n>We evaluate all three against fourteen lexical, dense, fused and ablated baselines plus four controls, on 300 questions from the 2024 and 2025 Polish bar and legal counsel entrance examinations.
  arXiv  Detail & Related papers  (2026-08-31T15:05:00Z)
• HIRA: A Human-in-the-Loop Retrieval-Augmented Cascade for Document Classification in Regulated Industries [1.5965246343492343]
  HIRA is a training-free, on-premises retrieval-augmented cascade for document classification in regulated deployments.<n>Confident documents are classified directly by retrieval; uncertain or visually confusable documents are passed to a locally hosted verifier.<n>On a private 80-class trade-finance corpus, HIRA processes the full 30,233-document production stream while requesting human correction for only 1,945 documents.
  arXiv  Detail & Related papers  (2026-08-22T06:19:19Z)
• A Structured Knowledge Infrastructure for Domain-Specific Data Asset Discovery [3.199771721348483]
  We present a two-layer solution deployed in the commercial advertising data warehouse at Xiaohongshu.<n>A three-tier dual-purpose knowledge base serves both retrieval and generation.<n>The Graph-Guided Retriever (GGR) uses a 2,859-node knowledge graph as a candidate gate with intent routing to deliver 71.6x token reduction.
  arXiv  Detail & Related papers  (2026-07-30T06:40:05Z)
• Industry Classification of GitHub Repositories Using the North American Industry Classification System (NAICS) [46.877501276559165]
  GitHub hosts hundreds of millions of public repositories, but the platform exposes no native mapping from repositories to standardized industry sectors.<n>We present NAICS-GH, a publicly released corpus of 6,588 GitHub repositories drawn from source pools covering the United States, the European Union, and Australia.<n>Labels are produced by a retrieve-and-verify pipeline that combines BAAI/bge-large-en embeddings, FAISS retrieval, and GPT-4.1 scoring.
  arXiv  Detail & Related papers  (2026-07-07T17:06:32Z)
• SkillDAG: Self-Evolving Typed Skill Graphs for LLM Skill Selection at Scale [54.70985426016736]
  We present SkillDAG, which models inter-skill relationships as a typed directed graph.<n>Each search returns vector matches, typed-edge neighbors, and conflict signals, and a propose-then-commit protocol lets the agent register execution-backed edges.<n>On ALFWorld and SkillsBench with MiniMax-M2.7, SkillDAG reaches 67.1% success and 27.3% reward.
  arXiv  Detail & Related papers  (2026-06-02T02:45:21Z)
• CorPipe at CRAC 2026: Empty Nodes and Cross-Lingual Transfer in Multilingual Coreference Resolution [0.6671865055671308]
  CorPipe 26 is an improved version of CorPipe 25, with a new variant predicting empty nodes together with mentions and coreference links in a single model.<n>Our system outperforms all other submissions in the LLM track by 2.8 percent points and all submissions in the unconstrained track by 9.5 percent points.
  arXiv  Detail & Related papers  (2026-05-28T16:01:03Z)
• Benchmarking Patent Embeddings: A Multi-Task Evaluation of 22 Models Across Retrieval, Classification, and Clustering [0.0]
  We evaluate 22 pre-trained embedding models on three tasks -- information retrieval, classification, and clustering.<n>We find that two results cast doubt on the prevailing wisdom.
  arXiv  Detail & Related papers  (2026-05-22T23:51:13Z)
• GLAN-QnA-KR: A Seedless Taxonomy-Driven Korean Instruction Corpus [0.0]
  We release GLAN-QnA-KR, a 303,581-row openly redistributable Korean instruction-QA corpus.<n>The corpus spans a flat taxonomy of 1,084 English-labelled disciplines paired with Korean question/answer text.
  arXiv  Detail & Related papers  (2026-05-12T15:23:59Z)
• Delta-Based Neural Architecture Search: LLM Fine-Tuning via Code Diffs [48.83701310501069]
  Large language models (LLMs) show strong potential for neural architecture generation.<n>Existing approaches produce complete model implementations from scratch.<n>We propose Delta-Code Generation, where fine-tuned LLMs generate compact unified diffs.
  arXiv  Detail & Related papers  (2026-05-06T13:32:05Z)
• Automated Knowledge Graph Construction using Large Language Models and Sentence Complexity Modelling [0.39089069256361736]
  We introduce CoDe-KG, an end-to-end pipeline for extracting sentence-level knowledge graphs.<n>We contribute a dataset of over 150,000 knowledge triples, which is open source.<n>We show that hybrid chain-of-thought and few-shot prompting yields up to 99.8% exact-match accuracy on sentence simplification.
  arXiv  Detail & Related papers  (2025-09-22T00:01:50Z)
• MonkeyOCR: Document Parsing with a Structure-Recognition-Relation Triplet Paradigm [60.14048367611333]
  MonkeyOCR is a vision-language model for document parsing.<n>It advances the state of the art by leveraging a Structure-Recognition-Relation (SRR) triplet paradigm.
  arXiv  Detail & Related papers  (2025-06-05T16:34:57Z)
• ICDAR 2023 Competition on Structured Text Extraction from Visually-Rich Document Images [198.35937007558078]
  The competition opened on 30th December, 2022 and closed on 24th March, 2023. There are 35 participants and 91 valid submissions received for Track 1, and 15 participants and 26 valid submissions received for Track 2. According to the performance of the submissions, we believe there is still a large gap on the expected information extraction performance for complex and zero-shot scenarios.
  arXiv  Detail & Related papers  (2023-06-05T22:20:52Z)
• MobIE: A German Dataset for Named Entity Recognition, Entity Linking and Relation Extraction in the Mobility Domain [76.21775236904185]
  dataset consists of 3,232 social media texts and traffic reports with 91K tokens, and contains 20.5K annotated entities. A subset of the dataset is human-annotated with seven mobility-related, n-ary relation types. To the best of our knowledge, this is the first German-language dataset that combines annotations for NER, EL and RE.
  arXiv  Detail & Related papers  (2021-08-16T08:21:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.