{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T13:30:41Z","timestamp":1770989441688,"version":"3.50.1"},"reference-count":82,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,12,1]],"date-time":"2017-12-01T00:00:00Z","timestamp":1512086400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Funds","doi-asserted-by":"publisher","award":["P26142"],"award-info":[{"award-number":["P26142"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1016\/j.ins.2017.08.009","type":"journal-article","created":{"date-parts":[[2017,8,14]],"date-time":"2017-08-14T12:00:08Z","timestamp":1502712008000},"page":"575-580","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":52,"special_numbering":"C","title":["Quantitative Graph Theory: A new branch of graph theory and network science"],"prefix":"10.1016","volume":"418-419","author":[{"given":"Matthias","family":"Dehmer","sequence":"first","affiliation":[]},{"given":"Frank","family":"Emmert-Streib","sequence":"additional","affiliation":[]},{"given":"Yongtang","family":"Shi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2017.08.009_bib0001","unstructured":"Sonamine. http:\/\/www.sonamine.com\/home\/; 2009."},{"key":"10.1016\/j.ins.2017.08.009_bib0002","unstructured":"R, software, a language and environment for statistical computing. www.r-project.org; 2011. R Development Core Team, Foundation for Statistical Computing, Vienna, Austria."},{"key":"10.1016\/j.ins.2017.08.009_bib0003","series-title":"Towards an Information Theory of Complex Networks: Statistical Methods and Applications","first-page":"321","article-title":"Typology by means of language networks. applying information theoretic measures to morphological derivation networks","author":"Abramov","year":"2011"},{"key":"10.1016\/j.ins.2017.08.009_bib0004","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1016\/j.jctb.2007.10.001","article-title":"The maximum edit distance from hereditary graph properties","volume":"98","author":"Alon","year":"2008","journal-title":"J. Combin. Theory Ser-B"},{"key":"10.1016\/j.ins.2017.08.009_bib0005","doi-asserted-by":"crossref","first-page":"16","DOI":"10.17730\/humo.7.3.f4033344851gl053","article-title":"A mathematical model for group structure","volume":"7","author":"Bavelas","year":"1948","journal-title":"Human Organizations"},{"key":"10.1016\/j.ins.2017.08.009_bib0006","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1121\/1.1906679","article-title":"Communication patterns in task-oriented groups","volume":"22","author":"Bavelas","year":"1950","journal-title":"J. Acoust. Soc. Amer."},{"key":"10.1016\/j.ins.2017.08.009_bib0007","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1137\/S0036144502415960","article-title":"A measure of similarity between graph vertices: applications to synonym extraction and web searching","volume":"46","author":"Blondel","year":"2004","journal-title":"SIAM Rev."},{"key":"10.1016\/j.ins.2017.08.009_bib0008","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0619-4","article-title":"Modern Graph Theory","author":"Bollab\u00e1s","year":"1998"},{"key":"10.1016\/j.ins.2017.08.009_bib0009","year":"1978"},{"key":"10.1016\/j.ins.2017.08.009_bib0010","year":"2001"},{"key":"10.1016\/j.ins.2017.08.009_bib0011","series-title":"Encyclopedia of Complexity and System Science","first-page":"4820","article-title":"Information theoretic measures of complexity","volume":"5","author":"Bonchev","year":"2009"},{"key":"10.1016\/j.ins.2017.08.009_bib0012","series-title":"Graph kernels, Ph.D. thesis","author":"Borgwardt","year":"2007"},{"key":"10.1016\/j.ins.2017.08.009_bib0013","first-page":"35","article-title":"What is the distance between graphs ?","volume":"20","author":"Bunke","year":"1983","journal-title":"Bulletin of the EATCS"},{"key":"10.1016\/j.ins.2017.08.009_bib0014","series-title":"15-th International Conference on Pattern Recognition","first-page":"117","article-title":"Recent developments in graph matching","volume":"2","author":"Bunke","year":"2000"},{"key":"10.1016\/j.ins.2017.08.009_bib0015","series-title":"International Conference on Internet Computing","first-page":"3","article-title":"A short survey of document structure similarity algorithms","author":"Buttler","year":"2004"},{"key":"10.1016\/j.ins.2017.08.009_bib0016","series-title":"Mining the Web: Discovering Knowledge from Hypertext Data","author":"Chakrabarti","year":"2002"},{"key":"10.1016\/j.ins.2017.08.009_bib0017","doi-asserted-by":"crossref","first-page":"3710","DOI":"10.3390\/e17063710","article-title":"Entropy of weighted graphs with Randi\u0107 weights","volume":"17","author":"Chen","year":"2015","journal-title":"Entropy"},{"key":"10.1016\/j.ins.2017.08.009_bib0018","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/0095-8956(85)90070-X","article-title":"Extremal subgraphs for two graphs","volume":"38","author":"Chung","year":"1985","journal-title":"J. Combin. Theory Ser-B"},{"key":"10.1016\/j.ins.2017.08.009_bib0019","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1142\/S0218001404003228","article-title":"Thirty years of graph matching in pattern regocnition","volume":"18","author":"Conte","year":"2004","journal-title":"Int. J. Pattern Recognit Artif Intell."},{"key":"10.1016\/j.ins.2017.08.009_bib0020","series-title":"Structural Analysis of Complex Networks","year":"2010"},{"key":"10.1016\/j.ins.2017.08.009_bib0021","series-title":"Quantitative Graph Theory. Theory and Applications","author":"Dehmer","year":"2014"},{"key":"10.1016\/j.ins.2017.08.009_bib0022","doi-asserted-by":"crossref","first-page":"e94985","DOI":"10.1371\/journal.pone.0094985","article-title":"Interrelations of graph distance measures based on topological indices","volume":"9","author":"Dehmer","year":"2014","journal-title":"PLoS ONE"},{"issue":"2","key":"10.1016\/j.ins.2017.08.009_bib0023","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pone.0031214","article-title":"Information indices with high discriminative power for graphs","volume":"7","author":"Dehmer","year":"2012","journal-title":"PLoS ONE"},{"key":"10.1016\/j.ins.2017.08.009_bib0024","series-title":"What is Quantitative Graph Theory ?","first-page":"1","author":"Dehmer","year":"2014"},{"key":"10.1016\/j.ins.2017.08.009_bib0025","first-page":"39","article-title":"A new method of measuring similarity for a special class of directed graphs","volume":"36","author":"Dehmer","year":"2007","journal-title":"Tatra Mountains Mathematical Publications"},{"key":"10.1016\/j.ins.2017.08.009_bib0026","series-title":"Proceedings of the International Conference on Machine Learning: Models, Technologies & Applications (MLMTA\u201907), Las Vegas\/USA, 2007","first-page":"113","article-title":"Graph-theoretical characterizations of generalized trees","author":"Dehmer","year":"2007"},{"key":"10.1016\/j.ins.2017.08.009_bib0027","doi-asserted-by":"crossref","first-page":"4263","DOI":"10.1016\/j.amc.2009.12.051","article-title":"Inequalities for entropy-based measures of network information content","volume":"215","author":"Dehmer","year":"2010","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.ins.2017.08.009_bib0028","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ins.2010.08.041","article-title":"A History of Graph Entropy Measures","volume":"1","author":"Dehmer","year":"2011","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2017.08.009_bib0029","first-page":"81","article-title":"Some history of the development of graffiti","author":"DeLaVina","year":"2005","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science 69: Graphs and Discovery"},{"key":"10.1016\/j.ins.2017.08.009_bib0030","series-title":"Topological Indices and Related Descriptors in QSAR and QSPR","author":"Devillers","year":"2000"},{"issue":"7","key":"10.1016\/j.ins.2017.08.009_bib0031","doi-asserted-by":"crossref","DOI":"10.1089\/cmb.2007.0041","article-title":"The chronic fatigue syndrome: A comparative pathway analysis","volume":"14","author":"Emmert-Streib","year":"2007","journal-title":"J. Comput. Biol."},{"key":"10.1016\/j.ins.2017.08.009_bib0032","series-title":"Analysis of Microarray Data: A Network-based Approach","year":"2010"},{"key":"10.1016\/j.ins.2017.08.009_bib0033","series-title":"Proceedings of DMIN\u201905, International Conference on Data Mining, Las Vegas, USA","first-page":"200","article-title":"Classification of large graphs by a local tree decomposition","author":"Emmert-Streib","year":"2006"},{"key":"10.1016\/j.ins.2017.08.009_bib0034","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/j.ins.2016.01.074","article-title":"Fifty years of graph matching, network alignment and comparison","volume":"346\u2013347","author":"Emmert-Streib","year":"2016","journal-title":"Inform. Sci."},{"key":"10.1016\/j.ins.2017.08.009_bib0035","doi-asserted-by":"crossref","first-page":"8973","DOI":"10.1016\/j.amc.2013.03.072","article-title":"On structure-sensitivity of degree-based topological indices","volume":"219","author":"Furtula","year":"2013","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.ins.2017.08.009_bib0036","series-title":"Algebraic Graph Theory","author":"Godsil","year":"2001"},{"key":"10.1016\/j.ins.2017.08.009_bib0037","unstructured":"Group F.A.S.. Sentinel visualizer. www.fmsasg.com; 2015."},{"key":"10.1016\/j.ins.2017.08.009_bib0038","doi-asserted-by":"crossref","first-page":"23","DOI":"10.2307\/2785610","article-title":"Status and contrastatus","volume":"22","author":"Harary","year":"1959","journal-title":"Sociometry"},{"key":"10.1016\/j.ins.2017.08.009_bib0039","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/j.ins.2017.08.009_bib0040","series-title":"Proceedings of the 2004 ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"158","article-title":"Cyclic pattern kernels for predictive graph mining","author":"Horv\u00e1th","year":"2004"},{"issue":"3","key":"10.1016\/j.ins.2017.08.009_bib0041","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.datak.2007.12.004","article-title":"Graph-based representation for similarity retrieval of symbolic images","volume":"65","author":"Hsieh","year":"2008","journal-title":"Data Knowl. Eng."},{"key":"10.1016\/j.ins.2017.08.009_bib0042","series-title":"Graph-Theoretical Matrices in Chemistry Mathematical Chemistry Monographs","author":"Jane\u017ei\u0107","year":"2007"},{"key":"10.1016\/j.ins.2017.08.009_bib0043","series-title":"CPM \u201994: Proceedings of the 5th Annual Symposium on Combinatorial Pattern Matching","first-page":"75","article-title":"Alignment of trees - an alternative to tree edit","author":"Jiang","year":"1994"},{"key":"10.1016\/j.ins.2017.08.009_bib0044","series-title":"Analysis of Biological Networks Wiley Series in Bioinformatics;","author":"Junker","year":"2008"},{"issue":"82","key":"10.1016\/j.ins.2017.08.009_bib0045","first-page":"1","article-title":"Graphmetriken und Distanzgraphen","volume":"2","author":"Kaden","year":"1982","journal-title":"ZKI-Informationen, Akad Wiss DDR"},{"key":"10.1016\/j.ins.2017.08.009_bib0046","series-title":"Theorie der endlichen und unendlichen Graphen","author":"K\u00f6nig","year":"1935"},{"key":"10.1016\/j.ins.2017.08.009_bib0047","doi-asserted-by":"crossref","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","article-title":"Sur le probl\u00e8me des courbes gauches en topologie","volume":"15","author":"Kuratowski","year":"1930","journal-title":"Fund. Math. Vol."},{"key":"10.1016\/j.ins.2017.08.009_bib0048","first-page":"85","article-title":"Note on the HOMO-LUMO index of graphs","volume":"70","author":"Li","year":"2013","journal-title":"MATCH Commun. Math. Comput. Chem."},{"issue":"1","key":"10.1016\/j.ins.2017.08.009_bib0049","first-page":"127","article-title":"A survey on the Randi\u0107 index","volume":"59","author":"Li","year":"2008","journal-title":"MATCH Commun. Math Comput. Chem."},{"key":"10.1016\/j.ins.2017.08.009_bib0050","series-title":"Graph Energy","author":"Li","year":"2012"},{"issue":"1\u20132","key":"10.1016\/j.ins.2017.08.009_bib0051","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF02018473","article-title":"On the eigenvalues of trees","volume":"3","author":"Lov\u00e1sz","year":"1973","journal-title":"Periodica Mathematica Hungarica"},{"key":"10.1016\/j.ins.2017.08.009_sbref0048a","article-title":"On the eigenvalues of trees","volume":"6","author":"Ma","year":"2016","journal-title":"On wiener polarity index of bicyclic networks"},{"key":"10.1016\/j.ins.2017.08.009_bib0053","series-title":"Chemoinformatics: Concepts, Methods, and Tools for Drug Discovery","first-page":"1","article-title":"Molecular Similarity Measures","author":"Maggiora","year":"2004"},{"issue":"22","key":"10.1016\/j.ins.2017.08.009_bib0054","doi-asserted-by":"crossref","first-page":"2579","DOI":"10.1093\/bioinformatics\/btn503","article-title":"Phylogenetic distances are encoded in networks of interacting pathways","volume":"24","author":"Mazurie","year":"2008","journal-title":"Bioinformatics"},{"issue":"6","key":"10.1016\/j.ins.2017.08.009_bib0055","doi-asserted-by":"crossref","first-page":"1440","DOI":"10.3390\/e12061440","article-title":"A network model of interpersonal alignment","volume":"12","author":"Mehler","year":"2010","journal-title":"Entropy"},{"key":"10.1016\/j.ins.2017.08.009_bib0056","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF02476948","article-title":"Entropy and the complexity of the graphs I: An index of the relative complexity of a graph","volume":"30","author":"Mowshowitz","year":"1968","journal-title":"Bull. Math. Biophys."},{"key":"10.1016\/j.ins.2017.08.009_bib0057","series-title":"chap. Network-based Methods for Computational Diagnostics by Means of R","first-page":"185","article-title":"Computational Medicine","author":"M\u00fcller","year":"2012"},{"key":"10.1016\/j.ins.2017.08.009_bib0058","unstructured":"L.A.J. M\u00fcller, M. Schutte, K.G. Kugler, M. Dehmer, QuACN: Quantitative Analyze of Complex Networks, 2012. R Package Version 1.6. URL http:\/\/cran.r-project.org\/web\/packages\/QuACN\/index.html."},{"key":"10.1016\/j.ins.2017.08.009_bib0059","first-page":"113","article-title":"The Zagreb Index 30 Years After","volume":"76","author":"Nikoli\u0107","year":"2003","journal-title":"Croat. Chem. Acta"},{"key":"10.1016\/j.ins.2017.08.009_bib0060","series-title":"Technical Report","article-title":"The Pagerank citation ranking: Bringing order to the web","author":"Page","year":"1999"},{"key":"10.1016\/j.ins.2017.08.009_bib0061","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10910-008-9420-5","article-title":"Grinvin in a nutshell","volume":"45","author":"Peeters","year":"2009","journal-title":"J. Math. Chem."},{"key":"10.1016\/j.ins.2017.08.009_bib0062","doi-asserted-by":"crossref","first-page":"6609","DOI":"10.1021\/ja00856a001","article-title":"On characterization of molecular branching","volume":"97","author":"Randi\u0107","year":"1975","journal-title":"J. Amer. Chem. Soc."},{"key":"10.1016\/j.ins.2017.08.009_bib0063","series-title":"Concepts and Applications of Molecular Similarity","first-page":"77","article-title":"Design of molecules with desired properties. molecular similarity approach to property optimization","author":"Randi\u0107","year":"1990"},{"key":"10.1016\/j.ins.2017.08.009_bib0064","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1021\/ci60017a009","article-title":"Graph theoretical approach to recognition of structural similarity in molecules","volume":"19","author":"Randi\u0107","year":"1979","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"10.1016\/j.ins.2017.08.009_bib0065","series-title":"Applications of Combinatorics and Graph Theory to the Biological and Social Sciences Series","author":"Roberts","year":"1989"},{"key":"10.1016\/j.ins.2017.08.009_bib0066","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","article-title":"Graph minors. part 2. algorithmic aspects of tree-width","volume":"7","author":"Robertson","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/j.ins.2017.08.009_bib0067","series-title":"Proceedings of the IEEE International Conference on Computer Vision","first-page":"234","article-title":"Edit distance from graph spectra","author":"Robles-Kelly","year":"2003"},{"issue":"6","key":"10.1016\/j.ins.2017.08.009_bib0068","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/0020-0190(77)90064-3","article-title":"The tree-to-tree editing problem","volume":"6","author":"Selkow","year":"1977","journal-title":"Inf. Process Lett."},{"issue":"3","key":"10.1016\/j.ins.2017.08.009_bib0069","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/S0893-6080(00)00099-X","article-title":"Graph matching vs mutual information maximization for object detection","volume":"14","author":"Shams","year":"2001","journal-title":"Neural Networks"},{"key":"10.1016\/j.ins.2017.08.009_bib0070","first-page":"105","article-title":"Metrical Analysis of Graphs","volume":"23","author":"Skorobogatov","year":"1988","journal-title":"MATCH Commun. Math. Comp. Chem."},{"issue":"82","key":"10.1016\/j.ins.2017.08.009_bib0071","first-page":"63","article-title":"Graphmetriken und klassifikation strukturierter objekte","volume":"2","author":"Sobik","year":"1982","journal-title":"ZKI-Informationen, Akad Wiss DDR"},{"key":"10.1016\/j.ins.2017.08.009_bib0072","series-title":"Action and performance: Models and tests. Contributions to the quantitative psychology and its methodology","first-page":"105","article-title":"Systematization and Formalization of Cognitive Structure Transformations on the Basis of Graph Transformations","author":"Sommerfeld","year":"1990"},{"key":"10.1016\/j.ins.2017.08.009_bib0073","series-title":"Proceedings of EUSIPCO, Vienna, Austria","article-title":"A similarity measure for color image retrieval and indexing based on the multivariate two sample problem","author":"Theoharatos","year":"2004"},{"issue":"10","key":"10.1016\/j.ins.2017.08.009_bib0074","doi-asserted-by":"crossref","first-page":"1892","DOI":"10.1016\/j.patcog.2006.04.015","article-title":"Multivariate image similarity in the compressed domain using statistical graph matching","volume":"39","author":"Theoharatos","year":"2006","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.ins.2017.08.009_bib0075","series-title":"Handbook of Molecular Descriptors","author":"Todeschini","year":"2002"},{"key":"10.1016\/j.ins.2017.08.009_bib0076","unstructured":"Todeschini R., Consonni V., Mauri A., Pavan M.. Dragon, software for calculation of molecular descriptors. www.talete.mi.it; 2004. Talete srl, Milano, Italy."},{"key":"10.1016\/j.ins.2017.08.009_bib0077","doi-asserted-by":"crossref","first-page":"2834","DOI":"10.1093\/bioinformatics\/btu384","article-title":"Netbiov: an r package for visualizing large network data in biology and medicine","volume":"19","author":"Tripathi","year":"2014","journal-title":"Bioinformatics"},{"key":"10.1016\/j.ins.2017.08.009_bib0078","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1021\/ci990267l","article-title":"Substructure isomorphism matrix","volume":"40","author":"Varmuza","year":"2000","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"10.1016\/j.ins.2017.08.009_bib0079","series-title":"Social Network Analysis: Methods and Applications","author":"Wasserman","year":"1994"},{"issue":"17","key":"10.1016\/j.ins.2017.08.009_bib0080","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1021\/ja01193a005","article-title":"Structural determination of paraffin boiling points","volume":"69","author":"Wiener","year":"1947","journal-title":"J. Am. Chem. Soc."},{"key":"10.1016\/j.ins.2017.08.009_bib0081","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.aml.2007.01.006","article-title":"Graph similarity scoring and matching","volume":"21","author":"Zager","year":"2008","journal-title":"Appl. Math. Lett."},{"key":"10.1016\/j.ins.2017.08.009_bib0082","doi-asserted-by":"crossref","first-page":"371","DOI":"10.21136\/CPM.1975.117890","article-title":"On a certain distance between isomorphism classes of graphs","volume":"100","author":"Zelinka","year":"1975","journal-title":"\u010casopis pro p\u0306est Mathematiky"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025517308666?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025517308666?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T04:49:46Z","timestamp":1659329386000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025517308666"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":82,"alternative-id":["S0020025517308666"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2017.08.009","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2017,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Quantitative Graph Theory: A new branch of graph theory and network science","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2017.08.009","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}