{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T15:33:38Z","timestamp":1773243218184,"version":"3.50.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T00:00:00Z","timestamp":1773100800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T00:00:00Z","timestamp":1773100800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100006761","name":"Universidade de Vigo","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100006761","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Pattern Anal Applic"],"published-print":{"date-parts":[[2026,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>A framework for encoding the boundary of any arbitrary binary shape in a high dimensional digital image is described, with special attention to the 3D case. The voxels of the outer shell of the shape are treated as vertices in a connected subgraph of an undirected cubic grid graph which has at least a spanning tree. A traversal of this spanning tree visits each voxel in a repeatable order. The sequence of traversed edges is coded into a chain that constitutes a high dimensional chain code, analogous to the classical Freeman chain code for 2D. The outer surface of the shape can be unambiguously reconstructed from this chain code. The framework is general in the sense that it can be used under any connectivity rule in any practical number of dimensions and also with noncubic voxels. Explicit algorithms for the computation of the chain codes and the reconstruction of the digital shapes in 3D and 4D are detailed. These are based on a hybrid graph traversal algorithm. The algorithms are illustrated with some simple digital shapes and tested with a benchmark dataset of medical images of intervertebral discs.<\/jats:p>","DOI":"10.1007\/s10044-026-01630-1","type":"journal-article","created":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T19:55:48Z","timestamp":1773172548000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A general chain code framework for higher dimensions"],"prefix":"10.1007","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1109-6338","authenticated-orcid":false,"given":"Julio","family":"Mart\u00edn-Herrero","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,10]]},"reference":[{"key":"1630_CR1","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/tec.1961.5219197","volume":"10","author":"H Freeman","year":"1961","unstructured":"Freeman H (1961) On the encoding of arbitrary geometric configurations. IRE Trans Electron Comp 10:260\u2013268. https:\/\/doi.org\/10.1109\/tec.1961.5219197","journal-title":"IRE Trans Electron Comp"},{"key":"1630_CR2","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1145\/356625.356627","volume":"6","author":"H Freeman","year":"1974","unstructured":"Freeman H (1974) Computer processing of line drawing images. ACM Comput Surv 6:57\u201397. https:\/\/doi.org\/10.1145\/356625.356627","journal-title":"ACM Comput Surv"},{"key":"1630_CR3","volume-title":"Digit Pict Process","author":"A Rosenfeld","year":"1976","unstructured":"Rosenfeld A, Kak AC (1976) Digit Pict Process. Academic Press, San Diego"},{"key":"1630_CR4","doi-asserted-by":"publisher","DOI":"10.2307\/1573081","author":"RO Duda","year":"1973","unstructured":"Duda RO, Hart PE (1973) Pattern Classification and Scene Analysis. Wiley New York. https:\/\/doi.org\/10.2307\/1573081","journal-title":"Wiley New York"},{"key":"1630_CR5","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/s0146-664x(77)80021-x","volume":"6","author":"Z Kulpa","year":"1977","unstructured":"Kulpa Z (1977) Area and perimeter measurement of blobs in discrete binary pictures. Comput Graph Image Process 6:434\u2013451. https:\/\/doi.org\/10.1016\/s0146-664x(77)80021-x","journal-title":"Comput Graph Image Process"},{"key":"1630_CR6","doi-asserted-by":"publisher","first-page":"790","DOI":"10.1109\/tc.1977.1674917","volume":"26","author":"JW McKee","year":"1977","unstructured":"McKee JW, Aggarwal JK (1977) Computer recognition of partial views of curved objects. IEEE Trans Comput C 26:790\u2013800. https:\/\/doi.org\/10.1109\/tc.1977.1674917","journal-title":"IEEE Trans Comput C"},{"key":"1630_CR7","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1016\/s0146-664x(79)80041-6","volume":"10","author":"D Profitt","year":"1979","unstructured":"Profitt D, Rosen D (1979) Metrication errors and coding efficiency of chain coding schemes for the representation of lines and edges. Comput Graph Image Process 10:318\u2013332. https:\/\/doi.org\/10.1016\/s0146-664x(79)80041-6","journal-title":"Comput Graph Image Process"},{"key":"1630_CR8","volume-title":"Vision in Man Mach","author":"MD Levine","year":"1985","unstructured":"Levine MD (1985) Vision in Man Mach. McGraw-Hill, New York"},{"key":"1630_CR9","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1109\/34.24795","volume":"11","author":"J Koplowitz","year":"1989","unstructured":"Koplowitz J, Bruckstein AM (1989) Design of perimeter estimators for digitized planar shapes. IEEE Trans Pattern Anal Mach Intell 11:611\u2013622. https:\/\/doi.org\/10.1109\/34.24795","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1630_CR10","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1016\/0031-3203(94)00100-z","volume":"28","author":"J Koplowitz","year":"1995","unstructured":"Koplowitz J, Plante S (1995) Corner detection of chain code curves. Pattern Recognit 28:843\u2013852. https:\/\/doi.org\/10.1016\/0031-3203(94)00100-z","journal-title":"Pattern Recognit"},{"key":"1630_CR11","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/0031-3203(94)00132-6","volume":"28","author":"J Yuan","year":"1995","unstructured":"Yuan J, Suen C (1995) An optimal $$O(n)$$ algorithm for identifying line segments from a sequence of chain codes. Pattern Recognit 28:635\u2013645. https:\/\/doi.org\/10.1016\/0031-3203(94)00132-6","journal-title":"Pattern Recognit"},{"key":"1630_CR12","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1016\/s0031-3203(98)00158-7","volume":"32","author":"F Shih","year":"1999","unstructured":"Shih F, Wong W (1999) A one-pass algorithm for local symmetry of contours from chain code. Pattern Recognit 32:1203\u20131210. https:\/\/doi.org\/10.1016\/s0031-3203(98)00158-7","journal-title":"Pattern Recognit"},{"key":"1630_CR13","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1016\/j.patrec.2005.09.003","volume":"27","author":"Z Shi","year":"2006","unstructured":"Shi Z, Govindaraju V (2006) A chain code based scheme for fingerprint feature extraction. Pattern Recognit 27:462\u2013468. https:\/\/doi.org\/10.1016\/j.patrec.2005.09.003","journal-title":"Pattern Recognit"},{"key":"1630_CR14","doi-asserted-by":"publisher","first-page":"1660","DOI":"10.1016\/j.patcog.2006.10.013","volume":"40","author":"H S\u00e1nchez-Cruz","year":"2007","unstructured":"S\u00e1nchez-Cruz H, Bribiesca E, Rodr\u00edguez-Dagnino RM (2007) Efficiency of chain codes to represent binary objects. Pattern Recognit 40:1660\u20131674. https:\/\/doi.org\/10.1016\/j.patcog.2006.10.013","journal-title":"Pattern Recognit"},{"issue":"2","key":"1630_CR15","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1109\/tpami.1986.4767780","volume":"8","author":"T Minami","year":"1986","unstructured":"Minami T, Shinohara K (1986) Encoding of line drawings with a multiple grid chain code. IEEE Trans Pattern Anal Mach Intell 8(2):269\u2013276. https:\/\/doi.org\/10.1109\/tpami.1986.4767780","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1630_CR16","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/s0031-3203(98)00132-0","volume":"32","author":"E Bribiesca","year":"1999","unstructured":"Bribiesca E (1999) A new chain code. Pattern Recognit 32:235\u2013251. https:\/\/doi.org\/10.1016\/s0031-3203(98)00132-0","journal-title":"Pattern Recognit"},{"key":"1630_CR17","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1016\/s0031-3203(99)00093-x","volume":"33","author":"E Bribiesca","year":"2000","unstructured":"Bribiesca E (2000) A chain code for representing 3D curves. Pattern Recognit 33:755\u2013765. https:\/\/doi.org\/10.1016\/s0031-3203(99)00093-x","journal-title":"Pattern Recognit"},{"issue":"1\u20138","key":"1630_CR18","doi-asserted-by":"publisher","DOI":"10.1117\/1.2052793","volume":"44","author":"H S\u00e1nchez-Cruz","year":"2005","unstructured":"S\u00e1nchez-Cruz H, Rodr\u00edguez-Dagnino R (2005) Compressing bi-level images by means of a 3-bit chain code. SPIE Opt Eng 44(1\u20138):097004. https:\/\/doi.org\/10.1117\/1.2052793","journal-title":"SPIE Opt Eng"},{"key":"1630_CR19","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/j.patcog.2004.08.017","volume":"38","author":"Y Liu","year":"2005","unstructured":"Liu Y, Zalik B (2005) An efficient chain code with Huffman coding. Pattern Recognit 38:553\u2013557. https:\/\/doi.org\/10.1016\/j.patcog.2004.08.017","journal-title":"Pattern Recognit"},{"key":"1630_CR20","doi-asserted-by":"publisher","first-page":"2908","DOI":"10.1016\/j.patcog.2007.03.001","volume":"40","author":"YK Liu","year":"2007","unstructured":"Liu YK, Wei W, Wang PJ et al (2007) Compressed vertex chain codes. Pattern Recognit 40:2908\u20132913. https:\/\/doi.org\/10.1016\/j.patcog.2007.03.001","journal-title":"Pattern Recognit"},{"key":"1630_CR21","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0031-3203(80)90009-6","volume":"12","author":"E Bribiesca","year":"1980","unstructured":"Bribiesca E, Guzm\u00e1n A (1980) How to describe pure form and how to measure differences in shapes using shape numbers. Pattern Recognit 12:101\u2013112. https:\/\/doi.org\/10.1016\/0031-3203(80)90009-6","journal-title":"Pattern Recognit"},{"key":"1630_CR22","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1016\/0031-3203(91)90007-r","volume":"24","author":"A Blumenkrans","year":"1991","unstructured":"Blumenkrans A (1991) Two-dimensional object recognition using a two-dimensional polar transform. Pattern Recognit 24:879\u2013890. https:\/\/doi.org\/10.1016\/0031-3203(91)90007-r","journal-title":"Pattern Recognit"},{"key":"1630_CR23","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1016\/0031-3203(92)90047-m","volume":"25","author":"E Bribiesca","year":"1992","unstructured":"Bribiesca E (1992) A geometric structure for two-dimensional shapes and three-dimensional surfaces. Pattern Recognit 25:483\u2013496. https:\/\/doi.org\/10.1016\/0031-3203(92)90047-m","journal-title":"Pattern Recognit"},{"key":"1630_CR24","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0146-664x(81)90078-2","volume":"15","author":"I Chakravarty","year":"1981","unstructured":"Chakravarty I (1981) A single-pass, chain generating algorithm for region boundaries. Comput Graph Image Process 15:182\u2013193. https:\/\/doi.org\/10.1016\/0146-664x(81)90078-2","journal-title":"Comput Graph Image Process"},{"key":"1630_CR25","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/0734-189x(88)90121-1","volume":"41","author":"SD Kim","year":"1988","unstructured":"Kim SD, Lee JH, Kim JK (1988) A new chain-coding algorithm for binary images using run-length codes. Comput Vis Graph Image Process 41:114\u2013128. https:\/\/doi.org\/10.1016\/0734-189x(88)90121-1","journal-title":"Comput Vis Graph Image Process"},{"issue":"1","key":"1630_CR26","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1109\/34.184775","volume":"15","author":"LT Chen","year":"1994","unstructured":"Chen LT, Davis LS, Kruskal CP (1994) Efficient parallel processing of image contours. IEEE Trans Pattern Anal Mach Intell 15(1):113\u2013129. https:\/\/doi.org\/10.1109\/34.184775","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"4","key":"1630_CR27","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1109\/34.677272","volume":"20","author":"P Zingaretti","year":"1998","unstructured":"Zingaretti P, Gasparroni M, Vecci L (1998) Fast chain coding of region boundaries. IEEE Trans Pattern Anal Mach Intell 20(4):407\u2013415. https:\/\/doi.org\/10.1109\/34.677272","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1630_CR28","doi-asserted-by":"publisher","first-page":"9377","DOI":"10.1088\/0305-4470\/37\/40\/004","volume":"37","author":"J Mart\u00edn-Herrero","year":"2004","unstructured":"Mart\u00edn-Herrero J (2004) Hybrid cluster identification. J Phys A: Math Gen 37:9377\u20139386. https:\/\/doi.org\/10.1088\/0305-4470\/37\/40\/004","journal-title":"J Phys A: Math Gen"},{"issue":"7","key":"1630_CR29","doi-asserted-by":"publisher","first-page":"1479","DOI":"10.1109\/tgrs.2005.846867","volume":"43","author":"J Mart\u00edn-Herrero","year":"2005","unstructured":"Mart\u00edn-Herrero J, Pe\u00f3n-Fern\u00e1ndez JF (2005) Computation of longwave electromagnetic response of nonhomogeneous media. IEEE Trans Geosci Remote Sens 43(7):1479\u20131489. https:\/\/doi.org\/10.1109\/tgrs.2005.846867","journal-title":"IEEE Trans Geosci Remote Sens"},{"key":"1630_CR30","unstructured":"Mart\u00edn-Herrero J (2006) Low level image processing for nonhomogeneous media in remote sensing. PhD thesis, Universit\u00e9 Bordeaux I, pp. 143\u2013152"},{"key":"1630_CR31","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.jvcir.2008.01.001","volume":"19","author":"E Bribiesca","year":"2008","unstructured":"Bribiesca E (2008) A method for representing 3D tree objects using chain coding. J Vis Commun Image R 19:184\u2013198. https:\/\/doi.org\/10.1016\/j.jvcir.2008.01.001","journal-title":"J Vis Commun Image R"},{"key":"1630_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10044-011-0240-z","volume":"15","author":"E Bribiesca","year":"2012","unstructured":"Bribiesca E, Guzm\u00e1n A, Mart\u00ednez LA (2012) Enclosing trees Pattern Anal Applic 15:1\u201317. https:\/\/doi.org\/10.1007\/s10044-011-0240-z","journal-title":"Enclosing trees Pattern Anal Applic"},{"key":"1630_CR33","doi-asserted-by":"publisher","first-page":"1721","DOI":"10.1016\/j.patcog.2013.11.002","volume":"47","author":"E Lemus","year":"2014","unstructured":"Lemus E, Bribiesca E, Gardu\u00f1o E (2014) Representation of enclosing surfaces from simple voxelized objects by means of a chain code. Pattern Recogn 47:1721\u20131730. https:\/\/doi.org\/10.1016\/j.patcog.2013.11.002","journal-title":"Pattern Recogn"},{"issue":"2","key":"1630_CR34","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1016\/j.patcog.2013.08.010","volume":"47","author":"H Sanchez-Cruz","year":"2014","unstructured":"Sanchez-Cruz H, Lopez-Valdez HH, Cuevas FJ (2014) A new relative chain code in 3D. Pattern Recognit 47(2):769\u2013788. https:\/\/doi.org\/10.1016\/j.patcog.2013.08.010","journal-title":"Pattern Recognit"},{"key":"1630_CR35","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1007\/s10044-016-0540-4","volume":"20","author":"LA Mart\u00ednez","year":"2017","unstructured":"Mart\u00ednez LA, Bribiesca E, Guzm\u00e1n A (2017) Chain coding representation of voxel-based objects with enclosing, edging and intersecting trees. Pattern Anal Applic 20:825\u2013844. https:\/\/doi.org\/10.1007\/s10044-016-0540-4","journal-title":"Pattern Anal Applic"},{"key":"1630_CR36","doi-asserted-by":"publisher","first-page":"9491","DOI":"10.1007\/s11042-022-13588-3","volume":"82","author":"OA Tapia-Due\u00f1as","year":"2023","unstructured":"Tapia-Due\u00f1as OA, S\u00e1nchez-Cruz H, L\u00f3pez HH (2023) 3D object simplification using chain code-based point clouds. Multimed Tools Appl 82:9491\u20139515. https:\/\/doi.org\/10.1007\/s11042-022-13588-3","journal-title":"Multimed Tools Appl"},{"key":"1630_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-8971-2","author":"D K\u00f6nig","year":"1990","unstructured":"K\u00f6nig D (1990) Theory of Finite and Infinite Graphs. Birkh\u00e4user Boston. https:\/\/doi.org\/10.1007\/978-1-4684-8971-2","journal-title":"Birkh\u00e4user Boston"},{"key":"1630_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00138-006-0041-3","volume":"18","author":"J Mart\u00edn-Herrero","year":"2007","unstructured":"Mart\u00edn-Herrero J (2007) Hybrid object labelling in digital images. Mach Vis Appl 18:1\u201315. https:\/\/doi.org\/10.1007\/s00138-006-0041-3","journal-title":"Mach Vis Appl"},{"key":"1630_CR39","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan R (1972) Depth-first search and linear graph algorithms. SIAM J Comput 1:146\u2013160. https:\/\/doi.org\/10.1137\/0201010","journal-title":"SIAM J Comput"},{"key":"1630_CR40","doi-asserted-by":"crossref","unstructured":"Chen C, Belavy D, Zheng G (2014) 3D intervertebral disc localization and segmentation from MR images by data-driven regression and classification. $$5^\\text{th}$$ International Workshop on Machine Learning in Medical Imaging (MLMI 2014) pp 50\u201358. 10.1007\/978-3-319-10581-9_7","DOI":"10.1007\/978-3-319-10581-9_7"},{"key":"1630_CR41","doi-asserted-by":"crossref","unstructured":"Duda RO, Hart PE, Munson JH (1967) Graphical-data-processing research study and experimental investigation. Tech. Rep. AD650926, Stanford Research Institute, p. 28\u201330","DOI":"10.21236\/AD0650926"},{"issue":"1","key":"1630_CR42","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1145\/321556.321570","volume":"17","author":"A Rosenfeld","year":"1970","unstructured":"Rosenfeld A (1970) Connectivity in digital pictures J ACM 17(1):146\u2013160. https:\/\/doi.org\/10.1145\/321556.321570","journal-title":"Connectivity in digital pictures J ACM"},{"issue":"4","key":"1630_CR43","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1145\/321356.321357","volume":"13","author":"A Rosenfeld","year":"1966","unstructured":"Rosenfeld A, Pfaltz JL (1966) Sequential operations in digital picture processing. J ACM 13(4):471\u2013494. https:\/\/doi.org\/10.1145\/321356.321357","journal-title":"J ACM"},{"issue":"1","key":"1630_CR44","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/s0304-3975(01)00050-0","volume":"283","author":"T Kong","year":"2002","unstructured":"Kong T (2002) Topological adjacency relations on Zn. Theoret Comput Sci 283(1):3\u201328. https:\/\/doi.org\/10.1016\/s0304-3975(01)00050-0","journal-title":"Theoret Comput Sci"},{"key":"1630_CR45","doi-asserted-by":"publisher","first-page":"1242","DOI":"10.1016\/j.carbon.2007.01.021","volume":"45","author":"J Mart\u00edn-Herrero","year":"2007","unstructured":"Mart\u00edn-Herrero J, Germain C (2007) Microstructure reconstruction of fibrous C\/C composites from X-ray microtomography. Carbon 45:1242\u20131253. https:\/\/doi.org\/10.1016\/j.carbon.2007.01.021","journal-title":"Carbon"},{"issue":"5","key":"1630_CR46","doi-asserted-by":"publisher","first-page":"1386","DOI":"10.1109\/tgrs.2007.894569","volume":"45","author":"J Mart\u00edn-Herrero","year":"2007","unstructured":"Mart\u00edn-Herrero J (2007) Anisotropic diffusion in the hypercube. IEEE Trans Geosci Remote Sens 45(5):1386\u20131398. https:\/\/doi.org\/10.1109\/tgrs.2007.894569","journal-title":"IEEE Trans Geosci Remote Sens"}],"container-title":["Pattern Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-026-01630-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10044-026-01630-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-026-01630-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T19:55:50Z","timestamp":1773172550000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10044-026-01630-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,10]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["1630"],"URL":"https:\/\/doi.org\/10.1007\/s10044-026-01630-1","relation":{},"ISSN":["1433-7541","1433-755X"],"issn-type":[{"value":"1433-7541","type":"print"},{"value":"1433-755X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,10]]},"assertion":[{"value":"15 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval and consent to participate"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"68"}}