{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T07:17:02Z","timestamp":1776583022260,"version":"3.51.2"},"reference-count":53,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62206208"],"award-info":[{"award-number":["62206208"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62306226"],"award-info":[{"award-number":["62306226"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["XJSJ23021"],"award-info":[{"award-number":["XJSJ23021"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Research and Development Project of Shaanxi Province","award":["2022QCY-LL-35"],"award-info":[{"award-number":["2022QCY-LL-35"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1109\/tnnls.2024.3413750","type":"journal-article","created":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T16:20:53Z","timestamp":1719332453000},"page":"9488-9499","source":"Crossref","is-referenced-by-count":5,"title":["CCGIB: A Cross-Channel Graph Information Bottleneck Principle"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8484-2069","authenticated-orcid":false,"given":"Xiaolong","family":"Fan","sequence":"first","affiliation":[{"name":"School of Electronic Engineering, Key Laboratory of Collaborative Intelligence Systems, Ministry of Education, Xidian University, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0415-8556","authenticated-orcid":false,"given":"Maoguo","family":"Gong","sequence":"additional","affiliation":[{"name":"School of Electronic Engineering, Key Laboratory of Collaborative Intelligence Systems, Ministry of Education, Xidian University, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3459-5079","authenticated-orcid":false,"given":"Yue","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Key Laboratory of Collaborative Intelligence Systems, Ministry of Education, Xidian University, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingyang","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Electronic Engineering, Key Laboratory of Collaborative Intelligence Systems, Ministry of Education, Xidian University, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6294-6761","authenticated-orcid":false,"given":"Hao","family":"Li","sequence":"additional","affiliation":[{"name":"School of Electronic Engineering, Key Laboratory of Collaborative Intelligence Systems, Ministry of Education, Xidian University, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4650-1308","authenticated-orcid":false,"given":"Xiangming","family":"Jiang","sequence":"additional","affiliation":[{"name":"School of Electronic Engineering, Key Laboratory of Collaborative Intelligence Systems, Ministry of Education, Xidian University, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313488"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3124640"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3124580"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"ref5","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gilmer"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449971"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403177"},{"key":"ref8","first-page":"4116","article-title":"Contrastive multi-view representation learning on graphs","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Hassani"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i11.17210"},{"key":"ref10","first-page":"368","article-title":"The information bottleneck method","volume-title":"Proc. Annu. Allerton Conf. Commun., Control Comput.","author":"Tishby"},{"key":"ref11","first-page":"1","article-title":"Deep variational information bottleneck","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Alemi"},{"key":"ref12","first-page":"20437","article-title":"Graph information bottleneck","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Wu"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i4.20335"},{"key":"ref14","first-page":"1","article-title":"Graph information bottleneck for subgraph recognition","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Yu"},{"key":"ref15","first-page":"5171","article-title":"On variational bounds of mutual information","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Poole"},{"key":"ref16","first-page":"1779","article-title":"CLUB: A contrastive log-ratio upper bound of mutual information","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Cheng"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3102964"},{"key":"ref18","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Welling"},{"key":"ref19","first-page":"1","article-title":"How powerful are graph neural networks?","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Xu"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3084319"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441734"},{"key":"ref22","first-page":"11458","article-title":"Robust graph representation learning via neural sparsification","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zheng"},{"key":"ref23","first-page":"1","article-title":"Deep graph infomax","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Velickovic"},{"key":"ref24","first-page":"1","article-title":"InfoGraph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Sun"},{"key":"ref25","first-page":"30414","article-title":"InfoGCL: Information-aware graph contrastive learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Xu"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3264512"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/449"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3093297"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3291696"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3261460"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3192445"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3583780.3614986"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/226"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3112205"},{"key":"ref35","first-page":"20407","article-title":"Contrastive graph structure learning via information bottleneck for recommendation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"35","author":"Wei"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599339"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3322739"},{"key":"ref38","first-page":"291","article-title":"Subgraph matching kernels for attributed graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Kriege"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti1007"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"issue":"43","key":"ref41","first-page":"1","article-title":"Benchmarking graph neural networks","volume":"24","author":"Dwivedi","year":"2023","journal-title":"J. Mach. Learn. Res."},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.132"},{"key":"ref43","first-page":"1201","article-title":"Graph kernels","volume":"11","author":"Vishwanathan","year":"2010","journal-title":"J. Mach. Learn. Res."},{"issue":"9","key":"ref44","first-page":"2539","article-title":"Weisfeiler-lehman graph kernels","volume":"12","author":"Shervashidze","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref45","first-page":"488","article-title":"Efficient graphlet kernels for large graph comparison","volume-title":"Proc. Artif. Intell. Statist.","author":"Shervashidze"},{"key":"ref46","first-page":"1","article-title":"Order matters: Sequence to sequence for sets","volume-title":"Proc. 4th Int. Conf. Learn. Represent.","author":"Vinyals"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1115"},{"key":"ref49","first-page":"1","article-title":"Variational graph auto-encoders","volume-title":"Proc. NeurIPS Workshop Bayesian Deep Learn.","author":"Kipf"},{"key":"ref50","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"You"},{"key":"ref51","first-page":"1","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Kingma"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"ref53","first-page":"1","article-title":"Graph auto-encoder via neighborhood Wasserstein reconstruction","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Tang"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/5962385\/10982361\/10571356.pdf?arnumber=10571356","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T18:39:47Z","timestamp":1764959987000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10571356\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5]]},"references-count":53,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2024.3413750","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5]]}}}