{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:21:01Z","timestamp":1773656461314,"version":"3.50.1"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T00:00:00Z","timestamp":1603152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T00:00:00Z","timestamp":1603152000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["2018YFB0204005"],"award-info":[{"award-number":["2018YFB0204005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s00607-020-00851-4","type":"journal-article","created":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T16:02:48Z","timestamp":1603209768000},"page":"313-332","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Diversity metrics for direct-coded variable-length chromosome shortest path problem evolutionary algorithms"],"prefix":"10.1007","volume":"103","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1671-1483","authenticated-orcid":false,"given":"Aiman","family":"Ghannami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ammar","family":"Hawbani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naji","family":"Alhusaini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,20]]},"reference":[{"key":"851_CR1","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/3-540-36970-8_28","volume-title":"International conference on evolutionary multi-criterion optimization","author":"HA Abbass","year":"2003","unstructured":"Abbass HA, Deb K (2003) Searching under multi-evolutionary pressures. International conference on evolutionary multi-criterion optimization. Springer, Berlin, pp 391\u2013404"},{"issue":"6","key":"851_CR2","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1109\/TEVC.2002.804323","volume":"6","author":"CW Ahn","year":"2002","unstructured":"Ahn CW, Ramakrishna RS (2002) A genetic algorithm for shortest path routing problem and the sizing of populations. IEEE Trans Evol Comput 6(6):566\u2013579","journal-title":"IEEE Trans Evol Comput"},{"issue":"07","key":"851_CR3","doi-asserted-by":"publisher","first-page":"65","DOI":"10.4236\/jcc.2017.57007","volume":"5","author":"BS Ayo","year":"2017","unstructured":"Ayo BS et al (2017) An improved genetic algorithm for flight path re-routes with reduced passenger impact. J Comput Commun 5(07):65","journal-title":"J Comput Commun"},{"key":"851_CR4","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms","author":"T Back","year":"1996","unstructured":"Back T (1996) Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms. Oxford University Press, Oxford"},{"key":"851_CR5","doi-asserted-by":"crossref","unstructured":"Barker AL, Martin WN (2000) Dynamics of a distance-based population diversity measure. In: Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No. 00TH8512), vol.\u00a02, pp. 1002\u20131009. IEEE","DOI":"10.1109\/CEC.2000.870755"},{"key":"851_CR6","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.eswa.2018.07.076","volume":"115","author":"J Beernaerts","year":"2019","unstructured":"Beernaerts J, Debever E, Lenoir M, De Baets B, Van de Weghe N (2019) A method based on the levenshtein distance metric for the comparison of multiple movement patterns described by matrix sequences of different length. Expert Syst Appl 115:373\u2013385","journal-title":"Expert Syst Appl"},{"issue":"1","key":"851_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1109\/TEVC.2003.819263","volume":"8","author":"EK Burke","year":"2004","unstructured":"Burke EK, Gustafson S, Kendall G (2004) Diversity in genetic programming: An analysis of measures and correlation with fitness. IEEE Trans Evol Comput 8(1):47\u201362","journal-title":"IEEE Trans Evol Comput"},{"key":"851_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.psep.2019.12.028","volume":"135","author":"M Chen","year":"2020","unstructured":"Chen M, Wang K, Dong X, Li H (2020) Emergency rescue capability evaluation on urban fire stations in china. Process Saf Environ Prot 135:59\u201369","journal-title":"Process Saf Environ Prot"},{"key":"851_CR9","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.eswa.2018.05.022","volume":"110","author":"P Chen","year":"2018","unstructured":"Chen P, Tong R, Lu G, Wang Y (2018) The $$\\alpha $$-reliable path problem in stochastic road networks with link correlations: A moment-matching-based path finding algorithm. Expert Syst Appl 110:20\u201332","journal-title":"Expert Syst Appl"},{"key":"851_CR10","first-page":"126","volume-title":"International symposium for intelligent transportation and smart city","author":"Y Chen","year":"2017","unstructured":"Chen Y, Zeng X, Yuan T (2017) Design and development of earthquake emergency rescue command system based on gis and gps. International symposium for intelligent transportation and smart city. Springer, Berlin, pp 126\u2013138"},{"issue":"5","key":"851_CR11","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1109\/TEVC.2011.2170075","volume":"16","author":"G Corriveau","year":"2012","unstructured":"Corriveau G, Guilbault R, Tahan A, Sabourin R (2012) Review and study of genotypic diversity measures for real-coded representations. IEEE Trans Evol Comput 16(5):695\u2013710","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"851_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1145\/2480741.2480752","volume":"45","author":"M \u010crepin\u0161ek","year":"2013","unstructured":"\u010crepin\u0161ek M, Liu SH, Mernik M (2013) Exploration and exploitation in evolutionary algorithms: A survey. ACM Comput Surv 45(3):35","journal-title":"ACM Comput Surv"},{"issue":"3","key":"851_CR13","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1109\/TEVC.2017.2724201","volume":"22","author":"DC Dang","year":"2017","unstructured":"Dang DC, Friedrich T, K\u00f6tzing T, Krejca MS, Lehre PK, Oliveto PS, Sudholt D, Sutton AM (2017) Escaping local optima using crossover with emergent diversity. IEEE Trans Evol Comput 22(3):484\u2013497","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"851_CR14","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/4235.771166","volume":"3","author":"\u00c1E Eiben","year":"1999","unstructured":"Eiben \u00c1E, Hinterding R, Michalewicz Z (1999) Parameter control in evolutionary algorithms. IEEE Trans Evol Comput 3(2):124\u2013141","journal-title":"IEEE Trans Evol Comput"},{"key":"851_CR15","doi-asserted-by":"crossref","unstructured":"Gao W, Nallaperuma S, Neumann F (2016) Feature-based diversity optimization for problem instance classification. In: International Conference on Parallel Problem Solving from Nature, pp. 869\u2013879. Springer, Berlin","DOI":"10.1007\/978-3-319-45823-6_81"},{"key":"851_CR16","doi-asserted-by":"crossref","unstructured":"Ghassemi\u00a0Toosi F, Nikolov NS, Eaton M (2015) Evolving smart initial layouts for force-directed graph drawing. In: Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation, pp. 1397\u20131398","DOI":"10.1145\/2739482.2764653"},{"key":"851_CR17","doi-asserted-by":"crossref","unstructured":"Gouvea MM, Araujo AF (2008) Diversity control based on population heterozygosity dynamics. In: 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence), pp. 3671\u20133678. IEEE","DOI":"10.1109\/CEC.2008.4631295"},{"issue":"4","key":"851_CR18","doi-asserted-by":"publisher","first-page":"693","DOI":"10.5465\/amj.2006.22083026","volume":"49","author":"AK Gupta","year":"2006","unstructured":"Gupta AK, Smith KG, Shalley CE (2006) The interplay between exploration and exploitation. Acad Manag J 49(4):693\u2013706","journal-title":"Acad Manag J"},{"key":"851_CR19","first-page":"95","volume":"8","author":"F Herrera","year":"1996","unstructured":"Herrera F, Lozano M et al (1996) Adaptation of genetic algorithm parameters based on fuzzy logic controllers. Genet Algorithms Soft Comput 8:95\u2013125","journal-title":"Genet Algorithms Soft Comput"},{"key":"851_CR20","unstructured":"Ichikawa Y, Ishii Y (1993) Retaining diversity of genetic algorithms for multivariable optimization and neural network learning. In: IEEE International Conference on Neural Networks, pp. 1110\u20131114. IEEE"},{"issue":"4","key":"851_CR21","doi-asserted-by":"publisher","first-page":"341","DOI":"10.3844\/jcssp.2008.341.344","volume":"4","author":"A Ismail","year":"2008","unstructured":"Ismail A, Sheta A, Al-Weshah M (2008) A mobile robot path planning using genetic algorithm in static environment. J Comput Sci 4(4):341\u2013344","journal-title":"J Comput Sci"},{"key":"851_CR22","volume-title":"Financial modeling under non-Gaussian distributions","author":"E Jondeau","year":"2007","unstructured":"Jondeau E, Poon SH, Rockinger M (2007) Financial modeling under non-Gaussian distributions. Springer, Berlin"},{"issue":"2","key":"851_CR23","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1111\/j.2006.0030-1299.14714.x","volume":"113","author":"L Jost","year":"2006","unstructured":"Jost L (2006) Entropy and diversity. Oikos 113(2):363\u2013375","journal-title":"Oikos"},{"key":"851_CR24","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1109\/TSE.1983.237018","volume":"3","author":"RL Kashyap","year":"1983","unstructured":"Kashyap RL, Oommen BJ (1983) The noisy substring matching problem. IEEE Trans Software Eng 3:365\u2013370","journal-title":"IEEE Trans Software Eng"},{"key":"851_CR25","doi-asserted-by":"crossref","unstructured":"Khankhour H, Abouchabaka J, Abdoun O (2019) Genetic algorithm for shortest path in ad hoc networks. In: International Conference on Artificial Intelligence and Symbolic Computation, pp. 145\u2013154. Springer, Berlin","DOI":"10.1007\/978-3-030-33103-0_15"},{"key":"851_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-52156-5","volume-title":"Genetic algorithm essentials","author":"O Kramer","year":"2017","unstructured":"Kramer O (2017) Genetic algorithm essentials, vol 679. Springer, Berlin"},{"key":"851_CR27","first-page":"707","volume":"10","author":"VI Levenshtein","year":"1966","unstructured":"Levenshtein VI (1966) Binary codes capable of correcting deletions, insertions, and reversals. Soviet Phys doklady 10:707\u2013710","journal-title":"Soviet Phys doklady"},{"issue":"3","key":"851_CR28","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1287\/orsc.2017.1189","volume":"29","author":"J Luger","year":"2018","unstructured":"Luger J, Raisch S, Schimmer M (2018) Dynamic balancing of exploration and exploitation: The contingent benefits of ambidexterity. Organ Sci 29(3):449\u2013470","journal-title":"Organ Sci"},{"key":"851_CR29","volume-title":"Measuring biological diversity","author":"AE Magurran","year":"2013","unstructured":"Magurran AE (2013) Measuring biological diversity. Wiley, New Jersy"},{"key":"851_CR30","doi-asserted-by":"crossref","unstructured":"Maruyama A, Shibata N, Murata Y, Yasumoto K, Ito M (2004) A personal tourism navigation system to support traveling multiple destinations with time restrictions. In: 18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004., vol.\u00a02, pp. 18\u201321. IEEE","DOI":"10.1109\/AINA.2004.1283747"},{"issue":"1","key":"851_CR31","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","volume":"20","author":"WJ Masek","year":"1980","unstructured":"Masek WJ, Paterson MS (1980) A faster algorithm computing string edit distances. J Comput Syst Sci 20(1):18\u201331","journal-title":"J Comput Syst Sci"},{"key":"851_CR32","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/j.trc.2018.04.014","volume":"91","author":"C Miao","year":"2018","unstructured":"Miao C, Liu H, Zhu GG, Chen H (2018) Connectivity-based optimization of vehicle route and speed for improved fuel economy. Trans Res Part C Emerg Technol 91:353\u2013368","journal-title":"Trans Res Part C Emerg Technol"},{"issue":"2","key":"851_CR33","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1007\/s11277-018-5747-9","volume":"101","author":"RE Mohamed","year":"2018","unstructured":"Mohamed RE, Saleh AI, Abdelrazzak M, Samra AS (2018) Survey on wireless sensor network applications and energy efficient routing protocols. Wireless Pers Commun 101(2):1019\u20131055","journal-title":"Wireless Pers Commun"},{"issue":"4","key":"851_CR34","doi-asserted-by":"publisher","first-page":"1643","DOI":"10.1016\/j.asoc.2008.01.002","volume":"8","author":"AW Mohemmed","year":"2008","unstructured":"Mohemmed AW, Sahoo NC, Geok TK (2008) Solving shortest path problem using particle swarm optimization. Appl Soft Comput 8(4):1643\u20131653","journal-title":"Appl Soft Comput"},{"issue":"18","key":"851_CR35","doi-asserted-by":"publisher","first-page":"3514","DOI":"10.1002\/ece3.1155","volume":"4","author":"EK Morris","year":"2014","unstructured":"Morris EK, Caruso T, Buscot F, Fischer M, Hancock C, Maier TS, Meiners T, M\u00fcller C, Obermaier E, Prati D et al (2014) Choosing and using diversity indices: insights for ecological applications from the german biodiversity exploratories. Ecol Evol 4(18):3514\u20133524","journal-title":"Ecol Evol"},{"key":"851_CR36","doi-asserted-by":"crossref","unstructured":"Morrison RW, De\u00a0Jong KA (2001) Measurement of population diversity. In: International Conference on Artificial Evolution (Evolution Artificielle), pp. 31\u201341. Springer, Berlin","DOI":"10.1007\/3-540-46033-0_3"},{"key":"851_CR37","doi-asserted-by":"crossref","unstructured":"Neumann A, Gao W, Doerr C, Neumann F, Wagner M (2018) Discrepancy-based evolutionary diversity optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 991\u2013998","DOI":"10.1145\/3205455.3205532"},{"key":"851_CR38","doi-asserted-by":"crossref","unstructured":"Olorunda O, Engelbrecht AP (2008) Measuring exploration\/exploitation in particle swarms using swarm diversity. In: 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence), pp. 1128\u20131134. IEEE","DOI":"10.1109\/CEC.2008.4630938"},{"key":"851_CR39","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1109\/TPAMI.1987.4767962","volume":"5","author":"BJ Oommen","year":"1987","unstructured":"Oommen BJ (1987) Recognition of noisy subsequences using constrained edit distances. IEEE Trans Pattern Anal Mach Intell 5:676\u2013685","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"3","key":"851_CR40","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s11633-014-0870-x","volume":"12","author":"SN Pawar","year":"2015","unstructured":"Pawar SN, Bichkar RS (2015) Genetic algorithm with variable length chromosomes for network intrusion detection. Int J Autom Comput 12(3):337\u2013342","journal-title":"Int J Autom Comput"},{"issue":"12","key":"851_CR41","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1145\/359038.359041","volume":"23","author":"JL Peterson","year":"1980","unstructured":"Peterson JL (1980) Computer programs for detecting and correcting spelling errors. Commun ACM 23(12):676\u2013687","journal-title":"Commun ACM"},{"issue":"2","key":"851_CR42","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s40998-018-0056-6","volume":"42","author":"R Rastgoo","year":"2018","unstructured":"Rastgoo R, Sattari-Naeini V (2018) Gsomcr: Multi-constraint genetic-optimized qos-aware routing protocol for smart grids. Iran J Sci Technol Trans Electr Eng 42(2):185\u2013194","journal-title":"Iran J Sci Technol Trans Electr Eng"},{"key":"851_CR43","doi-asserted-by":"crossref","unstructured":"Rothlauf F (2006) Representations for genetic and evolutionary algorithms. In: Representations for Genetic and Evolutionary Algorithms, pp. 9\u201332. Springer, Berlin","DOI":"10.1007\/3-540-32444-5_2"},{"key":"851_CR44","doi-asserted-by":"crossref","unstructured":"Roughan M, Tuke J, Parsonage E (2019) Estimating the parameters of the waxman random graph. In: International Workshop on Algorithms and Models for the Web-Graph, pp. 71\u201386. Springer, Berlin","DOI":"10.1007\/978-3-030-25070-6_6"},{"key":"851_CR45","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.compenvurbsys.2016.01.001","volume":"57","author":"ME Shafiee","year":"2016","unstructured":"Shafiee ME, Berglund EZ (2016) Agent-based modeling and evolutionary computation for disseminating public advisories about hazardous material emergencies. Comput Environ Urban Syst 57:12\u201325","journal-title":"Comput Environ Urban Syst"},{"key":"851_CR46","unstructured":"Shannon CE, Weaver W (1998) The mathematical theory of communication. University of Illinois press"},{"key":"851_CR47","doi-asserted-by":"publisher","first-page":"21468","DOI":"10.1038\/srep21468","volume":"6","author":"Q She","year":"2016","unstructured":"She Q, Chen G, Chan RH (2016) Evaluating the small-world-ness of a sampled network: Functional connectivity of entorhinal-hippocampal circuitry. Sci Rep 6:21468","journal-title":"Sci Rep"},{"issue":"10","key":"851_CR48","first-page":"937","volume":"14","author":"A Singh","year":"2016","unstructured":"Singh A, Jain L (2016) Optimization of vlsi floorplanning problem using a novel genetic algorithm. Int J Comput Sci Inf Secur 14(10):937","journal-title":"Int J Comput Sci Inf Secur"},{"key":"851_CR49","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1016\/j.ins.2015.09.056","volume":"329","author":"G Squillero","year":"2016","unstructured":"Squillero G, Tonda A (2016) Divergence of character and premature convergence: A survey of methodologies for promoting diversity in evolutionary optimization. Inf Sci 329:782\u2013799","journal-title":"Inf Sci"},{"key":"851_CR50","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/j.ijpe.2014.11.003","volume":"164","author":"A Tiwari","year":"2015","unstructured":"Tiwari A, Chang PC (2015) A block recombination approach to solve green vehicle routing problem. Int J Prod Econ 164:379\u2013387","journal-title":"Int J Prod Econ"},{"key":"851_CR51","doi-asserted-by":"crossref","unstructured":"Ursem RK (2002) Diversity-guided evolutionary algorithms. In: International Conference on Parallel Problem Solving from Nature, pp. 462\u2013471. Springer, Berlin","DOI":"10.1007\/3-540-45712-7_45"},{"key":"851_CR52","doi-asserted-by":"crossref","unstructured":"Vassilevska V, Williams R (2009) Finding, minimizing, and counting weighted subgraphs. In: Proceedings of the forty-first annual ACM symposium on Theory of computing, pp. 455\u2013464. ACM","DOI":"10.1145\/1536414.1536477"},{"key":"851_CR53","doi-asserted-by":"crossref","unstructured":"Wineberg M, Oppacher F (2003) The underlying similarity of diversity measures used in evolutionary computation. In: Genetic and evolutionary computation conference, pp. 1493\u20131504. Springer, Berlin","DOI":"10.1007\/3-540-45110-2_21"},{"issue":"9","key":"851_CR54","doi-asserted-by":"publisher","first-page":"1829","DOI":"10.1080\/13658816.2019.1603387","volume":"33","author":"S Zhou","year":"2019","unstructured":"Zhou S, Wang R, Ding J, Pan X, Zhou S, Fang F, Zhen W (2019) An approach for computing routes without complicated decision points in landmark-based pedestrian navigation. Int J Geogr Inf Sci 33(9):1829\u20131846","journal-title":"Int J Geogr Inf Sci"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-020-00851-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00607-020-00851-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-020-00851-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T04:34:33Z","timestamp":1723782873000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00607-020-00851-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,20]]},"references-count":54,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["851"],"URL":"https:\/\/doi.org\/10.1007\/s00607-020-00851-4","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,20]]},"assertion":[{"value":"17 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 October 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}