{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T10:20:15Z","timestamp":1772878815463,"version":"3.50.1"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["MA7111\/6-1"],"award-info":[{"award-number":["MA7111\/6-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["MA7111\/7-1"],"award-info":[{"award-number":["MA7111\/7-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Sci. Eng."],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1109\/tnse.2025.3547240","type":"journal-article","created":{"date-parts":[[2025,3,3]],"date-time":"2025-03-03T18:36:33Z","timestamp":1741026993000},"page":"2308-2321","source":"Crossref","is-referenced-by-count":2,"title":["Online Influence Maximization With Semi-Bandit Feedback Under Corruptions"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8859-4904","authenticated-orcid":false,"given":"Xiaotong","family":"Cheng","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering and Information Technology, Ruhr-University Bochum, Bochum, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-2854-1955","authenticated-orcid":false,"given":"Behzad","family":"Nourani-Koliji","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Tübingen, Tübingen, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0647-611X","authenticated-orcid":false,"given":"Setareh","family":"Maghsudi","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Information Technology, Ruhr-University Bochum, Bochum, Germany"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511761942"},{"key":"ref2","first-page":"737","article-title":"A gang of bandits","volume-title":"Proc. 27th Int. Conf. Neural Inf. Process. Syst.","author":"Cesa-Bianchi","year":"2013"},{"key":"ref3","article-title":"Bandits on graphs and structures","author":"Valko","year":"2016"},{"key":"ref4","first-page":"3026","article-title":"Online influence maximization under independent cascade model with semi-bandit feedback","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst.","author":"Wen","year":"2017"},{"key":"ref5","first-page":"3530","article-title":"Model-independent online learning for influence maximization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Vaswani","year":"2017"},{"key":"ref6","first-page":"20","article-title":"Heuristic algorithms for influence maximization in partially observable social networks","volume-title":"Proc. 3rd Int. Workshop Social Influence Anal.","author":"Stein","year":"2017"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330874"},{"key":"ref8","first-page":"1192","article-title":"Online influence maximization under linear threshold model","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Li","year":"2020"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783271"},{"key":"ref11","first-page":"11472","article-title":"Online competitive influence maximization","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Zuo","year":"2022"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1080\/00913367.2002.10673685"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1287\/mksc.1030.0033"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.4324\/9781315277288-10"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.4135\/9781412976046.n12"},{"key":"ref16","first-page":"34614","article-title":"Nearly optimal algorithms for linear contextual bandits with adversarial corruptions","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"35","author":"He","year":"2022"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775057"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2020.2997021"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i13.26980"},{"key":"ref21","article-title":"Influence maximization with bandits","author":"Vaswani","year":"2015"},{"key":"ref22","first-page":"151","article-title":"Combinatorial multi-armed bandit: General framework and applications","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen","year":"2013"},{"issue":"1","key":"ref23","first-page":"1746","article-title":"Combinatorial multi-armed bandit and its extension to probabilistically triggered arms","volume":"17","author":"Chen","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i8.20901"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3409370"},{"key":"ref26","first-page":"822","article-title":"Sequential learning algorithms for contextual model-free influence maximization","volume-title":"Proc. 29th ACM SIGKDD Conf. Knowl. Discov. Data Mining","author":"Iacob","year":"2023"},{"key":"ref27","first-page":"2197","article-title":"Online influence maximization under decreasing cascade model","volume-title":"Proc. 2023 Int. Conf. Auton. Agents Multiagent Syst.","author":"Kong","year":"2023"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2024.3395850"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398375"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188918"},{"key":"ref32","first-page":"14362","article-title":"Adversarial attacks on linear contextual bandits","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Garcelon","year":"2020"},{"key":"ref33","first-page":"1562","article-title":"Better algorithms for stochastic bandits with adversarial corruptions","volume-title":"Proc. Conf. Learn. Theory","author":"Gupta","year":"2019"},{"key":"ref34","article-title":"Stochastic linear optimization with adversarial corruption","author":"Li","year":"2019"},{"key":"ref35","first-page":"991","article-title":"Stochastic linear bandits robust to adversarial attacks","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Bogunovic","year":"2021"},{"key":"ref36","article-title":"Linear contextual bandits with adversarial corruptions","author":"Zhao","year":"2021"},{"key":"ref37","first-page":"2312","article-title":"Improved algorithms for linear stochastic bandits","volume-title":"Proc. 25th Int. Conf. Neural Inf. Process. Syst.","author":"Abbasi-Yadkori","year":"2011"},{"key":"ref38","first-page":"33262","article-title":"Online corrupted user detection and regret minimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Wang","year":"2023"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835934"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593670"},{"key":"ref41","first-page":"1161","article-title":"Improving regret bounds for combinatorial semi-bandits with probabilistically triggered arms and its applications","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst.","author":"Wang","year":"2017"},{"key":"ref42","article-title":"SNAP datasets: Stanford large network dataset collection","author":"Leskovec","year":"2014"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139020411"}],"container-title":["IEEE Transactions on Network Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6488902\/10975856\/10909361.pdf?arnumber=10909361","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T17:41:48Z","timestamp":1745602908000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10909361\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5]]},"references-count":43,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tnse.2025.3547240","relation":{},"ISSN":["2327-4697","2334-329X"],"issn-type":[{"value":"2327-4697","type":"electronic"},{"value":"2334-329X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5]]}}}