{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T22:30:25Z","timestamp":1762900225619,"version":"3.41.0"},"reference-count":74,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T00:00:00Z","timestamp":1638144000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004281","name":"Polish National Science Centre","doi-asserted-by":"crossref","award":["2015\/17\/N\/ST6\/03686"],"award-info":[{"award-number":["2015\/17\/N\/ST6\/03686"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"crossref"}]},{"name":"European Research Council","award":["291528"],"award-info":[{"award-number":["291528"]}]},{"DOI":"10.13039\/501100004281","name":"Polish National Science Centre","doi-asserted-by":"crossref","award":["2016\/23\/B\/ST6\/03599 and 2014\/13\/B\/ST6\/01807"],"award-info":[{"award-number":["2016\/23\/B\/ST6\/03599 and 2014\/13\/B\/ST6\/01807"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Intell. Syst. Technol."],"published-print":{"date-parts":[[2022,2,28]]},"abstract":"<jats:p>Centrality measures are the most commonly advocated social network analysis tools for identifying leaders of covert organizations. While the literature has predominantly focused on studying the effectiveness of existing centrality measures or developing new ones, we study the problem from the opposite perspective, by focusing on how a group of leaders can avoid being identified by centrality measures as key members of a covert network. More specifically, we analyze the problem of choosing a set of edges to be added to a network to decrease the leaders\u2019 ranking according to three fundamental centrality measures, namely, degree, closeness, and betweenness. We prove that this problem is NP-complete for each measure. Moreover, we study how the leaders can construct a network from scratch, designed specifically to keep them hidden from centrality measures. We identify a network structure that not only guarantees to hide the leaders to a certain extent but also allows them to spread their influence across the network.<\/jats:p>","DOI":"10.1145\/3490462","type":"journal-article","created":{"date-parts":[[2021,11,30]],"date-time":"2021-11-30T01:51:27Z","timestamp":1638237087000},"page":"1-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["How Members of Covert Networks Conceal the Identities of Their Leaders"],"prefix":"10.1145","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2864-6909","authenticated-orcid":false,"given":"Marcin","family":"Waniek","sequence":"first","affiliation":[{"name":"New York University Abu Dhabi, and University of Warsaw, Banacha, Warsaw, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomasz P.","family":"Michalak","sequence":"additional","affiliation":[{"name":"University of Warsaw, Banacha, Warsaw, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Wooldridge","sequence":"additional","affiliation":[{"name":"University of Oxford, Oxford, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Talal","family":"Rahwan","sequence":"additional","affiliation":[{"name":"New York University Abu Dhabi, Abu Dhabi, UAE"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,11,29]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1038\/35019019"},{"issue":"9","key":"e_1_3_1_3_2","first-page":"1","article-title":"The rush in a directed graph","volume":"71","author":"Anthonisse Jac M.","year":"1971","unstructured":"Jac M. Anthonisse. 1971. The rush in a directed graph. Stichting Mathematisch Centrum. Mathematische Besliskunde 71, BN 9 (1971), 1\u201310.","journal-title":"Stichting Mathematisch Centrum. Mathematische Besliskunde"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.286.5439.509"},{"issue":"6","key":"e_1_3_1_5_2","first-page":"2","article-title":"The evolution of Al Qaeda\u2019s global network and Al Qaeda core\u2019s position within it: A network analysis","volume":"9","author":"Barber Victoria","year":"2015","unstructured":"Victoria Barber. 2015. The evolution of Al Qaeda\u2019s global network and Al Qaeda core\u2019s position within it: A network analysis. Perspect. Terror. 9, 6 (2015), 2\u201335.","journal-title":"Perspect. Terror."},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.17730\/humo.7.3.f4033344851gl053"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1002\/bs.3830100205"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/s13042-010-0007-7"},{"key":"e_1_3_1_9_2","first-page":"695","volume-title":"Proceedings of the International Conference on Machine Learning (PMLR\u201919)","author":"Bojchevski Aleksandar","year":"2019","unstructured":"Aleksandar Bojchevski and Stephan G\u00fcnnemann. 2019. Adversarial attacks on node embeddings via graph poisoning. In Proceedings of the International Conference on Machine Learning (PMLR\u201919). 695\u2013704."},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1086\/228631"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.5555\/2503308.2503326"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10588-006-7083-y"},{"issue":"4","key":"e_1_3_1_13_2","first-page":"125","article-title":"The decision calculus of terrorist leaders","volume":"6","author":"Chatagnier J. Tyson","year":"2012","unstructured":"J. Tyson Chatagnier, Alex Mintz, and Yair Samban. 2012. The decision calculus of terrorist leaders. Perspect. Terror. 6, 4\/5 (2012), 125\u2013144.","journal-title":"Perspect. Terror."},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20086-6_4"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2012.07.004"},{"key":"e_1_3_1_16_2","first-page":"1115","volume-title":"Proceedings of the International Conference on Machine Learning (PMLR\u201918)","author":"Dai Hanjun","year":"2018","unstructured":"Hanjun Dai, Hui Li, Tian Tian, Xin Huang, Lin Wang, Jun Zhu, and Le Song. 2018. Adversarial attack on graph structured data. In Proceedings of the International Conference on Machine Learning (PMLR\u201918). 1115\u20131124."},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12117-012-9151-7"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.5555\/3306127.3331749"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.5555\/3398761.3398803"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591884"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1177\/0022002706296155"},{"key":"e_1_3_1_22_2","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs I.","volume":"6","author":"Erd\u0151s Paul","year":"1959","unstructured":"Paul Erd\u0151s and Alfr\u00e9d R\u00e9nyi. 1959. On random graphs I.Publ. Math. Debr. 6 (1959), 290\u2013297.","journal-title":"Publ. Math. Debr."},{"issue":"1","key":"e_1_3_1_23_2","first-page":"12","article-title":"Network topography, key players and terrorist networks","volume":"32","author":"Everton Sean F.","year":"2009","unstructured":"Sean F. Everton. 2009. Network topography, key players and terrorist networks. Connections 32, 1 (2009), 12\u201319.","journal-title":"Connections"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00175"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1080\/10576100390242857"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(78)90021-7"},{"issue":"3","key":"e_1_3_1_28_2","first-page":"1","article-title":"Using complex systems analysis to advance marketing theory development: Modeling heterogeneity effects on new product growth through stochastic cellular automata","volume":"9","author":"Goldenberg Jacob","year":"2001","unstructured":"Jacob Goldenberg, Barak Libai, and Eitan Muller. 2001. Using complex systems analysis to advance marketing theory development: Modeling heterogeneity effects on new product growth through stochastic cellular automata. Acad. Market. Sci. Rev. 9, 3 (2001), 1\u201318.","journal-title":"Acad. Market. Sci. Rev."},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66399-9_4"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-47093-1_17"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1108\/JCRPP-09-2016-0018"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/2046684.2046692"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.4018\/jats.2010070103"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70004-5_32"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.12.001"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1145\/3447556.3447566"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.aaf0675"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1080\/1057610X.2012.720240"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324140"},{"issue":"3","key":"e_1_3_1_41_2","first-page":"43","article-title":"Mapping networks of terrorist cells","volume":"24","author":"Krebs Valdis E.","year":"2002","unstructured":"Valdis E. Krebs. 2002. Mapping networks of terrorist cells. Connections 24, 3 (2002), 43\u201352.","journal-title":"Connections"},{"key":"e_1_3_1_42_2","unstructured":"Alexey Kurakin Ian Goodfellow and Samy Bengio. 2017. Adversarial Machine Learning at Scale. Retrieved from https:\/\/arxiv.org\/abs\/cs.CV\/1611.01236."},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2008.12.003"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.02.032"},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1080\/10576100701759988"},{"key":"e_1_3_1_46_2","doi-asserted-by":"publisher","DOI":"10.5555\/2512538.2512553"},{"key":"e_1_3_1_47_2","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2015.11"},{"key":"e_1_3_1_48_2","doi-asserted-by":"publisher","DOI":"10.5555\/3297863.3297909"},{"key":"e_1_3_1_49_2","doi-asserted-by":"publisher","DOI":"10.5555\/1559116"},{"key":"e_1_3_1_50_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2006.05.001"},{"key":"e_1_3_1_51_2","unstructured":"A. Nordrum. 2016. Pro-ISIS online groups use social media survival strategies to evade authorities. IEEE Spectrum (2016)."},{"key":"e_1_3_1_52_2","article-title":"Strategies for combating dark networks","volume":"12","author":"Roberts Nancy","year":"2011","unstructured":"Nancy Roberts and Sean Everton. 2011. Strategies for combating dark networks. J. Soc. Struct. 12(2) (Jan. 2011). https:\/\/doi.org\/10.21307\/joss-2019-030","journal-title":"J. Soc. Struct."},{"key":"e_1_3_1_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/2660460.2660470"},{"key":"e_1_3_1_54_2","first-page":"307","volume-title":"Contributions to the Theory of Games, volume II","author":"Shapley Lloyd S.","year":"1953","unstructured":"Lloyd S. Shapley. 1953. A value for n-person games. In Contributions to the Theory of Games, volume II, H. W. Kuhn and A. W. Tucker (Eds.). Princeton University Press, Princeton, NJ, 307\u2013317."},{"key":"e_1_3_1_55_2","doi-asserted-by":"publisher","DOI":"10.1080\/00223980.1954.9712925"},{"key":"e_1_3_1_56_2","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(91)90008-H"},{"key":"e_1_3_1_57_2","doi-asserted-by":"publisher","DOI":"10.1080\/14742837.2013.832622"},{"key":"e_1_3_1_58_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2019.2890858"},{"key":"e_1_3_1_59_2","unstructured":"Lichao Sun Yingtong Dou Carl Yang Ji Wang Philip S. Yu Lifang He and Bo Li. 2020. Adversarial Attack and Defense on Graph Data: A Survey. Retrieved from https:\/\/arxiv.org\/abs\/cs.CR\/1812.10528."},{"key":"e_1_3_1_60_2","doi-asserted-by":"publisher","DOI":"10.5555\/1402821.1402911"},{"key":"e_1_3_1_61_2","article-title":"Structural knowledge and success of anti-terrorist activity: The downside of structural equivalence","volume":"6","author":"Tsvetovat Maksim","year":"2005","unstructured":"Maksim Tsvetovat and Kathleen Carley. 2005. Structural knowledge and success of anti-terrorist activity: The downside of structural equivalence. J. Soc. Struct. 6 (2005).","journal-title":"J. Soc. Struct."},{"key":"e_1_3_1_62_2","doi-asserted-by":"crossref","unstructured":"Maksim Tsvetovat and Kathleen M. Carley. 2005. Generation of realistic social network datasets for testing of analysis and simulation tools. Retrieved from https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstractid=2729296.","DOI":"10.2139\/ssrn.2729296"},{"key":"e_1_3_1_63_2","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3354206"},{"key":"e_1_3_1_64_2","unstructured":"Marcin Waniek Manuel Cebrian Petter Holme and Talal Rahwan. 2021. Social Diffusion Sources Can Escape Detection. Retrieved from https:\/\/arxiv.org\/abs\/cs.SI\/2102.10539."},{"key":"e_1_3_1_65_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i01.5451"},{"key":"e_1_3_1_66_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41562-017-0290-3"},{"key":"e_1_3_1_67_2","unstructured":"Marcin Waniek Jan Wonica Kai Zhou Yevgeniy Vorobeychik Talal Rahwan and Tomasz Michalak. 2021. Strategic Evasion of Centrality Measures. Retrieved from https:\/\/arxiv.org\/abs\/cs.SI\/2101.10648."},{"key":"e_1_3_1_68_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-48583-6"},{"key":"e_1_3_1_69_2","doi-asserted-by":"publisher","DOI":"10.5555\/3398761.3398930"},{"key":"e_1_3_1_70_2","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"e_1_3_1_71_2","article-title":"The John Jay & ARTIS Transnational Terrorism Database","author":"Wright Dominick","year":"2009","unstructured":"Dominick Wright. 2009. The John Jay & ARTIS Transnational Terrorism Database. Retrieved from http:\/\/doitapps.jjay.cuny.edu\/jjatt\/.","journal-title":"Retrieved from http:\/\/doitapps.jjay.cuny.edu\/jjatt\/"},{"issue":"2","key":"e_1_3_1_72_2","first-page":"754","article-title":"Target defense against link-prediction-based attacks via evolutionary perturbations","volume":"33","author":"Yu Shanqing","year":"2019","unstructured":"Shanqing Yu, Minghao Zhao, Chenbo Fu, Jun Zheng, Huimin Huang, Xincheng Shu, Qi Xuan, and Guanrong Chen. 2019. Target defense against link-prediction-based attacks via evolutionary perturbations. IEEE Trans. Knowl. Data Eng. 33, 2 (2019), 754\u2013767.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"e_1_3_1_73_2","doi-asserted-by":"crossref","unstructured":"Hengtong Zhang Tianhang Zheng Jing Gao Chenglin Miao Lu Su Yaliang Li and Kui Ren. 2019. Data Poisoning Attack against Knowledge Graph Embedding. Retrieved from https:\/\/arxiv.org\/abs\/cs.LG\/1904.12052.","DOI":"10.24963\/ijcai.2019\/674"},{"key":"e_1_3_1_74_2","doi-asserted-by":"publisher","DOI":"10.5555\/3306127.3331707"},{"key":"e_1_3_1_75_2","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330851"}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490462","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3490462","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:03Z","timestamp":1750188663000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3490462"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,29]]},"references-count":74,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2,28]]}},"alternative-id":["10.1145\/3490462"],"URL":"https:\/\/doi.org\/10.1145\/3490462","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"type":"print","value":"2157-6904"},{"type":"electronic","value":"2157-6912"}],"subject":[],"published":{"date-parts":[[2021,11,29]]},"assertion":[{"value":"2020-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-11-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}