Pith. sign in

REVIEW 3 cited by

Graphusion: A RAG Framework for Knowledge Graph Construction with a Global Perspective

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.17600 v2 pith:D2IHXSXU submitted 2024-10-23 cs.CL cs.AIcs.DB

classification cs.CLcs.AIcs.DB
keywords knowledgegraphusionconstructionglobalstepbenchmarkdomainentities
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Knowledge Graphs (KGs) are crucial in the field of artificial intelligence and are widely used in downstream tasks, such as question-answering (QA). The construction of KGs typically requires significant effort from domain experts. Large Language Models (LLMs) have recently been used for Knowledge Graph Construction (KGC). However, most existing approaches focus on a local perspective, extracting knowledge triplets from individual sentences or documents, missing a fusion process to combine the knowledge in a global KG. This work introduces Graphusion, a zero-shot KGC framework from free text. It contains three steps: in Step 1, we extract a list of seed entities using topic modeling to guide the final KG includes the most relevant entities; in Step 2, we conduct candidate triplet extraction using LLMs; in Step 3, we design the novel fusion module that provides a global view of the extracted knowledge, incorporating entity merging, conflict resolution, and novel triplet discovery. Results show that Graphusion achieves scores of 2.92 and 2.37 out of 3 for entity extraction and relation recognition, respectively. Moreover, we showcase how Graphusion could be applied to the Natural Language Processing (NLP) domain and validate it in an educational scenario. Specifically, we introduce TutorQA, a new expert-verified benchmark for QA, comprising six tasks and a total of 1,200 QA pairs. Using the Graphusion-constructed KG, we achieve a significant improvement on the benchmark, for example, a 9.2% accuracy improvement on sub-graph completion.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Comparative Approaches to Agent Retrieval over Large Skill Libraries

    cs.AI 2026-08 conditional novelty 6.0 of 10

    A hybrid ranker outperforms a typed knowledge graph for skill retrieval, because the graph's edges are generated from the same embedding neighborhood the ranker already uses, limiting the graph to the ranker's own can...

  2. HVM-GraphRAG: Holistic-View Multimodal Graph Retrieval-Augmented Generation on Complex Document

    cs.IR 2026-07 conditional novelty 5.0 of 10

    A holistic-view multimodal GraphRAG that conflict-resolves concept indices and retrieves via compact concept anchors plus modality-grouped evidence, beating strong baselines on three complex-document QA sets.

  3. Graphs Meet AI Agents: Taxonomy, Progress, and Future Opportunities

    cs.AI 2025-06 conditional novelty 5.0 of 10

    A survey that groups graph-empowered AI agent research into planning, execution, memory, and multi-agent coordination, plus agents-for-graphs and applications.

Pith tools