{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T09:05:43Z","timestamp":1779267943127,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,5,25]],"date-time":"2026-05-25T00:00:00Z","timestamp":1779667200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,5,26]]},"DOI":"10.1145\/3795766.3799763","type":"proceedings-article","created":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T07:50:03Z","timestamp":1779263403000},"page":"227-237","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["FairGCL: Embedding Fairness for Influence Maximization with Graph Contrastive Learning"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1875-149X","authenticated-orcid":false,"given":"Arpan","family":"Dam","sequence":"first","affiliation":[{"name":"Computer Science and Engineering, IIT Kharagpur, Kharagpur, West Bengal, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-8751-978X","authenticated-orcid":false,"given":"Sougata","family":"Roy","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering, Indian Institute of Technology Kharagpur, Kharagpur, West Bengal, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4668-8771","authenticated-orcid":false,"given":"Bivas","family":"Mitra","sequence":"additional","affiliation":[{"name":"Computer Science and Engineering, IIT Kharagpur, Kharagpur, West Bengal, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,5,25]]},"reference":[{"key":"e_1_3_3_2_2_2","unstructured":"2020. Citation Network Dataset. https:\/\/www.kaggle.com\/datasets\/mathurinache\/citation-network-dataset. Kaggle Dataset."},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1609\/icwsm.v14i1.7360"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.70"},{"key":"e_1_3_3_2_5_2","doi-asserted-by":"crossref","unstructured":"Paula Chatterjee and Rachel\u00a0M Werner. 2021. Gender disparity in citations in high-impact journal articles. JAMA network open (2021).","DOI":"10.1001\/jamanetworkopen.2021.14509"},{"key":"e_1_3_3_2_6_2","doi-asserted-by":"crossref","unstructured":"Shubham Chowdhary Giulia De\u00a0Pasquale Nicolas Lanzetti Ana-Andreea Stoica and Florian Dorfler. 2024. Fairness in Social Influence Maximization via Optimal Transport. NeurIPS (2024).","DOI":"10.52202\/079017-0332"},{"key":"e_1_3_3_2_7_2","doi-asserted-by":"crossref","unstructured":"Hugo Confraria Manuel\u00a0Mira Godinho and Lili Wang. 2017. Determinants of citation impact: A comparative analysis of the Global South versus the Global North. Research Policy (2017).","DOI":"10.1016\/j.respol.2016.11.004"},{"key":"e_1_3_3_2_8_2","unstructured":"Gabriele Corso Luca Cavalleri Dominique Beaini Pietro Li\u00f2 and Petar Veli\u010dkovi\u0107. 2020. Principal neighbourhood aggregation for graph nets. NeurIPS (2020)."},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"crossref","unstructured":"Jordan\u00a0D Dworkin Kristin\u00a0A Linn Erin\u00a0G Teich Perry Zurn Russell\u00a0T Shinohara and Danielle\u00a0S Bassett. 2020. The extent and drivers of gender imbalance in neuroscience reference lists. Nature neuroscience (2020).","DOI":"10.1101\/2020.01.03.894378"},{"key":"e_1_3_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/CISAT66811.2025.11181690"},{"key":"e_1_3_3_2_11_2","doi-asserted-by":"crossref","unstructured":"Yuting Feng Ankitkumar Patel Bogdan Cautis and Hossein Vahabi. 2023. Influence Maximization with Fairness at Scale (Extended Version). ACM SIGKDD (2023).","DOI":"10.1145\/3580305.3599847"},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"crossref","unstructured":"Hao Gong and Chunxiang Guo. 2023. Influence maximization considering fairness: A multi-objective optimization approach with prior knowledge. Expert Systems with Applications 214 (2023) 119138.","DOI":"10.1016\/j.eswa.2022.119138"},{"key":"e_1_3_3_2_13_2","unstructured":"Will Hamilton Zhitao Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. Adv. Neural Inf. Process. Syst. (2017)."},{"key":"e_1_3_3_2_14_2","unstructured":"Mohammad\u00a0Mehdi Keikha Maseud Rahgozar Masoud Asadpour and Mohammad\u00a0Faghih Abdollahi. 2020. Influence maximization across heterogeneous interconnected networks based on deep learning. Expert Systems with Applications (2020)."},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i11.21454"},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"crossref","unstructured":"Moein Khajehnejad Ahmad\u00a0Asgharian Rezaei Mahmoudreza Babaei Jessica Hoffmann Mahdi Jalili and Adrian Weller. 2020. Adversarial graph embeddings for fair influence maximization over social networks. IJCAI (2020).","DOI":"10.24963\/ijcai.2020\/594"},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"crossref","unstructured":"Sanjay Kumar Abhishek Mallik and BS Panda. 2023. Influence maximization in social networks using transfer learning via graph-based LSTM. ESWA (2023).","DOI":"10.1016\/j.eswa.2022.118770"},{"key":"e_1_3_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"e_1_3_3_2_20_2","unstructured":"Mingkai Lin Lintan Sun Rui Yang Xusheng Liu Yajuan Wang Ding Li Wenzhong Li and Sanglu Lu. 2023. Fair Influence Maximization in Large-scale Social Networks Based on Attribute-aware Reverse Influence Sampling. JAIR (2023)."},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"crossref","unstructured":"Bich-Ngan\u00a0T Nguyen Phuong\u00a0NH Pham Van-Vang Le and V\u00e1clav Sn\u00e1\u0161el. 2022. Influence maximization under fairness budget distribution in online social networks. Mathematics (2022).","DOI":"10.3390\/math10224185"},{"key":"e_1_3_3_2_22_2","unstructured":"George Panagopoulos Fragkiskos\u00a0D Malliaros and Michalis Vazirgiannis. 2020. Multi-task learning for influence estimation and maximization. TKDE (2020)."},{"key":"e_1_3_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3625007.3627293"},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"crossref","unstructured":"Sen Pei Lev Muchnik Jos\u00e9\u00a0S Andrade Jr Zhiming Zheng and Hern\u00e1n\u00a0A Makse. 2014. Searching for superspreaders of information in real-world social media. Scientific reports (2014).","DOI":"10.1038\/srep05547"},{"key":"e_1_3_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i13.17383"},{"key":"e_1_3_3_2_26_2","unstructured":"Behnam Razaghi Mehdy Roayaei and Nasrollah\u00a0Moghadam Charkari. 2022. On the Group-Fairness-Aware Influence Maximization in Social Networks. TCSS (2022)."},{"key":"e_1_3_3_2_27_2","unstructured":"Andreea Soran. 2022. A Network Analysis for Assessing Similarities between Micro-Influencers and Their Followers in Music. B.S. thesis. University of Twente."},{"key":"e_1_3_3_2_28_2","doi-asserted-by":"crossref","unstructured":"Brian\u00a0J Taillon Steven\u00a0M Mueller Christine\u00a0M Kowalczyk and Daniel\u00a0N Jones. 2020. Understanding the relationships between social media influencers and their followers: the moderating role of closeness. Journal of Product & Brand Management (2020).","DOI":"10.1108\/JPBM-03-2019-2292"},{"key":"e_1_3_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482375"},{"key":"e_1_3_3_2_30_2","doi-asserted-by":"crossref","unstructured":"Alan Tsang Bryan Wilder Eric Rice Milind Tambe and Yair Zick. 2019. Group-fairness in influence maximization. IJCAI (2019).","DOI":"10.24963\/ijcai.2019\/831"},{"key":"e_1_3_3_2_31_2","doi-asserted-by":"crossref","unstructured":"Zhixiao Wang Jiayu Zhao Chengcheng Sun Xiaobin Rui and Philip\u00a0S Yu. 2024. A General Concave Fairness Framework for Influence Maximization Based on Poverty Reward. TKDD (2024).","DOI":"10.1145\/3701737"},{"key":"e_1_3_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i8.20871"}],"event":{"name":"WebSci '26: 18th ACM Web Science Conference 2026","location":"Braunschweig Germany","acronym":"WebSci '26","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the 18th ACM Web Science Conference 2026"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3795766.3799763","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T08:08:32Z","timestamp":1779264512000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3795766.3799763"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,25]]},"references-count":31,"alternative-id":["10.1145\/3795766.3799763","10.1145\/3795766"],"URL":"https:\/\/doi.org\/10.1145\/3795766.3799763","relation":{},"subject":[],"published":{"date-parts":[[2026,5,25]]},"assertion":[{"value":"2026-05-25","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}