{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T18:44:41Z","timestamp":1785177881383,"version":"3.55.0"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/tkde.2025.3564283","type":"journal-article","created":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T17:07:50Z","timestamp":1745514470000},"page":"1-15","source":"Crossref","is-referenced-by-count":7,"title":["A Scalable Algorithm for Fair Influence Maximization with Unbiased Estimator"],"prefix":"10.1109","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0951-1512","authenticated-orcid":false,"given":"Xiaobin","family":"Rui","sequence":"first","affiliation":[{"name":"School of Computer Science, China University of Mining and Technology, Xuzhou, Jiangsu, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4256-1477","authenticated-orcid":false,"given":"Zhixiao","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science, China University of Mining and Technology, Xuzhou, Jiangsu, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0458-5977","authenticated-orcid":false,"given":"Hao","family":"Peng","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Technology, Beihang University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Chen","sequence":"additional","affiliation":[{"name":"Theory Center of Microsoft Research Asia, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philip S.","family":"Yu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Illinois at Chicago, Chicago, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","first-page":"5575","article-title":"Adaptive influence maximization with myopic feedback","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Peng"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220101"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-022-01696-3"},{"key":"ref4","first-page":"7620","article-title":"Budgeted online influence maximization","volume-title":"Proc. 37th Int. Conf. Mach. Learn.","author":"Perrault"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3015387"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3120561"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2807843"},{"key":"ref8","first-page":"1414","article-title":"End-to-end influence maximization in the field","volume-title":"Proc. 17th Int. Conf. Auton. Agents MultiAgent Syst.","author":"Wilder"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i13.17383"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/831"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i17.17725"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599847"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3366424.3383555"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/2954.001.0001"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.70"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593670"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723734"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.14450"},{"key":"ref20","first-page":"66675","article-title":"Scalable fair influence maximization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Rui"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502525"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775057"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1963192.1963217"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2419659"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.118"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-012-0262-1"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505541"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.8726"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183749"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3138783"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3308560.3317588"},{"key":"ref35","first-page":"15 750","article-title":"Exploring algorithmic fairness in robust graph covering problems","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Rahmattalabi"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380275"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313680"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1961.tb00399.x"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098069"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2011.12.021"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.122"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.138"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-018-29405-7"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/4358933\/10976569.pdf?arnumber=10976569","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T04:20:25Z","timestamp":1749183625000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10976569\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/tkde.2025.3564283","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}