Aug 2026· Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2· pp. 8930-8941· 0 citations· 17 references
TL;DR
This paper develops a comprehensive benchmark construction framework and constructs three diverse benchmark datasets and proposes a unified evaluation framework that assesses both linguistic quality and factual consistency, providing a comprehensive approach to evaluating generated summaries for content fidelity and accuracy.
Abstract
This paper introduces a novel task, graph textual summarization, which aims to generate natural language descriptions that capture both the semantic content and structural characteristics of graph data based on large language models (LLMs). Unlike traditional summarization tasks for text, images, or videos, summarizing graph data presents unique challenges due to its abstract and non-intuitive nature. We develop a comprehensive benchmark construction framework and construct three diverse benchmark datasets, including text-attributed graphs (TAGs), knowledge graphs (KGs), and heterogeneous attributed graphs (HAGs). To facilitate empirical studies, we deliver three representative benchmark datasets: SurveyGraphSum, consisting of 7835 citation graphs from survey papers across 10 major domains and 56 subdomains; BookGraphSum, containing 6175 knowledge graphs extracted from 186 books; and E-comGraphSum, with 912 heterogeneous graphs from real-world e-commerce networks, each representing a fraud group with 14 node types, 19 relation types, and 9 numerical attributes related to user behavior and interactions. In addition, we propose a unified evaluation framework that assesses both linguistic quality and factual consistency, providing a comprehensive approach to evaluating generated summaries for content fidelity and accuracy. By formalizing the task, releasing benchmark datasets, and proposing an evaluation framework, we aim to advance research in graph textual summarization and promote methods that produce accurate, informative, and human-readable summaries for complex graphs.
OpenRTAG provides a standardized testbed for understanding robustness in TAG learning under realistic low-quality settings and systematically evaluates scenario validity and model sensitivity, compares traditional GNNs, LLM-GNNs, and a representative GFM, and investigates the effectiveness, efficiency, and robustness o...
Yu-Ze Dai, Zhi-Han Zhang, Yan Zhao et al.· arXiv.org· 0 citations
TAHB (Text-Attributed Hypergraph Benchmark) is presented, the first public benchmark integrating hypergraph structures and raw textual attributes, and shows that LLM-enhanced textual semantics improve hypergraph learning performance, while structural and textual information jointly provide the best setting for LLM-base...
D. Y. Kang, Junghyun Kim, Ju-hyun Jeon et al.· 0 citations
The rapid expansion of scientific publications has significantly increased the complexity of traditional literature review processes. While recent advances in AI-assisted screening reduce manual effort, they fail to provide an actionable organization of findings beyond thematic clustering. We propose an integrated pipe...
Le Van Olivier, Dardouillet Pierre, Boutalbi Karima· Annual International Compute...· 0 citations
This survey presents a systematic review of 121 references spanning 2002 to 2026, tracing the evolution of TextRank-based approaches into hybrid LLM pipelines and advancing three qualified arguments.
Ahmed J. Jabur, Asmaa Abdul Azeez Dakhil, Israa Saad Mohammed et al.· Iraqi Journal for Computers...· 0 citations
Assessing scientific novelty is inherently complex, requiring evaluation of both a paper's internal structure and its contribution within the broader research landscape. Existing large language model (LLM) approaches often rely on surface-level similarity or citation retrieval, overlooking the integration between a pap...
Italo Luis da Silva, Hanqi Yan, Lin Gui et al.· Proceedings of the 32nd ACM...· 1 citation
A five-stage semi-automatic framework for constructing complex graph reasoning benchmarks that serves as a challenging and diagnostic benchmark for graph reasoning and provides empirical guidance for future enhancement methods is proposed.
Fali Wang, Ali Al-Lawati, Iliyas Bektas et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.