Exploring Academic Influence of Algorithms by Co-occurrence Network Based on Full-text of Academic Papers

arXiv cs.AI Papers
algorithms co-occurrence-network academic-influence natural-language-processing network-analysis full-text-analysis machine-learning

Summary

This paper constructs large-scale algorithm co-occurrence networks from the full text of academic papers to study the collective influence of algorithms in NLP, finding that classic, high-performing, and intersectional algorithms hold central network positions.

arXiv:2606.24099v1 Announce Type: new Abstract: Algorithms have become central to scientific research in the era of artificial intelligence (AI). Although algorithm mentions in papers are often used to indicate popularity and influence, existing studies usually evaluate individual algorithms in isolation and pay limited attention to the collective influence formed through their interconnections. This study constructs large-scale algorithm co-occurrence networks in natural language processing (NLP) based on the full text of academic papers and investigates algorithm influence from a network perspective. Using deep learning models, we extract algorithm entities and build overall, cumulative, and annual co-occurrence networks. We analyze their structural characteristics and apply multiple centrality measures to assess the group influence of algorithms across the whole field and over time. The results show that algorithm networks display typical features of complex networks, with increasingly dense connections developing over approximately two decades. Classic, high-performing algorithms and those located at the intersections of different research periods tend to have high popularity, control, centrality, and balanced influence. When the influence of an algorithm declines, it usually loses its core network position first, followed by weaker associations with other algorithms. This study is the first large-scale analysis of algorithm co-occurrence networks. Covering more than four decades of academic publications, it provides a temporal and structural view of algorithm influence and offers a foundation for future research on networks linking algorithms, scholars, and tasks.
Original Article
View Cached Full Text

Cached at: 06/24/26, 07:44 AM 

# Exploring Academic Influence of Algorithms by Co-occurrence Network Based on Full-text of Academic Papers
Source: [https://arxiv.org/abs/2606.24099](https://arxiv.org/abs/2606.24099)
[View PDF](https://arxiv.org/pdf/2606.24099)

> Abstract:Algorithms have become central to scientific research in the era of artificial intelligence \(AI\)\. Although algorithm mentions in papers are often used to indicate popularity and influence, existing studies usually evaluate individual algorithms in isolation and pay limited attention to the collective influence formed through their interconnections\. This study constructs large\-scale algorithm co\-occurrence networks in natural language processing \(NLP\) based on the full text of academic papers and investigates algorithm influence from a network perspective\. Using deep learning models, we extract algorithm entities and build overall, cumulative, and annual co\-occurrence networks\. We analyze their structural characteristics and apply multiple centrality measures to assess the group influence of algorithms across the whole field and over time\. The results show that algorithm networks display typical features of complex networks, with increasingly dense connections developing over approximately two decades\. Classic, high\-performing algorithms and those located at the intersections of different research periods tend to have high popularity, control, centrality, and balanced influence\. When the influence of an algorithm declines, it usually loses its core network position first, followed by weaker associations with other algorithms\. This study is the first large\-scale analysis of algorithm co\-occurrence networks\. Covering more than four decades of academic publications, it provides a temporal and structural view of algorithm influence and offers a foundation for future research on networks linking algorithms, scholars, and tasks\.

## Submission history

From: Chengzhi Zhang \[[view email](https://arxiv.org/show-email/f4b4fabd/2606.24099)\] **\[v1\]**Tue, 23 Jun 2026 03:26:39 UTC \(1,706 KB\)

Similar Articles

Correcting Influence: Unboxing LLM Outputs with Orthogonal Latent Spaces

arXiv cs.LG

This paper introduces a framework for token-level influence attribution in large language models by learning orthogonal latent spaces with sparse autoencoders, enabling precise identification of training data tokens that jointly influence predictions, with applications in high-stakes domains like healthcare.