{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T19:01:23Z","timestamp":1764788483005,"version":"3.46.0"},"reference-count":65,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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. Netw. Sci. Eng."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/tnse.2025.3609971","type":"journal-article","created":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T17:38:43Z","timestamp":1757957923000},"page":"2077-2092","source":"Crossref","is-referenced-by-count":0,"title":["Enhancing Recommendation Performance Using Attribute-Aware Message-Passing and Augmentation GCN"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9462-3983","authenticated-orcid":false,"given":"Yan","family":"Wang","sequence":"first","affiliation":[{"name":"School of Computer Science and Cyber Engineering, Guangzhou University, Guangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-7917-8780","authenticated-orcid":false,"given":"Yifan","family":"Ren","sequence":"additional","affiliation":[{"name":"School of Computer Science and Cyber Engineering, Guangzhou University, Guangzhou, China"}]},{"given":"Jinting","family":"Nie","sequence":"additional","affiliation":[{"name":"GuangZhou City Construction College, Guangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5224-4048","authenticated-orcid":false,"given":"Keqin","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Computer Science, State University of New York, New Paltz, NY, USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2959100.2959190"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372071"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72079-9_9"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2008.4634046"},{"key":"ref6","first-page":"1257","article-title":"Probabilistic matrix factorization","volume-title":"Proc. 21st Int. Conf. Neural Inf. Process. Syst.","author":"Mnih","year":"2007"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1345448.1345465"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052569"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3343031.3350953"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2835776.2835837"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/447"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3209991"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487589"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2022.3224028"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/GWS.2018.8686513"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3185994"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-97-2650-9_3"},{"key":"ref18","article-title":"KellmRec: Knowledge-enhanced large language models for recommendation","volume":"abs\/2403.06642","author":"Luo","year":"2024","journal-title":"CoRR"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401063"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3040772"},{"key":"ref21","article-title":"Graph convolutional matrix completion","author":"Berg","year":"2018","journal-title":"KDD\u201918 Deep Learn. Day"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330989"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331267"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i01.5330"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449986"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531985"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482291"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2959100.2959185"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/350"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.134"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2003.1167344"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/963770.963776"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5747"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313488"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331214"},{"key":"ref36","article-title":"NGAT4REC: Neighbor-aware graph attention network for recommendation","volume":"abs\/2010.12256","author":"Song","year":"2020","journal-title":"CoRR"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2023.3258427"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.3301346"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403170"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462862"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512104"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583229"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3677377"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3616855.3635853"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2025.3551923"},{"key":"ref46","first-page":"2027","article-title":"DGR: A general graph desmoothing framework for recommendation via global and local perspectives","volume-title":"Proc. 33rd Int. Joint Conf. Artif. Intell.","author":"Ding","year":"2024"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2024.111910"},{"key":"ref48","article-title":"DropEdge: Towards deep graph convolutional networks on node classification","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Rong","year":"2020"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3288484"},{"key":"ref50","first-page":"21","article-title":"MixHop: Higher-order graph convolutional architectures via sparsified neighborhood mixing","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Abu-El-Haija","year":"2019"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467408"},{"key":"ref52","article-title":"Residual connections and normalization can provably prevent oversmoothing in graph neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Scholkemper","year":"2025"},{"article-title":"Residual connections provably mitigate oversmoothing in graph neural networks","year":"2025","author":"Chen","key":"ref53"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.52202\/079017-1526"},{"key":"ref55","first-page":"17","article-title":"Graph neural networks (with proper weights) can escape oversmoothing","volume-title":"Proc. 16th Asian Conf. Mach. Learn.","volume":"260","author":"Zhuo","year":"2025"},{"key":"ref56","first-page":"380","article-title":"Generalized personalized pagerank with graph convolutional networks for recommendation","volume-title":"Proc. ACM Int. Conf. Theory Inf. Retrieval","author":"Wayama","year":"2025"},{"key":"ref57","first-page":"10348","article-title":"Spectral graph pruning against over-squashing and over-smoothing","volume-title":"Adv. Neural Inf. Process. Syst.","author":"Jamadandi","year":"2024"},{"key":"ref58","article-title":"Rectier nonlinearities improve neural network acoustic models","volume-title":"Proc. 30th Int. Conf. Mach. Learn.","volume":"28","author":"Maas","year":"2013"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/3240323.3240381"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/3539597.3570451"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1205.2618"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/3687481"},{"key":"ref63","article-title":"Adam: A method for stochastic optimization","volume":"abs\/1412.6980","author":"Kingma","year":"2014","journal-title":"CoRR"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482291"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1145\/2043932.2044016"}],"container-title":["IEEE Transactions on Network Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6488902\/11264281\/11164169.pdf?arnumber=11164169","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T18:43:49Z","timestamp":1764787429000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11164169\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":65,"URL":"https:\/\/doi.org\/10.1109\/tnse.2025.3609971","relation":{},"ISSN":["2327-4697","2334-329X"],"issn-type":[{"type":"electronic","value":"2327-4697"},{"type":"electronic","value":"2334-329X"}],"subject":[],"published":{"date-parts":[[2026]]}}}