{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T08:03:15Z","timestamp":1772611395625,"version":"3.50.1"},"reference-count":74,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T00:00:00Z","timestamp":1664323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T00:00:00Z","timestamp":1664323200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Belgian Defence","award":["DAP-19-03"],"award-info":[{"award-number":["DAP-19-03"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Recently proposed computational techniques allow the application of various maximum entropy network models at a larger scale. We focus on disinformation campaigns and apply different maximum entropy network models on the collection of datasets from the Twitter information operations report. For each dataset, we obtain additional Twitter data required to build an interaction network. We consider different interaction networks which we compare to an appropriate null model. The null model is used to identify statistically significant interactions. We validate our method and evaluate to what extent it is suited to identify communities of members of a disinformation campaign in a non-supervised way. We find that this method is suitable for larger social networks and allows to identify statistically significant interactions between users. Extracting the statistically significant interaction leads to the prevalence of users involved in a disinformation campaign being higher. We found that the use of different network models can provide different perceptions of the data and can lead to the identification of different meaningful patterns. We also test the robustness of the methods to illustrate the impact of missing data. Here we observe that sampling the correct data is of great importance to reconstruct an entire disinformation operation.<\/jats:p>","DOI":"10.1007\/s41109-022-00506-7","type":"journal-article","created":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T16:05:25Z","timestamp":1664381125000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Maximum entropy networks for large scale social network node analysis"],"prefix":"10.1007","volume":"7","author":[{"given":"Bart","family":"De Clerck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis E. C.","family":"Rocha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Filip","family":"Van Utterbeeck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,28]]},"reference":[{"issue":"1","key":"506_CR1","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1057\/s41599-019-0300-3","volume":"5","author":"C Becatti","year":"2019","unstructured":"Becatti C, Caldarelli G, Lambiotte R, Saracco F (2019) Extracting significant signal of news consumption from social networks: the case of twitter in Italian political elections. Palgrave Commun 5(1):91. https:\/\/doi.org\/10.1057\/s41599-019-0300-3","journal-title":"Palgrave Commun"},{"issue":"1","key":"506_CR2","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1111\/j.2517-6161.1995.tb02031.x","volume":"57","author":"Y Benjamini","year":"1995","unstructured":"Benjamini Y, Hochberg Y (1995) Controlling the false discovery rate: a practical and powerful approach to multiple testing. J R Stat Soc Ser B (Methodol) 57(1):289\u2013300","journal-title":"J R Stat Soc Ser B (Methodol)"},{"issue":"6","key":"506_CR3","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.87.062806","volume":"87","author":"G Bianconi","year":"2013","unstructured":"Bianconi G (2013) Statistical mechanics of multiplex networks: Entropy and overlap. Phys Rev E 87(6):062806. https:\/\/doi.org\/10.1103\/physreve.87.062806","journal-title":"Phys Rev E"},{"key":"506_CR4","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198753919.001.0001","volume-title":"Multilayer networks: structure and function","author":"G Bianconi","year":"2018","unstructured":"Bianconi G (2018) Multilayer networks: structure and function. Oxford University Press, Oxford"},{"issue":"10","key":"506_CR5","doi-asserted-by":"publisher","first-page":"10008","DOI":"10.1088\/1742-5468\/2008\/10\/p10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel VD, Guillaume J-L, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech Theory Exp 2008(10):10008. https:\/\/doi.org\/10.1088\/1742-5468\/2008\/10\/p10008","journal-title":"J Stat Mech Theory Exp"},{"issue":"1","key":"506_CR6","doi-asserted-by":"publisher","first-page":"11509","DOI":"10.1038\/s41598-018-29725-8","volume":"8","author":"M Byshkin","year":"2018","unstructured":"Byshkin M, Stivala A, Mira A, Robins G, Lomi A (2018) Fast maximum likelihood estimation via equilibrium expectation for large network data. Sci Rep 8(1):11509. https:\/\/doi.org\/10.1038\/s41598-018-29725-8","journal-title":"Sci Rep"},{"issue":"1","key":"506_CR7","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1038\/s42005-020-0340-4","volume":"3","author":"G Caldarelli","year":"2020","unstructured":"Caldarelli G, De Nicola R, Del Vigna F, Petrocchi M, Saracco F (2020) The role of bot squads in the political propaganda on twitter. Commun Phys 3(1):81. https:\/\/doi.org\/10.1038\/s42005-020-0340-4","journal-title":"Commun Phys"},{"issue":"1","key":"506_CR8","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1140\/epjds\/s13688-021-00289-4","volume":"10","author":"G Caldarelli","year":"2021","unstructured":"Caldarelli G, De Nicola R, Petrocchi M, Pratelli M, Saracco F (2021) Flow of online misinformation during the peak of the Covid-19 pandemic in Italy. EPJ Data Sci 10(1):34. https:\/\/doi.org\/10.1140\/epjds\/s13688-021-00289-4","journal-title":"EPJ Data Sci"},{"issue":"1","key":"506_CR9","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1186\/s12864-019-6413-7","volume":"21","author":"D Chicco","year":"2020","unstructured":"Chicco D, Jurman G (2020) The advantages of the Matthews correlation coefficient (MCC) over f1 score and accuracy in binary classification evaluation. BMC Genomics 21(1):6. https:\/\/doi.org\/10.1186\/s12864-019-6413-7","journal-title":"BMC Genomics"},{"issue":"1","key":"506_CR10","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1038\/s42254-018-0002-6","volume":"1","author":"G Cimini","year":"2019","unstructured":"Cimini G, Squartini T, Saracco F, Garlaschelli D, Gabrielli A, Caldarelli G (2019) The statistical physics of real-world networks. Nat Rev Phys 1(1):58\u201371. https:\/\/doi.org\/10.1038\/s42254-018-0002-6","journal-title":"Nat Rev Phys"},{"issue":"6","key":"506_CR11","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.93.062311","volume":"93","author":"OT Courtney","year":"2016","unstructured":"Courtney OT, Bianconi G (2016) Generalized network structures: the configuration model and the canonical ensemble of simplicial complexes. Phys Rev E 93(6):062311. https:\/\/doi.org\/10.1103\/physreve.93.062311","journal-title":"Phys Rev E"},{"key":"506_CR12","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-030-93413-2_12","volume-title":"Complex networks and their applications X","author":"B De Clerck","year":"2022","unstructured":"De Clerck B, Van Utterbeeck F, Petit J, Lauwens B, Mees W, Rocha LEC (2022) Maximum entropy networks applied on twitter disinformation datasets. In: Benito RM, Cherifi C, Cherifi H, Moro E, Rocha LM, Sales-Pardo M (eds) Complex networks and their applications X. Springer, Cham, pp 132\u2013143"},{"key":"506_CR13","doi-asserted-by":"publisher","first-page":"165201","DOI":"10.1109\/ACCESS.2020.3022867","volume":"8","author":"M Elhadad","year":"2020","unstructured":"Elhadad M, Li KF, Gebali F (2020) Detecting misleading information on Covid-19. IEEE Access 8:165201\u2013165215. https:\/\/doi.org\/10.1109\/ACCESS.2020.3022867","journal-title":"IEEE Access"},{"issue":"1","key":"506_CR14","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.78.015101","volume":"78","author":"D Garlaschelli","year":"2008","unstructured":"Garlaschelli D, Loffredo MI (2008) Maximum likelihood: extracting unbiased information from complex networks. Phys Rev E 78(1):015101. https:\/\/doi.org\/10.1103\/physreve.78.015101","journal-title":"Phys Rev E"},{"key":"506_CR15","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/978-3-030-36687-2_36","volume-title":"Complex networks and their applications VIII","author":"S Guarino","year":"2020","unstructured":"Guarino S, Trino N, Chessa A, Riotta G (2020) Beyond fact-checking: network analysis tools for monitoring disinformation in social media. In: Cherifi H, Gaito S, Mendes JF, Moro E, Rocha LM (eds) Complex networks and their applications VIII. Springer, Cham, pp 436\u2013447"},{"issue":"3","key":"506_CR16","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme P, Saram\u00e4ki J (2012) Temporal networks. Phys Rep 519(3):97\u2013125. https:\/\/doi.org\/10.1016\/j.physrep.2012.03.001","journal-title":"Phys Rep"},{"issue":"4","key":"506_CR17","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1080\/10618600.2012.732921","volume":"21","author":"DR Hunter","year":"2012","unstructured":"Hunter DR, Krivitsky PN, Schweinberger M (2012) Computational statistical methods for social network models. J Comput Graph Stat 21(4):856\u2013882. https:\/\/doi.org\/10.1080\/10618600.2012.732921","journal-title":"J Comput Graph Stat"},{"issue":"6","key":"506_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0098679","volume":"9","author":"M Jacomy","year":"2014","unstructured":"Jacomy M, Venturini T, Heymann S, Bastian M (2014) ForceAtlas2, a continuous graph layout algorithm for handy network visualization designed for the Gephi software. PLOS ONE 9(6):1\u201312. https:\/\/doi.org\/10.1371\/journal.pone.0098679","journal-title":"PLOS ONE"},{"issue":"1","key":"506_CR19","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.73.016102","volume":"73","author":"SH Lee","year":"2006","unstructured":"Lee SH, Kim P-J, Jeong H (2006) Statistical properties of sampled networks. Phys Rev E 73(1):016102. https:\/\/doi.org\/10.1103\/physreve.73.016102","journal-title":"Phys Rev E"},{"key":"506_CR20","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.cag.2019.08.006","volume":"84","author":"CDG Linhares","year":"2019","unstructured":"Linhares CDG, Ponciano JR, Pereira FSF, Rocha LEC, Paiva JGS, Traven\u00e7olo BAN (2019) A scalable node ordering strategy based on community structure for enhanced temporal network visualization. Comput Graph 84:185\u2013198. https:\/\/doi.org\/10.1016\/j.cag.2019.08.006","journal-title":"Comput Graph"},{"issue":"11","key":"506_CR21","doi-asserted-by":"publisher","first-page":"1716","DOI":"10.1093\/bioinformatics\/btw029","volume":"32","author":"V Madar","year":"2016","unstructured":"Madar V, Batista S (2016) FastLSU: a more practical approach for the Benjamini\u2013Hochberg FDR controlling procedure for huge-scale testing problems. Bioinformatics 32(11):1716\u20131723. https:\/\/doi.org\/10.1093\/bioinformatics\/btw029","journal-title":"Bioinformatics"},{"issue":"4","key":"506_CR22","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/16\/4\/043022","volume":"16","author":"R Mastrandrea","year":"2014","unstructured":"Mastrandrea R, Squartini T, Fagiolo G, Garlaschelli D (2014) Enhanced reconstruction of weighted networks from strengths and degrees. New J Phys 16(4):043022. https:\/\/doi.org\/10.1088\/1367-2630\/16\/4\/043022","journal-title":"New J Phys"},{"key":"506_CR23","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1140\/epjds\/s13688-021-00301-x","volume":"10","author":"M Mattei","year":"2021","unstructured":"Mattei M, Caldarelli G, Squartini T, Saracco F (2021) Italian twitter semantic network during the Covid-19 epidemic. EPJ Data Sci 10:47","journal-title":"EPJ Data Sci"},{"issue":"2","key":"506_CR24","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1016\/0005-2795(75)90109-9","volume":"405","author":"BW Matthews","year":"1975","unstructured":"Matthews BW (1975) Comparison of the predicted and observed secondary structure of T4 phage lysozyme. Biochim Biophys Acta (BBA) Protein Struct 405(2):442\u2013451. https:\/\/doi.org\/10.1016\/0005-2795(75)90109-9","journal-title":"Biochim Biophys Acta (BBA) Protein Struct"},{"key":"506_CR25","doi-asserted-by":"publisher","DOI":"10.7249\/RR2713","volume-title":"Hostile social manipulation: present realities and emerging trends","author":"MJ Mazarr","year":"2019","unstructured":"Mazarr MJ, Casey A, Demus A, Harold SW, Matthews LJ, Beauchamp-Mustafaga N, Sladden J (2019) Hostile social manipulation: present realities and emerging trends. RAND Corporation, Santa Monica"},{"issue":"23","key":"506_CR26","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"MEJ Newman","year":"2006","unstructured":"Newman MEJ (2006) Modularity and community structure in networks. Proc Natl Acad Sci 103(23):8577\u20138582. https:\/\/doi.org\/10.1073\/pnas.0601602103","journal-title":"Proc Natl Acad Sci"},{"issue":"2","key":"506_CR27","doi-asserted-by":"publisher","DOI":"10.1103\/physreve.69.026113","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026113. https:\/\/doi.org\/10.1103\/physreve.69.026113","journal-title":"Phys Rev E"},{"issue":"07","key":"506_CR28","doi-asserted-by":"publisher","first-page":"2050101","DOI":"10.1142\/s0129183120501016","volume":"31","author":"H Noorazar","year":"2020","unstructured":"Noorazar H, Vixie KR, Talebanpour A, Hu Y (2020) From classical to modern opinion dynamics. Int J Mod Phys C 31(07):2050101. https:\/\/doi.org\/10.1142\/s0129183120501016","journal-title":"Int J Mod Phys C"},{"issue":"1","key":"506_CR29","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s41109-018-0073-4","volume":"3","author":"F Parisi","year":"2018","unstructured":"Parisi F, Caldarelli G, Squartini T (2018) Entropy-based approach to missing-links prediction. Appl Netw Sci 3(1):17. https:\/\/doi.org\/10.1007\/s41109-018-0073-4","journal-title":"Appl Netw Sci"},{"key":"506_CR30","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.066117","volume":"70","author":"J Park","year":"2004","unstructured":"Park J, Newman MEJ (2004) Statistical mechanics of networks. Phys Rev E 70:066117. https:\/\/doi.org\/10.1103\/PhysRevE.70.066117","journal-title":"Phys Rev E"},{"issue":"1","key":"506_CR31","doi-asserted-by":"publisher","first-page":"7261","DOI":"10.1038\/s41598-019-43830-2","volume":"9","author":"N Perra","year":"2019","unstructured":"Perra N, Rocha LEC (2019) Modelling opinion dynamics in the age of algorithmic personalisation. Sci Rep 9(1):7261. https:\/\/doi.org\/10.1038\/s41598-019-43830-2","journal-title":"Sci Rep"},{"key":"506_CR32","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.96.052302","volume":"96","author":"LEC Rocha","year":"2017","unstructured":"Rocha LEC, Masuda N, Holme P (2017) Sampling of temporal networks: methods and biases. Phys Rev E 96:052302. https:\/\/doi.org\/10.1103\/PhysRevE.96.052302","journal-title":"Phys Rev E"},{"issue":"5","key":"506_CR33","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/aa6b38","volume":"19","author":"F Saracco","year":"2017","unstructured":"Saracco F, Straka MJ, Clemente RD, Gabrielli A, Caldarelli G, Squartini T (2017) Inferring monopartite projections of bipartite networks: an entropy-based approach. New J Phys 19(5):053022. https:\/\/doi.org\/10.1088\/1367-2630\/aa6b38","journal-title":"New J Phys"},{"key":"506_CR34","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-030-05414-4_34","volume-title":"Complex networks and their applications VII","author":"R Schuchard","year":"2019","unstructured":"Schuchard R, Crooks A, Stefanidis A, Croitoru A (2019) Bots in nets: empirical comparative analysis of bot evidence in social networks. In: Aiello LM, Cherifi C, Cherifi H, Lambiotte R, Li\u00f3 P, Rocha LM (eds) Complex networks and their applications VII. Springer, Cham, pp 424\u2013436"},{"issue":"4","key":"506_CR35","doi-asserted-by":"publisher","first-page":"2011216118","DOI":"10.1073\/pnas.2011216118","volume":"118","author":"ST Smith","year":"2021","unstructured":"Smith ST, Kao EK, Mackin ED, Shah DC, Simek O, Rubin DB (2021) Automatic detection of influential actors in disinformation networks. Proc Natl Acad Sci 118(4):2011216118. https:\/\/doi.org\/10.1073\/pnas.2011216118","journal-title":"Proc Natl Acad Sci"},{"issue":"8","key":"506_CR36","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/13\/8\/083001","volume":"13","author":"T Squartini","year":"2011","unstructured":"Squartini T, Garlaschelli D (2011) Analytical maximum-likelihood method to detect patterns in real networks. New J Phys 13(8):083001. https:\/\/doi.org\/10.1088\/1367-2630\/13\/8\/083001","journal-title":"New J Phys"},{"issue":"1","key":"506_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0227804","volume":"15","author":"A Stivala","year":"2020","unstructured":"Stivala A, Robins G, Lomi A (2020) Exponential random graph model parameter estimation for very large directed networks. PLOS ONE 15(1):1\u201321. https:\/\/doi.org\/10.1371\/journal.pone.0227804","journal-title":"PLOS ONE"},{"key":"506_CR38","doi-asserted-by":"publisher","first-page":"286","DOI":"10.3389\/fphy.2020.00286","volume":"8","author":"N Vallarano","year":"2020","unstructured":"Vallarano N, Tessone CJ, Squartini T (2020) Bitcoin transaction networks: an overview of recent results. Front Phys 8:286. https:\/\/doi.org\/10.3389\/fphy.2020.00286","journal-title":"Front Phys"},{"issue":"1","key":"506_CR39","doi-asserted-by":"publisher","first-page":"15227","DOI":"10.1038\/s41598-021-93830-4","volume":"11","author":"N Vallarano","year":"2021","unstructured":"Vallarano N, Bruno M, Marchese E, Trapani G, Saracco F, Cimini G, Zanon M, Squartini T (2021) Fast and scalable likelihood maximization for exponential random graph models with local constraints. Sci Rep 11(1):15227. https:\/\/doi.org\/10.1038\/s41598-021-93830-4","journal-title":"Sci Rep"},{"key":"506_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2019\/5120581","volume":"209","author":"J van Lidth de Jeude","year":"2019","unstructured":"van Lidth de Jeude J, Di Clemente R, Caldarelli G, Saracco F, Squartini T (2019) Reconstructing mesoscale network structures. Complexity 209:1\u201313. https:\/\/doi.org\/10.1155\/2019\/5120581","journal-title":"Complexity"},{"issue":"2","key":"506_CR41","first-page":"295","volume":"3","author":"YH Wang","year":"1993","unstructured":"Wang YH (1993) On the number of successes in independent trials. Stat Sin 3(2):295\u2013312","journal-title":"Stat Sin"},{"key":"506_CR42","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-030-05414-4_35","volume-title":"Complex networks and their applications VII","author":"M-H Wang","year":"2019","unstructured":"Wang M-H, Nguyen N-L, Dow C-R (2019) Detecting potential cyber armies of election campaigns based on behavioral analysis. In: Aiello LM, Cherifi C, Cherifi H, Lambiotte R, Li\u00f3 P, Rocha LM (eds) Complex networks and their applications VII. Springer, Cham, pp 437\u2013446"},{"issue":"01","key":"506_CR43","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1609\/aaai.v34i01.5460","volume":"34","author":"K-C Yang","year":"2020","unstructured":"Yang K-C, Varol O, Hui P-M, Menczer F (2020) Scalable and generalizable social bot detection through data selection. Proc AAAI Conf Artif Intell 34(01):1096\u20131103. https:\/\/doi.org\/10.1609\/aaai.v34i01.5460","journal-title":"Proc AAAI Conf Artif Intell"},{"issue":"46","key":"506_CR44","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8113\/48\/46\/465002","volume":"48","author":"K Zuev","year":"2015","unstructured":"Zuev K, Eisenberg O, Krioukov D (2015) Exponential random simplicial complexes. J Phys A Math Theor 48(46):465002. https:\/\/doi.org\/10.1088\/1751-8113\/48\/46\/465002","journal-title":"J Phys A Math Theor"},{"key":"506_CR45","doi-asserted-by":"publisher","unstructured":"Achlioptas D, Clauset A, Kempe D, Moore C (2006) On the bias of traceroute sampling: or, power-law degree distributions in regular graphs. J ACM 56(4). https:\/\/doi.org\/10.1145\/1538902.1538905","DOI":"10.1145\/1538902.1538905"},{"key":"506_CR46","doi-asserted-by":"publisher","unstructured":"Baltakiene M, Baltakys K, Cardamone D, Parisi F, Radicioni T, Torricelli M, van Lidth de Jeude JA, Saracco F (2018) Maximum entropy approach to link prediction in bipartite networks. arXiv. https:\/\/doi.org\/10.48550\/arxiv.1805.04307","DOI":"10.48550\/arxiv.1805.04307"},{"key":"506_CR47","doi-asserted-by":"publisher","unstructured":"Bianconi G (2021) Higher-order networks. In: Elements in structure and dynamics of complex networks. Cambridge University Press, Cambridge. https:\/\/doi.org\/10.1017\/9781108770996","DOI":"10.1017\/9781108770996"},{"key":"506_CR48","unstructured":"Bie TD (2010) Maximum entropy models and subjective interestingness: an application to tiles in binary databases. CoRR arXiv:1008.3314"},{"key":"506_CR49","unstructured":"Bradshaw S, Howard PN (2018) Challenging truth and trust: a global inventory of organized social media manipulation. Technical report, Oxford Internet Institute"},{"key":"506_CR50","doi-asserted-by":"crossref","unstructured":"Bruno M, Lambiotte R, Saracco F (2021) Brexit and bots: characterizing the behaviour of automated accounts on twitter during the UK election. arXiv:2107.14155","DOI":"10.1140\/epjds\/s13688-022-00330-0"},{"key":"506_CR51","unstructured":"Bush D (2020) Fighting like a lion for Serbia: an analysis of government-linked influence operations in Serbia. Technical report, Stanford Internet Observatory Cyber Policy Center"},{"key":"506_CR52","unstructured":"Cryst E, Garc\u00eda-Camargo I (2020) An analysis of twitter\u2019s takedown of Honduran accounts an analysis of Twitter\u2019s takedown of Honduran accounts an analysis of twitter\u2019s takedown of Honduran accounts. Technical report, Stanford Internet Observatory Cyber Policy Center"},{"key":"506_CR53","doi-asserted-by":"publisher","unstructured":"Dianati N (2016) A maximum entropy approach to separating noise from signal in bimodal affiliation networks. arXiv. https:\/\/doi.org\/10.48550\/arxiv.1607.01735","DOI":"10.48550\/arxiv.1607.01735"},{"key":"506_CR54","unstructured":"DiResta R, Kheradpir T, Miller C (2020) \u201cThe world is swimming in a sea of rumors\u201d: influence operations associated with el FAGR newspaper (Egypt). Technical report, Stanford Internet Observatory Cyber Policy Center"},{"key":"506_CR55","doi-asserted-by":"crossref","unstructured":"Elhadad MK, Li KF, Gebali F (2021) Covid-19-fakes: a twitter (Arabic\/English) dataset for detecting misleading information on Covid-19. In: Barolli L, Li KF, Miwa H (eds) Advances in intelligent networking and collaborative systems. Springer, Cham, pp 256\u2013268","DOI":"10.1007\/978-3-030-57796-4_25"},{"key":"506_CR56","unstructured":"FactCheck.org (2003) FactCheck.org. https:\/\/www.factcheck.org. Accessed 20 Feb 2022"},{"key":"506_CR57","unstructured":"Grossman SHK, DiResta R, Kheradpir T, Miller C (2020) Blame it on Iran, Gatar, and Turkey: An analysis of a twitter and Facebook operation linked to Egypt, the UAE, and Saudi Arabia. Technical report, Stanford Internet Observatory Cyber Policy Center"},{"key":"506_CR58","doi-asserted-by":"crossref","unstructured":"Guilbeault D, Becker J, Centola D (2017) Complex contagions: a decade in review. CoRR arXiv:1710.07606","DOI":"10.1007\/978-3-319-77332-2_1"},{"key":"506_CR59","unstructured":"Linvill DL, Warren PL (2018) Troll factories: the internet research agency and state-sponsored agenda building"},{"key":"506_CR60","unstructured":"Marchal N, Neudert L-M, Kollanyi B, Howard PN (2018) Polarization, partisanship and junk news consumption on social media during the 2018 us midterm elections. Oxford Internet Institute, Oxford, UK"},{"key":"506_CR61","unstructured":"Nizzoli L, Tardelli S, Avvenuti M, Cresci S, Tesconi M (2020) Coordinated behavior on social media in 2019 UK general election. CoRR arXiv:2008.08370"},{"key":"506_CR62","doi-asserted-by":"crossref","unstructured":"Pacheco D, Flammini A, Menczer F (2020) Unveiling coordinated groups behind white helmets disinformation. CoRR arXiv:2003.01313","DOI":"10.1145\/3366424.3385775"},{"key":"506_CR63","unstructured":"Pacheco D, Hui P, Torres-Lugo C, Truong BT, Flammini A, Menczer F (2020) Uncovering coordinated networks on social media. CoRR arXiv:2001.05658"},{"key":"506_CR64","unstructured":"POLITIFACT (2007) https:\/\/www.politifact.com. Accessed 20 Feb 2022"},{"key":"506_CR65","doi-asserted-by":"crossref","unstructured":"Radicioni T, Pavan E, Squartini T, Saracco F (2020) Analysing twitter semantic networks: the case of 2018 Italian elections. CoRR arXiv:2009.02960","DOI":"10.1038\/s41598-021-92337-2"},{"key":"506_CR66","doi-asserted-by":"crossref","unstructured":"Radicioni T, Squartini T, Pavan E, Saracco F (2021) Networked partisanship and framing: a socio-semantic network analysis of the Italian debate on migration. CoRR arXiv:2103.04653","DOI":"10.1371\/journal.pone.0256705"},{"key":"506_CR67","doi-asserted-by":"publisher","unstructured":"Shao C, Ciampaglia G, Flammini A, Menczer F (2016) Hoaxy: a platform for tracking online misinformation. In: WWW \u201916 Companion: proceedings of the 25th international conference companion on World Wide Web. https:\/\/doi.org\/10.1145\/2872518.2890098","DOI":"10.1145\/2872518.2890098"},{"key":"506_CR68","unstructured":"Sharma K, Ferrara E, Liu Y (2020) Identifying coordinated accounts in disinformation campaigns. CoRR arXiv:2008.11308"},{"key":"506_CR69","unstructured":"Tackling Online Disinformation (2018) Technical report, European Commission. https:\/\/digital-strategy.ec.europa.eu\/en\/policies\/online-disinformation"},{"key":"506_CR70","doi-asserted-by":"crossref","unstructured":"Traag VA, Waltman L, van Eck NJ (2018) From Louvain to Leiden: guaranteeing well-connected communities. CoRR arXiv:1810.08473","DOI":"10.1038\/s41598-019-41695-z"},{"key":"506_CR71","unstructured":"Twitter (2021) Twitter transparency reports. Technical report. https:\/\/transparency.twitter.com\/en\/reports\/information- operations.html"},{"key":"506_CR72","unstructured":"EU Vs DiSiNFO (2015) https:\/\/euvsdisinfo.eu. Accessed 20 Feb 2022"},{"key":"506_CR73","doi-asserted-by":"crossref","unstructured":"Weber D, Neumann F (2021) A general method to find highly coordinating communities in social media through inferred interaction links. CoRR arXiv:2103.03409","DOI":"10.1109\/ASONAM49781.2020.9381418"},{"key":"506_CR74","doi-asserted-by":"publisher","unstructured":"Woolley SC, Howard PN (eds) (2018) Computational propaganda: political parties, politicians, and political manipulation on social media. In: Oxford studies in digital politics. Oxford University Press, New York, p 288. https:\/\/doi.org\/10.1093\/oso\/9780190931407.001.0001","DOI":"10.1093\/oso\/9780190931407.001.0001"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-022-00506-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-022-00506-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-022-00506-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,4]],"date-time":"2024-10-04T21:35:12Z","timestamp":1728077712000},"score":1,"resource":{"primary":{"URL":"https:\/\/appliednetsci.springeropen.com\/articles\/10.1007\/s41109-022-00506-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,28]]},"references-count":74,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,12]]}},"alternative-id":["506"],"URL":"https:\/\/doi.org\/10.1007\/s41109-022-00506-7","relation":{},"ISSN":["2364-8228"],"issn-type":[{"value":"2364-8228","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,28]]},"assertion":[{"value":"28 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"68"}}