{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T16:29:27Z","timestamp":1775579367927,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":60,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T00:00:00Z","timestamp":1715558400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSFC","award":["72071125, 72031001, 62376118"],"award-info":[{"award-number":["72071125, 72031001, 62376118"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,5,13]]},"DOI":"10.1145\/3589334.3645470","type":"proceedings-article","created":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T07:08:13Z","timestamp":1715152093000},"page":"629-640","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Graph Contrastive Learning with Cohesive Subgraph Awareness"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4689-9555","authenticated-orcid":false,"given":"Yucheng","family":"Wu","sequence":"first","affiliation":[{"name":"Key Lab of High Confidence Software Technologies (Peking University), Ministry of Education &amp; School of Computer Science, Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7627-8485","authenticated-orcid":false,"given":"Leye","family":"Wang","sequence":"additional","affiliation":[{"name":"Key Lab of High Confidence Software Technologies (Peking University), Ministry of Education &amp; School of Computer Science, Peking University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1331-0860","authenticated-orcid":false,"given":"Xiao","family":"Han","sequence":"additional","affiliation":[{"name":"School of Information Management and Engineering, Shanghai University of Finance and Economics, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1173-1880","authenticated-orcid":false,"given":"Han-Jia","family":"Ye","sequence":"additional","affiliation":[{"name":"National Key Laboratory for Novel Software Technology, Nanjing University &amp; School of Artificial Intelligence, Nanjing University, Nanjing, China"}]}],"member":"320","published-online":{"date-parts":[[2024,5,13]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137640"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2016.11.002"},{"key":"e_1_3_2_2_3_1","first-page":"498","article-title":"Prediction of protein functions based on k-cores of protein-protein interaction networks and amino acid sequences","volume":"14","author":"Altaf-Ul-Amine Md","year":"2003","unstructured":"Md Altaf-Ul-Amine, Kensaku Nishikata, Toshihiro Korna, Teppei Miyasato, Yoko Shinbo, Md Arifuzzaman, Chieko Wada, Maki Maeda, Taku Oshima, Hirotada Mori, et al. 2003. Prediction of protein functions based on k-cores of protein-protein interaction networks and amino acid sequences. Genome Informatics, Vol. 14 (2003), 498--499.","journal-title":"Genome Informatics"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1021\/jm00378a021"},{"key":"e_1_3_2_2_5_1","volume-title":"An automated method for finding molecular complexes in large protein interaction networks. BMC bioinformatics","author":"Bader Gary D","year":"2003","unstructured":"Gary D Bader and Christopher WV Hogue. 2003. An automated method for finding molecular complexes in large protein interaction networks. BMC bioinformatics, Vol. 4, 1 (2003), 1--27."},{"key":"e_1_3_2_2_6_1","volume-title":"arXiv preprint cs\/0310049","author":"Batagelj Vladimir","year":"2003","unstructured":"Vladimir Batagelj and Matjaz Zaversnik. 2003. An O (m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049 (2003)."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2746478"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti1007"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3154319"},{"key":"e_1_3_2_2_10_1","volume-title":"Proceedings of the International AAAI Conference on Web and Social Media","volume":"5","author":"Brown Phil","year":"2011","unstructured":"Phil Brown and Junlan Feng. 2011. Measuring user influence on twitter using modified k-shell decomposition. In Proceedings of the International AAAI Conference on Web and Social Media, Vol. 5. 18--23."},{"key":"e_1_3_2_2_11_1","volume-title":"Can graph neural networks count substructures? Advances in neural information processing systems","author":"Chen Zhengdao","year":"2020","unstructured":"Zhengdao Chen, Lei Chen, Soledad Villar, and Joan Bruna. 2020. Can graph neural networks count substructures? Advances in neural information processing systems, Vol. 33 (2020), 10383--10395."},{"key":"e_1_3_2_2_12_1","volume-title":"Trusses: Cohesive subgraphs for social network analysis. National security agency technical report","author":"Cohen Jonathan","year":"2008","unstructured":"Jonathan Cohen. 2008. Trusses: Cohesive subgraphs for social network analysis. National security agency technical report, Vol. 16, 3.1 (2008)."},{"key":"e_1_3_2_2_13_1","volume-title":"Carlo Sansone, and Mario Vento","author":"Cordella Luigi P","year":"2004","unstructured":"Luigi P Cordella, Pasquale Foggia, Carlo Sansone, and Mario Vento. 2004. A (sub) graph isomorphism algorithm for matching large graphs. IEEE transactions on pattern analysis and machine intelligence, Vol. 26, 10 (2004), 1367--1372."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.032093399"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2011.65"},{"key":"e_1_3_2_2_16_1","volume-title":"International conference on machine learning. PMLR, 1263--1272","author":"Gilmer Justin","year":"2017","unstructured":"Justin Gilmer, Samuel S Schoenholz, Patrick F Riley, Oriol Vinyals, and George E Dahl. 2017. Neural message passing for quantum chemistry. In International conference on machine learning. PMLR, 1263--1272."},{"key":"e_1_3_2_2_17_1","volume-title":"International Conference on Machine Learning. PMLR, 4116--4126","author":"Hassani Kaveh","year":"2020","unstructured":"Kaveh Hassani and Amir Hosein Khasahmadi. 2020. Contrastive multi-view representation learning on graphs. In International Conference on Machine Learning. PMLR, 4116--4126."},{"key":"e_1_3_2_2_18_1","first-page":"107","article-title":"Transitivity in Structural Models of Small Groups","volume":"2","author":"Holland Paul","year":"1971","unstructured":"Paul Holland and Samuel Leinhardt. 1971. Transitivity in Structural Models of Small Groups. Small Group Research, Vol. 2 (1971), 107 -- 124.","journal-title":"Small Group Research"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2453956"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610495"},{"key":"e_1_3_2_2_21_1","volume-title":"Semi-Supervised Classification with Graph Convolutional Networks. In International Conference on Learning Representations.","author":"Thomas","unstructured":"Thomas N. Kipf and Max Welling. 2017. Semi-Supervised Classification with Graph Convolutional Networks. In International Conference on Learning Representations."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1038\/nphys1746"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/3454287.3455484"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2019.10.004"},{"key":"e_1_3_2_2_25_1","volume-title":"International conference on machine learning. PMLR, 13052--13065","author":"Li Sihang","year":"2022","unstructured":"Sihang Li, Xiang Wang, An Zhang, Yingxin Wu, Xiangnan He, and Tat-Seng Chua. 2022. Let invariant rationale discovery inspire graph contrastive learning. In International conference on machine learning. PMLR, 13052--13065."},{"key":"e_1_3_2_2_26_1","volume-title":"Spectral Augmentation for Self-Supervised Learning on Graphs. In The Eleventh International Conference on Learning Representations.","author":"Lin Lu","year":"2023","unstructured":"Lu Lin, Jinghui Chen, and Hongning Wang. 2023. Spectral Augmentation for Self-Supervised Learning on Graphs. In The Eleventh International Conference on Learning Representations."},{"key":"e_1_3_2_2_27_1","first-page":"2972","article-title":"Revisiting graph contrastive learning from the perspective of graph spectrum","volume":"35","author":"Liu Nian","year":"2022","unstructured":"Nian Liu, Xiao Wang, Deyu Bo, Chuan Shi, and Jian Pei. 2022b. Revisiting graph contrastive learning from the perspective of graph spectrum. Advances in Neural Information Processing Systems, Vol. 35 (2022), 2972--2983.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_28_1","volume-title":"Graph self-supervised learning: A survey","author":"Liu Yixin","year":"2022","unstructured":"Yixin Liu, Ming Jin, Shirui Pan, Chuan Zhou, Yu Zheng, Feng Xia, and Philip Yu. 2022a. Graph self-supervised learning: A survey. IEEE Transactions on Knowledge and Data Engineering (2022)."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00587-4"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00139635"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014602"},{"key":"e_1_3_2_2_32_1","volume-title":"The Web Conference.","author":"Page Lawrence","year":"1999","unstructured":"Lawrence Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. 1999. The PageRank Citation Ranking : Bringing Order to the Web. In The Web Conference."},{"key":"e_1_3_2_2_33_1","volume-title":"Accelerating Community Detection by Using K-core Subgraphs. ArXiv","author":"Peng Chengbin","year":"2014","unstructured":"Chengbin Peng, Tamara G. Kolda, and Ali Pinar. 2014. Accelerating Community Detection by Using K-core Subgraphs. ArXiv, Vol. abs\/1403.2226 (2014)."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16354-3_42"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412757"},{"key":"e_1_3_2_2_36_1","volume-title":"Network structure and minimum degree. Social networks","author":"Seidman Stephen B","year":"1983","unstructured":"Stephen B Seidman. 1983. Network structure and minimum degree. Social networks, Vol. 5, 3 (1983), 269--287."},{"key":"e_1_3_2_2_37_1","volume-title":"Pitfalls of graph neural network evaluation. arXiv preprint arXiv:1811.05868","author":"Shchur Oleksandr","year":"2018","unstructured":"Oleksandr Shchur, Maximilian Mumme, Aleksandar Bojchevski, and Stephan G\u00fcnnemann. 2018. Pitfalls of graph neural network evaluation. arXiv preprint arXiv:1811.05868 (2018)."},{"key":"e_1_3_2_2_38_1","volume-title":"International Conference on Learning Representations.","author":"Sun Fan-Yun","year":"2020","unstructured":"Fan-Yun Sun, Jordon Hoffman, Vikas Verma, and Jian Tang. 2020. InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization. In International Conference on Learning Representations."},{"key":"e_1_3_2_2_39_1","first-page":"15920","article-title":"Adversarial graph augmentation to improve graph contrastive learning","volume":"34","author":"Suresh Susheel","year":"2021","unstructured":"Susheel Suresh, Pan Li, Cong Hao, and Jennifer Neville. 2021. Adversarial graph augmentation to improve graph contrastive learning. Advances in Neural Information Processing Systems, Vol. 34 (2021), 15920--15933.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_40_1","volume-title":"Lin (Eds.)","volume":"33","author":"Tian Yonglong","year":"2020","unstructured":"Yonglong Tian, Chen Sun, Ben Poole, Dilip Krishnan, Cordelia Schmid, and Phillip Isola. 2020. What Makes for Good Views for Contrastive Learning?. In Advances in Neural Information Processing Systems, H. Larochelle, M. Ranzato, R. Hadsell, M.F. Balcan, and H. Lin (Eds.), Vol. 33. Curran Associates, Inc., 6827--6839."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512200"},{"key":"e_1_3_2_2_42_1","volume-title":"Graph attention networks. arXiv preprint arXiv:1710.10903","author":"Petar Velivc","year":"2017","unstructured":"Petar Velivc kovi\u0107, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2017. Graph attention networks. arXiv preprint arXiv:1710.10903 (2017)."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/2311906.2311909"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"crossref","unstructured":"Xiao Wang Houye Ji Chuan Shi Bai Wang Yanfang Ye Peng Cui and Philip S Yu. 2019. Heterogeneous graph attention network. In The world wide web conference. 2022--2032.","DOI":"10.1145\/3308558.3313562"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449786"},{"key":"e_1_3_2_2_46_1","volume-title":"Collective dynamics of \"small-world'networks. nature","author":"Watts Duncan J","year":"1998","unstructured":"Duncan J Watts and Steven H Strogatz. 1998. Collective dynamics of \"small-world'networks. nature, Vol. 393, 6684 (1998), 440--442."},{"key":"e_1_3_2_2_47_1","volume-title":"Self-supervised learning on graphs: Contrastive, generative, or predictive","author":"Wu Lirong","year":"2021","unstructured":"Lirong Wu, Haitao Lin, Cheng Tan, Zhangyang Gao, and Stan Z Li. 2021. Self-supervised learning on graphs: Contrastive, generative, or predictive. IEEE Transactions on Knowledge and Data Engineering (2021)."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.82.056101"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512156"},{"key":"e_1_3_2_2_50_1","volume-title":"International Conference on Learning Representations.","author":"Xu Keyulu","year":"2019","unstructured":"Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2019. How Powerful are Graph Neural Networks?. In International Conference on Learning Representations."},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i8.20871"},{"key":"e_1_3_2_2_53_1","volume-title":"International Conference on Machine Learning. PMLR, 12121--12132","author":"You Yuning","year":"2021","unstructured":"Yuning You, Tianlong Chen, Yang Shen, and Zhangyang Wang. 2021. Graph contrastive learning automated. In International Conference on Machine Learning. PMLR, 12121--12132."},{"key":"e_1_3_2_2_54_1","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume":"33","author":"You Yuning","year":"2020","unstructured":"Yuning You, Tianlong Chen, Yongduo Sui, Ting Chen, Zhangyang Wang, and Yang Shen. 2020. Graph contrastive learning with augmentations. Advances in Neural Information Processing Systems, Vol. 33 (2020), 5812--5823.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10482"},{"key":"e_1_3_2_2_56_1","volume-title":"Motif-Driven Contrastive Learning of Graph Representations. ArXiv","author":"Zhang Shichang","year":"2021","unstructured":"Shichang Zhang, Ziniu Hu, Arjun Subramonian, and Yizhou Sun. 2021. Motif-Driven Contrastive Learning of Graph Representations. ArXiv, Vol. abs\/2012.12533 (2021)."},{"key":"e_1_3_2_2_57_1","volume-title":"International Conference on Learning Representations.","author":"Zhu Hao","year":"2020","unstructured":"Hao Zhu and Piotr Koniusz. 2020. Simple spectral graph convolution. In International Conference on Learning Representations."},{"key":"e_1_3_2_2_58_1","volume-title":"Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks, Joaquin Vanschoren and Serena Yeung (Eds.)","volume":"1","author":"Zhu Yanqiao","year":"2021","unstructured":"Yanqiao Zhu, Yichen Xu, Qiang Liu, and Shu Wu. 2021a. An Empirical Study of Graph Contrastive Learning. In Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks, Joaquin Vanschoren and Serena Yeung (Eds.), Vol. 1. Curran Associates, Inc."},{"key":"e_1_3_2_2_59_1","volume-title":"Deep graph contrastive representation learning. arXiv preprint arXiv:2006.04131","author":"Zhu Yanqiao","year":"2020","unstructured":"Yanqiao Zhu, Yichen Xu, Feng Yu, Qiang Liu, Shu Wu, and Liang Wang. 2020. Deep graph contrastive representation learning. arXiv preprint arXiv:2006.04131 (2020)."},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449802"}],"event":{"name":"WWW '24: The ACM Web Conference 2024","location":"Singapore Singapore","acronym":"WWW '24","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2024"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645470","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3589334.3645470","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:24:37Z","timestamp":1755822277000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645470"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,13]]},"references-count":60,"alternative-id":["10.1145\/3589334.3645470","10.1145\/3589334"],"URL":"https:\/\/doi.org\/10.1145\/3589334.3645470","relation":{},"subject":[],"published":{"date-parts":[[2024,5,13]]},"assertion":[{"value":"2024-05-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}