{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T23:59:40Z","timestamp":1773705580194,"version":"3.50.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T00:00:00Z","timestamp":1716768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T00:00:00Z","timestamp":1716768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Digit Libr"],"published-print":{"date-parts":[[2024,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We propose a method for visualizing literary works that quantitatively extracts the mutual relationships among play characters from the narrative of a storyline. The method first determines the cross-correlation of the appearance frequencies in the time domain between two play characters, which is calculated for all pairs of characters in each narrative. We also calculate the correlation among three play characters to find unique triangular relationships. Then we create a graphical representation of the relationships using node-link representations based on a physical potential model. The method is suitable for dramas, as demonstrated for ten famous Shakespeare plays. The resulting visualizations show good agreement with the conventional understanding of each play and also provide new insight into Shakespearean criticism.<\/jats:p>","DOI":"10.1007\/s00799-024-00401-9","type":"journal-article","created":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T14:04:26Z","timestamp":1716818666000},"page":"825-839","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Digital detection of play characters\u2019 relationships in Shakespeare\u2019s plays: extended cross-correlation analysis of the character appearance frequencies"],"prefix":"10.1007","volume":"25","author":[{"given":"Miyuki","family":"Yamada","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuichi","family":"Murai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ichiro","family":"Kumagai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,27]]},"reference":[{"key":"401_CR1","first-page":"80","volume":"68","author":"F Moretti","year":"2011","unstructured":"Moretti, F.: Network theory, plot analysis. New Left Rev 68, 80\u2013102 (2011)","journal-title":"New Left Rev"},{"issue":"5","key":"401_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3344548","volume":"52","author":"V Labatut","year":"2019","unstructured":"Labatut, V., Bost, X.: Extraction and analysis of fictional character networks: a survey. ACM Comput. Surv.Comput. Surv. 52(5), 1\u201340 (2019). https:\/\/doi.org\/10.1145\/3344548","journal-title":"ACM Comput. Surv.Comput. Surv."},{"key":"401_CR3","unstructured":"Lee, J., Yeung, C.Y.: Extracting networks of people and places from literary texts. In: Manurung, R., Bond, F. (eds.) Proceedings of the 26th Pacific Asia Conference on language, information, and computation; Bali, Indonesia. Faculty of computer science, Universitas Indonesia, 7\u201340, pp. 209\u2013218 (2012)"},{"key":"401_CR4","unstructured":"Harrison, C., BibleViz. Biblical Social Network (people and places) [Internet]. c2007 [cited 2021 June 26]. Available from: https:\/\/www.chrisharrison.net\/index.php\/Visualizations\/BibleViz"},{"issue":"1","key":"401_CR5","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s41109-016-0012-1","volume":"1","author":"SE Massey","year":"2016","unstructured":"Massey, S.E.: Social network analysis of the biblical Moses. Appl Netw. Sci. 1(1), 13 (2016). https:\/\/doi.org\/10.1007\/s41109-016-0012-1","journal-title":"Appl Netw. Sci."},{"key":"401_CR6","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1515\/9789048531011-014","volume-title":"The Datafied Society: Studying Culture through Data","author":"T Venturini","year":"2017","unstructured":"Venturini, T., Bounegru, L., Jacomy, M., Gray, J.: How to tell stories with networks: exploring the narrative affordances of graphs with the Iliad. In: Sch\u00e4fer, M., van Es, K. (eds.) The Datafied Society: Studying Culture through Data, pp. 155\u2013169. Amsterdam University Press, Amsterdam (2017). https:\/\/doi.org\/10.1515\/9789048531011-014"},{"issue":"6","key":"401_CR7","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0126470.","volume":"10","author":"MC Waumans","year":"2015","unstructured":"Waumans, M.C., Nicod\u00e8me, T., Bersini, H.: Topology analysis of social networks extracted from literature. PLoS ONE 10(6), e0126470 (2015). https:\/\/doi.org\/10.1371\/journal.pone.0126470.","journal-title":"PLoS ONE"},{"issue":"4","key":"401_CR8","doi-asserted-by":"publisher","first-page":"18","DOI":"10.4169\/mathhorizons.23.4.18","volume":"23","author":"A Beveridge","year":"2016","unstructured":"Beveridge, A., Shan, J.: Network of Thrones. Math Horizons. 23(4), 18\u201322 (2016)","journal-title":"Math Horizons."},{"key":"401_CR9","doi-asserted-by":"publisher","first-page":"201","DOI":"10.4324\/9781315114668-13","volume-title":"Reading Contemporary Serial Television Universes: A Narrative Ecosystem Framework","author":"A Beveridge","year":"2018","unstructured":"Beveridge, A., Chemers, M.: The Game of Game of Thrones: Networked Concordances and Fractal Dramaturgy. In: Brembilla, P., De Pascalis, I.A. (eds.) Reading Contemporary Serial Television Universes: A Narrative Ecosystem Framework, 1st edn., pp. 201\u2013225. Routledge, New York (2018)","edition":"1"},{"key":"401_CR10","unstructured":"Elson, D., Dames,\u00a0N., McKeown, K.: Extracting Social Networks from Literary Fiction. In: Proceedings of the 48th annual meeting of the association for computational linguistics; 2010 July 11\u201316, Uppsala, Sweden. Association for Computational Linguistics, pp 138\u2013147 (2010)"},{"issue":"12","key":"401_CR11","doi-asserted-by":"publisher","first-page":"2436","DOI":"10.1109\/TVCG.2013.196","volume":"19","author":"S Liu","year":"2013","unstructured":"Liu, S., Wu, Y., Wei, E., Liu, M., Liu, Y.: StoryFlow: tracking the evolution of stories. IEEE Trans. Visual Comput. Gr. 19(12), 2436\u20132445 (2013). https:\/\/doi.org\/10.1109\/TVCG.2013.196","journal-title":"IEEE Trans. Visual Comput. Gr."},{"issue":"24","key":"401_CR12","doi-asserted-by":"publisher","first-page":"35373","DOI":"10.1007\/s11042-019-07969-4","volume":"78","author":"X Bost","year":"2019","unstructured":"Bost, X., Gueye, S., Labatut, V., Larson, M., Linar\u00e8s, G., Malinas, D., Roth, R.: Remembering winter was coming: character-oriented video summaries of TV series. Multimed. Tools Appl. 78(24), 35373\u201335399 (2019). https:\/\/doi.org\/10.1007\/s11042-019-07969-4","journal-title":"Multimed. Tools Appl."},{"issue":"12","key":"401_CR13","doi-asserted-by":"publisher","first-page":"2679","DOI":"10.1109\/TVCG.2012.212","volume":"18","author":"Y Tanahashi","year":"2012","unstructured":"Tanahashi, Y., Ma, K.-L: Design considerations for optimizing storyline visualizations. IEEE Trans. Visual Comput. Gr. 18(12), 2679\u20132688 (2012). https:\/\/doi.org\/10.1109\/TVCG.2012.212","journal-title":"IEEE Trans. Visual Comput. Gr."},{"key":"401_CR14","unstructured":"Elsner, M.: Character-based kernels for novelistic plot structure. In: Proceedings of the 13th Conference of the European Chapter of the Association for Computational Linguistics; 2012 April 23\u201327, Avignon, France. Association for Computational Linguistics, pp. 634\u2013644 (2012)"},{"key":"401_CR15","doi-asserted-by":"crossref","unstructured":"Ardanuy, M.C., Sporleder, C.: Structure-based clustering of novels. In: Proceedings of the 3rd Workshop on computational linguistics for literature (CLFL), Gothenburg, Sweden. Association for Computational Linguistics, pp. 31\u201339 (2014)","DOI":"10.3115\/v1\/W14-0905"},{"key":"401_CR16","doi-asserted-by":"crossref","unstructured":"Jayannavar,\u00a0P., Agarwal,\u00a0A., Ju,\u00a0M., Rambow, O.: Validating literary theories using automatic social network extraction. In: Proceedings of the Fourth Workshop on Computational Linguistics for Literature, Denver, Colorado. Association for Computational Linguistics; pp. 32\u201341 (2015)","DOI":"10.3115\/v1\/W15-0704"},{"key":"401_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511620393","volume-title":"Shakespeare\u2019s Imagery and What It Tells Us","author":"CFE Spurgeon","year":"1935","unstructured":"Spurgeon, C.F.E.: Shakespeare\u2019s Imagery and What It Tells Us. Cambridge UP, Cambridge (1935)"},{"key":"401_CR18","first-page":"115","volume":"25","author":"D Foster","year":"1997","unstructured":"Foster, D.W: A funeral elegy: William Shakespeare\u2019s best-speaking witness. Shakespear Stud. 25, 115\u2013140 (1997)","journal-title":"Shakespear Stud."},{"issue":"4","key":"401_CR19","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s12110-003-1013-1","volume":"14","author":"J Stiller","year":"2003","unstructured":"Stiller, J., Nettle, D., Dunbar, R.I.M.: The small world of Shakespeare\u2019s plays. Hum. Nat. 14(4), 397\u2013408 (2003). https:\/\/doi.org\/10.1007\/s12110-003-1013-1","journal-title":"Hum. Nat."},{"issue":"1","key":"401_CR20","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1556\/JCEP.3.2005.1.4","volume":"3","author":"J Stiller","year":"2005","unstructured":"Stiller, J., Matthew, H.: Weak links and scene cliques within the small world of Shakespeare. J. Cult. Evolut. Psychol. 3(1), 57\u201373 (2005)","journal-title":"J. Cult. Evolut. Psychol."},{"key":"401_CR21","doi-asserted-by":"publisher","first-page":"69","DOI":"10.18483\/ijSci.414","volume":"02","author":"AC Sparavigna","year":"2014","unstructured":"Sparavigna, A.C., Marazzato, R.: Graph visualization software for networks of characters in plays. Int. J. Sci. 02, 69\u201379 (2014). https:\/\/doi.org\/10.18483\/ijSci.414","journal-title":"Int. J. Sci."},{"issue":"4","key":"401_CR22","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/MTS.2015.2494240","volume":"34","author":"VH Mas\u00edas","year":"2015","unstructured":"Mas\u00edas, V.H., Lind, P.B., Laengle, S., Crespo, F.A.: Shakespeare, social media and social networks [viewpoint]. IEEE Technol. Soc. Mag. 34(4), 17\u201330 (2015). https:\/\/doi.org\/10.1109\/MTS.2015.2494240","journal-title":"IEEE Technol. Soc. Mag."},{"issue":"4","key":"401_CR23","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1093\/llc\/fqw029","volume":"3","author":"VH Mas\u00edas","year":"2017","unstructured":"Mas\u00edas, V.H., Baldwin, P., Laengle, S., Vargas, A., Crespo, F.A.: Exploring the prominence of Romeo and Juliet\u2019s characters using weighted centrality measures. Digit. Scholarsh. Humanit. 3(4), 837\u2013858 (2017). https:\/\/doi.org\/10.1093\/llc\/fqw029","journal-title":"Digit. Scholarsh. Humanit."},{"key":"401_CR24","doi-asserted-by":"publisher","unstructured":"Nalisnick, E.T., Baird, H.S.: Extracting sentiment networks from Shakespeare\u2019s Plays. In: Proceedings of the 12th International Conference on Document Analysis and Recognition; 2013 August 25\u201328, Washington, DC, USA. IEEE. pp. 758\u2013762. doi: https:\/\/doi.org\/10.1109\/ICDAR.2013.155 (2013)","DOI":"10.1109\/ICDAR.2013.155"},{"key":"401_CR25","unstructured":"Nielsen, F.A.: Afinn [Internet], Informatics and mathematical modelling, Technical university of Denmark. c2011 [cited 2021 June 26], Richards Petersen Plads, Building 321, DK-2800 Kgs. Lyngby. Available from: http:\/\/www2.imm.dtu.dk\/pubdb\/pubs\/6010-full.html"},{"issue":"5","key":"401_CR26","doi-asserted-by":"publisher","first-page":"1771","DOI":"10.1073\/pnas.1013213108","volume":"108","author":"SA Marvel","year":"2011","unstructured":"Marvel, S.A., Kleinberg, J., Kleinberg, R.D., Strogatz, S.H.: Continuous-time model of structural balance. Proc Natl Acad Sci U S A. 108(5), 1771\u20131776 (2011). https:\/\/doi.org\/10.1073\/pnas.1013213108","journal-title":"Proc Natl Acad Sci U S A."},{"issue":"2","key":"401_CR27","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF03181960","volume":"12","author":"M Yamada","year":"2009","unstructured":"Yamada, M., Murai, Y.: Story visualization of literary works: how a computer reads Shakespeare\u2019s play. J. Visualization 12(2), 181\u2013188 (2009)","journal-title":"J. Visualization"},{"key":"401_CR28","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s12650-010-0050-1","volume":"13","author":"M Yamada","year":"2010","unstructured":"Yamada, M., Murai, Y.: Stereoscopic story visualization in literary works demonstrated by Shakespeare\u2019s plays. J. Visualization 13, 355\u2013363 (2010)","journal-title":"J. Visualization"},{"key":"401_CR29","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s12650-013-0163-4","volume":"16","author":"M Yamada","year":"2013","unstructured":"Yamada, M., Murai, Y., Kumagai, I.: Story visualization of novels with multi-theme keyword density analysis. J. Visualization 16, 247\u2013257 (2013)","journal-title":"J. Visualization"},{"key":"401_CR30","unstructured":"Horatius Flaccus, Quintus (65\u20138 p.n.e.). Satires, Epistles and Ars Poetica\/Horace; with an English translation by H. Rushton Fairclough. Cambridge, Mass.: Harvard University Press. London: W. Heinemann. (1929)"},{"issue":"2","key":"401_CR31","first-page":"159","volume":"30","author":"S Jarukasemratana","year":"2013","unstructured":"Jarukasemratana, S., Murata, T.: Recent large graph visualization tools: a review. Comput. Softw. 30(2), pp. 159\u2013175 (2013)","journal-title":"Comput. Softw."},{"key":"401_CR32","doi-asserted-by":"crossref","unstructured":"Bastian, M., Heymann, S., Jacomy, M., Gephi: An open source software for exploring and manipulating networks. ICWSM [Internet]. 2009 Mar 19 [cited 2021 June 26]; vol 3(1), pp. 361\u2013362. Available from: https:\/\/ojs.aaai.org\/index.php\/ICWSM\/article\/view\/13937.","DOI":"10.1609\/icwsm.v3i1.13937"},{"key":"401_CR33","unstructured":"Smith, M., Ceni, A., Milic-Frayling, N., Shneiderman, B., Mendes Rodrigues, E., Leskovec, J., Dunne, C.: NodeXL: a free and open network overview, discovery and exploration add-in for Excel. The social media research foundation; c2007[updated 2010\/2013\/2016; cited 2021 June 26]. Available from: https:\/\/www.smrfoundation.org"},{"key":"401_CR34","doi-asserted-by":"publisher","unstructured":"Batagelj, V., Mrvar, A.: Pajek\u2014Analysis and visualization of large networks. In: J\u00fcnger M., Mutzel P. (eds.) graph drawing software. Mathematics and visualization. Springer, Berlin, Heidelberg, pp. 77\u2013103. https:\/\/doi.org\/10.1007\/978-3-642-18638-7_4 (2004)","DOI":"10.1007\/978-3-642-18638-7_4"},{"key":"401_CR35","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"T Kamada","year":"1989","unstructured":"Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Inf. Process. Lett. 31, 7\u201315 (1989)","journal-title":"Inf. Process. Lett."},{"key":"401_CR36","doi-asserted-by":"publisher","unstructured":"Noack, A.: An energy model for visual graph clustering. In: Liotta G. (eds.) Graph Drawing. GD 2003. Lecture notes in computer science, vol 2912. Springer, Berlin, Heidelberg, https:\/\/doi.org\/10.1007\/978-3-540-24595-7_40 (2004)","DOI":"10.1007\/978-3-540-24595-7_40"},{"issue":"2","key":"401_CR37","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.79.026102","volume":"79","author":"A Noack","year":"2009","unstructured":"Noack, A.: Modularity clustering is force-directed layout. Phys. Rev. E 79(2), 026102 (2009)","journal-title":"Phys. Rev. E"},{"issue":"6","key":"401_CR38","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0098679.","volume":"9","author":"M Jacomy","year":"2014","unstructured":"Jacomy, M., Venturini, T., Heymann, S., Bastian, M.: ForceAtlas2, a continuous graph layout algorithm for handy network visualization designed for the Gephi software. PLoS ONE 9(6), e98679 (2014). https:\/\/doi.org\/10.1371\/journal.pone.0098679.","journal-title":"PLoS ONE"},{"issue":"3","key":"401_CR39","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1109\/MCI.2018.2840738","volume":"13","author":"T Young","year":"2018","unstructured":"Young, T., Hazarika, D., Poira, S., Cambria, E.: Recent trends in deep learning based natural language processing. IEEE Comput. Intell. Mag. 13(3), 55\u201375 (2018). https:\/\/doi.org\/10.1109\/MCI.2018.2840738","journal-title":"IEEE Comput. Intell. Mag."},{"key":"401_CR40","doi-asserted-by":"crossref","unstructured":"Wolf, T., Debut, L., Sanh, V., Chaumond, J., Delangue, C., Moi, A., Cistac, P., Rault, T., Louf, R., Funtowicz, M., Davison, J., Shleifer, S., von Platen, P., Ma, C., Jernite, Y., Plu, J., Xu, C., Le Scao, T., Gugger, S., Drame, M., Alexander, Q.L., Rush, M.: Transformers: state-of-the-art natural language processing. Proc. the 2020 EMNLP (systems demonstrations), Association for computational linguistics. pp. 38\u201345 (2020)","DOI":"10.18653\/v1\/2020.emnlp-demos.6"},{"key":"401_CR41","doi-asserted-by":"publisher","unstructured":"Ghoniem, M., Fekete, J.D., Castagliola, P.: A comparison of the readability of graphs using node-link and matrix-based representations. IEEE symposium on information visualization, Austin, TX. pp. 17\u201324, IEEE. https:\/\/doi.org\/10.1109\/INFVIS.2004.1 (2004)","DOI":"10.1109\/INFVIS.2004.1"},{"key":"401_CR42","doi-asserted-by":"publisher","unstructured":"Hoffmann, P., Grinstein, G., Marx, K., Grosse, I., Stanley, E.: DNA visual and analytic data mining. Proceedings of the 8th Conference on visualization \u201997 (Cat. No. 97CB36155); Phoenix, AZ, USA. IEEE. pp. 437\u2013441. https:\/\/doi.org\/10.1109\/VISUAL.1997.663916.","DOI":"10.1109\/VISUAL.1997.663916"},{"issue":"1","key":"401_CR43","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1109\/TVCG.2015.2467324","volume":"22","author":"M Rubio-Sanchez","year":"2016","unstructured":"Rubio-Sanchez, M., Raya, L., Diaz, F., Sanchez, A.: A comparative study between RadViz and star coordinates. IEEE Trans. Vis. Comput. Gr. 22(1), 619\u2013628 (2016). https:\/\/doi.org\/10.1109\/TVCG.2015.2467324","journal-title":"IEEE Trans. Vis. Comput. Gr."},{"issue":"2","key":"401_CR44","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1111\/cgf.12845","volume":"35","author":"DJ Lehmann","year":"2016","unstructured":"Lehmann, D.J., Theisel, H.: General projective maps for multidimensional data projection. Comput. Gr. Forum 35(2), 443\u2013453 (2016)","journal-title":"Comput. Gr. Forum"},{"issue":"3","key":"401_CR45","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1111\/1467-8659.00280","volume":"17","author":"H Theisel","year":"1998","unstructured":"Theisel, H., Kreuseler, M.: An enhanced spring model for information visualization. Comput. Gr. Forum 17(3), 335\u2013344 (1998)","journal-title":"Comput. Gr. Forum"},{"key":"401_CR46","doi-asserted-by":"publisher","unstructured":"Kreuseler, M., Lopez, N., Schumann, H.: A scalable framework for information visualization. IEEE symposium on information visualization 2000. INFOVIS 2000, Salt Lake City, UT, USA. Proceedings, 27\u201336. https:\/\/doi.org\/10.1109\/INFVIS.2000.885088 (2000)","DOI":"10.1109\/INFVIS.2000.885088"}],"container-title":["International Journal on Digital Libraries"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00799-024-00401-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00799-024-00401-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00799-024-00401-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T08:54:35Z","timestamp":1730192075000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00799-024-00401-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,27]]},"references-count":46,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["401"],"URL":"https:\/\/doi.org\/10.1007\/s00799-024-00401-9","relation":{},"ISSN":["1432-5012","1432-1300"],"issn-type":[{"value":"1432-5012","type":"print"},{"value":"1432-1300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,27]]},"assertion":[{"value":"24 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}