Aug 2026· Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2· pp. 732-742· 1 citation· 13 references
Abstract
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 paper's content and its contextual grounding in related literature. To address this gap, we introduce SciNova, a benchmark containing 3,063 papers from both ICLR and NeurIPS, with full content, bibliographies, and peer review scores for novelty prediction. Building on this benchmark, we propose GraphMind, a model that jointly processes micro- and macro-level structures for novelty prediction and rationale generation. It represents each paper as a hierarchical graph that captures its claims, methods, and experiments (micro-level), while its related paper graphs encode both cited and semantically similar works (macro-level). Experiments show that by incorporating this bi-level graph, GraphMind significantly outperforms baseline LLMs in both novelty score prediction and rationale generation.
This paper proposes Concept-guided Counterfactual Subgraph Retrieval (CCSGR), a dataset-grounded formulation that retrieves from a large graph subgraphs that are structurally and semantically similar to a query but induce different predictions under the same model, yielding domain-valid and verifiable counterfactual ex...
Hsi-Wen Chen, Jian Pei, De-Nian Yang et al.· Proceedings of the 32nd ACM...· 0 citations
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 ac...
Xiaoxuan Gou, Weiguo Zheng, Han-Qing Guo et al.· Proceedings of the 32nd ACM...· 0 citations
Scientific papers may relate by problem, method, result, or contribution, but document-level retrievers collapse these into a single similarity score without saying why they are related. Citation- and similarity-based retrieval alone also confines search to the neighbourhood of what is already known, whereas generative...
Italo Luis da Silva, Hanqi Yan, Yujing Wang et al.· 0 citations
Counterfactual explanations for graph-structured data seek to determine minimal and realistic modifications required in an input graph to alter a model's prediction to a predefined output. Although counterfactual explainers that support modifying the graph by both adding and removing edges have recently emerged, there...
Maria Myrto Villia, Filippos Gouidis, T. Patkos et al.· 0 citations
EvoTree is proposed, a staged framework that decouples conceptual backbone learning from temporal refinement and is the only method with non-trivial marginal-paper detection on the annotated set, and is the only method with non-trivial marginal-paper detection on the annotated set.
Similarity-guided Structural Matching Learning for Graph Dataset Condensation (SSGDC) is proposed, which efficiently reduces repository size while maintaining both task performance and structural information.
Yi-Yang Zhang, Yutong Ye, Ying-Bo Zhou et al.· Proceedings of the Thirty-Fi...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.