<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>graph-based anomaly detection in research citations &#8211; Science</title>
	<atom:link href="https://scienmag.com/tag/graph-based-anomaly-detection-in-research-citations/feed/" rel="self" type="application/rss+xml" />
	<link>https://scienmag.com</link>
	<description></description>
	<lastBuildDate>Thu, 10 Sep 2026 23:54:42 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>
	hourly	</sy:updatePeriod>
	<sy:updateFrequency>
	1	</sy:updateFrequency>
	<generator>https://wordpress.org/?v=7.1</generator>

<image>
	<url>https://scienmag.com/wp-content/uploads/2024/07/cropped-scienmag_ico-32x32.jpg</url>
	<title>graph-based anomaly detection in research citations &#8211; Science</title>
	<link>https://scienmag.com</link>
	<width>32</width>
	<height>32</height>
</image> 
<site xmlns="com-wordpress:feed-additions:1">73899611</site>	<item>
		<title>Graph Learning Method Detects Suspicious Citation Groups in Academic Networks</title>
		<link>https://scienmag.com/graph-learning-method-detects-suspicious-citation-groups-in-academic-networks/</link>
		
		<dc:creator><![CDATA[Denise Maddox]]></dc:creator>
		<pubDate>Thu, 10 Sep 2026 23:54:38 +0000</pubDate>
				<category><![CDATA[Technology and Engineering]]></category>
		<category><![CDATA[Academic citation manipulation detection]]></category>
		<category><![CDATA[citation manipulation detection methods]]></category>
		<category><![CDATA[citation stacking and impact factor manipulation]]></category>
		<category><![CDATA[community detection in citation networks]]></category>
		<category><![CDATA[computational methods for citation network integrity]]></category>
		<category><![CDATA[computational tools for academic integrity]]></category>
		<category><![CDATA[detecting illegitimate citation practices]]></category>
		<category><![CDATA[graph learning for scholarly networks]]></category>
		<category><![CDATA[graph learning for suspicious citation groups]]></category>
		<category><![CDATA[graph-based anomaly detection in research citations]]></category>
		<category><![CDATA[graph-based detection of fraudulent citations]]></category>
		<category><![CDATA[heterogeneous academic network analysis]]></category>
		<category><![CDATA[identifying citation cartels in scientific publishing]]></category>
		<category><![CDATA[identifying citation cartels using graph algorithms]]></category>
		<category><![CDATA[large-scale academic network analysis]]></category>
		<category><![CDATA[machine learning for scientific misconduct detection]]></category>
		<category><![CDATA[machine learning in scholarly communication]]></category>
		<category><![CDATA[multi-level analysis of citation behaviors]]></category>
		<category><![CDATA[network analysis of citation behaviors]]></category>
		<category><![CDATA[network behavior analysis in scholarly communication]]></category>
		<category><![CDATA[structural analysis of academic citation networks]]></category>
		<category><![CDATA[suspicious citation group identification]]></category>
		<guid isPermaLink="false">https://scienmag.com/graph-learning-method-detects-suspicious-citation-groups-in-academic-networks/</guid>

					<description><![CDATA[Citation manipulation has become one of the most corrosive hidden problems in modern science, and a new study from researchers in China, Australia and the United Kingdom now offers a computational weapon against it. In a paper published in the journal Information Systems Frontiers, Jiaying Liu and Shengliang Wei of Dalian University of Technology, Xinrui [&#8230;]]]></description>
										<content:encoded><![CDATA[<p>Citation manipulation has become one of the most corrosive hidden problems in modern science, and a new study from researchers in China, Australia and the United Kingdom now offers a computational weapon against it. In a paper published in the journal Information Systems Frontiers, Jiaying Liu and Shengliang Wei of Dalian University of Technology, Xinrui Cheng of RMIT University, and Gongtai Wang of Warwick Business School describe a graph learning framework designed to identify suspicious citation groups operating inside heterogeneous academic networks, networks that contain not only individual papers but also the journals that publish them. The work arrives at a moment when the scientific community is grappling with a wave of documented citation manipulation, from coordinated citation cartels to journals stripped of their impact factors by Clarivate over suspected citation stacking. The team&#8217;s central insight is deceptively simple but technically far-reaching: to catch groups of journals and papers that trade citations illegitimately, you cannot look at pairwise citation counts alone. You have to understand how a given cluster of nodes behaves both locally, in its immediate neighborhood, and globally, in terms of the structural role it plays across the entire network of scholarly communication.</p>
<p>The scale of the problem the researchers set out to address is well documented. In June 2024, seventeen journals lost their Journal Impact Factors amid suspected citation manipulation, an event the authors explicitly cite as motivation. Earlier studies have estimated that a meaningful fraction of researchers have been asked to add superfluous citations to manuscripts, and analyses of journal self-citation patterns have shown that some outlets inflate their metrics through biased self-referencing. Citation cartels, in which journals, editors and authors agree to cite one another&#8217;s work in a reciprocal loop, distort the map of scientific influence, misdirect funding decisions, and undermine the credibility of bibliometric indicators that universities and hiring committees rely upon. Existing detection approaches, the authors argue, have largely focused on local structural signals: the intensity of citations between a pair of journals, or the anomalous behavior of a single node. Such methods can flag unusual dyads, but they systematically miss the global picture, in which a suspicious group may look unremarkable in isolation while occupying a highly atypical position within the overall citation flow of the network.</p>
<p>To close this gap, the researchers adopted a design science research methodology, a framework originating in information systems research that treats the construction of an effective artifact, in this case a computational framework, as a legitimate scientific contribution alongside the design principles that explain why the artifact works. Drawing on Complex Network Theory, they model the academic ecosystem as a heterogeneous network in which both journals and papers are represented as nodes, connected by citation and publication links of different types. This heterogeneous representation matters because citation manipulation typically spans multiple levels: a cartel may involve papers citing each other, journals preferentially publishing papers that cite member journals, and editorial decisions that channel citations along particular pathways. By encoding these relationships in a single graph structure, the framework can reason about citation flow dynamics that would be invisible in a flattened, journal-only or paper-only network.</p>
<p>Technically, the framework integrates two complementary families of structural signals. On the local side, it captures behavior similarity among nodes, measuring how closely a candidate group of journals and papers resembles the citation behavior of the surrounding network. Nodes engaged in legitimate scholarly exchange tend to exhibit citation patterns consistent with their topical communities; cartel participants, by contrast, display behavior that is mutually reinforcing and decoupled from the broader community. On the global side, the framework learns node embeddings, dense vector representations produced by graph learning algorithms, that encode each node&#8217;s structural position across the entire network. These embeddings allow the system to detect when a group occupies an anomalous structural role, for instance when a cluster of journals receives an unusually high proportion of citations from a closed set of sources relative to the global distribution of citation flow. The detection problem is thus reframed as an anomaly detection task over learned graph representations, a strategy that connects the study to the rapidly expanding literature on deep graph anomaly detection.</p>
<p>The choice of graph learning is not incidental. Graph neural networks and related embedding techniques have transformed anomaly detection on attributed networks in recent years, enabling models to learn normal patterns of connectivity and then flag deviations without requiring exhaustive hand-crafted rules. The authors build on this foundation but tailor it to the specific structure of citation manipulation, where the unit of suspicion is a group rather than an individual node. Prior work on anomalous citation detection, including deep graph learning approaches published in IEEE Transactions on Neural Networks and Learning Systems and unsupervised anomaly detection methods applied to journal-level citation networks, has demonstrated the promise of these techniques. The new framework extends them by explicitly combining local and global signals in a principled way, and by deriving generalizable design principles for how such signals should be integrated when the target is a coordinated group operating across a heterogeneous network.</p>
<p>The empirical implications of the framework extend well beyond the technical community. Publishers, indexing services and bibliometric agencies currently rely heavily on threshold-based rules, such as limits on the ratio of self-citations, to police citation behavior. These rules are blunt instruments: sophisticated cartels can distribute their exchanges across many journals and papers to stay beneath any fixed threshold, while legitimate journals with narrow, specialized fields can be unfairly penalized by crude ratio tests. A learned, structure-aware detector offers a fundamentally different enforcement model, one that evaluates the pattern of citation flow in context rather than applying a single arithmetic cutoff. For editors and publishers, such a tool could serve as an early warning system, surfacing candidate suspicious groups for human review before manipulation accumulates enough to distort impact factors or h-index style rankings. For funders and institutions, it offers a path toward more trustworthy evaluation, since the citations underpinning a candidate&#8217;s metrics could be audited against learned models of normal scholarly behavior.</p>
<p>The study is also notable for its methodological positioning. Rather than presenting the framework as a black-box classifier, the authors frame their contribution in terms of design principles, generalizable statements about how local and global structural signals should be combined in network-based identification of suspicious citation groups. This framing, consistent with the design science tradition established by Hevner and colleagues and refined by Gregor and Hevner, means that the work&#8217;s value is not confined to the specific algorithm implemented. Other researchers and practitioners can use the principles to construct their own detection systems adapted to different data sources, network schemas, or institutional contexts. In a field where adversarial actors continuously adapt their tactics, transferable design principles may prove more durable than any single model.</p>
<p>The broader context of research integrity gives the study urgency. Surveys of researchers have documented widespread pressure to cite, including coercive citation practices in which reviewers or editors demand citations to their own work as a condition of favorable editorial decisions. Analyses of self-citation behavior have revealed extreme outliers among individual scientists and journals alike, and simulation studies have explored how self-interest can metastasize into cartel behavior when reputational incentives reward citation counts over genuine scholarly contribution. The economics of academic publishing amplify these pressures: journal impact factors influence library subscriptions, editorial board prestige, and the commercial value of publishing portfolios. As long as citation counts function as currency, the incentive to manipulate them will persist, and the tools required to defend the integrity of scholarly communication must evolve in step.</p>
<p>The new framework does not claim to automate the judgment of misconduct; identification of a suspicious citation group is a signal for investigation, not a verdict. Human editorial oversight, institutional review and due process remain essential, and false positives, in which legitimate communities of closely related work are flagged, carry real costs. The authors position their artifact as a decision-support tool that narrows the search space for investigators, prioritizing which corners of an enormous citation network deserve scrutiny. Given that modern citation databases encompass hundreds of millions of papers and tens of thousands of journals, any scalable approach to this problem must be computational; manual auditing alone is mathematically incapable of covering the terrain.</p>
<p>What makes the work likely to resonate widely is the way it reframes a social problem as a structural one. Citation cartels are, in network terms, communities whose citation flow deviates from the expectations encoded in the rest of the graph. By formalizing that intuition with heterogeneous network representations, behavior similarity measures and learned global embeddings, the study transforms an opaque ethics problem into a tractable data science task. As the scientific enterprise continues to grow in scale and as metric-driven evaluation deepens, frameworks of this kind may become as fundamental to the infrastructure of science as peer review itself. The research was partially supported by the National Natural Science Foundation of China, the Humanities and Social Science Fund of the Ministry of Education, and the Natural Science Foundation of Liaoning Province, and the underlying data and materials are available from the authors upon request.</p>
<div class="scienmag-article-metadata"><strong>Subject of Research:</strong> Identification of suspicious citation groups in heterogeneous academic networks using a graph learning framework that integrates local and global structural signals.</p>
<p><strong>Article Title:</strong> Designing a Computational Framework for Identifying Suspicious Citation Groups in Heterogeneous Academic Networks: A Graph Learning Approach</p>
<p><strong>Article References:</strong> Liu, J., Cheng, X., Wei, S., &amp; Wang, G. (2026). Designing a Computational Framework for Identifying Suspicious Citation Groups in Heterogeneous Academic Networks: A Graph Learning Approach. <em>Information Systems Frontiers, 28</em>(4), 1651-1673. <a href="https://doi.org/10.1007/s10796-026-10770-y" target="_blank" rel="noopener noreferrer">https://doi.org/10.1007/s10796-026-10770-y</a></p>
<p><strong>Image Credits:</strong> AI Generated</p>
<p><strong>DOI:</strong> <a href="https://doi.org/10.1007/s10796-026-10770-y" target="_blank" rel="noopener noreferrer">10.1007/s10796-026-10770-y</a></p>
<p><strong>Keywords:</strong> suspicious citation groups, heterogeneous network, graph learning, behavior similarity, design science, citation manipulation, citation cartels, complex network theory, anomaly detection, journal impact factor, academic integrity, scholarly big data</p>
</div>
]]></content:encoded>
					
		
		
		<post-id xmlns="com-wordpress:feed-additions:1">192061</post-id>	</item>
	</channel>
</rss>
