{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T00:02:36Z","timestamp":1752278556528,"version":"3.41.2"},"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":0,"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"}]},{"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"}]},{"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"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1145\/3580305.3599551"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1145\/3534678.3539321"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1145\/1401890.1402008"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1145\/1557019.1557108"},{"volume-title":"Proc. Int. Conf. Learn. Representations","author":"Hu","article-title":"Strategies for pre-training graph neural networks","key":"ref5"},{"key":"ref6","first-page":"12 096","article-title":"Does GNN pretraining help molecular representation?","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Sun"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/TBDATA.2022.3192598"},{"volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf","article-title":"Semi-supervised classification with graph convolutional networks","key":"ref8"},{"key":"ref9","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hamilton"},{"volume-title":"Proc. Int. Conf. Learn. Representations","author":"Veli\u010dkovi\u0107","article-title":"Graph attention networks","key":"ref10"},{"volume-title":"Proc. Int. Conf. Learn. Representations","author":"Xu","article-title":"How powerful are graph neural networks?","key":"ref11"},{"key":"ref12","first-page":"6861","article-title":"Simplifying graph convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wu"},{"volume-title":"Proc. Int. Conf. Learn. Representations","author":"Brody","article-title":"How attentive are graph attention networks?","key":"ref13"},{"volume-title":"Proc. Int. Conf. Learn. Representations","author":"Topping","article-title":"Understanding over-squashing and bottlenecks on graphs via curvature","key":"ref14"},{"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"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/TPAMI.2021.3054830"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1609\/aaai.v34i04.5747"},{"volume-title":"Proc. Int. Conf. Learn. Representations","author":"Karhadkar","article-title":"FoSR: First-order spectral rewiring for addressing oversquashing in GNNs","key":"ref18"},{"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"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/5.726791"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1038\/nature14539"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1145\/3394486.3403177"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.24963\/ijcai.2020\/188"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.24963\/ijcai.2021\/199"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1109\/TKDE.2023.3271772"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.18653\/v1\/2021.acl-long.28"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1093\/bib\/bbab346"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1145\/3477495.3531906"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1007\/11564089_7"},{"doi-asserted-by":"publisher","key":"ref30","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"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1109\/TNNLS.2022.3171419"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1109\/TNN.2008.2005605"},{"year":"2016","author":"Kipf","article-title":"Variational graph auto-encoders","key":"ref34"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1109\/TKDE.2024.3363703"},{"year":"2021","author":"He","article-title":"Learning conjoint attentions for graph neural nets","key":"ref36"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1016\/j.artint.2024.104129"},{"year":"2022","author":"He","article-title":"Not all neighbors are worth attending to: Graph selective attention networks for semi-supervised learning","key":"ref38"},{"doi-asserted-by":"publisher","key":"ref39","DOI":"10.1145\/3543507.3583379"},{"doi-asserted-by":"publisher","key":"ref40","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"},{"doi-asserted-by":"publisher","key":"ref42","DOI":"10.1007\/s12559-023-10222-8"},{"doi-asserted-by":"publisher","key":"ref43","DOI":"10.1016\/j.neucom.2024.127260"},{"doi-asserted-by":"publisher","key":"ref44","DOI":"10.1109\/TBDATA.2023.3266590"},{"doi-asserted-by":"publisher","key":"ref45","DOI":"10.1109\/TBDATA.2021.3140205"},{"doi-asserted-by":"publisher","key":"ref46","DOI":"10.1109\/tpami.2021.3081010"},{"doi-asserted-by":"publisher","key":"ref47","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":[{"type":"electronic","value":"2332-7790"},{"type":"electronic","value":"2372-2096"}],"subject":[],"published":{"date-parts":[[2025,8]]}}}