跳到正文
arXiv cs.CL· Juan Felipe Duran, Arthur Tobler, Martin Valli\`eres·· 12 小时前AI 评分31

每条边都要有引文:用语言模型智能体构建医疗软件采购的引文溯源知识图谱

Every Edge Needs a Quote: Building a Quote-Grounded Knowledge Graph of Healthcare Software Adoption with Language-Model Agents

AI 导读

研究者提出一条流水线,从开放网络构建医疗软件客户与集成关系的知识图谱,规则是每条边都必须有来源页面的逐字引文支撑。在 61 家厂商上,该流水线对其抽取器提出的 6,428 条候选关系达到 0.94 精确率和 0.71 召回率;基于五模型投票面板的置信度评分在同等精确率下保留更多正确关系,并在 0.90 召回时达到 0.90 精确率。

正文 · 原文

View PDF HTML (experimental)

Abstract:Hospitals regularly buy software that clinicians and patients depend on. Because these purchases are costly, hard to reverse and can affect patient care, buyers look for evidence of which peer institutions already use a product and which systems it connects to. This evidence is public but scattered across vendor websites, press releases and third-party pages. Language-model agents can now collect it at low cost, but the correctness of the extracted claims is difficult to establish, and a wrongly listed customer can mislead buyers and misrepresent an organisation. We present a pipeline that builds a knowledge graph of customer and integration relations from the open web under one rule: every edge must be supported by a verbatim quote from its source page. Pages come from a deterministic crawl of each vendor's site and a budgeted ReAct agent that searches the rest of the web. A permissive extractor proposes relations with quotes, and a layered grounding stage decides which to keep, using a referent step that reads the whole page when a quote names only one side, deterministic checks, and a panel of five model calls voting on nine criteria. On 61 vendors, the pipeline reaches 0.94 precision and 0.71 recall against a page-level key covering the 6,428 candidate relations proposed by its extractor, whose verdicts were drafted by one model and re-checked with a second. Against the golden reference, the marketplace's own curated list, it scores lower, but 89% of the relations it keeps that the reference lacks are stated on a page. A confidence score built from the panel's votes keeps more correct relations than the fixed rule at the same precision, and reaches 0.90 precision at 0.90 recall. We also discuss how narrow, bounded model calls, string-matched evidence and voting address long-context degradation and run-to-run variance.
Comments: 19 pages, 3 figures, 9 tables. Code: this https URL
Subjects: Computation and Language (cs.CL); Artificial Intelligence (cs.AI); Information Retrieval (cs.IR)
Cite as: arXiv:2610.32781 [cs.CL]
  (or arXiv:2610.32781v1 [cs.CL] for this version)
  https://doi.org/10.48550/arXiv.2610.32781

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Juan Felipe Duran [view email]
[v1] Fri, 23 Oct 2026 15:28:39 UTC (32 KB)

来源:arXiv cs.CL · arxiv.org