{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:57:55Z","timestamp":1760597875362,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,2,19]],"date-time":"2019-02-19T00:00:00Z","timestamp":1550534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,2,19]]},"DOI":"10.1145\/3316615.3316686","type":"proceedings-article","created":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T12:17:59Z","timestamp":1557749879000},"page":"442-446","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["An Information Source Identification Algorithm Based on Shortest Arborescence of Network"],"prefix":"10.1145","author":[{"given":"Zhong","family":"Li","sequence":"first","affiliation":[{"name":"Beijing Key Laboratory of Network Technology, School of Computer Science and Engineering, Beihang University, Beijing, China"}]},{"given":"Chunhe","family":"Xia","sequence":"additional","affiliation":[{"name":"Beijing Key Laboratory of Network Technology, School of Computer Science and Engineering, Beihang University, Beijing, China"}]},{"given":"Tianbo","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Technology, Beihang University, Beijing, China"}]},{"given":"Xiaochen","family":"Liu","sequence":"additional","affiliation":[{"name":"Beijing Key Laboratory of Network Technology, School of Computer Science and Engineering, Beihang University, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2019,2,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2184319.2184338"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1287\/isre.2015.0565"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.giq.2013.10.014"},{"key":"e_1_3_2_1_4_1","unstructured":"Berr J. 2017. 'WannaCry'Ransomware Attack Losses Could Reach $4 Billion. CBS News. https:\/\/www.cbsnews.com\/news\/wannacry-ransomware-attacks-wannacry-virus-losses\/.  Berr J. 2017. 'WannaCry'Ransomware Attack Losses Could Reach $4 Billion. CBS News. https:\/\/www.cbsnews.com\/news\/wannacry-ransomware-attacks-wannacry-virus-losses\/."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1811099.1811063"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2158885"},{"volume-title":"Proceedings of IEEE International Symposium on Information Theory Proceedings (ISIT)","year":"2013","author":"Karamchandani N.","key":"e_1_3_2_1_8_1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2364972"},{"volume-title":"Proceedings of IEEE Conference on Computer Communications (INFOCOM)","year":"2014","author":"Zhu K.","key":"e_1_3_2_1_10_1"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.82.016101"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.90.012801"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1245200"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579168"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2015.2469256"}],"event":{"name":"ICSCA '19: 2019 8th International Conference on Software and Computer Applications","sponsor":["University of New Brunswick University of New Brunswick"],"location":"Penang Malaysia","acronym":"ICSCA '19"},"container-title":["Proceedings of the 2019 8th International Conference on Software and Computer Applications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3316615.3316686","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3316615.3316686","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:12Z","timestamp":1750208532000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3316615.3316686"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,19]]},"references-count":14,"alternative-id":["10.1145\/3316615.3316686","10.1145\/3316615"],"URL":"https:\/\/doi.org\/10.1145\/3316615.3316686","relation":{},"subject":[],"published":{"date-parts":[[2019,2,19]]},"assertion":[{"value":"2019-02-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}