{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T06:46:34Z","timestamp":1784357194395,"version":"3.55.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T00:00:00Z","timestamp":1705017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T00:00:00Z","timestamp":1705017600000},"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":["Stat Comput"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1007\/s11222-023-10376-3","type":"journal-article","created":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T05:02:03Z","timestamp":1705035723000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Bayesian contiguity constrained clustering"],"prefix":"10.1007","volume":"34","author":[{"given":"Etienne","family":"C\u00f4me","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,1,12]]},"reference":[{"issue":"1","key":"10376_CR1","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1186\/s13015-019-0157-4","volume":"14","author":"C Ambroise","year":"2019","unstructured":"Ambroise, C., Dehman, A., Neuvial, P., et al.: Adjacency-constrained hierarchical clustering of a band similarity matrix with application to genomics. Algorithms Mol. Biol. 14(1), 22 (2019)","journal-title":"Algorithms Mol. Biol."},{"key":"10376_CR2","doi-asserted-by":"publisher","unstructured":"Angriman, E., Predari, M., van\u00a0der Grinten, A., et\u00a0al.: Approximation of the diagonal of a Laplacian\u2019s pseudoinverse for complex network analysis. In: Grandoni, F., Herman, G., Sanders, P. (eds.) 28th Annual European Symposium on Algorithms (ESA 2020), Leibniz International Proceedings in Informatics (LIPIcs), vol. 173, pp. 6:1\u20136:24. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2020.6, https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2020\/12872","DOI":"10.4230\/LIPIcs.ESA.2020.6"},{"key":"10376_CR3","first-page":"310","volume-title":"Spatial Econometrics","author":"L Anselin","year":"2001","unstructured":"Anselin, L.: Spatial Econometrics, vol. 310330, pp. 310\u2013330. Wiley, Hoboken (2001)"},{"issue":"7","key":"10376_CR4","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1080\/13658810600665111","volume":"20","author":"RM Assun\u00e7\u00e3o","year":"2006","unstructured":"Assun\u00e7\u00e3o, R.M., Neves, M.C., C\u00e2mara, G., et al.: Efficient regionalization techniques for socio-economic geographical units using minimum spanning trees. Int. J. Geogr. Inf. Sci. 20(7), 797\u2013811 (2006). https:\/\/doi.org\/10.1080\/13658810600665111","journal-title":"Int. J. Geogr. Inf. Sci."},{"issue":"421","key":"10376_CR5","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1080\/01621459.1993.10594323","volume":"88","author":"D Barry","year":"1993","unstructured":"Barry, D., Hartigan, J.A.: A Bayesian analysis for change point problems. J. Am. Stat. Assoc. 88(421), 309\u2013319 (1993). https:\/\/doi.org\/10.1080\/01621459.1993.10594323","journal-title":"J. Am. Stat. Assoc."},{"key":"10376_CR6","unstructured":"Bates, D., Maechler, M.: Matrix: Sparse and Dense Matrix Classes and Methods (2019). https:\/\/CRAN.R-project.org\/package=Matrix, r package version 1.2-17"},{"key":"10376_CR7","doi-asserted-by":"publisher","unstructured":"Bellocchi, L., Geroliminis, N.: Shenzhen Whole Day Speeds (2019). https:\/\/doi.org\/10.6084\/m9.figshare.7212230.v2, figshare.com\/articles\/dataset\/Shenzhen_whole_day_Speeds\/7212230","DOI":"10.6084\/m9.figshare.7212230.v2"},{"key":"10376_CR8","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1109\/34.865189","volume":"7","author":"C Biernacki","year":"2000","unstructured":"Biernacki, C., Celeux, G., Govaert, G.: Assessing a mixture model for clustering with the integrated completed likelihood. IEEE Trans. Pattern Anal. Mach. Intell. 7, 719\u2013725 (2000)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10376_CR9","doi-asserted-by":"publisher","first-page":"2991","DOI":"10.1016\/j.jspi.2010.03.042","volume":"140","author":"C Biernacki","year":"2010","unstructured":"Biernacki, C., Celeux, G., Govaert, G.: Exact and Monte Carlo calculations of integrated likelihoods for the latent class model. J. Stat. Plan. Inference 140, 2991\u20133002 (2010)","journal-title":"J. Stat. Plan. Inference"},{"key":"10376_CR10","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1093\/biomet\/65.1.31","volume":"65","author":"D Binder","year":"1978","unstructured":"Binder, D.: Bayesian cluster analysis. Biometrika 65, 31\u201338 (1978)","journal-title":"Biometrika"},{"issue":"10","key":"10376_CR11","doi-asserted-by":"publisher","first-page":"P10,008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","volume":"2008","author":"VD Blondel","year":"2008","unstructured":"Blondel, V.D., Guillaume, J.L., Lambiotte, R., et al.: Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp. 2008(10), P10,008 (2008)","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"10376_CR12","unstructured":"Bondy, A., Murty, U.: Graph theory. In: Graduate Texts in Mathematics. Springer, London (2011). https:\/\/books.google.fr\/books?id=HuDFMwZOwcsC"},{"key":"10376_CR13","unstructured":"Breiman, L.: Classification and Regression Trees. The Wadsworth & Brooks\/Cole (1984)"},{"key":"10376_CR14","first-page":"376","volume":"23","author":"A Cayley","year":"1889","unstructured":"Cayley, A.: A theorem on trees. Quat. J. Math. 23, 376\u2013378 (1889)","journal-title":"Quat. J. Math."},{"issue":"4","key":"10376_CR15","doi-asserted-by":"publisher","first-page":"1799","DOI":"10.1007\/s00180-018-0791-1","volume":"33","author":"M Chavent","year":"2018","unstructured":"Chavent, M., Kuentz-Simonet, V., Labenne, A., et al.: ClustGeo: an R package for hierarchical clustering with spatial constraints. Comput. Stat. 33(4), 1799\u20131822 (2018). https:\/\/doi.org\/10.1007\/s00180-018-0791-1","journal-title":"Comput. Stat."},{"key":"10376_CR16","doi-asserted-by":"publisher","first-page":"22:1","DOI":"10.1145\/1391989.1391995","volume":"35","author":"Y Chen","year":"2008","unstructured":"Chen, Y., Davis, T., Hager, W., et al.: Algorithm 887: CHOLMOD, supernodal sparse Cholesky factorization and update\/downdate. ACM Trans. Math. Softw. 35, 22:1-22:14 (2008). https:\/\/doi.org\/10.1145\/1391989.1391995","journal-title":"ACM Trans. Math. Softw."},{"key":"10376_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/s11634-021-00440-z","author":"E C\u00f4me","year":"2021","unstructured":"C\u00f4me, E., Latouche, P., Jouvin, N., et al.: Hierarchical clustering with discrete latent variable models and the integrated classification likelihood. Adv. Data Anal. Classif. (2021). https:\/\/doi.org\/10.1007\/s11634-021-00440-z","journal-title":"Adv. Data Anal. Classif."},{"key":"10376_CR18","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1137\/S0895479897321076","volume":"20","author":"TA Davis","year":"1999","unstructured":"Davis, T.A., Hager, W.W.: Modifying a sparse Cholesky factorization. SIAM J. Matrix Anal. Appl. 20, 606\u2013627 (1999). https:\/\/doi.org\/10.1137\/S0895479897321076","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10376_CR19","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1137\/S0895479899357346","volume":"22","author":"TA Davis","year":"2001","unstructured":"Davis, T.A., Hager, W.W.: Multiple-rank modifications of a sparse Cholesky factorization. SIAM J. Matrix Anal. Appl. 22, 997\u20131013 (2001). https:\/\/doi.org\/10.1137\/S0895479899357346","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10376_CR20","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1137\/S089547980343641X","volume":"26","author":"TA Davis","year":"2005","unstructured":"Davis, T.A., Hager, W.W.: Row modifications of a sparse Cholesky factorization. SIAM J. Matrix Anal. Appl. 26, 621\u2013639 (2005). https:\/\/doi.org\/10.1137\/S089547980343641X","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10376_CR21","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1214\/aos\/1176344611","volume":"7","author":"P Diaconis","year":"1979","unstructured":"Diaconis, P., Ylvisaker, D.: Conjugate priors for exponential families. Ann. Stat. 7, 269\u2013281 (1979)","journal-title":"Ann. Stat."},{"key":"10376_CR22","doi-asserted-by":"publisher","first-page":"e3188v1","DOI":"10.7287\/peerj.preprints.3188v1","volume":"5","author":"D Eddelbuettel","year":"2017","unstructured":"Eddelbuettel, D., Balamuta, J.J.: Extending extitR with extitC++: A Brief Introduction to extitRcpp. PeerJ Preprints 5, e3188v1 (2017). https:\/\/doi.org\/10.7287\/peerj.preprints.3188v1","journal-title":"PeerJ Preprints"},{"key":"10376_CR23","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1016\/j.csda.2013.02.005","volume":"71","author":"D Eddelbuettel","year":"2014","unstructured":"Eddelbuettel, D., Sanderson, C.: RcppArmadillo: accelerating r with high-performance C++ linear algebra. Comput. Stat. Data Anal. 71, 1054\u20131063 (2014). https:\/\/doi.org\/10.1016\/j.csda.2013.02.005","journal-title":"Comput. Stat. Data Anal."},{"key":"10376_CR24","doi-asserted-by":"publisher","DOI":"10.1214\/09-BA414","author":"A Fritsch","year":"2009","unstructured":"Fritsch, A., Ickstadt, K.: An improved criterion for clustering based on the posterior similarity matrix. Bayesian Anal. (2009). https:\/\/doi.org\/10.1214\/09-BA414","journal-title":"Bayesian Anal."},{"key":"10376_CR25","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0167-9473(95)00005-4","volume":"21","author":"A Gordon","year":"1996","unstructured":"Gordon, A.: A survey of constrained classification. Comput. Stat. Data Anal. 21, 17\u201329 (1996)","journal-title":"Comput. Stat. Data Anal."},{"issue":"483","key":"10376_CR26","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1198\/016214508000000689","volume":"103","author":"RB Gramacy","year":"2008","unstructured":"Gramacy, R.B., Lee, H.K.H.: Bayesian treed gaussian process models with an application to computer modeling. J. Am. Stat. Assoc. 103(483), 1119\u20131130 (2008). https:\/\/doi.org\/10.1198\/016214508000000689","journal-title":"J. Am. Stat. Assoc."},{"key":"10376_CR27","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0098-3004(87)90022-7","volume":"13","author":"EC Grimm","year":"1987","unstructured":"Grimm, E.C.: CONISS: a FORTRAN 77 program for stratigraphically constrained analysis by the method of incremental sum of squares. Comput. Geosci. 13, 13\u201335 (1987)","journal-title":"Comput. Geosci."},{"issue":"7","key":"10376_CR28","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1080\/13658810701674970","volume":"22","author":"D Guo","year":"2008","unstructured":"Guo, D.: Regionalization with dynamically constrained agglomerative clustering and partitioning (redcap). Int. J. Geogr. Inf. Sci. 22(7), 801\u2013823 (2008). https:\/\/doi.org\/10.1080\/13658810701674970","journal-title":"Int. J. Geogr. Inf. Sci."},{"issue":"11","key":"10376_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0260201","volume":"16","author":"SA Haghbayan","year":"2021","unstructured":"Haghbayan, S.A., Geroliminis, N., Akbarzadeh, M.: Community detection in large scale congested urban road networks. PLoS ONE 16(11), 1\u201314 (2021). https:\/\/doi.org\/10.1371\/journal.pone.0260201","journal-title":"PLoS ONE"},{"issue":"8","key":"10376_CR30","doi-asserted-by":"publisher","first-page":"2745","DOI":"10.1080\/03610929008830345","volume":"19","author":"J Hartigan","year":"1990","unstructured":"Hartigan, J.: Partition models. Commun. Stat. Theory Methods 19(8), 2745\u20132756 (1990). https:\/\/doi.org\/10.1080\/03610929008830345","journal-title":"Commun. Stat. Theory Methods"},{"key":"10376_CR31","unstructured":"Hayashi, T., Akiba, T., Yoshida, Y.: Efficient algorithms for spanning tree centrality. In: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI-16), pp. 3733\u20133739 (2016)"},{"issue":"19","key":"10376_CR32","doi-asserted-by":"publisher","first-page":"3868","DOI":"10.1002\/sim.3253","volume":"27","author":"A Hegarty","year":"2008","unstructured":"Hegarty, A., Barry, D.: Bayesian disease mapping using product partition models. Stat. Med. 27(19), 3868\u20133893 (2008). https:\/\/doi.org\/10.1002\/sim.3253","journal-title":"Stat. Med."},{"key":"10376_CR33","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1016\/j.trb.2012.08.005","volume":"46","author":"Y Ji","year":"2012","unstructured":"Ji, Y., Geroliminis, N.: On the spatial partitioning of urban transportation networks. Transp. Res. Part B Methodol. 46, 1639\u20131656 (2012)","journal-title":"Transp. Res. Part B Methodol."},{"key":"10376_CR34","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1002\/andp.18471481202","volume":"148","author":"G Kirchhoff","year":"1847","unstructured":"Kirchhoff, G.: \u00dcber die aufl\u00f6sung der gleichungen, auf welche man bei der untersuchung der linearen vertheilung galvanischer str\u00f6me gef\u00fchrt wird. Ann. Phys. 148, 497\u2013508 (1847). https:\/\/doi.org\/10.1002\/andp.18471481202","journal-title":"Ann. Phys."},{"key":"10376_CR35","unstructured":"Lebart, L.: Programme d\u2019agr\u00e9gation avec contraintes. Cahiers de l\u2019analyse des donn\u00e9es 3(3):275\u2013287 ( 1978). http:\/\/www.numdam.org\/item\/CAD_1978__3_3_275_0\/"},{"key":"10376_CR36","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1068\/a070509","volume":"7","author":"I Masser","year":"1975","unstructured":"Masser, I., Brown, P.J.B.: Hierarchical aggregation procedures for interaction data. Environ. Plan. A 7, 509\u2013523 (1975)","journal-title":"Environ. Plan. A"},{"key":"10376_CR37","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1093\/comjnl\/28.1.82","volume":"28","author":"F Murtagh","year":"1985","unstructured":"Murtagh, F.: A survey of algorithms for contiguity-constrained clustering and related problems. Comput. J. 28, 82\u201388 (1985)","journal-title":"Comput. J."},{"key":"10376_CR38","doi-asserted-by":"publisher","unstructured":"Murtagh, F., Contreras, P.: Algorithms for hierarchical clustering: an overview. WIREs Data Min. Knowl. Discov. 2(1), 86\u201397 (2012). https:\/\/doi.org\/10.1002\/widm.53","DOI":"10.1002\/widm.53"},{"key":"10376_CR39","doi-asserted-by":"publisher","first-page":"459","DOI":"10.2307\/622300","volume":"2","author":"S Openshaw","year":"1977","unstructured":"Openshaw, S.: A geographical solution to scale and aggregation problems in region-building, partitioning and spatial modeling. Trans. Inst. Br. Geogr. 2, 459\u201372 (1977)","journal-title":"Trans. Inst. Br. Geogr."},{"key":"10376_CR40","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1068\/a270425","volume":"27","author":"S Openshaw","year":"1995","unstructured":"Openshaw, S., Rao, L.: Algorithms for reengineering the 1991 census geography. Environ. Plan. A 27, 425\u201346 (1995)","journal-title":"Environ. Plan. A"},{"issue":"1","key":"10376_CR41","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1214\/15-BA971","volume":"11","author":"GL Page","year":"2016","unstructured":"Page, G.L., Quintana, F.A.: Spatial product partition models. Bayesian Anal. 11(1), 265\u2013298 (2016). https:\/\/doi.org\/10.1214\/15-BA971","journal-title":"Bayesian Anal."},{"issue":"1","key":"10376_CR42","doi-asserted-by":"publisher","first-page":"439","DOI":"10.32614\/RJ-2018-009","volume":"10","author":"E Pebesma","year":"2018","unstructured":"Pebesma, E.: Simple features for R: standardized support for spatial vector data. R J. 10(1), 439\u2013446 (2018). https:\/\/doi.org\/10.32614\/RJ-2018-009","journal-title":"R J."},{"key":"10376_CR43","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/9781119483298.ch11","volume-title":"Bayesian Stochastic Blockmodeling","author":"TP Peixoto","year":"2019","unstructured":"Peixoto, T.P.: Bayesian Stochastic Blockmodeling, vol. 11, pp. 289\u2013332. John Wiley & Sons Ltd, Hoboken (2019). https:\/\/doi.org\/10.1002\/9781119483298.ch11"},{"key":"10376_CR44","unstructured":"Core Team, R.: R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria (2019). https:\/\/www.R-project.org\/"},{"key":"10376_CR45","doi-asserted-by":"publisher","DOI":"10.1007\/s00357-020-09377-y","author":"N Randriamihamison","year":"2020","unstructured":"Randriamihamison, N., Vialaneix, N., Neuvial, P.: Applicability and interpretability of ward hierarchical agglomerative clustering with or without contiguity constraints. J. Classif. (2020). https:\/\/doi.org\/10.1007\/s00357-020-09377-y","journal-title":"J. Classif."},{"key":"10376_CR46","unstructured":"Rasmussen, C., Ghahramani, Z.: Infinite mixtures of gaussian process experts. In: Dietterich, T., Becker, S., Ghahramani, Z. (eds.) Proceedings of NIPS, vol. 14. pp. 881\u2013888. MIT Press (2001)"},{"key":"10376_CR47","doi-asserted-by":"publisher","first-page":"1331","DOI":"10.1007\/s11222-016-9689-3","volume":"27","author":"L Schwaller","year":"2017","unstructured":"Schwaller, L., Robin, S.: Exact Bayesian inference for off-line change-point detection in tree-structured graphical models. Stat. Comput. 27, 1331\u20131345 (2017). https:\/\/doi.org\/10.1007\/s11222-016-9689-3","journal-title":"Stat. Comput."},{"key":"10376_CR48","doi-asserted-by":"publisher","first-page":"1331","DOI":"10.1007\/s11222-016-9689-3","volume":"27","author":"L Schwaller","year":"2017","unstructured":"Schwaller, L., Robin, S.: Exact Bayesian inference for off-line change-point detection in tree-structured graphical models. Stat. Comput. 27, 1331\u20131345 (2017). https:\/\/doi.org\/10.1007\/s11222-016-9689-3","journal-title":"Stat. Comput."},{"issue":"85","key":"10376_CR49","first-page":"1","volume":"20","author":"LV Teixeira","year":"2019","unstructured":"Teixeira, L.V., Assun\u00e7\u00e3o, R.M., Loschi, R.H.: Bayesian space-time partitioning by sampling and pruning spanning trees. J. Mach. Learn. Res. 20(85), 1\u201335 (2019)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"10376_CR50","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-019-41695-z","volume":"9","author":"VA Traag","year":"2019","unstructured":"Traag, V.A., Waltman, L., Van Eck, N.J.: From Louvain to Leiden: guaranteeing well-connected communities. Sci. Rep. 9(1), 1\u201312 (2019)","journal-title":"Sci. Rep."},{"key":"10376_CR51","first-page":"2837","volume":"11","author":"NX Vinh","year":"2010","unstructured":"Vinh, N.X., Epps, J.: Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance. J. Mach. Learn. Res. 11, 2837\u20132854 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"10376_CR52","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1214\/17-BA1073","volume":"13","author":"S Wade","year":"2018","unstructured":"Wade, S., Ghahramani, Z.: Bayesian cluster analysis: point estimation and credible balls (with discussion). Bayesian Anal. 13(2), 559\u2013626 (2018). https:\/\/doi.org\/10.1214\/17-BA1073","journal-title":"Bayesian Anal."}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-023-10376-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11222-023-10376-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-023-10376-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,23]],"date-time":"2024-03-23T08:05:34Z","timestamp":1711181134000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11222-023-10376-3"}},"subtitle":["spanning trees and dendrograms"],"short-title":[],"issued":{"date-parts":[[2024,1,12]]},"references-count":52,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["10376"],"URL":"https:\/\/doi.org\/10.1007\/s11222-023-10376-3","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"value":"0960-3174","type":"print"},{"value":"1573-1375","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,12]]},"assertion":[{"value":"16 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 December 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 January 2024","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 have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"64"}}