{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T04:57:18Z","timestamp":1780721838222,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T00:00:00Z","timestamp":1745280000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Natural Science Fundation of China","award":["No. 62471147"],"award-info":[{"award-number":["No. 62471147"]}]},{"name":"National Key R&D Program of China","award":["No. 2024YFF0505601"],"award-info":[{"award-number":["No. 2024YFF0505601"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,4,28]]},"DOI":"10.1145\/3696410.3714780","type":"proceedings-article","created":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T22:57:28Z","timestamp":1745362648000},"page":"3586-3597","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Fairness-aware Prompt Tuning for Graph Neural Networks"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0897-980X","authenticated-orcid":false,"given":"Zhengpin","family":"Li","sequence":"first","affiliation":[{"name":"Fudan University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1591-7172","authenticated-orcid":false,"given":"Minhua","family":"Lin","sequence":"additional","affiliation":[{"name":"The Pennsylvania State University, State College, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5421-5678","authenticated-orcid":false,"given":"Jian","family":"Wang","sequence":"additional","affiliation":[{"name":"Fudan University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3448-4878","authenticated-orcid":false,"given":"Suhang","family":"Wang","sequence":"additional","affiliation":[{"name":"The Pennsylvania State University, State College, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,4,22]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Chirag Agarwal Himabindu Lakkaraju and Marinka Zitnik. 2021. Towards a unified framework for fair and stable graph representation learning. In Uncertainty in Artificial Intelligence. 2114--2124."},{"key":"e_1_3_2_1_2_1","volume-title":"2nd International Conference on Learning Representations.","author":"Bruna Joan","year":"2014","unstructured":"Joan Bruna, Wojciech Zaremba, Arthur Szlam, and Yann LeCun. 2014. Spectral networks and deep locally connected networks on graphs. In 2nd International Conference on Learning Representations."},{"key":"e_1_3_2_1_3_1","volume-title":"12th International Conference on Learning Representations.","author":"Chen Jingyu","year":"2024","unstructured":"Jingyu Chen, Runlin Lei, and Zhewei Wei. 2024. POLYGCL: Graph contrastive learning via learnable spectral polynomial filters. In 12th International Conference on Learning Representations."},{"key":"e_1_3_2_1_4_1","volume-title":"PreGIP: Watermarking the pretraining of graph neural networks for deep intellectual property protection. arXiv preprint arXiv:2402.04435","author":"Dai Enyan","year":"2024","unstructured":"Enyan Dai, Minhua Lin, and Suhang Wang. 2024a. PreGIP: Watermarking the pretraining of graph neural networks for deep intellectual property protection. arXiv preprint arXiv:2402.04435 (2024)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441752"},{"key":"e_1_3_2_1_6_1","first-page":"7103","article-title":"Learning fair graph neural networks with limited and private sensitive attribute information","volume":"35","author":"Dai Enyan","year":"2022","unstructured":"Enyan Dai and Suhang Wang. 2022. Learning fair graph neural networks with limited and private sensitive attribute information. IEEE Transactions on Knowledge and Data Engineering, Vol. 35, 7 (2022), 7103--7117.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_2_1_7_1","volume-title":"A comprehensive survey on trustworthy graph neural networks: Privacy, robustness, fairness, and explainability. Machine Intelligence Research","author":"Dai Enyan","year":"2024","unstructured":"Enyan Dai, Tianxiang Zhao, Huaisheng Zhu, Junjie Xu, Zhimeng Guo, Hui Liu, Jiliang Tang, and Suhang Wang. 2024b. A comprehensive survey on trustworthy graph neural networks: Privacy, robustness, fairness, and explainability. Machine Intelligence Research (2024), 1--51."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512173"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3265598"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090255"},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of the 40th International Conference on Machine Learning. 9224--9245","author":"Eliasof Moshe","year":"2023","unstructured":"Moshe Eliasof, Lars Ruthotto, and Eran Treister. 2023. Improving graph neural networks with learnable propagation operators. In Proceedings of the 40th International Conference on Machine Learning. 9224--9245."},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of the 37th International Conference on Neural Information Processing Systems. 52464--52489","author":"Fang Taoran","year":"2023","unstructured":"Taoran Fang, Yunchao Zhang, Yang Yang, Chunping Wang, and Lei Chen. 2023. Universal prompt tuning for graph neural networks. In Proceedings of the 37th International Conference on Neural Information Processing Systems. 52464--52489."},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the 37th International Conference on Neural Information Processing Systems. 80644--80660","author":"Feng Qizhang","year":"2023","unstructured":"Qizhang Feng, Zhimeng Jiang, Ruiquan Li, Yicheng Wang, Na Zou, Jiang Bian, and Xia Hu. 2023. Fair graph distillation. In Proceedings of the 37th International Conference on Neural Information Processing Systems. 80644--80660."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645673"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583268"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939754"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3583780.3615092"},{"key":"e_1_3_2_1_18_1","volume-title":"Proceedings of 31st International Conference on Neural Information Processing Systems. 1025--1035","author":"Hamilton Will","year":"2017","unstructured":"Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. In Proceedings of 31st International Conference on Neural Information Processing Systems. 1025--1035."},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of the 30th International Conference on Neural Information Processing Systems. 3323--3331","author":"Hardt Moritz","year":"2016","unstructured":"Moritz Hardt, Eric Price, and Nathan Srebro. 2016. Equality of opportunity in supervised learning. In Proceedings of the 30th International Conference on Neural Information Processing Systems. 3323--3331."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401063"},{"key":"e_1_3_2_1_21_1","volume-title":"5th International Conference on Learning Representation.","author":"Thomas","unstructured":"Thomas N. Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. In 5th International Conference on Learning Representation."},{"key":"e_1_3_2_1_22_1","volume-title":"FairGAT: Fairness-aware graph attention networks. ACM Transactions on Knowledge Discovery from Data","author":"Deniz Kose O","year":"2024","unstructured":"O Deniz Kose and Yanning Shen. 2024. FairGAT: Fairness-aware graph attention networks. ACM Transactions on Knowledge Discovery from Data, Vol. 18, 7 (2024), 1--20."},{"key":"e_1_3_2_1_23_1","volume-title":"Stealing training graphs from graph neural networks. arXiv preprint arXiv:2411.11197","author":"Lin Minhua","year":"2024","unstructured":"Minhua Lin, Enyan Dai, Junjie Xu, Jinyuan Jia, Xiang Zhang, and Suhang Wang. 2024a. Stealing training graphs from graph neural networks. arXiv preprint arXiv:2411.11197 (2024)."},{"key":"e_1_3_2_1_24_1","volume-title":"Trojan prompt attacks on graph neural networks. arXiv preprint arXiv:2410.13974","author":"Lin Minhua","year":"2024","unstructured":"Minhua Lin, Zhiwei Zhang, Enyan Dai, Zongyu Wu, Yilong Wang, Xiang Zhang, and Suhang Wang. 2024b. Trojan prompt attacks on graph neural networks. arXiv preprint arXiv:2410.13974 (2024)."},{"key":"e_1_3_2_1_25_1","volume-title":"International Conference on Learning Representations (ICLR).","author":"Ling Hongyi","year":"2023","unstructured":"Hongyi Ling, Zhimeng Jiang, Youzhi Luo, Shuiwang Ji, and Na Zou. 2023. Learning fair graph representations via automated data augmentations. In International Conference on Learning Representations (ICLR)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3560815"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583386"},{"key":"e_1_3_2_1_28_1","volume-title":"SIGKDD 2023 Deep Learning on Graphs Workshop.","author":"Loveland Donald","year":"2023","unstructured":"Donald Loveland, Jiong Zhu, Mark Heimann, Ben Fish, Michael T Schaub, and Danai Koutra. 2023. On graph neural network fairness in the presence of heterophilous neighborhoods. In SIGKDD 2023 Deep Learning on Graphs Workshop."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16552"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3488560.3498391"},{"key":"e_1_3_2_1_31_1","volume-title":"Gpt-4 technical report. arXiv preprint arXiv:2303.08774","author":"AI.","year":"2023","unstructured":"OpenAI. 2023. Gpt-4 technical report. arXiv preprint arXiv:2303.08774 (2023)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/456"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539249"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599256"},{"key":"e_1_3_2_1_36_1","volume-title":"Graph prompt learning: A comprehensive survey and beyond. arXiv preprint arXiv:2311.16534","author":"Sun Xiangguo","year":"2023","unstructured":"Xiangguo Sun, Jiawen Zhang, Xixi Wu, Hong Cheng, Yun Xiong, and Jia Li. 2023b. Graph prompt learning: A comprehensive survey and beyond. arXiv preprint arXiv:2311.16534 (2023)."},{"key":"e_1_3_2_1_37_1","volume-title":"International scientific conference and international workshop present day trends of innovations","author":"Takac Lubos","unstructured":"Lubos Takac and Michal Zabovsky. 2012. Data analysis in public social networks. In International scientific conference and international workshop present day trends of innovations, Vol. 1."},{"key":"e_1_3_2_1_38_1","volume-title":"6th International Conference on Learning Representations.","author":"Veli\u010dkovi\u0107 Petar","year":"2018","unstructured":"Petar Veli\u010dkovi\u0107, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Li\u00f2, and Yoshua Bengio. 2018a. Graph attention networks. In 6th International Conference on Learning Representations."},{"key":"e_1_3_2_1_39_1","volume-title":"6th International Conference on Learning Representations.","author":"Veli\u010dkovi\u0107 Petar","year":"2018","unstructured":"Petar Veli\u010dkovi\u0107, William Fedus, William L Hamilton, Pietro Li\u00f2, Yoshua Bengio, and R Devon Hjelm. 2018b. Deep graph infomax. In 6th International Conference on Learning Representations."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539404"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645604"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512156"},{"key":"e_1_3_2_1_43_1","volume-title":"Proceedings of the 37th International Conference on Neural Information Processing Systems. 16129--16152","author":"Xiao Teng","year":"2023","unstructured":"Teng Xiao, Huaisheng Zhu, Zhengyu Chen, and Suhang Wang. 2023. Simple and asymmetric graph contrastive learning without augmentations. In Proceedings of the 37th International Conference on Neural Information Processing Systems. 16129--16152."},{"key":"e_1_3_2_1_44_1","volume-title":"6th International Conference on Learning Representations.","author":"Xu Keyulu","year":"2018","unstructured":"Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2018. How powerful are graph neural networks?. In 6th International Conference on Learning Representations."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645546"},{"key":"e_1_3_2_1_46_1","volume-title":"Proceedings of the 38th International Conference on Machine Learning. 12121--12132","author":"You Yuning","year":"2021","unstructured":"Yuning You, Tianlong Chen, Yang Shen, and Zhangyang Wang. 2021. Graph contrastive learning automated. In Proceedings of the 38th International Conference on Machine Learning. 12121--12132."},{"key":"e_1_3_2_1_47_1","volume-title":"Proceedings of the 34th International Conference on Neural Information Processing Systems. 5812--5823","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. In Proceedings of the 34th International Conference on Neural Information Processing Systems. 5812--5823."},{"key":"e_1_3_2_1_48_1","volume-title":"DTGB: A comprehensive benchmark for dynamic text-attributed graphs. arXiv preprint arXiv:2406.12072","author":"Zhang Jiasheng","year":"2024","unstructured":"Jiasheng Zhang, Jialin Chen, Menglin Yang, Aosong Feng, Shuang Liang, Jie Shao, and Rex Ying. 2024a. DTGB: A comprehensive benchmark for dynamic text-attributed graphs. arXiv preprint arXiv:2406.12072 (2024)."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645703"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16602"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-018-04948-5"}],"event":{"name":"WWW '25: The ACM Web Conference 2025","location":"Sydney NSW Australia","acronym":"WWW '25","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM on Web Conference 2025"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3696410.3714780","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3696410.3714780","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:41Z","timestamp":1750295921000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3696410.3714780"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,22]]},"references-count":51,"alternative-id":["10.1145\/3696410.3714780","10.1145\/3696410"],"URL":"https:\/\/doi.org\/10.1145\/3696410.3714780","relation":{},"subject":[],"published":{"date-parts":[[2025,4,22]]},"assertion":[{"value":"2025-04-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}