{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T22:15:23Z","timestamp":1771280123643,"version":"3.50.1"},"reference-count":68,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LDQ23F020001"],"award-info":[{"award-number":["LDQ23F020001"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62406286"],"award-info":[{"award-number":["62406286"]}],"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":["62072406"],"award-info":[{"award-number":["62072406"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Laboratory of Data Protection and Intelligent Management, Ministry of Education, Sichuan University","award":["SCUSAKFKT202402Z"],"award-info":[{"award-number":["SCUSAKFKT202402Z"]}]},{"name":"Beijing Life Science Academy","award":["2024200CD0210"],"award-info":[{"award-number":["2024200CD0210"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput. Soc. Syst."],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1109\/tcss.2025.3602790","type":"journal-article","created":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T17:40:14Z","timestamp":1759340414000},"page":"769-782","source":"Crossref","is-referenced-by-count":0,"title":["Can Contrastive Learning Always be Trusted? Privacy Leakage Evaluation of Contrastive Learning for Graph Neural Networks"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7153-2755","authenticated-orcid":false,"given":"Jinyin","family":"Chen","sequence":"first","affiliation":[{"name":"College of Computer Science and Technology, Zhejiang University of Technology, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-1154-5560","authenticated-orcid":false,"given":"Wenbo","family":"Mu","sequence":"additional","affiliation":[{"name":"College of Information Engineering, Zhejiang University of Technology, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-7451-9166","authenticated-orcid":false,"given":"Haonan","family":"Ma","sequence":"additional","affiliation":[{"name":"College of Information Engineering, Zhejiang University of Technology, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-8041-7203","authenticated-orcid":false,"given":"Chengyi","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Information Engineering, Zhejiang University of Technology, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8997-5343","authenticated-orcid":false,"given":"Haibin","family":"Zheng","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Zhejiang University of Technology, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hang","family":"Du","sequence":"additional","affiliation":[{"name":"College of System Engineering, National University of Defense Technology, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2017.2760016"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1021\/bi00147a001"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/454"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/379"},{"key":"ref5","first-page":"23341","article-title":"How powerful are graph neural networks?","volume-title":"Proc. 7th Int. Conf. Learn. Representations (ICLR)","volume":"162","author":"Xu","year":"2019"},{"key":"ref6","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. 5th Int. Conf. Learn. Representations (ICLR)","author":"Kipf","year":"2017"},{"key":"ref7","article-title":"Graph attention networks","author":"Velickovic","year":"2017"},{"key":"ref8","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. 34th Int. Conf. Mach. Learn. (ICML)","volume":"70","author":"Gilmer","year":"2017"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btx029"},{"key":"ref10","first-page":"1","article-title":"InfoGraph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization","volume-title":"Proc. 8th Int. Conf. Learn. Representations (ICLR)","author":"Sun","year":"2020"},{"key":"ref11","first-page":"15920","article-title":"Adversarial graph augmentation to improve graph contrastive learning","volume-title":"Proc. 35th Int. Conf. Neural Inf. Process. Syst. (NIPS)","author":"Suresh","year":"2021"},{"key":"ref12","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume-title":"Proc. 34th Int. Conf. Neural Inf. Process. Syst. (NIPS)","volume":"33","author":"You","year":"2020"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3448891.3448939"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3488932.3497753"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPSISA52974.2021.00002"},{"key":"ref16","article-title":"Node-level membership inference attacks against graph neural networks","author":"He","year":"2021"},{"key":"ref17","first-page":"2669","article-title":"Stealing links from graph neural networks","volume-title":"Proc. USENIX Secur.","author":"He","year":"2021"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484571"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449802"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/317"},{"key":"ref21","first-page":"13052","article-title":"Let invariant rationale discovery inspire graph contrastive learning","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","volume":"162","author":"Li","year":"2022"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2023.04.001"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-01588-5"},{"key":"ref24","first-page":"874","article-title":"Spectral clustering with graph neural networks for graph pooling","volume-title":"Proc. 37th Int. Conf. Mach. Learn. (ICML)","volume":"119","author":"Bianchi","year":"2020"},{"key":"ref25","first-page":"3837","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","volume-title":"Proc. 30th Int. Conf. Neural Inf. Process. Syst. (NIPS)","author":"Defferrard","year":"2016"},{"key":"ref26","article-title":"Graph attention networks","author":"Veli\u010dkovi\u0107","year":"2017"},{"issue":"43","key":"ref27","first-page":"1","article-title":"Benchmarking graph neural networks","volume":"24","author":"Dwivedi","year":"2023","journal-title":"J. Mach. Learn. Res."},{"key":"ref28","article-title":"DropEdge: Towards deep graph convolutional networks on node classification","author":"Rong","year":"2019"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2024.111340"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2024.3453757"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3389966"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2024.3370918"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2024.3371592"},{"key":"ref34","article-title":"Graph-Bert: Only attention is needed for learning graph representations","author":"Zhang","year":"2020"},{"key":"ref35","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Adv. Neural Inf. Process. Syst. (NeurIPS 2017)","author":"Hamilton","year":"2017"},{"key":"ref36","first-page":"5708","article-title":"GraphRNN: Generating realistic graphs with deep auto-regressive models","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"You","year":"2018"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591647"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599768"},{"key":"ref39","article-title":"LightGCL: Simple yet effective graph contrastive learning for recommendation","author":"Cai","year":"2023"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-97-5572-1_3"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/260"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3725854"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15931-2_59"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.media.2023.102932"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591691"},{"key":"ref46","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume-title":"Proc. 34th Int. Conf. Neural Inf. Process. Syst. (NIPS)","author":"You","year":"2020"},{"key":"ref47","article-title":"Prototypical contrastive learning of unsupervised representations","author":"Li","year":"2020"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2023.127101"},{"key":"ref49","article-title":"Evaluating modules in graph contrastive learning","author":"Cui","year":"2021"},{"key":"ref50","first-page":"4543","article-title":"Inference attacks against graph neural networks","volume-title":"Proc. 31st USENIX Secur. Symp. (USENIX Secur.)","author":"Zhang","year":"2022"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441720"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484565"},{"key":"ref53","first-page":"3223","article-title":"GAP: Differentially private graph neural networks with aggregation perturbation","volume-title":"Proc. 32nd USENIX Secur. Symp.","author":"Sajadmanesh","year":"2023"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.3036583"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3125565"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.5555\/3327345.3327389"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449802"},{"key":"ref58","article-title":"Deep graph contrastive representation learning","author":"Zhu","year":"2020"},{"key":"ref59","first-page":"4116","article-title":"Contrastive multi-view representation learning on graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Hassani","year":"2020"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539321"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1021\/jm00106a046"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti1007"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"ref64","article-title":"TUDataset: A collection of benchmark datasets for learning with graphs","author":"Morris","year":"2020"},{"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","first-page":"4543","article-title":"Inference attacks against graph neural networks","volume-title":"Proc. USENIX Secur.","author":"Zhang","year":"2022"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i10.17053"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103475"}],"container-title":["IEEE Transactions on Computational Social Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6570650\/11395558\/11185186.pdf?arnumber=11185186","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T21:09:05Z","timestamp":1771276145000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11185186\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":68,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tcss.2025.3602790","relation":{},"ISSN":["2329-924X","2373-7476"],"issn-type":[{"value":"2329-924X","type":"electronic"},{"value":"2373-7476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2]]}}}