{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,8]],"date-time":"2026-10-08T18:55:58Z","timestamp":1791485758896,"version":"4.3.4"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-2312396"],"award-info":[{"award-number":["CNS-2312396"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-2338512"],"award-info":[{"award-number":["CNS-2338512"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-2224054"],"award-info":[{"award-number":["CNS-2224054"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2220211"],"award-info":[{"award-number":["DMS-2220211"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3520903","type":"journal-article","created":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T19:24:31Z","timestamp":1734981871000},"page":"194804-194815","source":"Crossref","is-referenced-by-count":4,"title":["Information-Enhanced Graph Neural Network for Transcending Homophily Barriers"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7888-6898","authenticated-orcid":false,"given":"Xiao","family":"Liu","sequence":"first","affiliation":[{"name":"College of Information and Computer Sciences, University of Massachusetts Amherst, Amherst, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1946-7105","authenticated-orcid":false,"given":"Lijun","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Information and Computer Sciences, University of Massachusetts Amherst, Amherst, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9128-2231","authenticated-orcid":false,"given":"Hui","family":"Guan","sequence":"additional","affiliation":[{"name":"College of Information and Computer Sciences, University of Massachusetts Amherst, Amherst, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1609.02907"},{"key":"ref2","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Hamilton"},{"key":"ref3","article-title":"Graph attention networks","author":"Veli\u010dkovi\u0107","year":"2017","journal-title":"arXiv:1710.10903"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219947"},{"key":"ref5","article-title":"Predict then propagate: Graph neural networks meet personalized PageRank","author":"Gasteiger","year":"2018","journal-title":"arXiv:1810.05997"},{"key":"ref6","first-page":"5453","article-title":"Representation learning on graphs with jumping knowledge networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Xu"},{"key":"ref7","first-page":"6861","article-title":"Simplifying graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wu"},{"key":"ref8","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gilmer"},{"key":"ref9","article-title":"Relational inductive biases, deep learning, and graph networks","author":"Battaglia","year":"2018","journal-title":"arXiv:1806.01261"},{"key":"ref10","first-page":"20887","article-title":"Large scale learning on non-homophilous graphs: New benchmarks and strong simple methods","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Lim"},{"key":"ref11","first-page":"13242","article-title":"Finding global homophily in graph neural networks when meeting heterophily","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Li"},{"key":"ref12","article-title":"Twitch gamers: A dataset for evaluating proximity preserving and structural role-based node embeddings","author":"Rozemberczki","year":"2021","journal-title":"arXiv:2101.03091"},{"key":"ref13","first-page":"7793","article-title":"Beyond homophily in graph neural networks: Current limitations and effective designs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhu"},{"key":"ref14","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"},{"key":"ref15","article-title":"Adaptive universal generalized PageRank graph neural network","author":"Chien","year":"2020","journal-title":"arXiv:2006.07988"},{"key":"ref16","article-title":"Two sides of the same coin: Heterophily and oversmoothing in graph convolutional neural networks","author":"Yan","year":"2021","journal-title":"arXiv:2102.06462"},{"key":"ref17","first-page":"1362","article-title":"Revisiting heterophily for graph neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Luan"},{"key":"ref18","first-page":"14239","article-title":"BernNet: Learning arbitrary graph spectral filters via Bernstein approximation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"He"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482226"},{"key":"ref20","first-page":"2014","article-title":"Learning convolutional neural networks for graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Niepert"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.576"},{"key":"ref22","article-title":"How powerful are graph neural networks?","author":"Xu","year":"2018","journal-title":"arXiv:1810.00826"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3326362"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref25","first-page":"1725","article-title":"Simple and deep graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","volume":"1","author":"Chen"},{"key":"ref26","first-page":"6437","article-title":"Training graph neural networks with 1000 layers","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Li"},{"key":"ref27","first-page":"19665","article-title":"Decoupling the depth and scope of graph neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zeng"},{"key":"ref28","article-title":"Graph neural networks exponentially lose expressive power for node classification","author":"Oono","year":"2019","journal-title":"arXiv:1905.10947"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539374"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00936"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403076"},{"key":"ref32","article-title":"Geom-GCN: Geometric graph convolutional networks","author":"Pei","year":"2020","journal-title":"arXiv:2002.05287"},{"key":"ref33","article-title":"New benchmarks for learning on non-homophilous graphs","author":"Lim","year":"2021","journal-title":"arXiv:2104.01404"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-022-12710-7"},{"key":"ref35","article-title":"DARTS: Differentiable architecture search","author":"Liu","year":"2018","journal-title":"arXiv:1806.09055"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00186"},{"key":"ref37","article-title":"Adam: A method for stochastic optimization","author":"Kingma","year":"2014","journal-title":"arXiv:1412.6980"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref39","article-title":"Pitfalls of graph neural network evaluation","author":"Shchur","year":"2018","journal-title":"arXiv:1811.05868"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2011.12.021"},{"key":"ref41","first-page":"22118","article-title":"Open graph benchmark: Datasets for machine learning on graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hu"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1609\/icwsm.v15i1.18068"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/6287639\/10380310\/10810421-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10380310\/10810421.pdf?arnumber=10810421","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,14]],"date-time":"2025-01-14T20:04:08Z","timestamp":1736885048000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10810421\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3520903","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}