Pith. sign in

REVIEW 2 cited by

CleanGraph: Human-in-the-loop Knowledge Graph Refinement and Completion

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 2405.03932 v2 pith:IHQO7WAG submitted 2024-05-07 cs.AI cs.CL

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

This paper presents CleanGraph, an interactive web-based tool designed to facilitate the refinement and completion of knowledge graphs. Maintaining the reliability of knowledge graphs, which are grounded in high-quality and error-free facts, is crucial for real-world applications such as question-answering and information retrieval systems. These graphs are often automatically assembled from textual sources by extracting semantic triples via information extraction. However, assuring the quality of these extracted triples, especially when dealing with large or low-quality datasets, can pose a significant challenge and adversely affect the performance of downstream applications. CleanGraph allows users to perform Create, Read, Update, and Delete (CRUD) operations on their graphs, as well as apply models in the form of plugins for graph refinement and completion tasks. These functionalities enable users to enhance the integrity and reliability of their graph data. A demonstration of CleanGraph and its source code can be accessed at https://github.com/nlp-tlp/CleanGraph under the MIT License.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. SCoRE: Streamlined Corpus-based Relation Extraction using Multi-Label Contrastive Learning and Bayesian kNN

    cs.CL 2025-07 conditional novelty 6.0 of 10

    A no-fine-tuning, contrastive-learning plus Bayesian kNN system matches or exceeds state-of-the-art relation extraction on several benchmarks at a fraction of the energy cost.

  2. medicX-KG: A Knowledge Graph for Pharmacists' Drug Information Needs

    cs.AI 2025-06

Pith tools