{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:21:32Z","timestamp":1740133292227,"version":"3.37.3"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF Grants:","award":["NSF AI Institute (AI-EDGE) 2112471","CNS-NeTS-2106679","CNS-NeTS-2007231","CNS-SpecEES-1824337"],"award-info":[{"award-number":["NSF AI Institute (AI-EDGE) 2112471","CNS-NeTS-2106679","CNS-NeTS-2007231","CNS-SpecEES-1824337"]}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"crossref","award":["N00014-19-1-2621"],"award-info":[{"award-number":["N00014-19-1-2621"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"crossref","award":["W911NF-24-1-0103"],"award-info":[{"award-number":["W911NF-24-1-0103"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1109\/tnet.2024.3405798","type":"journal-article","created":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T17:36:51Z","timestamp":1717004211000},"page":"4025-4039","source":"Crossref","is-referenced-by-count":0,"title":["Fast Online Learning of Vulnerabilities for Networks With Propagating Failures"],"prefix":"10.1109","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5663-4411","authenticated-orcid":false,"given":"Yilin","family":"Zheng","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH, USA"}]},{"given":"Semih","family":"Cayci","sequence":"additional","affiliation":[{"name":"Department of Mathematics, RWTH Aachen University, Aachen, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5560-5806","authenticated-orcid":false,"given":"Atilla","family":"Eryilmaz","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, The Ohio State University, Columbus, OH, USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.86.3200"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498374"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/bfb0053999"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2318857.2254783"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487664"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3376930.3376933"},{"issue":"90","key":"ref8","first-page":"1","article-title":"Estimating diffusion networks: Recovery conditions, sample complexity and soft-thresholding algorithm","volume":"17","author":"Gomez-Rodriguez","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2158885"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.109.068702"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"volume-title":"Optimal Nonmyopic Value of Information in Graphical Models: Efficient Algorithms and Theoretical Limits","year":"2005","author":"Krause","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1561\/9781601986276"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401"},{"key":"ref15","first-page":"151","article-title":"Combinatorial multi-armed bandit: General framework and applications","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2591971.2591989"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11751"},{"issue":"1","key":"ref18","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":"ref19","first-page":"3022","article-title":"Online influence maximization under independent cascade model with semi-bandit feedback","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Wen"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45435-7_18"},{"key":"ref21","first-page":"511","article-title":"Efficient selection of multiple bandit arms: Theory and practice","volume-title":"Proc. ICML","volume":"10","author":"Kalyanakrishnan"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04414-4_7"},{"key":"ref23","first-page":"379","article-title":"Combinatorial pure exploration of multi-armed bandits","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"27","author":"Chen"},{"key":"ref24","first-page":"7620","article-title":"Budgeted online influence maximization","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Perrault"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1177009939"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1111\/insr.12107"},{"key":"ref27","article-title":"Gaussian process optimization in the bandit setting: No regret and experimental design","author":"Srinivas","year":"2009","journal-title":"arXiv:0912.3995"},{"key":"ref28","first-page":"1583","article-title":"Learning to optimize via information-directed sampling","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Russo"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2012.2204831"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.2200\/s00271ed1v01y201006cnt007"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1561\/9781933019697"},{"issue":"1","key":"ref32","first-page":"1","article-title":"A low complexity algorithm with O(\u221aT) regret and O(1) constraint violations for online convex optimization with long term constraints","volume":"21","author":"Yu","year":"2020","journal-title":"J. Mach. Learn. Res."},{"key":"ref33","first-page":"13750","article-title":"Group-fair online allocation in continuous time","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Cayci"},{"key":"ref34","article-title":"An efficient pessimistic-optimistic algorithm for stochastic linear bandits with general constraints","author":"Liu","year":"2021","journal-title":"arXiv:2102.05295"},{"key":"ref35","article-title":"POND: Pessimistic-optimistic online dispatching","author":"Liu","year":"2020","journal-title":"arXiv:2010.09995"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2151-2_7"},{"volume-title":"SNAP Datasets: Stanford Large Network Dataset Collection","year":"2014","author":"Leskovec","key":"ref38"},{"key":"ref39","first-page":"548","article-title":"Learning to discover social circles in ego networks","volume-title":"Proc. NIPS","author":"McAuley"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.01.016"},{"volume-title":"Information Theory","year":"1990","author":"Ash","key":"ref41"},{"issue":"2","key":"ref42","first-page":"5","article-title":"Inequalities on the Lambert W function and hyperpower function","volume":"9","author":"Hoorfar","year":"2008","journal-title":"J. Inequal. Pure Appl. Math."},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1017\/9781108627771"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/90\/10720541\/10541931-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/10720541\/10541931.pdf?arnumber=10541931","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,18]],"date-time":"2024-10-18T04:43:39Z","timestamp":1729226619000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10541931\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10]]},"references-count":43,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2024.3405798","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"type":"print","value":"1063-6692"},{"type":"electronic","value":"1558-2566"}],"subject":[],"published":{"date-parts":[[2024,10]]}}}