CORE-KG: An LLM-Driven Knowledge Graph Construction Framework for Human Smuggling Networks

Dipak Meher, Carlotta Domeniconi, Guadalupe Correa-Cabrera
6/20/2025
cs.CLcs.AIcs.LG

No confident code implementation found for this paper.

Abstract

Human smuggling networks are increasingly adaptive and difficult to analyze. Legal case documents offer valuable insights but are unstructured, lexically dense, and filled with ambiguous or shifting references-posing challenges for automated knowledge graph (KG) construction. Existing KG methods often rely on static templates and lack coreference resolution, while recent LLM-based approaches frequently produce noisy, fragmented graphs due to hallucinations, and duplicate nodes caused by a lack of guided extraction. We propose CORE-KG, a modular framework for building interpretable KGs from legal texts. It uses a two-step pipeline: (1) type-aware coreference resolution via sequential, structured LLM prompts, and (2) entity and relationship extraction using domain-guided instructions, built on an adapted GraphRAG framework. CORE-KG reduces node duplication by 33.28%, and legal noise by 38.37% compared to a GraphRAG-based baseline-resulting in cleaner and more coherent graph structures. These improvements make CORE-KG a strong foundation for analyzing complex criminal networks.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{meher2025corekg,
  title  = {CORE-KG: An LLM-Driven Knowledge Graph Construction Framework for Human Smuggling Networks},
  author = {Dipak Meher and Carlotta Domeniconi and Guadalupe Correa-Cabrera},
  year   = {2025},
  eprint = {2506.21607},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2506.21607v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2506.21607.svg)](https://codeofpaper.com/paper/2506.21607)

Discussion