{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T22:56:45Z","timestamp":1776380205377,"version":"3.51.2"},"reference-count":37,"publisher":"Tsinghua University Press","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Big Data Min. Anal."],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.26599\/bdma.2023.9020019","type":"journal-article","created":{"date-parts":[[2023,12,25]],"date-time":"2023-12-25T20:35:44Z","timestamp":1703536544000},"page":"205-216","source":"Crossref","is-referenced-by-count":21,"title":["Limits of Depth: Over-Smoothing and Over-Squashing in GNNs"],"prefix":"10.26599","volume":"7","author":[{"given":"Aafaq Mohi","family":"ud din","sequence":"first","affiliation":[{"name":"National Institute of Technology Srinagar,Department of Computer Science and Engineering,Srinagar,India,190006"}]},{"given":"Shaima","family":"Qureshi","sequence":"additional","affiliation":[{"name":"National Institute of Technology Srinagar,Department of Computer Science and Engineering,Srinagar,India,190006"}]}],"member":"11138","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aiopen.2021.01.001"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.2021.3076021"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3406474"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2017.2693418"},{"key":"ref5","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. 34th Int. Conf. Machine Learning, Sydney","author":"Gilmer"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-01587-8"},{"key":"ref7","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. 5th Int. Conf. Learning Representations","author":"Kipf"},{"key":"ref8","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. 31st Int. Conf. Neural Information Processing Systems","author":"Hamilton"},{"key":"ref9","article-title":"Graph attention networks","author":"Velickovic","year":"2017","journal-title":"arXiv preprint"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143968"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5747"},{"key":"ref13","article-title":"Continuous graph neural networks","volume-title":"Proc. 37th Int. Conf. Machine Learning","author":"Xhonneux"},{"key":"ref14","volume-title":"On the bottleneck of graph neural networks and its practical implications","author":"Alon","year":"2020"},{"key":"ref15","volume-title":"Improving breadth-wise backpropagation in graph neural networks helps learning long-range dependencies","author":"Lukovnikov","year":"2021"},{"key":"ref16","first-page":"40","article-title":"Revisiting semi-supervised learning with graph embeddings","volume-title":"Proc. 33rd Int. Conf. Machine Learning","author":"Yang"},{"key":"ref17","author":"Hu","journal-title":"OGB-LSC: A large-scale challenge for machine learning on graphs"},{"key":"ref18","article-title":"Fast graph representation learning with PyTorch geometric","author":"Fey","year":"2019","journal-title":"arXiv preprint"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.aiopen.2021.01.001"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2981333"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3214832"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3137605"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2020.3015157"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.isprsjprs.2018.10.006"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3183586"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3181116"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3127346"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2018.2878958"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.isprsjprs.2019.09.008"},{"key":"ref31","article-title":"Graph-MLP: Node classification without message passing in graph","author":"Hu","year":"2021","journal-title":"arXiv preprint"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010933404324"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1080\/1206212X.2022.2133805"},{"key":"ref34","author":"Barcelo","year":"2020","journal-title":"The logical expressiveness of graph neural networks"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009953814988"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/276675.276685"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"}],"container-title":["Big Data Mining and Analytics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8254253\/10372994\/10372997.pdf?arnumber=10372997","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T20:10:49Z","timestamp":1743711049000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10372997\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3]]},"references-count":37,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.26599\/bdma.2023.9020019","relation":{},"ISSN":["2096-0654","2097-406X"],"issn-type":[{"value":"2096-0654","type":"print"},{"value":"2097-406X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3]]}}}