{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T17:14:51Z","timestamp":1782234891241,"version":"3.54.5"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,10,1]],"date-time":"2023-10-01T00:00:00Z","timestamp":1696118400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Emerg. Top. Comput. Intell."],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1109\/tetci.2023.3249255","type":"journal-article","created":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T17:46:06Z","timestamp":1678729566000},"page":"1595-1604","source":"Crossref","is-referenced-by-count":12,"title":["Can Graph Neural Networks Go Deeper Without Over-Smoothing? Yes, With a Randomized Path Exploration!"],"prefix":"10.1109","volume":"7","author":[{"given":"Kushal","family":"Bose","sequence":"first","affiliation":[{"name":"Electronics and Communication Sciences Unit, Indian Statistical Institute, Kolkata, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6843-4508","authenticated-orcid":false,"given":"Swagatam","family":"Das","sequence":"additional","affiliation":[{"name":"Electronics and Communication Sciences Unit, Indian Statistical Institute, Kolkata, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","article-title":"Graph attention networks","author":"veli?kovi?","year":"0","journal-title":"Proc Int Conf Learn Representations (ICLR)"},{"key":"ref35","first-page":"16211","article-title":"Random walk graph neural networks","author":"nikolentzos","year":"0","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.3389\/fbioe.2020.00034"},{"key":"ref34","article-title":"GraphSAINT: Graph sampling based inductive learning method","author":"zeng","year":"2019"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref37","article-title":"A note on over-smoothing for graph neural networks","author":"cai","year":"2020"},{"key":"ref14","first-page":"1025","article-title":"Inductive representation learning on large graphs","author":"hamilton","year":"0","journal-title":"Proc 31st Int Conf Neural Inf Process Syst"},{"key":"ref36","article-title":"Preventing over-smoothing for hypergraph neural networks","author":"chen","year":"2022"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9414106"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i4.20316"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1186\/1756-0381-4-10"},{"key":"ref33","article-title":"SPAGAN: Shortest path graph attention network","author":"yang","year":"2021"},{"key":"ref10","first-page":"1263","article-title":"Neural message passing for quantum chemistry","author":"gilmer","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014424"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2693418"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2988458.2988485"},{"key":"ref17","article-title":"Graph neural networks exponentially lose expressive power for node classification","author":"oono","year":"0","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref39","first-page":"21834","article-title":"Dirichlet energy constrained learning for deep graph neural networks","volume":"34","author":"zhou","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"ref38","article-title":"Revisiting over-smoothing in deep GCNs","author":"yang","year":"2020"},{"key":"ref19","first-page":"13354","article-title":"Diffusion improves graph learning","volume":"32","author":"klicpera","year":"0","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref18","article-title":"Predict then propagate: Graph neural networks meet personalized pagerank","author":"klicpera","year":"0","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref24","article-title":"DROPEDGE: Towards deep graph convolutional networks on node classification","author":"rong","year":"0","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.576"},{"key":"ref23","first-page":"1","article-title":"Towards deeper graph neural networks with differentiable group normalization","author":"zhou","year":"0","journal-title":"Proc 34th Annu Conf Neural Inf Process Syst"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403076"},{"key":"ref26","first-page":"1725","article-title":"Simple and deep graph convolutional networks","author":"chen","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref48","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2014"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5747"},{"key":"ref47","article-title":"SIGN: Scalable inception graph neural networks","author":"frasca","year":"2020"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00936"},{"key":"ref42","article-title":"Pitfalls of graph neural network evaluation","author":"shchur","year":"2018"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref22","article-title":"Pairnorm: Tackling oversmoothing in GNNs","author":"zhao","year":"2019"},{"key":"ref44","article-title":"Fast graph representation learning with PyTorch geometric","author":"fey","year":"0"},{"key":"ref21","first-page":"5453","article-title":"Representation learning on graphs with jumping knowledge networks","author":"xu","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref43","article-title":"Geom-GCN: Geometric graph convolutional networks","author":"pei","year":"2020"},{"key":"ref28","article-title":"The PageRank citation ranking: Bringing order to the web","author":"page","year":"1999"},{"key":"ref27","first-page":"6861","article-title":"Simplifying graph convolutional networks","author":"wu","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref29","article-title":"Adaptive universal generalized PageRank graph neural network","author":"chien","year":"2020"},{"key":"ref8","first-page":"2224","article-title":"Convolutional networks on graphs for learning molecular fingerprints","author":"duvenaud","year":"0","journal-title":"Proc 28th Int Conf Neural Inf Process Syst"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"ref4","first-page":"40","article-title":"Revisiting semi-supervised learning with graph embeddings","author":"yang","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"ref6","first-page":"610","article-title":"NetGAN: Generating graphs via random walks","author":"bojchevski","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref5","article-title":"Semi-supervised classification with graph convolutional networks","author":"kipf","year":"0","journal-title":"Proc Int Conf Learn Representations (ICLR)"},{"key":"ref40","article-title":"Improving graph attention networks with large margin-based constraints","author":"wang","year":"2019"}],"container-title":["IEEE Transactions on Emerging Topics in Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7433297\/10261323\/10068275.pdf?arnumber=10068275","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,9]],"date-time":"2023-10-09T19:35:50Z","timestamp":1696880150000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10068275\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10]]},"references-count":48,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tetci.2023.3249255","relation":{},"ISSN":["2471-285X"],"issn-type":[{"value":"2471-285X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10]]}}}