{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T05:12:35Z","timestamp":1778562755325,"version":"3.51.4"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T00:00:00Z","timestamp":1747958400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T00:00:00Z","timestamp":1747958400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["41422\/2018-1"],"award-info":[{"award-number":["41422\/2018-1"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["407242\/2021-0"],"award-info":[{"award-number":["407242\/2021-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["428720\/2018-7"],"award-info":[{"award-number":["428720\/2018-7"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["407242\/2021-0"],"award-info":[{"award-number":["407242\/2021-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2018\/15652-7"],"award-info":[{"award-number":["2018\/15652-7"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","award":["2015\/22308-2"],"award-info":[{"award-number":["2015\/22308-2"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Math Imaging Vis"],"published-print":{"date-parts":[[2025,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>The distance transform is a crucial technique in binary image processing, assigning the distance to the nearest contour to each foreground pixel. In this extended version of our previous work, we enhance our method for computing the maximum distance transform (DT) value, now utilizing the optimized differential image foresting transform (DIFT) and improved contour extraction processes. These advancements enable more efficient computation of the maximum DT value across all connected components of a grayscale image, significantly reducing computational time by intelligently reusing DIFT trees rooted at contour points (DIFT seeds). Our optimized algorithm now achieves processing speeds that are twice as fast as our previous differential method. The proposed attribute, maximum distance, which measures the thickness of objects within the image, has proven pivotal in different image processing approaches. We showcase this through detailed illustrations of attribute opening, extinction value filters, watershed, and ultimate attribute openings.<\/jats:p>","DOI":"10.1007\/s10851-025-01248-8","type":"journal-article","created":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T20:20:41Z","timestamp":1748031641000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Maximum Euclidean Distance Transform Computation in Component Trees Using the Differential Image Foresting Transform"],"prefix":"10.1007","volume":"67","author":[{"given":"Dennis J.","family":"Silva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paulo A. V.","family":"Miranda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wonder A. L.","family":"Alves","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronaldo F.","family":"Hashimoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji\u0159\u00ed","family":"Kosinka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos B. T. M.","family":"Roerdink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,23]]},"reference":[{"issue":"6","key":"1248_CR1","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1109\/MSP.2009.934154","volume":"26","author":"P Salembier","year":"2009","unstructured":"Salembier, P., Wilkinson, M.H.F.: Connected operators. IEEE Signal Process. Mag. 26(6), 136\u2013157 (2009)","journal-title":"IEEE Signal Process. Mag."},{"key":"1248_CR2","doi-asserted-by":"crossref","unstructured":"Neumann, L., Matas, J.: Real-time scene text localization and recognition. In: Computer Vision and Pattern Recognition (CVPR), 2012 IEEE Conference On, pp. 3538\u20133545. IEEE (2012)","DOI":"10.1109\/CVPR.2012.6248097"},{"key":"1248_CR3","doi-asserted-by":"crossref","unstructured":"Alves, W.A., Gobber, C.F., Ara\u00fajo, S.A., Hashimoto, R.F.: Segmentation of retinal blood vessels based on ultimate elongation opening. In: International Conference Image Analysis and Recognition, pp. 727\u2013733. Springer (2016)","DOI":"10.1007\/978-3-319-41501-7_81"},{"key":"1248_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.cag.2022.09.002","volume":"108","author":"J Wang","year":"2022","unstructured":"Wang, J., Silva, D.J., Kosinka, J., Telea, A., Hashimoto, R.F., Roerdink, J.B.T.M.: Interactive image manipulation using morphological trees and spline-based skeletons. Comput. Graph. 108, 61\u201373 (2022)","journal-title":"Comput. Graph."},{"key":"1248_CR5","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.patrec.2019.10.036","volume":"129","author":"DJ Silva","year":"2020","unstructured":"Silva, D.J., Alves, W.A.L., Hashimoto, R.F.: Incremental bit-quads count in component trees: theory, algorithms, and optimization. Pattern Recogn. Lett. 129, 33\u201340 (2020)","journal-title":"Pattern Recogn. Lett."},{"key":"1248_CR6","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.patrec.2014.10.012","volume":"53","author":"J Climent","year":"2015","unstructured":"Climent, J., Oliveira, L.S.: A new algorithm for number of holes attribute filtering of grey-level images. Pattern Recogn. Lett. 53, 24\u201330 (2015)","journal-title":"Pattern Recogn. Lett."},{"issue":"5","key":"1248_CR7","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1109\/T-C.1971.223289","volume":"C\u201320","author":"SB Gray","year":"1971","unstructured":"Gray, S.B.: Local properties of binary images in two dimensions. IEEE Trans. Comput. C\u201320(5), 551\u2013561 (1971)","journal-title":"IEEE Trans. Comput."},{"issue":"11","key":"1248_CR8","doi-asserted-by":"publisher","first-page":"3531","DOI":"10.1109\/TIP.2006.877518","volume":"15","author":"L Najman","year":"2006","unstructured":"Najman, L., Couprie, M.: Building the component tree in quasi-linear time. IEEE Trans. Image Process. 15(11), 3531\u20133539 (2006)","journal-title":"IEEE Trans. Image Process."},{"key":"1248_CR9","doi-asserted-by":"crossref","unstructured":"Silva, A.G., Lotufo, R.A.: New extinction values from efficient construction and analysis of extended attribute component tree. In: 2008 XXI Brazilian Symposium on Computer Graphics and Image Processing, pp. 204\u2013211 (2008)","DOI":"10.1109\/SIBGRAPI.2008.8"},{"issue":"4","key":"1248_CR10","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1109\/83.663500","volume":"7","author":"P Salembier","year":"1998","unstructured":"Salembier, P., Oliveras, A., Garrido, L.: Antiextensive connected operators for image and sequence processing. IEEE Trans. Image Process. 7(4), 555\u2013570 (1998)","journal-title":"IEEE Trans. Image Process."},{"key":"1248_CR11","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1201\/b17217","volume-title":"Image Visualization. Data Visualization: Principles and Practice","author":"A Telea","year":"2014","unstructured":"Telea, A.: Image Visualization. Data Visualization: Principles and Practice, 2nd edn., pp. 363\u2013379. CRC Press, Boca Raton (2014)","edition":"2"},{"key":"1248_CR12","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-031-57793-2_6","volume-title":"Discrete Geometry and Mathematical Morphology","author":"DJ Silva","year":"2024","unstructured":"Silva, D.J., Miranda, P.A.V., Alves, W.A.L., Hashimoto, R.F., Kosinka, J., Roerdink, J.B.T.M.: Differential maximum Euclidean distance transform computation in component trees. In: Brunetti, S., Frosini, A., Rinaldi, S. (eds.) Discrete Geometry and Mathematical Morphology, pp. 67\u201379. Springer, Cham (2024)"},{"issue":"2","key":"1248_CR13","first-page":"257","volume":"157","author":"G Ramalingam","year":"1996","unstructured":"Ramalingam, G., Reps, T.: On the computational complexity of dynamic graph problems. Theor. Comput. Sci. 157(2), 257\u2013289 (1996)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"1248_CR14","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1145\/1039488.1039492","volume":"51","author":"C Demetrescu","year":"2004","unstructured":"Demetrescu, C., Italiano, G.F.: A new approach to dynamic all pairs shortest paths. J. ACM 51(6), 968\u2013992 (2004)","journal-title":"J. ACM"},{"key":"1248_CR15","doi-asserted-by":"crossref","unstructured":"Bernstein, A., Roditty, L.: Improved dynamic algorithms for maintaining approximate shortest paths under deletions. In: Proceedings of the ACM Symposium on Theory of Computing (STOC), pp. 745\u2013754 (2011)","DOI":"10.1137\/1.9781611973082.104"},{"key":"1248_CR16","doi-asserted-by":"crossref","unstructured":"Thorup, M., Karger, D.R.: Dynamic graph algorithms with applications. In: Seventh Scandinavian Workshop on Algorithm Theory (2000)","DOI":"10.1007\/3-540-44985-X_1"},{"issue":"11","key":"1248_CR17","doi-asserted-by":"publisher","first-page":"3531","DOI":"10.1109\/TIP.2006.877518","volume":"15","author":"L Najman","year":"2006","unstructured":"Najman, L., Couprie, M.: Building the component tree in quasi-linear time. IEEE Trans. Image Process. 15(11), 3531\u20133539 (2006)","journal-title":"IEEE Trans. Image Process."},{"key":"1248_CR18","volume-title":"Digital Image Processing","author":"RC Gonzalez","year":"2018","unstructured":"Gonzalez, R.C., Woods, R.E.: Digital Image Processing, 4th edn. Pearson, New York (2018)","edition":"4"},{"issue":"1","key":"1248_CR19","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1109\/TPAMI.2004.1261076","volume":"26","author":"AX Falc\u00e3o","year":"2004","unstructured":"Falc\u00e3o, A.X., Stolfi, J., Alencar Lotufo, R.: The image foresting transform: theory, algorithms, and applications. IEEE Trans. Pattern Anal. Mach. Intell. 26(1), 19\u201329 (2004)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"7","key":"1248_CR20","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1007\/s10851-018-0793-1","volume":"60","author":"KC Ciesielski","year":"2018","unstructured":"Ciesielski, K.C., Falc\u00e3o, A.X., Miranda, P.A.V.: Path-value functions for which Dijkstra\u2019s algorithm returns optimal mapping. J. Math. Imaging Vis. 60(7), 1025\u20131036 (2018)","journal-title":"J. Math. Imaging Vis."},{"issue":"9","key":"1248_CR21","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1109\/TMI.2004.829335","volume":"23","author":"AX Falc\u00e3o","year":"2004","unstructured":"Falc\u00e3o, A.X., Bergo, F.P.: Interactive volume segmentation with differential image foresting transforms. IEEE Trans. Med. Imaging 23(9), 1100\u20131108 (2004)","journal-title":"IEEE Trans. Med. Imaging"},{"issue":"7","key":"1248_CR22","doi-asserted-by":"publisher","first-page":"1571","DOI":"10.1016\/S0031-3203(01)00148-0","volume":"35","author":"AX Falc\u00e3o","year":"2002","unstructured":"Falc\u00e3o, A.X., Costa, L.F., Cunha, B.S.: Multiscale skeletons by image foresting transform and its application to neuromorphometry. Pattern Recogn. 35(7), 1571\u20131582 (2002)","journal-title":"Pattern Recogn."},{"key":"1248_CR23","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/B978-0-08-101291-8.00003-1","volume-title":"Skeletonization","author":"A Falc\u00e3o","year":"2017","unstructured":"Falc\u00e3o, A., Feng, C., Kustra, J., Telea, A.: Chapter 2\u2014multiscale 2D medial axes and 3D surface skeletons by the image foresting transform. In: Saha, P.K., Borgefors, G., Sanniti di Baja, G. (eds.) Skeletonization, pp. 43\u201370. Academic Press, London (2017)"},{"issue":"6","key":"1248_CR24","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1016\/j.patcog.2003.10.007","volume":"37","author":"RS da Torres","year":"2004","unstructured":"da Torres, R.S., Falc\u00e3o, A.X., da Costa, L.F.: A graph-based approach for multiscale shape analysis. Pattern Recogn. 37(6), 1163\u20131174 (2004)","journal-title":"Pattern Recogn."},{"issue":"1","key":"1248_CR25","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.imavis.2005.12.010","volume":"25","author":"RS Torres","year":"2007","unstructured":"Torres, R.S., Falc\u00e3o, A.X.: Contour salience descriptors for effective image retrieval and analysis. Image Vis. Comput. 25(1), 3\u201313 (2007)","journal-title":"Image Vis. Comput."},{"key":"1248_CR26","unstructured":"Andalo, F.A., Miranda, P.A.V., Silva\u00a0Torres, R., Falc\u00e3o, A.X.: A new shape descriptor based on tensor scale. In: International Symposium on Mathematical Morphology and Its Application to Signal and Image Processing (2007)"},{"key":"1248_CR27","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-031-57793-2_6","volume-title":"Discrete Geometry Math. Morphol.","author":"DJ Silva","year":"2024","unstructured":"Silva, D.J., Miranda, P.A.V., Alves, W.A.L., Hashimoto, R.F., Kosinka, J., Roerdink, J.B.T.M.: Differential maximum Euclidean distance transform computation in component trees. In: Brunetti, S., Frosini, A., Rinaldi, S. (eds.) Discrete Geometry Math. Morphol., pp. 67\u201379. Springer, Cham (2024)"},{"key":"1248_CR28","doi-asserted-by":"publisher","first-page":"102748","DOI":"10.1016\/j.jvcir.2019.102748","volume":"71","author":"MAT Condori","year":"2020","unstructured":"Condori, M.A.T., Cappabianco, F.A.M., Falc\u00e3o, A.X., Miranda, P.A.V.: An extension of the differential image foresting transform and its application to superpixel generation. J. Vis. Commun. Image Represent. 71, 102748 (2020)","journal-title":"J. Vis. Commun. Image Represent."},{"key":"1248_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-05088-0","volume-title":"Morphological Image Analysis: Principles and Applications","author":"P Soille","year":"2004","unstructured":"Soille, P.: Morphological Image Analysis: Principles and Applications. Springer, Berlin, Heidelberg (2004)"},{"key":"1248_CR30","unstructured":"Silva, D.J.: Morphotree. https:\/\/github.com\/dennisjosesilva\/morphotree. accessed in 1st December of 2022 (2022)"},{"key":"1248_CR31","first-page":"331","volume-title":"Mathematical Morphology and its Applications to Image and Signal Processing","author":"A Meijster","year":"2000","unstructured":"Meijster, A., Roerdink, J.B.T.M., Hesselink, W.H.: A general algorithm for computing distance transforms in linear time. In: Goutsias, J., Vincent, L., Bloomberg, D.S. (eds.) Mathematical Morphology and its Applications to Image and Signal Processing, pp. 331\u2013340. Springer, Boston (2000)"},{"issue":"1","key":"1248_CR32","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1109\/42.832960","volume":"19","author":"AX Falcao","year":"2000","unstructured":"Falcao, A.X., Udupa, J.K., Miyazawa, F.K.: An ultra-fast user-steered image segmentation paradigm: live wire on the fly. IEEE Trans. Med. Imaging 19(1), 55\u201362 (2000)","journal-title":"IEEE Trans. Med. Imaging"},{"key":"1248_CR33","unstructured":"Tom, G., Mathew, M., Mondal, A., Weinman, J., Karatzas, D., Jawahar, C.V.: Robust Reading Competition\u2014Occluded RoadText. https:\/\/rrc.cvc.uab.es\/?ch=29. Accessed in 23rd July of 2024 (2024)"},{"key":"1248_CR34","unstructured":"Scikit-image: API Reference. https:\/\/scikit-image.org\/docs\/stable\/api\/skimage.transform.html#skimage.transform.rescale. accessed in 23rd July of 2024 (2024)"},{"key":"1248_CR35","doi-asserted-by":"crossref","unstructured":"Silva, D.J., Miranda, P.A.V., Alves, W.A.L., Hashimoto, R.F., Kosinka, J., Roerdink, J.B.T.M.: Efficient Maximum Euclidean Distance Transform Computation in Component Trees Using the Differential Image Foresting Transform-Experiment analysis webpage and source code. https:\/\/github.com\/dennisjosesilva\/maxdist-diff-extended. accessed in 11 May of 2025","DOI":"10.1007\/s10851-025-01248-8"},{"issue":"C","key":"1248_CR36","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.cviu.2017.06.010","volume":"165","author":"WAL Alves","year":"2017","unstructured":"Alves, W.A.L., Hashimoto, R.F., Marcotegui, B.: Ultimate levelings. Comput. Vis. Image Underst. 165(C), 60\u201374 (2017)","journal-title":"Comput. Vis. Image Underst."},{"key":"1248_CR37","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1016\/j.patrec.2020.03.013","volume":"133","author":"WAL Alves","year":"2020","unstructured":"Alves, W.A.L., Gobber, C.F., Silva, D.J., Morimitsu, A., Hashimoto, R.F., Marcotegui, B.: Image segmentation based on ultimate levelings: from attribute filters to machine learning strategies. Pattern Recogn. Lett. 133, 264\u2013271 (2020)","journal-title":"Pattern Recogn. Lett."},{"key":"1248_CR38","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.cag.2022.09.002","volume":"108","author":"J Wang","year":"2022","unstructured":"Wang, J., Silva, D.J., Kosinka, J., Telea, A., Hashimoto, R.F., Roerdink, J.B.T.M.: Interactive image manipulation using morphological trees and spline-based skeletons. Comput. Graph. 108, 61\u201373 (2022)","journal-title":"Comput. Graph."},{"key":"1248_CR39","unstructured":"Bergo, F.P., Falc\u00e3o, A.X.: A partitioned algorithm for the image foresting transform. In: Mathematical Morphology and Its Applications to Signal and Image Processing (ISMM), pp. 425\u2013436 (2007)"},{"issue":"11","key":"1248_CR40","doi-asserted-by":"publisher","first-page":"1551","DOI":"10.1016\/0031-3203(94)90133-3","volume":"27","author":"T Saito","year":"1994","unstructured":"Saito, T., Toriwaki, J.-I.: New algorithms for Euclidean distance transformation of an n-dimensional digitized picture with applications. Pattern Recogn. 27(11), 1551\u20131565 (1994)","journal-title":"Pattern Recogn."},{"issue":"3","key":"1248_CR41","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0020-0190(96)00049-X","volume":"58","author":"T Hirata","year":"1996","unstructured":"Hirata, T.: A unified linear-time algorithm for computing distance maps. Inf. Process. Lett. 58(3), 129\u2013133 (1996)","journal-title":"Inf. Process. Lett."},{"key":"1248_CR42","doi-asserted-by":"crossref","unstructured":"Cappabianco, F.A., Araujo, G., Falcao, A.X.: The image forest transform architecture. In: International Conference on Field-Programmable Technology, pp. 137\u2013144. IEEE (2007)","DOI":"10.1109\/FPT.2007.4439242"},{"key":"1248_CR43","doi-asserted-by":"publisher","unstructured":"Danielsson, P.-E.: Euclidean distance mapping. Comput. Graph. Image Process. 14(3), 227\u2013248 (1980). https:\/\/doi.org\/10.1016\/0146-664X(80)90054-4","DOI":"10.1016\/0146-664X(80)90054-4"}],"container-title":["Journal of Mathematical Imaging and Vision"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10851-025-01248-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10851-025-01248-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10851-025-01248-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T09:44:26Z","timestamp":1751535866000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10851-025-01248-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,23]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["1248"],"URL":"https:\/\/doi.org\/10.1007\/s10851-025-01248-8","relation":{},"ISSN":["0924-9907","1573-7683"],"issn-type":[{"value":"0924-9907","type":"print"},{"value":"1573-7683","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,23]]},"assertion":[{"value":"15 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2025","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Author Biographies has been updated","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"31"}}