Network-Driven Reputation in Online Scientific Communities
Open accessThe DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
The ever-increasing quantity and complexity of scientific production have made it difficult for researchers to keep track of advances in their own fields. This, together with growing popularity of online scientific communities, calls for the development of effective information filtering tools. We propose here an algorithm which simultaneously computes reputation of users and fitness of papers in a bipartite network representing an online scientific community. Evaluation on artificially-generated data and real data from the Econophysics Forum is used to determine the method's best-performing variants. We show that when the input data is extended to a multilayer network including users, papers and authors and the algorithm is correspondingly modified, the resulting performance improves on multiple levels. In particular, top papers have higher citation count and top authors have higher h-index than top papers and top authors chosen by other algorithms. We finally show that our algorithm is robust against persistent authors (spammers) which makes the method readily applicable to the existing online scientific communities.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
A survey of trust and reputation systems for online service provision
Jøsang, A., Ismail, R., & Boyd, C. (2007) · Decision Support Systems · doi:10.1016/j.dss.2005.05.019 · Cited by 3,330
Resnick, P., Kuwabara, K., Zeckhauser, R., & Friedman, E. (2000) · Communications of the ACM · doi:10.1145/355112.355122 · Cited by 2,190
Mathematical Formulation of Multilayer Networks
De Domenico, M., Solé-Ribalta, A., Cozzo, E., Kivelä, M., Moreno, Y., Porter, M. A., Gómez, S., & Arenas, A. (2013) · Physical Review X · doi:10.1103/physrevx.3.041022 · Cited by 930 · cited 1×
“More precisely, the algorithm effectively acts on a multilayer network [20] consisting of two bipartite components: user-item and item-author network (see Figure 1 for an illustration).”
Universality of citation distributions: Toward an objective measure of scientific impact
Radicchi, F., Fortunato, S., & Castellano, C. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0806977105 · Cited by 828 · cited 1×
“Science is not a monolithic movement, but rather a complex enterprise divided in a multitude of fields and subfields, many of which enjoy rapidly increasing levels of activity [1, 2].”
BackgroundGilbert, N. (2008) · doi:10.4135/9781412983259 · Cited by 692
Finding scientific gems with Google’s PageRank algorithm
Chen, P., Xie, H., Maslov, S., & Redner, S. (2007) · Journal of Informetrics · doi:10.1016/j.joi.2006.06.001 · Cited by 483
Acuna, D. E., Allesina, S., & Kording, K. P. (2012) · Nature · doi:10.1038/489201a · Cited by 249
Cited by
Vital nodes identification in complex networks
Lü, L., Chen, D., Ren, X.-L., Zhang, Q.-M., Zhang, Y.-C., & Zhou, T. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.06.007 · Cited by 1,183
Topic choice contributes to the lower rate of NIH awards to African-American/black scientists
Hoppe, T. A., Litovitz, A., Willis, K. A., Meseroll, R. A., Perkins, M. J., Hutchins, B. I., Davis, A. F., Lauer, M. S., Valantine, H. A., Anderson, J. M., et al. (2019) · Science Advances · doi:10.1126/sciadv.aaw7238 · Cited by 625
Hutchins, B. I., Yuan, X., Anderson, J. M., & Santangelo, G. M. (2016) · PLoS Biology · doi:10.1371/journal.pbio.1002541 · Cited by 500
“Consistent with this conclusion, a different group of authors has shown that including a “reputation” variable enables an algorithm to better predict which papers in the interdisciplinary field of econophysics will be the most highly cited [67].”
ResultThe science of science: From the perspective of complex systems
Zeng, A., Shen, Z., Zhou, J., Wu, J., Fan, Y., Wang, Y., & Stanley, H. E. (2017) · Physics Reports · doi:10.1016/j.physrep.2017.10.001 · Cited by 410
Liquid-based three-dimensional tumor models for cancer research and drug discovery
Ham, S. L., Joshi, R., Thakuri, P. S., & Tavana, H. (2016) · Experimental Biology and Medicine · doi:10.1177/1535370216643772 · Cited by 91
Metadata
- Authors
- Liao, H., Xiao, R., Cimini, G., & Medo, M.
- Venue
- PLoS ONE
- Publisher
- Public Library of Science (PLoS)
- Published
- 2014-12-02
- Volume
- 9
- Issue
- 12
- Pages
- e112022
- ISSN
- 1932-6203 (ISSN-L)
- OpenAlex
- W1810636528
- Cited by
- 58
- References
- 7
- FWCI
- 6.37
- Type
- journal article
- Language
- en
- Open access
- gold
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Network-Driven Reputation in Online Scientific Communities. https://app.cochat.ai/papers/10.1371/journal.pone.0112022
- The paper
- Liao, H., Xiao, R., Cimini, G., & Medo, M. (2014). Network-Driven Reputation in Online Scientific Communities. PLoS ONE. https://doi.org/10.1371/journal.pone.0112022
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.