{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T00:53:51Z","timestamp":1776214431236,"version":"3.50.1"},"reference-count":69,"publisher":"Oxford University Press (OUP)","issue":"1","funder":[{"DOI":"10.13039\/501100001807","name":"FAPESP","doi-asserted-by":"publisher","award":["2016\/19069-9"],"award-info":[{"award-number":["2016\/19069-9"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"FAPESP","doi-asserted-by":"publisher","award":["2015\/08003-4"],"award-info":[{"award-number":["2015\/08003-4"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"FAPESP","doi-asserted-by":"publisher","award":["2015\/05676-8"],"award-info":[{"award-number":["2015\/05676-8"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"FAPESP","doi-asserted-by":"publisher","award":["2014\/20830-0"],"award-info":[{"award-number":["2014\/20830-0"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"FAPESP","doi-asserted-by":"publisher","award":["2011\/50761-2"],"award-info":[{"award-number":["2011\/50761-2"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,2,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Statistical techniques that analyse texts, referred to as text analytics, have departed from the use of simple word count statistics towards a new paradigm. Text mining now hinges on a more sophisticated set of methods, including the representations in terms of complex networks. While well-established word-adjacency (co-occurrence) methods successfully grasp syntactical features of written texts, they are unable to represent important aspects of textual data, such as its topical structure, that is the sequence of subjects developing at a mesoscopic level along the text. Such aspects are often overlooked by current methodologies. In order to grasp the mesoscopic characteristics of semantical content in written texts, we devised a network model which is able to analyse documents in a multi-scale fashion. In the proposed model, a limited amount of adjacent paragraphs are represented as nodes, which are connected whenever they share a minimum semantical content. To illustrate the capabilities of our model, we present, as a case example, a qualitative analysis of \u2018Alice\u2019s Adventures in Wonderland\u2019. We show that the mesoscopic structure of a document, modelled as a network, reveals many semantic traits of texts. Such an approach paves the way to a myriad of semantic-based applications. In addition, our approach is illustrated in a machine learning context, in which texts are classified among real texts and randomized instances.<\/jats:p>","DOI":"10.1093\/comnet\/cnx023","type":"journal-article","created":{"date-parts":[[2017,6,17]],"date-time":"2017-06-17T15:08:12Z","timestamp":1497712092000},"page":"125-144","source":"Crossref","is-referenced-by-count":28,"title":["Representation of texts as complex networks: a mesoscopic approach"],"prefix":"10.1093","volume":"6","author":[{"given":"Henrique","family":"Ferraz de Arruda","sequence":"first","affiliation":[{"name":"Institute of Mathematics and Computer Science, University of S\u00e3o Paulo, Avenida Trabalhador Sancarlense, 400 - Centro, S\u00e3o Carlos - SP, 13566-590, Brazil"}]},{"given":"Filipi","family":"Nascimento Silva","sequence":"additional","affiliation":[{"name":"S\u00e3o Carlos Institute of Physics, University of S\u00e3o Paulo, S\u00e3o Avenida Trabalhador Sancarlense, 400 - Centro, S\u00e3o Carlos - SP, 13566-590, Brazil"}]},{"given":"Vanessa","family":"Queiroz Marinho","sequence":"additional","affiliation":[{"name":"Institute of Mathematics and Computer Science, University of S\u00e3o Paulo, Avenida Trabalhador Sancarlense, 400 - Centro, S\u00e3o Carlos - SP, 13566-590, Brazil"}]},{"given":"Diego","family":"Raphael Amancio","sequence":"additional","affiliation":[{"name":"Institute of Mathematics and Computer Science, University of S\u00e3o Paulo, Avenida Trabalhador Sancarlense, 400 - Centro, S\u00e3o Carlos - SP, 13566-590, Brazil"}]},{"given":"Luciano","family":"da Fontoura Costa","sequence":"additional","affiliation":[{"name":"S\u00e3o Carlos Institute of Physics, University of S\u00e3o Paulo, Avenida Trabalhador Sancarlense, 400 - Centro, S\u00e3o Carlos - SP, 13566-590, Brazil"}]}],"member":"286","published-online":{"date-parts":[[2017,7,26]]},"reference":[{"key":"2026041420032877800_B1","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.physrep.2005.10.009","article-title":"Complex networks: structure and dynamics.","volume":"424","author":"Boccaletti,","year":"2006","journal-title":"Phys. Rep."},{"key":"2026041420032877800_B2","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1038\/nrg1272","article-title":"Network biology: understanding the cell\u2019s functional organization.","volume":"5","author":"Barabasi,","year":"2004","journal-title":"Nat. Rev. Genet."},{"key":"2026041420032877800_B3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jneumeth.2015.02.019","article-title":"A framework for analyzing the relationship between gene expression and morphological, topological, and dynamical patterns in neuronal networks.","volume":"245","author":"de Arruda,","year":"2015","journal-title":"J. Neurosci. Methods"},{"key":"2026041420032877800_B4","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1038\/nrg2918","article-title":"Network medicine: a network-based approach to human disease.","volume":"12","author":"Barab\u00e1si,","year":"2011","journal-title":"Nat. Rev. Genet."},{"key":"2026041420032877800_B5","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1080\/09296174.2014.1001636","article-title":"Word-length entropies and correlations of natural language written texts.","volume":"22","author":"Kalimeri,","year":"2015","journal-title":"J. Quant. Linguist."},{"key":"2026041420032877800_B6","doi-asserted-by":"crossref","first-page":"066130","DOI":"10.1103\/PhysRevE.69.066130","article-title":"Dynamics of rumor spreading in complex networks.","volume":"69","author":"Moreno,","year":"2004","journal-title":"Phys. Rev. E"},{"key":"2026041420032877800_B7","volume-title":"Foundations of Statistical Natural Language Processing","author":"Manning,","year":"1999"},{"key":"2026041420032877800_B8","doi-asserted-by":"crossref","first-page":"e7678","DOI":"10.1371\/journal.pone.0007678","article-title":"Beyond word frequency: bursts, lulls, and scaling in the temporal distributions of words.","volume":"4","author":"Altmann,","year":"2009","journal-title":"PLoS One"},{"key":"2026041420032877800_B9","article-title":"Text mining with information extraction.","volume":"Vol. 1.","author":"Nahm,","year":"2002","journal-title":"AAAI 2002 Spring Symposium on Mining Answers from Texts and Knowledge Bases"},{"key":"2026041420032877800_B10","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1145\/383952.383974","article-title":"A statistical learning learning model of text classification for support vector machines.","volume-title":"Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval","author":"Joachims,","year":"2001"},{"key":"2026041420032877800_B11","first-page":"19","article-title":"A brief survey of text mining.","volume":"Vol. 20.","author":"Hotho,","year":"2005","journal-title":"Ldv Forum"},{"key":"2026041420032877800_B12","article-title":"Using tf-idf to determine word relevance in document queries.","author":"Ramos,","year":"2003","journal-title":"Proceedings of the First Instructional Conference on Machine Learning"},{"key":"2026041420032877800_B13","first-page":"3","article-title":"On-line lda: adaptive topic models for mining text streams with applications to topic detection and tracking.","volume-title":"ICDM\u201908 Eighth IEEE International Conference on Data Mining, 2008","author":"AlSumait,","year":"2008"},{"key":"2026041420032877800_B14","first-page":"993","article-title":"Latent dirichlet allocation.","volume":"3","author":"Blei,","year":"2003","journal-title":"J. Mach. Learn. Res."},{"key":"2026041420032877800_B15","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1080\/01638539809545028","article-title":"An introduction to latent semantic analysis.","volume":"25","author":"Landauer,","year":"1998","journal-title":"Discourse Process."},{"key":"2026041420032877800_B16","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/345508.345582","article-title":"An investigation of linguistic features and clustering algorithms for topical document clustering.","volume-title":"Proceedings of the 23rd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval","author":"Hatzivassiloglou,","year":"2000"},{"key":"2026041420032877800_B17","first-page":"1689","article-title":"Latent dirichlet learning for document summarization.","volume-title":"IEEE International Conference on Acoustics, Speech and Signal Processing, 2009. ICASSP 2009.","author":"Chang,","year":"2009"},{"key":"2026041420032877800_B18","first-page":"222","article-title":"Overlapping target event and story line detection of online newspaper articles.","volume-title":"IEEE International Conference on Data Science and Advanced Analytics (DSAA), 2016","author":"Wei,","year":"2016"},{"key":"2026041420032877800_B19","first-page":"142","article-title":"Learning word vectors for sentiment analysis.","volume-title":"Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies-Volume 1","author":"Maas,","year":"2011"},{"key":"2026041420032877800_B20","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/978-3-642-23199-5_28","article-title":"Authorship similarity detection from email messages.","volume-title":"Machine Learning and Data Mining in Pattern Recognition","author":"Chen,","year":"2011"},{"key":"2026041420032877800_B21","doi-asserted-by":"crossref","first-page":"2436","DOI":"10.1109\/TVCG.2013.196","article-title":"Storyflow: tracking the evolution of stories.","volume":"19","author":"Liu,","year":"2013","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"2026041420032877800_B22","doi-asserted-by":"crossref","first-page":"1650005","DOI":"10.1142\/S0219525916500053","article-title":"Temporal network analysis of literary texts.","volume":"19","author":"Prado,","year":"2016","journal-title":"Adv. Complex Syst."},{"key":"2026041420032877800_B23","doi-asserted-by":"crossref","first-page":"2679","DOI":"10.1109\/TVCG.2012.212","article-title":"Design considerations for optimizing storyline visualizations.","volume":"18","author":"Tanahashi,","year":"2012","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"2026041420032877800_B24","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1140\/epjds\/s13688-016-0093-1","article-title":"The emotional arcs of stories are dominated by six basic shapes.","volume":"5","author":"Reagan,","year":"2016","journal-title":"EPJ Data Science"},{"key":"2026041420032877800_B25","doi-asserted-by":"crossref","first-page":"4406","DOI":"10.1016\/j.physa.2012.04.011","article-title":"Structure\u2013semantics interplay in complex networks and its effects on the predictability of similarity in texts.","volume":"391","author":"Amancio,","year":"2012","journal-title":"Phys. A"},{"key":"2026041420032877800_B26","doi-asserted-by":"crossref","first-page":"032810.","DOI":"10.1103\/PhysRevE.91.032810","article-title":"Modeling the average shortest-path length in growth of word-adjacency networks.","volume":"91","author":"Kulig,","year":"2015","journal-title":"Phys. Rev. E"},{"key":"2026041420032877800_B27","doi-asserted-by":"crossref","first-page":"051915.","DOI":"10.1103\/PhysRevE.69.051915","article-title":"Patterns in syntactic dependency networks.","volume":"69","author":"Cancho,","year":"2004","journal-title":"Phys. Rev. E"},{"key":"2026041420032877800_B28","first-page":"82","article-title":"Techniques and applications for sentiment analysis.","volume-title":"Commun","author":"Feldman,","year":"2013"},{"key":"2026041420032877800_B29","doi-asserted-by":"crossref","first-page":"P03005.","DOI":"10.1088\/1742-5468\/2015\/03\/P03005","article-title":"Authorship recognition via fluctuation analysis of network topology and word intermittency.","volume":"2015","author":"Amancio,","year":"2015","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"2026041420032877800_B30","doi-asserted-by":"crossref","first-page":"2429","DOI":"10.1016\/j.physa.2011.12.011","article-title":"The complex networks approach for authorship attribution of books.","volume":"391","author":"Mehri,","year":"2012","journal-title":"Phys. A"},{"key":"2026041420032877800_B31","doi-asserted-by":"crossref","first-page":"5464","DOI":"10.1109\/TSP.2015.2451111","article-title":"Authorship attribution through function word adjacency networks.","volume":"63","author":"Segarra,","year":"2015","journal-title":"IEEE Trans. Signal Process."},{"key":"2026041420032877800_B32","doi-asserted-by":"crossref","first-page":"e0136076.","DOI":"10.1371\/journal.pone.0136076","article-title":"A complex network approach to stylometry.","volume":"10","author":"Amancio,","year":"2015","journal-title":"PLoS One"},{"key":"2026041420032877800_B33","doi-asserted-by":"crossref","first-page":"28007.","DOI":"10.1209\/0295-5075\/113\/28007","article-title":"Using complex networks for text classification: discriminating informative and imaginative documents.","volume":"113","author":"Arruda,","year":"2016","journal-title":"Europhys. Lett."},{"key":"2026041420032877800_B34","doi-asserted-by":"crossref","first-page":"18002.","DOI":"10.1209\/0295-5075\/98\/18002","article-title":"Unveiling the relationship between complex networks metrics and word senses.","volume":"98","author":"Amancio,","year":"2012","journal-title":"Europhys. Lett."},{"key":"2026041420032877800_B35","doi-asserted-by":"crossref","DOI":"10.3115\/1220355.1220517","article-title":"Pagerank on semantic networks, with application to word sense disambiguation.","volume-title":"Proceedings of the 20th International Conference on Computational Linguistics","author":"Mihalcea,","year":"2004"},{"key":"2026041420032877800_B36","doi-asserted-by":"crossref","first-page":"58001.","DOI":"10.1209\/0295-5075\/98\/58001","article-title":"Word sense disambiguation via high order of learning in complex networks.","volume":"98","author":"Silva,","year":"2012","journal-title":"Europhys. Lett."},{"key":"2026041420032877800_B37","doi-asserted-by":"crossref","first-page":"1855","DOI":"10.1016\/j.physa.2011.10.015","article-title":"Extractive summarization using complex networks and syntactic dependency.","volume":"391","author":"Amancio,","year":"2012","journal-title":"Phys. A"},{"key":"2026041420032877800_B38","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1016\/j.ins.2008.10.032","article-title":"A complex network approach to text summarization.","volume":"179","author":"Antiqueira,","year":"2009","journal-title":"Inf. Sci."},{"key":"2026041420032877800_B39","doi-asserted-by":"crossref","first-page":"026103.","DOI":"10.1103\/PhysRevE.80.026103","article-title":"Node matching between complex networks.","volume":"80","author":"Xuan,","year":"2009","journal-title":"Phys. Rev. E"},{"key":"2026041420032877800_B40","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1371\/journal.pone.0067310","article-title":"Probing the statistical properties of unknown texts: application to the Voynich manuscript.","volume":"8","author":"Amancio,","year":"2013","journal-title":"PLOS One"},{"key":"2026041420032877800_B41","first-page":"063120.","article-title":"Topic segmentation via community detection in complex networks.","volume-title":"Chaos","author":"de Arruda,","year":"2016"},{"key":"2026041420032877800_B42","volume-title":"Data Mining: Concepts and Techniques","author":"Han,","year":"2005"},{"key":"2026041420032877800_B43","first-page":"1129","article-title":"Graph drawing by force-directed placement.","volume":"21","author":"Fruchterman,","year":"1991","journal-title":"Software: Practice and experience"},{"key":"2026041420032877800_B44","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","article-title":"Collective dynamics of \u2018small-world\u2019 networks.","volume":"393","author":"Watts,","year":"1998","journal-title":"Nature"},{"key":"2026041420032877800_B45","doi-asserted-by":"crossref","first-page":"123024.","DOI":"10.1088\/1367-2630\/13\/12\/123024","article-title":"Comparing intermittency and network measurements of words and their dependence on authorship.","volume":"13","author":"Amancio,","year":"2011","journal-title":"New J. Phys."},{"key":"2026041420032877800_B46","doi-asserted-by":"crossref","first-page":"026102.","DOI":"10.1103\/PhysRevE.74.026102","article-title":"Network properties of written human language.","volume":"74","author":"Masucci,","year":"2006","journal-title":"Phys. Rev. E"},{"key":"2026041420032877800_B47","doi-asserted-by":"crossref","first-page":"2561","DOI":"10.1016\/j.physa.2009.02.043","article-title":"English and chinese languages as weighted complex networks.","volume":"388","author":"Sheng,","year":"2009","journal-title":"Phys. A"},{"key":"2026041420032877800_B48","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/s00422-004-0479-1","article-title":"Edge vulnerability in neural and metabolic networks.","volume":"90","author":"Kaiser,","year":"2004","journal-title":"Biol. Cybernet."},{"key":"2026041420032877800_B49","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: An Introduction","author":"Newman,","year":"2010"},{"key":"2026041420032877800_B50","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/978-1-4615-1079-6_12","article-title":"Graph theory methods for the analysis of neural connectivity patterns.","volume-title":"Neuroscience Databases","author":"Sporns,","year":"2003"},{"key":"2026041420032877800_B51","first-page":"290","volume-title":"Statistical Methods-Combined Edition, Vols. i and ii","author":"Das,","year":"2008"},{"key":"2026041420032877800_B52","volume-title":"Principal Component Analysis","author":"Jolliffe,","year":"2002"},{"key":"2026041420032877800_B53","doi-asserted-by":"crossref","first-page":"1269","DOI":"10.1007\/978-0-387-09823-4_66","article-title":"Weka-a machine learning workbench for data mining.","volume-title":"Data Mining and Knowledge Discovery Handbook","author":"Frank,","year":"2009"},{"key":"2026041420032877800_B54","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01908075","article-title":"Comparing partitions.","volume":"2","author":"Hubert,","year":"1985","journal-title":"J. Classif."},{"key":"2026041420032877800_B55","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0378-4371(95)00025-3","article-title":"Long-range correlations between letters and sentences in texts.","volume":"215","author":"Ebeling,","year":"1995","journal-title":"Phys. A"},{"key":"2026041420032877800_B56","doi-asserted-by":"crossref","first-page":"7956","DOI":"10.1073\/pnas.0510673103","article-title":"Hierarchical structures induce long-range dynamical correlations in written texts.","volume":"103","author":"Alvarez-Lacalle,","year":"2006","journal-title":"Proc. Natl. Acad. Sci."},{"key":"2026041420032877800_B57","doi-asserted-by":"crossref","first-page":"066102.","DOI":"10.1103\/PhysRevE.82.066102","article-title":"Quantifying network heterogeneity.","volume":"82","author":"Estrada,","year":"2010","journal-title":"Phys. Rev. E"},{"key":"2026041420032877800_B58","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.laa.2005.09.008","article-title":"Laplacian energy of a graph.","author":"Gutman,","year":"2006","journal-title":"Linear Algebra Appl.,"},{"key":"2026041420032877800_B59","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s00026-006-0289-3","article-title":"The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states.","volume":"10","author":"Braunstein,","year":"2006","journal-title":"Ann. Comb.,"},{"key":"2026041420032877800_B60","article-title":"Efficient estimation of word representations in vector space.","author":"Mikolov,","year":"2013"},{"key":"2026041420032877800_B61","first-page":"3111","volume-title":"Distributed Representations of Words and Phrases and Their Compositionality","author":"Mikolov,","year":"2013"},{"key":"2026041420032877800_B62","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.physleta.2008.10.069","article-title":"Accessibility in complex networks.","volume":"373","author":"Traven\u00e7olo,","year":"2008","journal-title":"Phys. Lett. A"},{"key":"2026041420032877800_B63","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/3033543","article-title":"A set of measures of centrality based on betweenness.","volume":"40","author":"Freeman,","year":"1977","journal-title":"Sociometry"},{"key":"2026041420032877800_B64","volume-title":"The Structure of Complex Networks: Theory and Applications","author":"Estrada,","year":"2012"},{"key":"2026041420032877800_B65","doi-asserted-by":"crossref","first-page":"1170","DOI":"10.1086\/228631","article-title":"Power and centrality: a family of measures.","volume":"92","author":"Bonacich,","year":"1987","journal-title":"Amer. J. Sociol."},{"key":"2026041420032877800_B66","doi-asserted-by":"crossref","first-page":"032812.","DOI":"10.1103\/PhysRevE.90.032812","article-title":"Role of centrality for the identification of influential spreaders in complex networks.","volume":"90","author":"de Arruda,","year":"2014","journal-title":"Phys. Rev. E"},{"key":"2026041420032877800_B67","doi-asserted-by":"crossref","first-page":"026113.","DOI":"10.1103\/PhysRevE.69.026113","article-title":"Finding and evaluating community structure in networks.","volume":"69","author":"Newman,","year":"2004","journal-title":"Phys. Rev. E"},{"key":"2026041420032877800_B68","doi-asserted-by":"crossref","first-page":"066111.","DOI":"10.1103\/PhysRevE.70.066111","article-title":"Finding community structure in very large networks.","volume":"70","author":"Clauset,","year":"2004","journal-title":"Phys. Rev. E"},{"key":"2026041420032877800_B69","doi-asserted-by":"crossref","DOI":"10.2307\/j.ctt7t8z9","volume-title":"Google\u2019s PageRank and Beyond: The Science of Search Engine Rankings","author":"Langville,","year":"2011"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/6\/1\/125\/23677005\/cnx023.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/6\/1\/125\/23677005\/cnx023.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T00:04:54Z","timestamp":1776211494000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/6\/1\/125\/4037124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,26]]},"references-count":69,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,2,1]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnx023","relation":{},"ISSN":["2051-1310","2051-1329"],"issn-type":[{"value":"2051-1310","type":"print"},{"value":"2051-1329","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2018,2]]},"published":{"date-parts":[[2017,7,26]]}}}