{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T15:54:21Z","timestamp":1774626861358,"version":"3.50.1"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2023ZYGXZR023"],"award-info":[{"award-number":["2023ZYGXZR023"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100021171","name":"Basic and Applied Basic Research Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2024A1515010220"],"award-info":[{"award-number":["2024A1515010220"]}],"id":[{"id":"10.13039\/501100021171","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Postdoctoral Fellowship Program of CPSF","award":["GZC20230841"],"award-info":[{"award-number":["GZC20230841"]}]},{"name":"Basic research of Shenzhen Science and Technology Plan","award":["JCYJ20210324123802006"],"award-info":[{"award-number":["JCYJ20210324123802006"]}]},{"name":"Sponsored by CCF-Phytium Fund"},{"name":"Sponsored by CAAI-MindSpore Open Fund"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Emerg. Top. Comput. Intell."],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1109\/tetci.2024.3420692","type":"journal-article","created":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T13:28:34Z","timestamp":1720445314000},"page":"889-903","source":"Crossref","is-referenced-by-count":3,"title":["Efficient Message Passing Algorithm and Architecture Co-Design for Graph Neural Networks"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5823-6345","authenticated-orcid":false,"given":"Xiaofeng","family":"Zou","sequence":"first","affiliation":[{"name":"School of Future Technology, South China University of Technology, Guangzhou, Guangdong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1389-0148","authenticated-orcid":false,"given":"Cen","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Future Technology, South China University of Technology, Guangzhou, Guangdong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-6301-7843","authenticated-orcid":false,"given":"Luochuan","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Future Technology, South China University of Technology, Guangzhou, Guangdong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengyang","family":"Li","sequence":"additional","affiliation":[{"name":"School of Future Technology, South China University of Technology, Guangzhou, Guangdong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4675-7055","authenticated-orcid":false,"given":"Joey Tianyi","family":"Zhou","sequence":"additional","affiliation":[{"name":"Institute of High Performance Computing, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7566-2995","authenticated-orcid":false,"given":"Wei","family":"Wei","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Xi'an University of Technology, Xi'an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2635-7716","authenticated-orcid":false,"given":"Kenli","family":"Li","sequence":"additional","affiliation":[{"name":"College of Information Science and Engineering, Hunan University, Changsha, Hunan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2981333"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2019.2897815"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33017370"},{"key":"ref6","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf","year":"2017"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2021.3051021"},{"key":"ref9","first-page":"5165","article-title":"Link prediction based on graph neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Zhang","year":"2018"},{"key":"ref10","first-page":"443","article-title":"Neugraph: Parallel deep neural network computation on large graphs","volume-title":"Proc. Annu. Tech. Conf.","author":"Ma","year":"2019"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA47549.2020.00012"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2020.3014632"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3477141"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO50266.2020.00079"},{"key":"ref15","first-page":"1","article-title":"DropEdge: Towards deep graph convolutional networks on node classification","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Rong","year":"2020"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD51958.2021.9643511"},{"key":"ref17","first-page":"11458","article-title":"Robust graph representation learning via neural sparsification","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zheng","year":"2020"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441734"},{"key":"ref19","article-title":"Are all edges necessary? a unified framework for graph purification","author":"Gu","year":"2022"},{"key":"ref20","first-page":"1695","article-title":"A unified lottery ticket hypothesis for graph neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen"},{"key":"ref21","article-title":"Relational inductive biases, deep learning, and graph networks","author":"Battaglia","year":"2018"},{"key":"ref22","first-page":"1","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Velikovi","year":"2018"},{"key":"ref23","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hamilton","year":"2017"},{"key":"ref24","first-page":"1","article-title":"How powerful are graph neural networks?","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Xu","year":"2019"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref26","first-page":"2525","article-title":"Not all samples are created equal: Deep learning with importance sampling","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Katharopoulos","year":"2018"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403076"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00160"},{"key":"ref30","first-page":"17751","article-title":"Automatic channel pruning via clustering and swarm intelligence optimization for CNN","volume-title":"Appl. Intell.","author":"Chang","year":"2021"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/181"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/772"},{"key":"ref33","first-page":"6861","article-title":"Simplifying graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wu","year":"2019"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403296"},{"key":"ref35","first-page":"1","article-title":"Degree-quant: Quantization-aware training for graph neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Tailor","year":"2021"},{"key":"ref36","first-page":"1","article-title":"FastGCN: Fast learning with graph convolutional networks via importance sampling","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Chen","year":"2018"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330925"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA51647.2021.00070"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA53966.2022.00039"},{"key":"ref40","first-page":"2083","article-title":"Graph u-nets","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gao","year":"2019"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA51647.2021.00018"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18074.2021.9586298"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3079856.3080246"},{"key":"ref44","article-title":"Fast graph representation learning with pytorch geometric","author":"Fey","year":"2019"},{"key":"ref45","first-page":"1","article-title":"Cacti 5.1","author":"Thoziyoor","year":"2008"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/LCA.2015.2414456"}],"container-title":["IEEE Transactions on Emerging Topics in Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/7433297\/10850886\/10589444.pdf?arnumber=10589444","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T19:05:55Z","timestamp":1764183955000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10589444\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2]]},"references-count":46,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tetci.2024.3420692","relation":{},"ISSN":["2471-285X"],"issn-type":[{"value":"2471-285X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2]]}}}