{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T15:03:59Z","timestamp":1784646239716,"version":"3.55.0"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"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. Big Data"],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1109\/tbdata.2024.3522817","type":"journal-article","created":{"date-parts":[[2024,12,26]],"date-time":"2024-12-26T14:21:28Z","timestamp":1735222888000},"page":"2036-2045","source":"Crossref","is-referenced-by-count":1,"title":["MC-GNN: Multi-Channel Graph Neural Networks With Hilbert-Schmidt Independence Criterion"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9819-4485","authenticated-orcid":false,"given":"Shicheng","family":"Cui","sequence":"first","affiliation":[{"name":"School of Computer Engineering, Nanjing Institute of Technology, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3456-902X","authenticated-orcid":false,"given":"Deqiang","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2541-4923","authenticated-orcid":false,"given":"Jing","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Engineering, Southeast University, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599551"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539321"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1402008"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557108"},{"key":"ref5","article-title":"Strategies for pre-training graph neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Hu"},{"key":"ref6","first-page":"12 096","article-title":"Does GNN pretraining help molecular representation?","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Sun"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2022.3192598"},{"key":"ref8","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf"},{"key":"ref9","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref10","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Veli\u010dkovi\u0107"},{"key":"ref11","article-title":"How powerful are graph neural networks?","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Xu"},{"key":"ref12","first-page":"6861","article-title":"Simplifying graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wu"},{"key":"ref13","article-title":"How attentive are graph attention networks?","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Brody"},{"key":"ref14","article-title":"Understanding over-squashing and bottlenecks on graphs via curvature","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Topping"},{"key":"ref15","first-page":"2528","article-title":"Understanding oversquashing in gnns through the lens of effective resistance","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Black"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3054830"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5747"},{"key":"ref18","article-title":"FoSR: First-order spectral rewiring for addressing oversquashing in GNNs","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Karhadkar"},{"key":"ref19","first-page":"8202","article-title":"Towards understanding and reducing graph structural noise for GNNs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Dong"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1038\/nature14539"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403177"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/188"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/199"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3271772"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.acl-long.28"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1093\/bib\/bbab346"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531906"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/11564089_7"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273600"},{"key":"ref31","first-page":"3759","article-title":"Robust learning with the hilbert-schmidt independence criterion","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Greenfeld"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3171419"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"ref34","article-title":"Variational graph auto-encoders","author":"Kipf","year":"2016"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3363703"},{"key":"ref36","article-title":"Learning conjoint attentions for graph neural nets","author":"He","year":"2021"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2024.104129"},{"key":"ref38","article-title":"Not all neighbors are worth attending to: Graph selective attention networks for semi-supervised learning","author":"He","year":"2022"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583379"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2022.3144151"},{"key":"ref41","first-page":"13 260","article-title":"Principal neighbourhood aggregation for graph nets","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Corso"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/s12559-023-10222-8"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2024.127260"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2023.3266590"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2021.3140205"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2021.3081010"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3081010"}],"container-title":["IEEE Transactions on Big Data"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6687317\/11077791\/10816548.pdf?arnumber=10816548","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T17:45:34Z","timestamp":1752255934000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10816548\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8]]},"references-count":47,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tbdata.2024.3522817","relation":{},"ISSN":["2332-7790","2372-2096"],"issn-type":[{"value":"2332-7790","type":"electronic"},{"value":"2372-2096","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8]]}}}