{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:29:36Z","timestamp":1772119776405,"version":"3.50.1"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T00:00:00Z","timestamp":1654128000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T00:00:00Z","timestamp":1654128000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Multimed Tools Appl"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s11042-021-11606-4","type":"journal-article","created":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T03:49:16Z","timestamp":1654141756000},"page":"3057-3084","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["GNPA: a hybrid model for social influence maximization in dynamic networks"],"prefix":"10.1007","volume":"83","author":[{"given":"Sakshi","family":"Agarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2601-6284","authenticated-orcid":false,"given":"Shikha","family":"Mehta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,2]]},"reference":[{"key":"11606_CR1","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., & Tardos, \u00c9. (2003) Maximizing the spread of influence through a social network. In\u00a0Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, ACM:137\u2013146.","DOI":"10.1145\/956750.956769"},{"issue":"1","key":"11606_CR2","doi-asserted-by":"crossref","first-page":"89","DOI":"10.2307\/30040691","volume":"28","author":"JE Perry-Smith","year":"2003","unstructured":"Perry-Smith JE, Shalley CE (2003) The social side of creativity: A static and dynamic social network perspective. Acad Manag Rev 28(1):89\u2013106","journal-title":"Acad Manag Rev"},{"key":"11606_CR3","doi-asserted-by":"crossref","unstructured":"Agarwal, S., & Mehta, S. (2018) Social Influence Maximization Using Genetic Algorithm with Dynamic Probabilities. In\u00a02018 Eleventh International Conference on Contemporary Computing (IC3), IEEE:1\u20136.","DOI":"10.1109\/IC3.2018.8530626"},{"key":"11606_CR4","first-page":"2560","volume":"8","author":"S Agarwal","year":"2019","unstructured":"Agarwal S, Mehta S (2019) Multi-perspective Elicitation of Influential Parameters and Measures in Social Network. IJITEE 8:2560\u20132571","journal-title":"IJITEE"},{"key":"11606_CR5","first-page":"292","volume":"274","author":"H Garg","year":"2016","unstructured":"Garg H (2016) A hybrid PSO-GA algorithm for constrained optimization problems. Appl Math Comput 274:292\u2013305","journal-title":"Appl Math Comput"},{"key":"11606_CR6","doi-asserted-by":"crossref","unstructured":"Goyal, A., Bonchi, F., & Lakshmanan, L. V. (2010) Learning influence probabilities in social networks. In\u00a0Proceedings of the third ACM international conference on Web search and data mining, ACM:241\u2013250.","DOI":"10.1145\/1718487.1718518"},{"issue":"10","key":"11606_CR7","doi-asserted-by":"crossref","first-page":"1852","DOI":"10.1109\/TKDE.2018.2807843","volume":"30","author":"Y Li","year":"2018","unstructured":"Li Y, Fan J, Wang Y, Tan KL (2018) Influence maximization on social graphs: A survey. IEEE Trans Knowl Data Eng 30(10):1852\u20131872","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"11606_CR8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/978-1-4419-8462-3_7","volume-title":"Social network data analytics","author":"J Sun","year":"2011","unstructured":"Sun J, Tang J (2011) A survey of models and algorithms for social influence analysis. Social network data analytics. Springer, Boston, pp 177\u2013214"},{"issue":"6","key":"11606_CR9","doi-asserted-by":"crossref","first-page":"1420","DOI":"10.1086\/226707","volume":"83","author":"M Granovetter","year":"1978","unstructured":"Granovetter M (1978) Threshold models of collective behavior. Am J Sociol 83(6):1420\u20131443","journal-title":"Am J Sociol"},{"key":"11606_CR10","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/s40745-017-0119-y","volume":"4","author":"S Agarwal","year":"2017","unstructured":"Agarwal S, Mehta S (2017) Approximate shortest distance computing using k-medoids clustering. Ann Data Sci 4:547\u2013564","journal-title":"Ann Data Sci"},{"key":"11606_CR11","doi-asserted-by":"crossref","unstructured":"Chen, W., Wang, Y., & Yang, S. (2009) Efficient influence maximization in social networks. In\u00a0Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining,\u00a0ACM: 199\u2013208.","DOI":"10.1145\/1557019.1557047"},{"issue":"13","key":"11606_CR12","doi-asserted-by":"crossref","first-page":"10181","DOI":"10.1007\/s00500-019-04533-y","volume":"24","author":"SS Singh","year":"2020","unstructured":"Singh SS, Singh K, Kumar A, Biswas B (2020) ACO-IM: maximizing influence in social networks using ant colony optimization. Soft Comput 24(13):10181\u201310203","journal-title":"Soft Comput"},{"key":"11606_CR13","doi-asserted-by":"crossref","first-page":"104833","DOI":"10.1016\/j.knosys.2019.07.004","volume":"187","author":"J Tang","year":"2020","unstructured":"Tang J, Zhang R, Wang P, Zhao Z, Fan L, Liu X (2020) A discrete shuffled frog-leaping algorithm to identify influential nodes for influence maximization in social networks. Knowl-Based Syst 187:104833","journal-title":"Knowl-Based Syst"},{"issue":"1","key":"11606_CR14","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1111\/0081-1750.00099","volume":"31","author":"TA Snijders","year":"2001","unstructured":"Snijders TA (2001) The statistical evaluation of social network dynamics. Sociol Methodol 31(1):361\u2013395","journal-title":"Sociol Methodol"},{"issue":"1","key":"11606_CR15","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1027\/1614-2241.2.1.48","volume":"2","author":"C Steglich","year":"2006","unstructured":"Steglich C, Snijders TA, West P (2006) Applying siena. Methodology 2(1):48\u201356","journal-title":"Methodology"},{"issue":"1","key":"11606_CR16","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1111\/j.1467-9531.2010.01225.x","volume":"40","author":"C Steglich","year":"2010","unstructured":"Steglich C, Snijders TA, Pearson M (2010) 8 Dynamic Networks and Behavior: Separating Selection from Influence. Sociol Methodol 40(1):329\u2013393","journal-title":"Sociol Methodol"},{"key":"11606_CR17","doi-asserted-by":"crossref","unstructured":"Hirasawa, K., Okubo, M., Katagiri, H., Hu, J., & Murata, J. (2001) Comparison between genetic network programming (GNP) and genetic programming (GP). In\u00a0Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No. 01TH8546),\u00a0Vol. 2, IEEE:1276\u20131282.","DOI":"10.1109\/CEC.2001.934337"},{"issue":"3","key":"11606_CR18","first-page":"193","volume":"9","author":"BL Miller","year":"1995","unstructured":"Miller BL, Goldberg DE (1995) Genetic algorithms, tournament selection, and the effects of noise. Complex Systems 9(3):193\u2013212","journal-title":"Complex Systems"},{"key":"11606_CR19","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/978-981-15-1286-5_9","volume-title":"International Conference on Innovative Computing and Communications","author":"S Agarwal","year":"2020","unstructured":"Agarwal S, Mehta S (2020) GA with k-Medoid Approach for Optimal Seed Selection to Maximize Social Influence. International Conference on Innovative Computing and Communications. Springer, Singapore, pp 97\u2013106"},{"key":"11606_CR20","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/978-1-4419-1665-5_7","volume-title":"Handbook of metaheuristics","author":"WB Langdon","year":"2010","unstructured":"Langdon WB, McKay RI, Spector L (2010) Genetic programming. Handbook of metaheuristics. Springer, Boston, MA, pp 185\u2013225"},{"issue":"1","key":"11606_CR21","first-page":"89","volume":"1","author":"X Li","year":"2011","unstructured":"Li X, Mabu S, Hirasawa K (2011) Towards the maintenance of population diversity: A hybrid probabilistic model building genetic network programming. Transaction of the Japanese Society for Evolutionary Computation 1(1):89\u2013101","journal-title":"Transaction of the Japanese Society for Evolutionary Computation"},{"key":"11606_CR22","first-page":"487","volume":"1215","author":"R Agrawal","year":"1994","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In Proc. 20th int. conf. very large data bases. VLDB 1215:487\u2013499","journal-title":"VLDB"},{"key":"11606_CR23","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/3-540-45372-5_2","volume-title":"European conference on principles of data mining and knowledge discovery","author":"A Inokuchi","year":"2000","unstructured":"Inokuchi A, Washio T, Motoda H (2000) An apriori-based algorithm for mining frequent substructures from graph data. In: Zighed Djamel A, Komorowski Jan, \u017bytkow Jan (eds) European conference on principles of data mining and knowledge discovery. Springer, Berlin, pp 13\u201323"},{"key":"11606_CR24","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1016\/j.ins.2019.07.043","volume":"503","author":"E G\u00fcney","year":"2019","unstructured":"G\u00fcney E (2019) An efficient linear programming based method for the influence maximization problem in social networks. Inf Sci 503:589\u2013605","journal-title":"Inf Sci"},{"key":"11606_CR25","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.ins.2017.02.023","volume":"394","author":"D Kim","year":"2017","unstructured":"Kim D, Hyeon D, Oh J, Han WS, Yu H (2017) Influence maximization based on reachability sketches in dynamic graphs. Inf Sci 394:217\u2013231","journal-title":"Inf Sci"},{"key":"11606_CR26","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.ins.2018.07.003","volume":"465","author":"YY Ko","year":"2018","unstructured":"Ko YY, Cho KJ, Kim SW (2018) Efficient and effective influence maximization in social networks: a hybrid-approach. Inf Sci 465:144\u2013161","journal-title":"Inf Sci"},{"issue":"1","key":"11606_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s13278-018-0489-y","volume":"8","author":"J Tang","year":"2018","unstructured":"Tang J, Tang X, Yuan J (2018) An efficient and effective hop-based approach for influence maximization in social networks. Soc Netw Anal Min 8(1):1\u201319","journal-title":"Soc Netw Anal Min"},{"issue":"1","key":"11606_CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s41060-018-0155-5","volume":"8","author":"T Lawrence","year":"2018","unstructured":"Lawrence T, Hosein P (2018) Stochastic dynamic programming heuristics for influence maximization\u2013revenue optimization. Int J Data Sci Anal 8(1):1\u201314","journal-title":"Int J Data Sci Anal"},{"key":"11606_CR29","doi-asserted-by":"crossref","unstructured":"Chung, Y. H., Fan, T. F., & Liau, C. J. (2018) A comparative study on algorithms for influence maximization in social networks. In\u00a0Proceedings of the Genetic and Evolutionary Computation Conference Companion, ACM:231\u2013232.","DOI":"10.1145\/3205651.3205667"},{"key":"11606_CR30","first-page":"259","volume-title":"European conference on principles of data mining and knowledge discovery","author":"M Kimura","year":"2006","unstructured":"Kimura M, Saito K (2006) Tractable models for information diffusion in social networks. European conference on principles of data mining and knowledge discovery. Springer, Berlin, pp 259\u2013271"},{"issue":"3","key":"11606_CR31","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s10618-012-0262-1","volume":"25","author":"C Wang","year":"2012","unstructured":"Wang C, Chen W, Wang Y (2012) Scalable influence maximization for independent cascade model in large-scale social networks. Data Min Knowl Disc 25(3):545\u2013576","journal-title":"Data Min Knowl Disc"},{"key":"11606_CR32","doi-asserted-by":"crossref","unstructured":"Goyal, A., Lu, W., & Lakshmanan, L. V. (2011) Simpath: An efficient algorithm for influence maximization under the linear threshold model. In\u00a02011 IEEE 11th international conference on data mining, IEEE:211\u2013220.","DOI":"10.1109\/ICDM.2011.132"},{"key":"11606_CR33","doi-asserted-by":"crossref","unstructured":"Chen, W., Yuan, Y., & Zhang, L. (2010) Scalable influence maximization in social networks under the linear threshold model. In\u00a02010 IEEE international conference on data mining, IEEE:88\u201397.","DOI":"10.1109\/ICDM.2010.118"},{"key":"11606_CR34","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1016\/j.physa.2018.09.040","volume":"513","author":"J Tang","year":"2019","unstructured":"Tang J, Zhang R, Yao Y, Yang F, Zhao Z, Hu R, Yuan Y (2019) Identification of top-k influential nodes based on enhanced discrete particle swarm optimization for influence maximization. Physica A 513:477\u2013496","journal-title":"Physica A"},{"key":"11606_CR35","doi-asserted-by":"crossref","first-page":"12084","DOI":"10.1109\/ACCESS.2020.2966056","volume":"8","author":"Q Liqing","year":"2020","unstructured":"Liqing Q, Chunmei G, Shuang Z, Xiangbo T, Mingjv Z (2020) TSIM: A two-stage selection algorithm for influence maximization in social networks. IEEE Access 8:12084\u201312095","journal-title":"IEEE Access"},{"key":"11606_CR36","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/978-3-319-31204-0_25","volume-title":"European Conference on the Applications of Evolutionary Computation","author":"D Bucur","year":"2016","unstructured":"Bucur D, Iacca G (2016) Influence maximization in social networks with genetic algorithms. In: Squillero Giovanni, Burelli Paolo (eds) European Conference on the Applications of Evolutionary Computation. Springer, Cham, pp 379\u2013392"},{"key":"11606_CR37","doi-asserted-by":"crossref","unstructured":"Zhuang, H., Sun, Y., Tang, J., Zhang, J., & Sun, X. (2013) Influence maximization in dynamic social networks. In\u00a02013 IEEE 13th International Conference on Data Mining, IEEE:1313\u20131318.","DOI":"10.1109\/ICDM.2013.145"},{"issue":"1","key":"11606_CR38","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1109\/TNET.2016.2563397","volume":"25","author":"G Tong","year":"2017","unstructured":"Tong G, Wu W, Tang S, Du DZ (2017) Adaptive influence maximization in dynamic social networks. IEEE\/ACM Transactions on Networking (TON) 25(1):112\u2013125","journal-title":"IEEE\/ACM Transactions on Networking (TON)"},{"issue":"4","key":"11606_CR39","doi-asserted-by":"crossref","first-page":"e3054","DOI":"10.1002\/ett.3054","volume":"28","author":"M Han","year":"2017","unstructured":"Han M, Yan M, Cai Z, Li Y, Cai X, Yu J (2017) Influence maximization by probing partial communities in dynamic online social networks. Trans Emerg Telecommun Technol 28(4):e3054","journal-title":"Trans Emerg Telecommun Technol"},{"key":"11606_CR40","volume-title":"Introduction to graph theory","author":"DB West","year":"1996","unstructured":"West DB (1996) Introduction to graph theory, vol 2. Prentice hall, Upper Saddle River"},{"issue":"3","key":"11606_CR41","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1162\/evco.2007.15.3.369","volume":"15","author":"S Mabu","year":"2007","unstructured":"Mabu S, Hirasawa K, Hu J (2007) A graph-based evolutionary algorithm: Genetic network programming (GNP) and its extension using reinforcement learning. Evol Comput 15(3):369\u2013398","journal-title":"Evol Comput"},{"issue":"3","key":"11606_CR42","doi-asserted-by":"crossref","first-page":"5432","DOI":"10.1016\/j.eswa.2008.06.054","volume":"36","author":"J Chen","year":"2009","unstructured":"Chen J, Huang H, Tian S, Qu Y (2009) Feature selection for text classification with Na\u00efve Bayes. Expert Syst Appl 36(3):5432\u20135435","journal-title":"Expert Syst Appl"},{"key":"11606_CR43","first-page":"491","volume":"4","author":"H Liu","year":"2005","unstructured":"Liu H, Yu L (2005) Toward integrating feature selection algorithms for classification and clustering. IEEE Trans Knowl Data Eng 4:491\u2013502","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"9","key":"11606_CR44","doi-asserted-by":"crossref","first-page":"1761","DOI":"10.1016\/j.energy.2006.11.010","volume":"32","author":"GK Tso","year":"2007","unstructured":"Tso GK, Yau KK (2007) Predicting electricity energy consumption: A comparison of regression analysis, decision tree and neural networks. Energy 32(9):1761\u20131768","journal-title":"Energy"},{"key":"11606_CR45","unstructured":"Sheena, K. K., & Kumar, G. (2016) Analysis of feature selection techniques: A data mining approach. In\u00a0Proc. Int. Conf. Adv. Emerg. Technol. (ICAET):17\u201321."},{"key":"11606_CR46","unstructured":"Kohavi, R., & Sommerfield, D. (1995) Feature Subset Selection Using the Wrapper Method: Overfitting and Dynamic Search Space Topology. In\u00a0KDD:192\u2013197."},{"key":"11606_CR47","first-page":"124","volume":"99","author":"Y Freund","year":"1999","unstructured":"Freund Y, Mason L (1999) The alternating decision tree learning algorithm. In icml 99:124\u2013133","journal-title":"In icml"},{"issue":"3","key":"11606_CR48","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1109\/72.572104","volume":"8","author":"R Setiono","year":"1997","unstructured":"Setiono R, Liu H (1997) Neural-network feature selector. IEEE Trans Neural Networks 8(3):654\u2013662","journal-title":"IEEE Trans Neural Networks"},{"key":"11606_CR49","doi-asserted-by":"crossref","unstructured":"Chen, Z., Kalashnikov, D. V., & Mehrotra, S. (2009) Exploiting context analysis for combining multiple entity resolution systems. In\u00a0Proceedings of the 2009 ACM SIGMOD International Conference on Management of data, ACM:207\u2013218.","DOI":"10.1145\/1559845.1559869"},{"issue":"1","key":"11606_CR50","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.eng.2018.02.004","volume":"4","author":"K Li","year":"2018","unstructured":"Li K, Zhang L, Huang H (2018) Social influence analysis: models, methods, and evaluation. Engineering 4(1):40\u201346","journal-title":"Engineering"},{"key":"11606_CR51","unstructured":"Cortez, P., & Silva, A. M. G. (2008) Using data mining to predict secondary school student performance. In A. Brito and J. Teixeira Eds., Proceedings of 5th FUture BUsiness TEChnology Conference:5\u201312."},{"key":"11606_CR52","unstructured":"Takac, L., & Zabovsky, M. (2012) Data analysis in public social networks. In\u00a0International Scientific Conference and International Workshop Present Day Trends of Innovations (Vol. 1, No. 6)."},{"issue":"1","key":"11606_CR53","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0034-4257(97)00083-7","volume":"62","author":"SV Stehman","year":"1997","unstructured":"Stehman SV (1997) Selecting and interpreting measures of thematic classification accuracy. Remote Sens Environ 62(1):77\u201389","journal-title":"Remote Sens Environ"},{"key":"11606_CR54","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s13278-020-00654-7","volume":"10","author":"B Saxena","year":"2020","unstructured":"Saxena B, Saxena V (2020) Towards establishing the effect of self-similarity on influence maximization in online social networks. Soc Netw Anal Min 10:1\u201316","journal-title":"Soc Netw Anal Min"},{"key":"11606_CR55","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Zhao, W., Yang, J., Paris, C., & Nepal, S. (2019) Learning influence probabilities and modelling influence diffusion in twitter. In Companion Proceedings of The 2019 World Wide Web Conference:1087\u20131094.","DOI":"10.1145\/3308560.3316701"},{"issue":"6","key":"11606_CR56","doi-asserted-by":"crossref","first-page":"102321","DOI":"10.1016\/j.ipm.2020.102321","volume":"57","author":"S Agarwal","year":"2020","unstructured":"Agarwal S, Mehta S (2020) Effective influence estimation in twitter using temporal, profile, structural and interaction characteristics. Inf Process Manag 57(6):102321","journal-title":"Inf Process Manag"},{"issue":"1","key":"11606_CR57","doi-asserted-by":"crossref","first-page":"84","DOI":"10.3390\/math8010084","volume":"8","author":"Y Yun","year":"2020","unstructured":"Yun Y, Chuluunsukh A, Gen M (2020) Sustainable closed-loop supply chain design problem: A hybrid genetic algorithm approach. Mathematics 8(1):84","journal-title":"Mathematics"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-021-11606-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11042-021-11606-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-021-11606-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T08:16:05Z","timestamp":1704183365000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11042-021-11606-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,2]]},"references-count":57,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["11606"],"URL":"https:\/\/doi.org\/10.1007\/s11042-021-11606-4","relation":{},"ISSN":["1380-7501","1573-7721"],"issn-type":[{"value":"1380-7501","type":"print"},{"value":"1573-7721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,2]]},"assertion":[{"value":"4 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}