The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
A Comprehensive Review of the Oversmoothing in Graph Neural Networks
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.
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?
In the citing paper
“which can result in over-smoothing [5], where the features of nodes converge to similar values after multiple rounds of neighborhood aggregation.”
From Temporal Graph Attention Network for Spatio-Temporal Feature Extraction in Research Topic Trend Prediction (2025) · cites this paper as [5]
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
Collective Classification in Network Data
Sen, P., Namata, G., Bilgic, M., Getoor, L., Gallagher, B., & Eliassi‐Rad, T. (2008) · AI Magazine · doi:10.1609/aimag.v29i3.2157 · Cited by 3,293
Knowledge vault: a web-scale approach to probabilistic knowledge fusion
Dong, X., Gabrilovich, E., Heitz, G., Horn, W., Lao, N., Murphy, K., Strohmann, T., Sun, S., & Zhang, W. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623623 · Cited by 1,533
Debnath, A. K., Lopez de Compadre, R. L., Debnath, G., Shusterman, A. J., & Hansch, C. (1991) · Journal of Medicinal Chemistry · doi:10.1021/jm00106a046 · Cited by 868
Relational learning via latent social dimensions
Tang, L., & Liu, H. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557109 · Cited by 799
Research works printed but not linked: 52
- Bhagat, S., Cormode, G.: Node classification in social networks. In: Proceedings of the 2011 SIAM International Conference on Data Mining, pp. 201–212 (2011) · DOI · Paper page
- Chen, D., Lin, Y., Li, W., Li, P., Zhou, J., Sun, X.: Measuring and relieving the over-smoothing problem for graph neural networks from the topological view. In: The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, IAAI 2020, The Tenth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2020, New York, NY, USA, February 7–12, 2020, pp. 3438–3445. AAAI Press (2020). https://ojs.aaai.org/index.php/AAAI/article/view/5747 · DOI · Paper page
- Chen, H., Li, Y.: Node-smoothness based adaptive initial residual deep graph convolutional network (2022). Available at SSRN 4254779
- Chen, J., Zhong, M., Li, J., Wang, D., Qian, T., Tu, H.: Effective deep attributed network representation learning with topology adapted smoothing. IEEE Trans. Cybern. 52(7), 5935–5946 (2022). https://doi.org/10.1109/TCYB.2021.3064092 · DOI
- Chen, M., Wei, Z., Huang, Z., Ding, B., Li, Y.: Simple and deep graph convolutional networks. In: Proceedings of the 37th International Conference on Machine Learning, ICML 2020, 13–18 July 2020, Virtual Event. Proceedings of Machine Learning Research, vol. 119, pp. 1725–1735. PMLR (2020). http://proceedings.mlr.press/v119/chen20v.html
- Chen, Y., Li, Z., Xiao, X., Zhang, K., Lu, H.: Simple and effective graph convolutional networks with graph attention convolution. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 11459–11466 (2020)
- Ding, H., Takigawa, I., Mamitsuka, H., Zhu, S.: Similarity-based machine learning methods for predicting drug-target interactions: a brief review. Brief. Bioinform. 15(5), 734–747 (2014) · DOI · Paper page
- Do, T.H., Nguyen, D.M., Bekoulis, G., Munteanu, A., Deligiannis, N.: Graph convolutional neural networks with node transition probability-based message passing and DropNode regularization. Expert Syst. Appl. 174, 114711 (2021). https://doi.org/10.1016/j.eswa.2021.114711 · DOI
- Fang, T., Xiao, Z., Wang, C., Xu, J., Yang, X., Yang, Y.: DropMessage: unifying random dropping for graph neural networks. CoRR abs/2204.10037 (2022). https://doi.org/10.48550/arXiv.2204.10037 · arXiv · doi:10.48550/arxiv.2204.10037
- Giles, C.L., Bollacker, K.D., Lawrence, S.: CiteSeer: an automatic citation indexing system. In: Proceedings of the 3rd ACM Conference on Digital Libraries, pp. 89–98. ACM (1998) · DOI · Paper page
- Guo, H., Sun, S.: SoftEdge: regularizing graph classification with random soft edges. CoRR abs/2204.10390 (2022). https://doi.org/10.48550/arXiv.2204.10390 · DOI
- Hamilton, W.L., Ying, R., Leskovec, J.: Inductive representation learning on large graphs. In: Advances in Neural Information Processing Systems, pp. 1024–1034 (2017)
- Hodosh, M., Young, P., Hockenmaier, J.: Framing image description as a ranking task: data, models and evaluation metrics. J. Artif. Intell. Res. 47, 853–899 (2013) · DOI · Paper page
- Hu, W., et al.: Open graph benchmark: datasets for machine learning on graphs. arXiv preprint arXiv:2005.00687 (2021) · arXiv
- Jin, W., Barz, B., Li, M.: Graphdiff: differential privacy for graph neural networks via topology change. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 11024–11031 (2020)
- Klicpera, J., Bojchevski, A., Günnemann, S.: Diffusion improves graph learning. In: Proceedings of the 36th International Conference on Machine Learning (ICML), vol. 97, pp. 3651–3661 (2019)
- Koishekenov, Y.: Reducing over-smoothing in graph neural networks using relational embeddings. CoRR abs/2301.02924 (2023). https://doi.org/10.48550/arXiv.2301.02924 · arXiv · doi:10.48550/arxiv.2301.02924
- Li, H., et al.: DeeperGCN: all you need to train deeper GCNs. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 3332–3342. ACM (2020)
- Li, Q., Han, Z., Wu, X.: Deeper insights into graph convolutional networks for semi-supervised learning. CoRR abs/1801.07606 (2018). http://arxiv.org/abs/1801.07606 · arXiv
- Luo, D., et al.: Learning to drop: robust graph neural network via topological denoising. In: Lewin-Eytan, L., Carmel, D., Yom-Tov, E., Agichtein, E., Gabrilovich, E. (eds.) WSDM 2021, The Fourteenth ACM International Conference on Web Search and Data Mining, Virtual Event, Israel, March 8–12, 2021, pp. 779–787. ACM (2021). https://doi.org/10.1145/3437963.3441734 · DOI · Paper page
- Mai, S., Zheng, S., Sun, Y., Zeng, Y., Yang, Y., Hu, H.: Dynamic graph dropout for subgraph-based relation prediction. Knowl. Based Syst. 250, 109172 (2022). https://doi.org/10.1016/j.knosys.2022.109172 · DOI
- Papp, P.A., Martinkus, K., Faber, L., Wattenhofer, R.: DropGNN: random dropouts increase the expressiveness of graph neural networks. In: Ranzato, M., Beygelzimer, A., Dauphin, Y.N., Liang, P., Vaughan, J.W. (eds.) Advances in Neural Information Processing Systems: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021(December), pp. 6–14, 2021. virtual, vol. 34, pp. 21997–22009 (2021). https://proceedings.neurips.cc/paper/2021/hash/b8b2926bd27d4307569ad119b6025f94-Abstract.html
- Perozzi, B., Al-Rfou, R., Skiena, S.: DeepWalk: online learning of social representations. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 701–710 (2014) · DOI · Paper page
- Rong, Y., Huang, W., Xu, T., Huang, J.: DropEdge: towards deep graph convolutional networks on node classification. In: 8th International Conference on Learning Representations, ICLR 2020, Addis Ababa, Ethiopia, April 26–30, 2020. OpenReview.net (2020). https://openreview.net/forum?id=Hkx1qkrKPr
- Rusch, T.K., Bronstein, M.M., Mishra, S.: A survey on oversmoothing in graph neural networks. CoRR abs/2303.10993 (2023). https://doi.org/10.48550/arXiv.2303.10993 · DOI
- Sayers, E.W., et al.: PubBed: a resource for curated biomedical literature. Nucleic Acids Res. 39(Database issue), D1268–D1271 (2011)
- Shervashidze, N., Schweitzer, P., van Leeuwen, E.J., Mehlhorn, K., Borgwardt, K.M.: Weisfeiler-Lehman graph kernels. J. Mach. Learn. Res. 12(Sep), 2539–2561 (2011)
- Spinelli, I., Scardapane, S., Hussain, A., Uncini, A.: FairDrop: biased edge dropout for enhancing fairness in graph representation learning. IEEE Trans. Artif. Intell. 3(3), 344–354 (2022). https://doi.org/10.1109/TAI.2021.3133818 · DOI
- Stark, C., Breitkreutz, B.J., Reguly, T., Boucher, L., Breitkreutz, A., Tyers, M.: BioGRID: a general repository for interaction datasets. Nucleic Acids Res. 34(Database issue), D535–D539 (2006) · DOI · Paper page
- Sun, F.: Over-smoothing effect of graph convolutional networks. CoRR abs/2201.12830 (2022). https://arxiv.org/abs/2201.12830 · arXiv
- Tan, J., Chang, S., Zettlemoyer, L.S.: Linguistically informed character-level language models for unsupervised named entity recognition. arXiv preprint arXiv:1505.05008 (2015) · arXiv
- Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., Mei, Q.: Line: large-scale information network embedding. In: Proceedings of the 24th International Conference on World Wide Web, pp. 1067–1077 (2015) · DOI · Paper page
- Toivonen, H., Kaski, S., Nikkilä, J., Vähänikkilä, M., Hautaniemi, S.: Statistical evaluation of term occurrences for discovering differentially expressed genes. J. Comput. Biol. 10(4), 447–464 (2003)
- Veličković, P., Cucurull, G., Casanova, A., Romero, A., Lio, P., Bengio, Y.: Graph attention networks. In: International Conference on Learning Representations (2018)
- Wale, N., Karypis, G.: Comparison of descriptor spaces for chemical compound retrieval and classification. Knowl. Inf. Syst. 14(3), 347–375 (2008) · DOI · Paper page
- Wang, H., Wang, J., Wang, J., Zhao, M., Zhang, W.: Knowledge-aware graph neural networks with label smoothness regularization for recommender systems. In: Proceedings of the 28th ACM International Conference on Information and Knowledge Management, pp. 1221–1230 (2019) · DOI · Paper page
- Wu, F., Zhang, T., Souza, A., Fifty, C., Yu, T., Weinberger, K.Q.: Simplifying graph convolutional networks. In: Proceedings of the 36th International Conference on Machine Learning, pp. 6861–6871 (2019)
- Wu, Q., Zhao, W., Li, Z., Wipf, D., Yan, J.: NodeFormer: a scalable graph structure learning transformer for node classification. CoRR abs/2306.08385 (2023). https://doi.org/10.48550/arXiv.2306.08385 · DOI
- Xu, K., Li, C., Tian, Y., Sonobe, T., Kawarabayashi, K.i., Jegelka, S.: Representation learning on graphs with jumping knowledge networks. In: Proceedings of the 35th International Conference on Machine Learning (ICML), vol. 80, pp. 5421–5430 (2018)
- Xu, K., Li, C., Tian, Y., Sonobe, T., Kawarabayashi, K.i., Jegelka, S.: How powerful are graph neural networks? In: International Conference on Learning Representations (2019)
- Yan, Y., Hashemi, M., Swersky, K., Yang, Y., Koutra, D.: Two sides of the same coin: heterophily and oversmoothing in graph convolutional neural networks. In: Zhu, X., Ranka, S., Thai, M.T., Washio, T., Wu, X. (eds.) IEEE International Conference on Data Mining, ICDM 2022, Orlando, FL, USA, November 28 - Dec. 1, 2022, pp. 1287–1292. IEEE (2022). https://doi.org/10.1109/ICDM54844.2022.00169 · DOI · Paper page
- Yanardag, P., Vishwanathan, S.: Deep graph kernels. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 1365–1374 (2015) · DOI · Paper page
- Ye, Y., Ji, S.: Sparse graph attention networks. IEEE Trans. Knowl. Data Eng. 35(1), 905–916 (2023)
- Ying, R., He, R., Chen, K., Eksombatchai, P., Hamilton, W.L., Leskovec, J.: Graph convolutional neural networks for web-scale recommender systems. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (2018) · DOI · Paper page
- Zeng, S., Yang, J., Liu, W., Liu, Q.: GraphSAINT: graph sampling based inductive learning method. In: International Conference on Learning Representations (ICLR) (2020)
- Zhang, S., Zhu, F., Yan, J., Zhao, R., Yang, X.: DOTIN: dropping task-irrelevant nodes for GNNs. CoRR abs/2204.13429 (2022). https://doi.org/10.48550/arXiv.2204.13429 · DOI
- Zhang, S., Du, L., Li, F., Yu, G., Chen, M.: Propagate deeper and adaptive graph convolutional networks. In: ICLR (2023)
- Zhang, X., Li, Y., Zhuang, Y., Zhou, Q.: Towards deeper graph neural networks with differentiable group normalization. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 4609–4616 (2019)
- Zheng, C., et al.: Robust graph representation learning via neural sparsification. In: Proceedings of the 37th International Conference on Machine Learning, ICML 2020, 13–18 July 2020, Virtual Event. Proceedings of Machine Learning Research, vol. 119, pp. 11458–11468. PMLR (2020). http://proceedings.mlr.press/v119/zheng20d.html
- Zhou, X., Wu, O.: Drop “noise” edge: an approximation of the Bayesian GNNs. In: Wallraven, C., Liu, Q., Nagahara, H. (eds.) Pattern Recognition - 6th Asian Conference, ACPR 2021, Jeju Island, South Korea, November 9–12, 2021, Revised Selected Papers, Part II. Lecture Notes in Computer Science, vol. 13189, pp. 59–72. Springer (2021). https://doi.org/10.1007/978-3-031-02444-3_5 · doi:10.1007/978-3-031-02444-3_5
- Zhu, J., Mao, G., Jiang, C.: DII-GCN: dropedge based deep graph convolutional networks. Symmetry 14(4), 798 (2022). https://doi.org/10.3390/sym14040798 · DOI
- Zou, X., Li, K., Chen, C., Yang, X., Wei, W., Li, K.: DGSLN: differentiable graph structure learning neural network for robust graph representations. Inf. Sci. 626, 94–113 (2023). https://doi.org/10.1016/j.ins.2023.01.059 · DOI
Cited by
Guo, Z., Lu, M., & Han, J. (2025) · Mathematics · doi:10.3390/math13050686 · Cited by 11
Metadata
- Authors
- Zhang, X., Xu, Y., He, W., Guo, W., & Cui, L.
- Venue
- Communications in Computer and Information Science
- Publisher
- Springer Nature Singapore
- Published
- 2024
- Pages
- 451-465
- ISSN
- 1865-0929
- 1865-0937
- Cited by
- 20
- References
- 4
- Language
- en
- Licence
- www.springernature.com/gp/researchers/text-and-data-mining (tdm)
- www.springernature.com/gp/researchers/text-and-data-mining (vor)
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: A Comprehensive Review of the Oversmoothing in Graph Neural Networks. https://app.cochat.ai/papers/10.1007/978-981-99-9637-7_33
- The paper
- Zhang, X., Xu, Y., He, W., Guo, W., & Cui, L. (2024). A Comprehensive Review of the Oversmoothing in Graph Neural Networks. Communications in Computer and Information Science. https://doi.org/10.1007/978-981-99-9637-7_33
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.