LINK-KG: LLM-Driven Coreference-Resolved Knowledge Graphs for Human Smuggling Networks

Dipak Meher, Carlotta Domeniconi, Guadalupe Correa-Cabrera
10/30/2025
cs.AIcs.IRcs.LG

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Human smuggling networks are complex and constantly evolving, making them difficult to analyze comprehensively. Legal case documents offer rich factual and procedural insights into these networks but are often long, unstructured, and filled with ambiguous or shifting references, posing significant challenges for automated knowledge graph (KG) construction. Existing methods either overlook coreference resolution or fail to scale beyond short text spans, leading to fragmented graphs and inconsistent entity linking. We propose LINK-KG, a modular framework that integrates a three-stage, LLM-guided coreference resolution pipeline with downstream KG extraction. At the core of our approach is a type-specific Prompt Cache, which consistently tracks and resolves references across document chunks, enabling clean and disambiguated narratives for structured knowledge graph construction from both short and long legal texts. LINK-KG reduces average node duplication by 45.21% and noisy nodes by 32.22% compared to baseline methods, resulting in cleaner and more coherent graph structures. These improvements establish LINK-KG as 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. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

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

Similar Papers

Cite this paper

@article{meher2025linkkg,
  title  = {LINK-KG: LLM-Driven Coreference-Resolved Knowledge Graphs for Human Smuggling Networks},
  author = {Dipak Meher and Carlotta Domeniconi and Guadalupe Correa-Cabrera},
  year   = {2025},
  eprint = {2510.26486},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2510.26486v1}
}

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/2510.26486.svg)](https://codeofpaper.com/paper/2510.26486)

Discussion