The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Roles in networks
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Sub-clusters exchanging information are likely to average towards their local centre [137,138,139], which entails a form of opinion stability within the group.”
From Epistemic Communities under Active Inference (2022) · cites this paper as [138]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Community structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502
(1999) · Cited by 12,854
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 9,032
Epidemic Spreading in Scale-Free Networks
Pastor‐Satorras, R., & Vespignani, A. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.3200 · Cited by 5,785
Factoring and weighting approaches to status scores and clique identification
Bonacich, P. (1972) · Journal of Mathematical Sociology · doi:10.1080/0022250x.1972.9989806 · Cited by 3,246
Graph Drawing: Algorithms for the Visualization of Graphs
Battista, G. D., Eades, P., Tamassia, R., & Tollis, I. G. (1998) · Iris (Roma Tre University) · Cited by 1,977
(2001) · Cited by 1,052
Stable algorithms for link analysis
Ng, A. Y., Zheng, A. X., & Jordan, M. I. (2001) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/383952.384003 · Cited by 289
A graph-theoretical model of computer security
Burgess, M., Canright, G., & Engø‐Monsen, K. (2004) · International Journal of Information Security · doi:10.1007/s10207-004-0044-x · Cited by 20
Self-citation
Research works printed but not linked: 1
- Canright, 2003, Multiplex structure of the communications network in a small working group, Social Networks—An International Journal of Structural Analysis
Cited by
Sorted by citations
Epistemic Communities under Active Inference
Albarracin, M., Demekas, D., Ramstead, M. J. D., & Heins, C. (2022) · Entropy · doi:10.3390/e24040476 · Cited by 60
Farooqui, A., Tazyeen, S., Ahmed, M. M., Alam, A., Ali, S., Malik, M. Z., Ali, S., & Ishrat, R. (2018) · Scientific Reports · doi:10.1038/s41598-018-28375-0 · Cited by 30
Metadata
- Authors
- Canright, G., & Engø-Monsen, K.
- Affiliations
- Telenor (Norway) (NO)
- Corresponding author
- Canright, Geoffrey
- ORCID
- Canright, Geoffrey
- Venue
- Science of Computer Programming
- Publisher
- Elsevier BV
- Published
- 2004-11
- Volume
- 53
- Issue
- 2
- Pages
- 195-214
- ISSN
- 0167-6423 (ISSN-L)
- OpenAlex
- W2034342292
- Cited by
- 51
- References
- 11
- Citations by year
- 2026: 1 · 2025: 1 · 2024: 4 · 2023: 1 · 2022: 8 · 2021: 4 · 2020: 3 · 2019: 2 · 2018: 2 · 2017: 2 · 2016: 3 · 2015: 1 · 2013: 3 · 2012: 2
- FWCI
- 2.05
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- Science of Computer Programming (publishedVersion)
- Funders
- European Commission
- Topics
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Graph Theory and Algorithms
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Graph theory and applications
- Keywords
- node roles, subclusters, eigenvector centrality, graph decomposition, height function, Gnutella, peer-to-peer networks, network security, undirected graphs
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
