{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T15:38:58Z","timestamp":1774021138765,"version":"3.50.1"},"reference-count":77,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003995","name":"Natural Science Foundation of Anhui Province","doi-asserted-by":"publisher","award":["2408085J037"],"award-info":[{"award-number":["2408085J037"]}],"id":[{"id":"10.13039\/501100003995","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Technologies R&D Program of Anhui Province","award":["202423k09020039"],"award-info":[{"award-number":["202423k09020039"]}]},{"name":"Open Research Fund of the State Key Laboratory of Brain-Machine Intelligence, Zhejiang University","award":["BMI2400004"],"award-info":[{"award-number":["BMI2400004"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1109\/tpami.2025.3586651","type":"journal-article","created":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T13:49:45Z","timestamp":1751896185000},"page":"9563-9579","source":"Crossref","is-referenced-by-count":1,"title":["Unifying Graph Contrastive Learning via Graph Message Augmentation"],"prefix":"10.1109","volume":"47","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9429-1635","authenticated-orcid":false,"given":"Ziyan","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Anhui University, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6238-1596","authenticated-orcid":false,"given":"Bo","family":"Jiang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Anhui University, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8375-3590","authenticated-orcid":false,"given":"Jin","family":"Tang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Anhui University, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1414-3307","authenticated-orcid":false,"given":"Bin","family":"Luo","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Anhui University, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1117\/12.2639685"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3031549"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3203630"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP43922.2022.9746929"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.acl-long.72"},{"key":"ref6","article-title":"An empirical study of graph contrastive learning","volume-title":"Proc. 35th Conf. Neural Inf. Process. Syst. Datasets Benchmarks Track","author":"Zhu"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3170559"},{"key":"ref8","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2023.3290649"},{"key":"ref10","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Veli\u010dkovi\u0107"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2023.3285215"},{"key":"ref12","first-page":"3469","article-title":"Structure-aware transformer for graph representation learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CISP-BMEI60920.2023.10373343"},{"key":"ref14","first-page":"21872","article-title":"Disentangled contrastive learning on graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Li"},{"key":"ref15","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"You"},{"key":"ref16","article-title":"Deep graph contrastive representation learning","volume-title":"Proc. ICML Workshop Graph Representation Learn. Beyond","author":"Zhu"},{"key":"ref17","first-page":"76","article-title":"From canonical correlation analysis to self-supervised graph neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref18","article-title":"Strategies for pre-training graph neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Hu"},{"key":"ref19","first-page":"15870","article-title":"Motif-based graph self-supervised learning for molecular property prediction","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref20","first-page":"8230","article-title":"G-Mixup: Graph data augmentation for graph classification","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Han"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449796"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i8.20871"},{"key":"ref23","first-page":"15920","article-title":"Adversarial graph augmentation to improve graph contrastive learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Suresh"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449802"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3488560.3498416"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM50108.2020.00031"},{"key":"ref27","first-page":"12121","article-title":"Graph contrastive learning automated","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"You"},{"key":"ref28","article-title":"Automated data augmentations for graph classification","volume-title":"Proc. 11th Int. Conf. Learn. Representations","author":"Luo"},{"key":"ref29","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gilmer"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i4.25545"},{"key":"ref31","first-page":"22092","article-title":"Graph random neural networks for semi-supervised learning on graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Feng"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512044"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132967"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2021.04.021"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17315"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-26412-2_32"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/204"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467186"},{"key":"ref39","first-page":"1","article-title":"AutoGDA: Automated graph data augmentation for node classification","volume-title":"Proc. Learn. Graphs Conf.","author":"Zhao"},{"key":"ref40","article-title":"InfoGraph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Sun"},{"key":"ref41","article-title":"Deep graph infomax","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Veli\u010dkovi\u0107"},{"key":"ref42","article-title":"Heterogeneous deep graph infomax","volume-title":"Proc. Workshop Deep Learn. Graphs: Methodol. Appl. co-located 34th AAAI Conf. Artif. Intell.","author":"Ren"},{"key":"ref43","article-title":"Spatio-temporal deep graph infomax","volume-title":"Proc. Int. Conf. Learn. Representations Workshop","author":"Opolka"},{"key":"ref44","first-page":"11548","article-title":"Self-supervised graph-level representation learning with local and global structure","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Xu"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3191086"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.09.013"},{"key":"ref47","first-page":"4116","article-title":"Contrastive multi-view representation learning on graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Hassani"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16578"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3177295"},{"key":"ref50","first-page":"6827","article-title":"What makes for good views for contrastive learning?","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Tian"},{"key":"ref51","article-title":"Deep variational information bottleneck","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Alemi"},{"key":"ref52","first-page":"1857","article-title":"Improved deep metric learning with multi-class n-pair loss objective","volume-title":"Proc. 30th Int. Conf. Neural Inf. Process. Syst.","author":"Sohn"},{"key":"ref53","article-title":"How powerful are graph neural networks?","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Xu"},{"key":"ref54","first-page":"2224","article-title":"Convolutional networks on graphs for learning molecular fingerprints","volume-title":"Proc. 28th Int. Conf. Neural Inf. Process. Syst.","author":"Duvenaud"},{"key":"ref55","first-page":"12251","article-title":"Object-aware contrastive learning for debiased scene representation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Mo"},{"key":"ref56","first-page":"3531","article-title":"Efficient attention: Attention with linear complexities","volume-title":"Proc. IEEE\/CVF Winter Conf. Appl. Comput. Vis.","author":"Shen"},{"key":"ref57","article-title":"mixup: Beyond empirical risk minimization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Zhang"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17533"},{"key":"ref59","first-page":"12310","article-title":"AD-DROP: Attribution-driven dropout for robust language model fine-tuning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Yang"},{"key":"ref60","article-title":"Categorical reparameterization with gumbel-softmax","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Jang"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3157042"},{"key":"ref62","article-title":"TUDataset: A collection of benchmark datasets for learning with graphs","volume-title":"Proc. ICML 2020 Workshop Graph Representation Learn. Beyond","author":"Morris"},{"key":"ref63","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kingma"},{"key":"ref64","first-page":"488","article-title":"Efficient graphlet kernels for large graph comparison","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Shervashidze"},{"issue":"9","key":"ref65","first-page":"2539","article-title":"Weisfeiler-Lehman graph kernels","volume":"12","author":"Shervashidze","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93037-4_14"},{"key":"ref69","article-title":"graph2vec: Learning distributed representations of graphs","volume-title":"Proc. 13th Int. Workshop Mining Learn. Graphs","author":"Narayanan"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00936"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkr777"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref73","article-title":"Pitfalls of graph neural network evaluation","author":"Shchur","year":"2018"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i18.18017"},{"key":"ref75","first-page":"2641","article-title":"Learning conjoint attentions for graph neural nets","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"He"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2024.104129"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.35"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/34\/11192800\/11072380.pdf?arnumber=11072380","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T17:37:00Z","timestamp":1759772220000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11072380\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":77,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2025.3586651","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"},{"value":"1939-3539","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11]]}}}