{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:29:26Z","timestamp":1772119766795,"version":"3.50.1"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61502281"],"award-info":[{"award-number":["61502281"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71772107"],"award-info":[{"award-number":["71772107"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2894155","type":"journal-article","created":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T22:47:20Z","timestamp":1548197240000},"page":"42052-42062","source":"Crossref","is-referenced-by-count":20,"title":["Analysis of Influence Maximization in Temporal Social Networks"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4523-2011","authenticated-orcid":false,"given":"Qiu","family":"Liqing","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Jinfeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fan","family":"Xin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6875-2346","authenticated-orcid":false,"given":"Jia","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gao","family":"Wenwen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2964791.2901458"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2009.08.035"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.90.022804"},{"key":"ref13","first-page":"592","article-title":"Time-critical influence maximization in social networks with time-delayed diffusion process","volume":"19","author":"chen","year":"2012","journal-title":"Proc 26th AAAI Conf Artif Intell"},{"key":"ref14","first-page":"1","article-title":"Scalable influence maximization for multiple products in continuous-time diffusion networks","volume":"18","author":"du","year":"2017","journal-title":"J Mach Learn Res"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.14778\/3067421.3067429"},{"key":"ref16","author":"hui","year":"2017","journal-title":"Time is what prevents everything from happening at once Propagation time-conscious influence maximization"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1038\/srep01783"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.2196\/jmir.4297"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-015-0283-z"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-017-18961-z"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.14778\/2047485.2047492"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.106"},{"key":"ref8","first-page":"918","article-title":"IRIE: Scalable and robust influence maximization in social networks","author":"jung","year":"2013","journal-title":"Proc IEEE Int Conf Data Mining"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-012-0262-1"},{"key":"ref2","first-page":"189","article-title":"Computer network emergency response technical team","volume":"37","author":"li","year":"2014","journal-title":"Chin J Comput"},{"key":"ref9","author":"tang","year":"2014","journal-title":"Influence maximization Near-optimal time complexity meets practical efficiency"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/956750.956769","article-title":"Maximizing the spread of influence through a social network","author":"kemple","year":"2003","journal-title":"Proc KDD"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2009.07.002"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2532549"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.14778\/2735703.2735706"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882929"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2016.05.006"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2015.06.012"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.03.003"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08620999.pdf?arnumber=8620999","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T03:09:16Z","timestamp":1694574556000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8620999\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2894155","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}