{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T18:48:54Z","timestamp":1755802134714,"version":"3.44.0"},"reference-count":52,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T00:00:00Z","timestamp":1747612800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T00:00:00Z","timestamp":1747612800000},"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":[],"published-print":{"date-parts":[[2025,5,19]]},"DOI":"10.1109\/icde65448.2025.00147","type":"proceedings-article","created":{"date-parts":[[2025,8,20]],"date-time":"2025-08-20T18:28:25Z","timestamp":1755714505000},"page":"1924-1937","source":"Crossref","is-referenced-by-count":0,"title":["SIGMA: An Efficient Heterophilous Graph Neural Network with Fast Global Aggregation"],"prefix":"10.1109","author":[{"given":"Haoyu","family":"Liu","sequence":"first","affiliation":[{"name":"College of Computing and Data Science, Nanyang Technological University"}]},{"given":"Ningyi","family":"Liao","sequence":"additional","affiliation":[{"name":"College of Computing and Data Science, Nanyang Technological University"}]},{"given":"Siqiang","family":"Luo","sequence":"additional","affiliation":[{"name":"College of Computing and Data Science, Nanyang Technological University"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Semi -supervised classification with graph convolutional networks","volume-title":"J. International Conference on Learning Representations (ICLR 2017)","author":"Welling","year":"2016"},{"key":"ref2","volume":"30","author":"Hamilton","year":"2017","journal-title":"Inductive representation learning on large graphs"},{"key":"ref3","article-title":"Learning-based approaches for graph problems: a survey","author":"Yow","year":"2022","journal-title":"arXiv preprint"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/338"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412707"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467243"},{"key":"ref7","first-page":"14556","article-title":"Scalable graph neural networks via bidirectional propagation","volume":"33","author":"Chen","year":"2020","journal-title":"Advances in neural information processing systems"},{"key":"ref8","article-title":"Graph attention networks","author":"Velickovic","year":"2017","journal-title":"ar Xiv preprint"},{"key":"ref9","article-title":"Predict then propagate: Graph neural networks meet personal-ized pagerank","volume-title":"International Conference on Learning Representations","author":"Klicpera","year":"2018"},{"key":"ref10","first-page":"7793","article-title":"Beyond homophily in graph neural networks: Current limitations and effective designs","volume":"33","author":"Zhu","year":"2020","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref11","first-page":"21","article-title":"Mixhop: Higher-order graph convolutional architectures via sparsified neighborhood mixing","volume-title":"international conference on machine learning. PMLR","author":"Abu-EI-Haija","year":"2019"},{"key":"ref12","article-title":"Geom-gcn: Geometric graph convolutional networks","volume-title":"International Conference on Learning Representations","author":"Pei","year":"2020"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i8.20864"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3134200"},{"key":"ref15","first-page":"10654","article-title":"Universal graph convolutional networks","volume":"34","author":"Jin","year":"2021","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref16","article-title":"Finding global homophily in graph neural networks when meeting heterophily","volume-title":"International Con-terence on Machine Learning","author":"Li","year":"2022"},{"key":"ref17","first-page":"20887","article-title":"Large scale learning on non-homophilous graphs: New benchmarks and strong simple methods","volume":"34","author":"Lim","year":"2021","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467373"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403086"},{"key":"ref21","article-title":"Two sides of the same coin: Heterophily and over-smoothing in graph convolutional neural networks","author":"Yan","year":"2021","journal-title":"ar Xiv preprint"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512069"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389781"},{"key":"ref24","first-page":"5453","article-title":"Representation learning on graphs with jumping knowledge networks","volume-title":"Proceedings of the 35th International Conference on Machine Learning, ser. Proceedings of Machine Learning Research","volume":"80","author":"Xu"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2612662"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00056"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2023.3271425"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2024\/249"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330925"},{"key":"ref30","article-title":"Adaptive universal generalized pagerank graph neural network","volume-title":"International Conference on Learning Representations","author":"Chien","year":"2021"},{"key":"ref31","article-title":"Dif-fusion Improves Graph Learning","author":"Gasteiger","year":"2019","journal-title":"32nd Advances in Neural Information Processing Systems"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403296"},{"key":"ref33","first-page":"28877","article-title":"Do transformers really perform badly for graph representation?","volume":"34","author":"Ying","year":"2021","journal-title":"Advances in neural information processing systems"},{"key":"ref34","first-page":"1725","article-title":"Simple and deep graph convolutional networks","volume-title":"International Conference on Machine Learning. PMLR","author":"Chen","year":"2020"},{"issue":"6","key":"ref35","first-page":"6861","article-title":"Simplifying graph convolutional networks","volume-title":"Proceedings of the 36th International Conference on Machine Learning","volume":"97","author":"Wu","year":"2019"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512201"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i4.20340"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.03.057"},{"key":"ref39","first-page":"10909","article-title":"Predicting global label relationship matrix for graph neural networks under heterophily","volume":"36","author":"Liang","year":"2023","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551866"},{"key":"ref41","article-title":"LD2: Scalable heterophilous graph neural network with decoupled em-bedding","volume":"36","author":"Liao","year":"2023","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"3","key":"ref42","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1007\/s00778-023-00829-6","article-title":"Scalable decoupling graph neural networks with feature-oriented optimization","volume":"33","author":"Liao","year":"2024","journal-title":"The VLDB Journal"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.14778\/3665844.3665855"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482317"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3637528.3671777"},{"key":"ref46","article-title":"Is heterophily a real nightmare for graph neural networks to do node classification?","author":"Luan","year":"2021","journal-title":"ar Xiv preprint"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnab014"},{"key":"ref48","article-title":"Deep gaussian embedding of graphs: Unsupervised inductive learning via ranking","volume-title":"International Conference on Learning Representations","author":"Bojchevski","year":"2018"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref50","first-page":"1","article-title":"Query-driven active surveying for collective classification","volume-title":"10th International Workshop on Mining and Learning with Graphs","volume":"8","author":"Namata","year":"2012"},{"volume-title":"On the use of arxiv as a dataset","year":"2019","author":"Clement","key":"ref51"},{"volume-title":"Snap datasets: Stanford large network dataset collection","year":"2014","author":"Leskovec","key":"ref52"}],"event":{"name":"2025 IEEE 41st International Conference on Data Engineering (ICDE)","start":{"date-parts":[[2025,5,19]]},"location":"Hong Kong, Hong Kong","end":{"date-parts":[[2025,5,23]]}},"container-title":["2025 IEEE 41st International Conference on Data Engineering (ICDE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11112833\/11112834\/11113040.pdf?arnumber=11113040","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T05:16:34Z","timestamp":1755753394000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11113040\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,19]]},"references-count":52,"URL":"https:\/\/doi.org\/10.1109\/icde65448.2025.00147","relation":{},"subject":[],"published":{"date-parts":[[2025,5,19]]}}}