Reconnecting Fragmented Citation Networks with Semantic Augmentation

Vu Thi Huong, Annika Buchholz, Imene Khebouri, Thorsten Koch, Tim Kunt +3 more
5/12/2026
cs.DLcs.AI

No confident code implementation found for this paper.

Abstract

Citation graphs are fundamental tools for modeling scientific structure, but are often fragmented due to missing citations of scientifically connected articles. To address this issue, we propose a computationally efficient hybrid framework integrating citation topology with large language model (LLM)-based text similarity. Using 662,369 Web of Science publications in Mathematics and Operations Research & Management Science, we augment the original graph by adding semantic edges from small, disconnected components and weighting existing citations according to textual similarity. Semantic augmentation substantially reduces fragmentation while preserving disciplinary homogeneity. Compared to embedding-only clustering, cluster detection on augmented graphs using the Leiden algorithm retains structural interpretability while offering multi-scale organization. The method scales efficiently to large datasets and offers a practical strategy for strengthening citation-based indicators without collapsing disciplinary boundaries.

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{huong2026reconnecting,
  title  = {Reconnecting Fragmented Citation Networks with Semantic Augmentation},
  author = {Vu Thi Huong and Annika Buchholz and Imene Khebouri and Thorsten Koch and Tim Kunt and Wolfgang Peters-Kottig and Tomasz Stompor and Janina Zittel},
  year   = {2026},
  eprint = {2605.12263},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2605.12263v1}
}

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

Discussion