{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:42:10Z","timestamp":1742913730433,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030653507"},{"type":"electronic","value":"9783030653514"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-65351-4_42","type":"book-chapter","created":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T22:03:06Z","timestamp":1609797786000},"page":"520-531","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Algorithmic Information Distortion in Multidimensional Networks"],"prefix":"10.1007","author":[{"given":"Felipe S.","family":"Abrah\u00e3o","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus","family":"Wehmuth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hector","family":"Zenil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Artur","family":"Ziviani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,1,5]]},"reference":[{"key":"42_CR1","unstructured":"Abrah\u00e3o, F.S., Wehmuth, K., Zenil, H., Ziviani, A.: On incompressible multidimensional networks. arXiv Preprints (2018). http:\/\/arxiv.org\/abs\/1812.01170"},{"key":"42_CR2","unstructured":"Abrah\u00e3o, F.S., Wehmuth, K., Zenil, H., Ziviani, A.: Algorithmic information and incompressibility of families of multidimensional networks. Research report no. 8\/2018, National Laboratory for Scientific Computing (LNCC), Petr\u00f3polis, Brazil (2020). https:\/\/arxiv.org\/abs\/1810.11719v9"},{"issue":"1","key":"42_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2014.07.001","volume":"544","author":"S Boccaletti","year":"2014","unstructured":"Boccaletti, S., Bianconi, G., Criado, R., del Genio, C., G\u00f3mez-Garde\u00f1es, J., Romance, M., Sendi\u00f1a-Nadal, I., Wang, Z., Zanin, M.: The structure and dynamics of multilayer networks. Phys. Rep. 544(1), 1\u2013122 (2014)","journal-title":"Phys. Rep."},{"key":"42_CR4","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern Graph Theory","author":"B Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s, B.: Modern Graph Theory. Graduate Texts in Mathematics. Springer, New York (1998)"},{"key":"42_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-540-31955-9_2","volume-title":"Network Analysis","author":"U Brandes","year":"2005","unstructured":"Brandes, U., Erlebach, T.: Fundamentals. In: Brandes, U., Erlebach, T. (eds.) Network Analysis. Lecture Notes in Computer Science, vol. 3418, pp. 7\u201315. Springer, Heidelberg (2005)"},{"issue":"2","key":"42_CR6","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1137\/S0097539797327805","volume":"29","author":"H Buhrman","year":"1999","unstructured":"Buhrman, H., Li, M., Tromp, J., Vit\u00e1nyi, P.: Kolmogorov random graphs and the incompressibility method. SIAM J. Comput. 29(2), 590\u2013599 (1999)","journal-title":"SIAM J. Comput."},{"key":"42_CR7","unstructured":"Calude, C.S.: Borel normality and algorithmic randomness. In: Developments in Language Theory, pp. 113\u2013129. World Scientific Publishing (1994)"},{"key":"42_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04978-5","volume-title":"Information and Randomness: An Algorithmic Perspective","author":"CS Calude","year":"2002","unstructured":"Calude, C.S.: Information and Randomness: An Algorithmic Perspective, 2nd edn. Springer, Berlin (2002)","edition":"2"},{"key":"42_CR9","volume-title":"Algorithmic Information Theory","author":"G Chaitin","year":"2004","unstructured":"Chaitin, G.: Algorithmic Information Theory, 3rd edn. Cambridge University Press, Cambridge (2004)","edition":"3"},{"issue":"4","key":"42_CR10","first-page":"041022","volume":"3","author":"M De Domenico","year":"2013","unstructured":"De Domenico, M., Sol\u00e9-Ribalta, A., Cozzo, E., Kivel\u00e4, M., Moreno, Y., Porter, M.A., G\u00f3mez, S., Arenas, A.: Mathematical formulation of multilayer networks. Phys. Rev. X 3(4), 041022 (2013)","journal-title":"Phys. Rev. X"},{"key":"42_CR11","volume-title":"Graph Theory, Graduate Texts in Mathematics","author":"R Diestel","year":"2017","unstructured":"Diestel, R.: Graph Theory, Graduate Texts in Mathematics, vol. 173, 5th edn. Springer, Heidelberg (2017)","edition":"5"},{"key":"42_CR12","series-title":"Theory and Applications of Computability","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68441-3","volume-title":"Algorithmic Randomness and Complexity","author":"RG Downey","year":"2010","unstructured":"Downey, R.G., Hirschfeldt, D.R.: Algorithmic Randomness and Complexity. Theory and Applications of Computability. Springer, New York (2010)"},{"key":"42_CR13","series-title":"Addison Wesley Series in Mathematics","volume-title":"Graph Theory","author":"F Harary","year":"2018","unstructured":"Harary, F.: Graph Theory. Addison Wesley Series in Mathematics. CRC Press, Boca Raton (2018)"},{"key":"42_CR14","doi-asserted-by":"crossref","unstructured":"Khoussainov, B.: A quest for algorithmically random infinite structures. In: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS) - CSL-LICS, pp. 1\u20139. ACM Press, New York (2014)","DOI":"10.1145\/2603088.2603114"},{"issue":"3","key":"42_CR15","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1093\/comnet\/cnu016","volume":"2","author":"M Kivela","year":"2014","unstructured":"Kivela, M., Arenas, A., Barthelemy, M., Gleeson, J.P., Moreno, Y., Porter, M.A.: Multilayer networks. J. Complex Netw. 2(3), 203\u2013271 (2014)","journal-title":"J. Complex Netw."},{"issue":"4","key":"42_CR16","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1038\/s41567-019-0459-y","volume":"15","author":"R Lambiotte","year":"2019","unstructured":"Lambiotte, R., Rosvall, M., Scholtes, I.: From networks to optimal higher-order models of complex systems. Nat. Phys. 15(4), 313\u2013320 (2019)","journal-title":"Nat. Phys."},{"key":"42_CR17","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-11298-1","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"M Li","year":"2019","unstructured":"Li, M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and Its Applications. Texts in Computer Science, 4th edn. Springer, Cham (2019)","edition":"4"},{"key":"42_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2017\/3250301","volume":"2017","author":"M Morzy","year":"2017","unstructured":"Morzy, M., Kajdanowicz, T., Kazienko, P.: On measuring the complexity of networks: Kolmogorov complexity versus entropy. Complexity 2017, 1\u201312 (2017)","journal-title":"Complexity"},{"issue":"3","key":"42_CR19","doi-asserted-by":"publisher","first-page":"559","DOI":"10.3390\/e14030559","volume":"14","author":"A Mowshowitz","year":"2012","unstructured":"Mowshowitz, A., Dehmer, M.: Entropy and the complexity of graphs revisited. Entropy 14(3), 559\u2013570 (2012)","journal-title":"Entropy"},{"issue":"2","key":"42_CR20","first-page":"021069","volume":"10","author":"A Santoro","year":"2020","unstructured":"Santoro, A., Nicosia, V.: Algorithmic complexity of multiplex networks. Phys. Rev. X 10(2), 021069 (2020)","journal-title":"Phys. Rev. X"},{"key":"42_CR21","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.tcs.2016.08.017","volume":"651","author":"K Wehmuth","year":"2016","unstructured":"Wehmuth, K., Fleury, \u00c9., Ziviani, A.: On MultiAspect graphs. Theor. Comput. Sci. 651, 50\u201361 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"42_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/a10010001","volume":"10","author":"K Wehmuth","year":"2017","unstructured":"Wehmuth, K., Fleury, \u00c9., Ziviani, A.: MultiAspect graphs: algebraic representation and algorithms. Algorithms 10(1), 1\u201336 (2017)","journal-title":"Algorithms"},{"issue":"8","key":"42_CR23","doi-asserted-by":"publisher","first-page":"551","DOI":"10.3390\/e20080551","volume":"20","author":"H Zenil","year":"2018","unstructured":"Zenil, H., Kiani, N., Tegn\u00e9r, J.: A review of graph and network complexity from an algorithmic information perspective. Entropy 20(8), 551 (2018)","journal-title":"Entropy"},{"key":"42_CR24","unstructured":"Zenil, H., Kiani, N.A., Abrah\u00e3o, F.S., Rueda-Toicen, A., Zea, A.A., Tegn\u00e9r, J.: Minimal Algorithmic Information Loss Methods for Dimension Reduction, Feature Selection and Network Sparsification. arXiv Preprints (2019). https:\/\/arxiv.org\/abs\/1802.05843"},{"issue":"3","key":"42_CR25","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1093\/comnet\/cnv025","volume":"4","author":"H Zenil","year":"2016","unstructured":"Zenil, H., Kiani, N.A., Tegn\u00e9r, J.: Quantifying loss of information in network-based dimensionality reduction techniques. J. Complex Netw. 4(3), 342\u2013362 (2016)","journal-title":"J. Complex Netw."},{"issue":"6","key":"42_CR26","doi-asserted-by":"publisher","first-page":"560","DOI":"10.3390\/e21060560","volume":"21","author":"H Zenil","year":"2019","unstructured":"Zenil, H., Kiani, N.A., Tegn\u00e9r, J.: The thermodynamics of network coding, and an algorithmic refinement of the principle of maximum entropy. Entropy 21(6), 560 (2019)","journal-title":"Entropy"},{"key":"42_CR27","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/j.physa.2014.02.060","volume":"404","author":"H Zenil","year":"2014","unstructured":"Zenil, H., Soler-Toscano, F., Dingle, K., Louis, A.A.: Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks. Phys. A: Stat. Mech. Appl. 404, 341\u2013358 (2014)","journal-title":"Phys. A: Stat. Mech. Appl."}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications IX"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-65351-4_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,8]],"date-time":"2021-01-08T05:33:49Z","timestamp":1610084029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-65351-4_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030653507","9783030653514"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-65351-4_42","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"5 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS 2020","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}