arXiv:2608.22381cs.IRcs.CL2026-08

让论文检索不仅找相似,还能说明为何相关,助力科学发现。

GRAFT: Graph-Distilled Generative Retrieval for Facet-Aware Scientific Literature Exploration

  • 用四类关联边构建论文图谱,生成式检索直接输出相关论文文本
  • 在11,359篇论文上实现91%的召回率,且无需编码器或近邻索引
  • 返回结果自带标签,明确说明论文为何被推荐,适合探索性研究

科学论文可能因问题、方法、结果或贡献而关联,但传统文档级检索将这些关系压缩为单一相似度分数,无法解释关联原因。仅依赖引用和相似度的检索局限于已有知识范围,而生成式检索可直接生成文档标识符,支持科学发现所需的探索性搜索。本文构建一个包含四类关联边(问题、方法、结果、贡献)的论文图谱,基于段落内容与引用信号生成,并将其蒸馏为生成式检索器,其生成的标识符即为论文自身的关联文本。原始蒸馏存在两个缺陷:一是训练样本为边,导致仅84%的语料可被索引;二是约束解码虽保证生成有效论文,但不保证与查询连通。为此,提出覆盖感知蒸馏,通过反向邻居回退、最小覆盖率阈值和边重要性加权提升可学习性;并引入图加权互逆排名融合,根据查询-候选边权重调整排名,剔除无支持的候选。在自建的11,359篇NLP论文数据集LitWeave上,GRAFT在无近邻索引与编码器的情况下,实现了91%的Recall@20,且对未包含于语料的查询论文表现优于图教师模型。其生成的关联标签精确率达0.922,确保每条返回结果均附带其来源的关联类型标签。

原文摘要 · Abstract (English)

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 retrieval generates document identifiers directly, enabling the exploratory retrieval that scientific discovery depends on. We connect papers in a graph whose edges are typed by these four facets, derived from facet items and citation signals, and distil it into a generative retriever whose identifiers are the papers' own facet text. Two graph properties do not survive naive distillation. First, because every training pair is an edge, naive enumeration indexes just 84% of the corpus. Coverage-aware distillation makes every paper learnable through a reverse-neighbour fallback, a minimum-coverage threshold, and edge-importance weighting. Second, constrained decoding guarantees that every generated identifier is a valid paper, but not that the graph connects it to the query. Graph-weighted reciprocal rank fusion scales each candidate's rank term by its query-candidate edge weight, dropping unsupported ones. On LitWeave, our constructed corpus of 11,359 NLP papers, Graft recovers 91% of its graph teacher's Recall@20 with no nearest-neighbour index or encoder at inference, and outperforms the graph teacher on query papers outside the corpus. It reproduces the graph's own facet labels at 0.922 precision, so every returned paper arrives labelled with the facet that surfaced it rather than an opaque score.

生成检索论文图谱探索发现多面关联

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。