{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:01:48Z","timestamp":1757617308268,"version":"3.44.0"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,12,24]],"date-time":"2024-12-24T00:00:00Z","timestamp":1734998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,12,24]],"date-time":"2024-12-24T00:00:00Z","timestamp":1734998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100010583","name":"Universit\u00e4t Konstanz","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100010583","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Geoinformatica"],"published-print":{"date-parts":[[2025,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Highways play a crucial role in transportation services as they facilitate long-distance traveling and allow driving at an almost constant speed, thus resulting in lower fuel consumption and emissions. Many existing highway systems were designed before practical computational tools had been developed. Furthermore, most existing approaches to evaluating highways focus on analyzing mobility data rather than studying the design of the highway system. To address this gap in existing research, in this paper, we investigate the problem of evaluating the efficacy of the design of real-world highway systems. To this end, we propose two novel measures for the effectiveness of highway systems, along with both exact and heuristic algorithms to compute them. In addition, we present a first-cut heuristic algorithm that aims to compute a highway system that optimizes our proposed measures. In our experiments, we demonstrate the potential of our methods in measuring the efficacy of real-world highway systems. We also evaluate the performance of our heuristic algorithm in computing a rough design of an efficient highway system.<\/jats:p>","DOI":"10.1007\/s10707-024-00533-9","type":"journal-article","created":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T20:51:51Z","timestamp":1734987111000},"page":"403-433","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Highway systems: How good are they, really?"],"prefix":"10.1007","volume":"29","author":[{"given":"Theodoros","family":"Chondrogiannis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Grossniklaus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,24]]},"reference":[{"key":"533_CR1","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10707-014-0219-1","volume":"19","author":"Y Lin","year":"2015","unstructured":"Lin Y, Mouratidis K (2015) Best upgrade plans for single and multiple source-destination pairs. GeoInformatica 19:365\u2013404","journal-title":"GeoInformatica"},{"key":"533_CR2","doi-asserted-by":"crossref","unstructured":"Song T, Schonfeld P, Pu H (2023) A review of alignment optimization research for roads, railways and rail transit lines. IEEE Transactions on Intelligent Transportation Systems","DOI":"10.1109\/TITS.2023.3235685"},{"issue":"4","key":"533_CR3","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1109\/TITS.2009.2026673","volume":"10","author":"Y Ma","year":"2009","unstructured":"Ma Y, Chowdhury M, Sadek A, Jeihani M (2009) Real-time highway traffic condition assessment framework using vehicle-infrastructure integration (vii) with artificial intelligence (ai). IEEE Trans Intell Transp Syst 10(4):615\u2013627","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"3","key":"533_CR4","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.jtrangeo.2005.10.003","volume":"14","author":"DM Scott","year":"2006","unstructured":"Scott DM, Novak DC, Aultman-Hall L, Guo F (2006) Network robustness index: A new method for identifying critical links and evaluating the performance of transportation networks. J Transp Geogr 14(3):215\u2013227","journal-title":"J Transp Geogr"},{"key":"533_CR5","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1016\/j.apenergy.2016.01.098","volume":"169","author":"E Ferrero","year":"2016","unstructured":"Ferrero E, Alessandrini S, Balanzino A (2016) Impact of the electric vehicles on the air pollution from a highway. Appl Energy 169:450\u2013459","journal-title":"Appl Energy"},{"issue":"4","key":"533_CR6","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1080\/03081067708717111","volume":"3","author":"NA Parker","year":"1977","unstructured":"Parker NA (1977) Rural highway route corridor selection. Transp Plan Technol 3(4):247\u2013256","journal-title":"Transp Plan Technol"},{"issue":"1","key":"533_CR7","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1287\/trsc.21.1.26","volume":"21","author":"D Trietsch","year":"1987","unstructured":"Trietsch D (1987) Comprehensive design of highway networks. Transp Sci 21(1):26\u201335","journal-title":"Transp Sci"},{"key":"533_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-018-0493-2","volume":"8","author":"K Das","year":"2018","unstructured":"Das K, Samanta S, Pal M (2018) Study on centrality measures in social networks: a survey. Soc Netw Anal Min 8:1\u201311","journal-title":"Soc Netw Anal Min"},{"key":"533_CR9","doi-asserted-by":"crossref","unstructured":"Chondrogiannis T, Grossniklaus M (2023) Highway systems: How good are they, really? In: International Symposium on Spatial and Temporal Data, pp. 1\u201310","DOI":"10.1145\/3609956.3609963"},{"issue":"1","key":"533_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/0116001","volume":"16","author":"EN Gilbert","year":"1968","unstructured":"Gilbert EN, Pollak HO (1968) Steiner minimal trees. SIAM J Appl Math 16(1):1\u201329","journal-title":"SIAM J Appl Math"},{"issue":"1","key":"533_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1061\/JHCEA2.0000266","volume":"94","author":"BE Howard","year":"1968","unstructured":"Howard BE, Bramnick Z, Shaw JF (1968) Optimum curvature principle in highway routing. Journal of the Highway Division. 94(1):61\u201382","journal-title":"Journal of the Highway Division."},{"issue":"1","key":"533_CR12","doi-asserted-by":"publisher","first-page":"58","DOI":"10.3141\/1659-08","volume":"1659","author":"J-C Jong","year":"1999","unstructured":"Jong J-C, Schonfeld P (1999) Cost functions for optimizing highway alignments. Transp Res Rec 1659(1):58\u201367","journal-title":"Transp Res Rec"},{"issue":"4","key":"533_CR13","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1111\/0885-9507.00190","volume":"15","author":"J-C Jong","year":"2000","unstructured":"Jong J-C, Jha MK, Schonfeld P (2000) Preliminary highway design with genetic algorithms and geographic information systems. Computer-Aided Civil and Infrastructure Engineering. 15(4):261\u2013271","journal-title":"Computer-Aided Civil and Infrastructure Engineering."},{"issue":"2","key":"533_CR14","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0191-2615(01)00047-9","volume":"37","author":"J-C Jong","year":"2003","unstructured":"Jong J-C, Schonfeld P (2003) An evolutionary model for simultaneously optimizing three-dimensional highway alignments. Transportation Research Part B: Methodological. 37(2):107\u2013128","journal-title":"Transportation Research Part B: Methodological."},{"issue":"1","key":"533_CR15","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.trc.2011.09.006","volume":"21","author":"M-W Kang","year":"2012","unstructured":"Kang M-W, Jha MK, Schonfeld P (2012) Applicability of highway alignment optimization models. Transportation Research Part C: Emerging Technologies. 21(1):257\u2013286","journal-title":"Transportation Research Part C: Emerging Technologies."},{"issue":"1","key":"533_CR16","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s12518-023-00495-x","volume":"15","author":"YM Sameer","year":"2023","unstructured":"Sameer YM, Abed AN, Sayl KN (2023) Geomatics-based approach for highway route selection. Applied Geomatics. 15(1):161\u2013176","journal-title":"Applied Geomatics."},{"issue":"4","key":"533_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2530531","volume":"46","author":"C Sommer","year":"2014","unstructured":"Sommer C (2014) Shortest-path queries in static networks. ACM Comput Surv 46(4):1\u201331","journal-title":"ACM Comput Surv"},{"key":"533_CR18","doi-asserted-by":"crossref","unstructured":"Sanders P, Schultes D (2005) Highway hierarchies hasten exact shortest path queries. In: ESA, pp. 568\u2013579","DOI":"10.1007\/11561071_51"},{"key":"533_CR19","doi-asserted-by":"crossref","unstructured":"Schultes D, Sanders P (2007) Dynamic highway-node routing. In: WEA, pp. 66\u201379","DOI":"10.1007\/978-3-540-72845-0_6"},{"key":"533_CR20","doi-asserted-by":"crossref","unstructured":"Chondrogiannis T, Gamper J (2016) Pardisp: A partition-based framework for distance and shortest path queries on road networks. In: IEEE MDM, pp. 242\u2013251","DOI":"10.1109\/MDM.2016.45"},{"key":"533_CR21","doi-asserted-by":"crossref","unstructured":"Storandt S (2018) Region-aware route planning. In: W2GIS Symp., pp. 101\u2013117","DOI":"10.1007\/978-3-319-90053-7_11"},{"key":"533_CR22","doi-asserted-by":"crossref","unstructured":"Akiba T, Iwata Y, Kawarabayashi K, Kawata Y (2014) Fast shortest-path distance queries on road networks by pruned highway labeling. In: SIAM ALENEX, pp. 147\u2013154","DOI":"10.1137\/1.9781611973198.14"},{"issue":"5","key":"533_CR23","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/2985473","volume":"63","author":"I Abraham","year":"2016","unstructured":"Abraham I, Delling D, Fiat A, Goldberg AV, Werneck RF (2016) Highway dimension and provably efficient shortest path algorithms. J ACM 63(5):41\u201314126","journal-title":"J ACM"},{"issue":"1","key":"533_CR24","doi-asserted-by":"publisher","first-page":"1210","DOI":"10.14778\/1687627.1687763","volume":"2","author":"J Sankaranarayanan","year":"2009","unstructured":"Sankaranarayanan J, Samet H, Alborzi H (2009) Path oracles for spatial networks. Proceedings of the VLDB Endowment. 2(1):1210\u20131221","journal-title":"Proceedings of the VLDB Endowment."},{"key":"533_CR25","doi-asserted-by":"crossref","unstructured":"Kosowski A, Viennot L (2017) Beyond highway dimension: small distance labels using tree skeletons. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 1462\u20131478. SIAM","DOI":"10.1137\/1.9781611974782.95"},{"key":"533_CR26","doi-asserted-by":"crossref","unstructured":"Sacharidis D, Patroumpas K, Terrovitis M, Kantere V, Potamias M, Mouratidis K, Sellis T (2008) On-line discovery of hot motion paths. In: EDBT, pp. 392\u2013403","DOI":"10.1145\/1353343.1353392"},{"key":"533_CR27","doi-asserted-by":"crossref","unstructured":"Chen Z, Shen HT, Zhou X (2011) Discovering popular routes from trajectories. In: IEEE ICDE, pp. 900\u2013911. IEEE","DOI":"10.1109\/ICDE.2011.5767890"},{"key":"533_CR28","doi-asserted-by":"crossref","unstructured":"Wei L-Y, Zheng Y, Peng W-C (2012) Constructing popular routes from uncertain trajectories. In: ACM SIGKDD, pp. 195\u2013203","DOI":"10.1145\/2339530.2339562"},{"key":"533_CR29","doi-asserted-by":"crossref","unstructured":"Luo W, Tan H, Chen L, Ni LM (2013) Finding time period-based most frequent path in big trajectory data. In: ACM SIGMOD, pp. 713\u2013724","DOI":"10.1145\/2463676.2465287"},{"issue":"4","key":"533_CR30","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1177\/107755879505200406","volume":"52","author":"CS Phibbs","year":"1995","unstructured":"Phibbs CS, Luft HS (1995) Correlation of travel time on roads versus straight line distance. Med Care Res Rev 52(4):532\u2013542","journal-title":"Med Care Res Rev"},{"issue":"9","key":"533_CR31","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1177\/0361198120933265","volume":"2674","author":"I Politis","year":"2020","unstructured":"Politis I, Kyriakoglou M, Georgiadis G, Papaioannou P (2020) Evidence from highway drivers in greece showing toll avoidance and utility of alternative routes. Transp Res Rec 2674(9):948\u2013958","journal-title":"Transp Res Rec"},{"key":"533_CR32","volume-title":"The rush in a directed graph","author":"JM Anthonisse","year":"1971","unstructured":"Anthonisse JM (1971) The rush in a directed graph. Stichting Mathematisch Centrum, Mathematische Besliskunde"},{"issue":"4","key":"533_CR33","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1016\/j.socnet.2005.11.005","volume":"28","author":"SP Borgatti","year":"2006","unstructured":"Borgatti SP, Everett MG (2006) A graph-theoretic perspective on centrality. Social networks. 28(4):466\u2013484","journal-title":"Social networks."},{"issue":"2","key":"533_CR34","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1080\/0022250X.2001.9990249","volume":"25","author":"U Brandes","year":"2001","unstructured":"Brandes U (2001) A faster algorithm for betweenness centrality. The Journal of Mathematical Sociology. 25(2):163\u2013177","journal-title":"The Journal of Mathematical Sociology."},{"issue":"2","key":"533_CR35","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.socnet.2007.11.001","volume":"30","author":"U Brandes","year":"2008","unstructured":"Brandes U (2008) On variants of shortest-path betweenness centrality and their generic computation. Social Networks. 30(2):136\u2013145","journal-title":"Social Networks."},{"issue":"1","key":"533_CR36","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1(1):269\u2013271","journal-title":"Numer Math"},{"key":"533_CR37","doi-asserted-by":"crossref","unstructured":"Abraham I, Delling D, Goldberg AV, Werneck RF (2011) A hub-based labeling algorithm for shortest paths in road networks. In: SEA, pp. 230\u2013241","DOI":"10.1007\/978-3-642-20662-7_20"},{"key":"533_CR38","doi-asserted-by":"crossref","unstructured":"Geisberger R, Sanders P, Schultes D, Delling D (2008) Contraction hierarchies: Faster and simpler hierarchical routing in road networks. In: WEA, pp. 319\u2013333","DOI":"10.1007\/978-3-540-68552-4_24"},{"issue":"3","key":"533_CR39","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1109\/69.687976","volume":"10","author":"N Jing","year":"1998","unstructured":"Jing N, Huang Y-W, Rundensteiner EA (1998) Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation. IEEE Trans Knowl Data Eng 10(3):409\u2013432","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"533_CR40","unstructured":"Jung S, Pramanik S (1996) Hiti graph model of topographical roadmaps in navigation systems. In: ICDE, pp. 76\u201384"},{"key":"533_CR41","doi-asserted-by":"crossref","unstructured":"Zhong R, Li G, Tan K-L, Zhou L (2013) G-tree: An efficient index for kNN search on road networks. In: ACM CIKM, pp. 39\u201348","DOI":"10.1145\/2505515.2505749"},{"key":"533_CR42","first-page":"13","volume":"1","author":"J Wang","year":"2014","unstructured":"Wang J, Zheng K, Jeung H, Wang H, Zheng B, Zhou X (2014) Cost-efficient spatial network partitioning for distance-based query processing. IEEE MDM 1:13\u201322","journal-title":"IEEE MDM"},{"key":"533_CR43","doi-asserted-by":"crossref","unstructured":"Delling D, Goldberg AV, Pajor T, Werneck RF (2011) Customizable route planning. In: International Symposium on Experimental Algorithms (SEA), pp. 376\u2013387. Springer","DOI":"10.1007\/978-3-642-20662-7_32"},{"issue":"1\u20132","key":"533_CR44","doi-asserted-by":"publisher","first-page":"747","DOI":"10.14778\/1920841.1920936","volume":"3","author":"G Kellaris","year":"2010","unstructured":"Kellaris G, Mouratidis K (2010) Shortest path computation on air indexes. Proceedings of the VLDB Endowment. 3(1\u20132):747\u2013757","journal-title":"Proceedings of the VLDB Endowment."},{"key":"533_CR45","doi-asserted-by":"crossref","unstructured":"Mouratidis K, Yiu ML (2012) Shortest path computation with no information leakage. Proceedings of the VLDB Endowment. 5(8)","DOI":"10.14778\/2212351.2212352"},{"issue":"12","key":"533_CR46","doi-asserted-by":"publisher","first-page":"7821","DOI":"10.1073\/pnas.122653799","volume":"99","author":"M Girvan","year":"2002","unstructured":"Girvan M, Newman ME (2002) Community structure in social and biological networks. Proc Natl Acad Sci 99(12):7821\u20137826","journal-title":"Proc Natl Acad Sci"},{"issue":"2","key":"533_CR47","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"RJ Lipton","year":"1979","unstructured":"Lipton RJ, Tarjan R (1979) E: A separator theorem for planar graphs. SIAM J Appl Math 36(2):177\u2013189","journal-title":"SIAM J Appl Math"},{"key":"533_CR48","doi-asserted-by":"crossref","unstructured":"Delling D, Goldberg AV, Pajor T, Werneck RF (2011) Customizable route planning. In: SEA, pp. 376\u2013387","DOI":"10.1007\/978-3-642-20662-7_32"},{"issue":"9","key":"533_CR49","doi-asserted-by":"publisher","first-page":"2209","DOI":"10.1002\/j.1538-7305.1967.tb04250.x","volume":"46","author":"EN Gilbert","year":"1967","unstructured":"Gilbert EN (1967) Minimum cost communication networks. Bell Syst Tech J 46(9):2209\u20132227","journal-title":"Bell Syst Tech J"},{"issue":"2","key":"533_CR50","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1137\/S089548019732653X","volume":"12","author":"D-Z Du","year":"1999","unstructured":"Du D-Z, Hwang FK, Xue G (1999) Interconnecting highways. SIAM J Discret Math 12(2):252\u2013261","journal-title":"SIAM J Discret Math"},{"issue":"1","key":"533_CR51","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/trsc.21.1.17","volume":"21","author":"D Trietsch","year":"1987","unstructured":"Trietsch D (1987) A family of methods for preliminary highway alignment. Transp Sci 21(1):17\u201325","journal-title":"Transp Sci"},{"issue":"2","key":"533_CR52","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.026118","volume":"64","author":"ME Newman","year":"2001","unstructured":"Newman ME, Strogatz SH, Watts DJ (2001) Random graphs with arbitrary degree distributions and their applications. Phys Rev E 64(2):026118","journal-title":"Phys Rev E"},{"key":"533_CR53","unstructured":"Dodge Y (2008) Kolmogorov\u2013Smirnov Test, pp. 283\u2013287. Springer, ???"},{"key":"533_CR54","unstructured":"Molin P, Abdi H (1998) New table and numerical approximations for kolmogorov-smirnov\/lilliefors\/van soest normality test. Technical report, University of Bourgogne, Dijon"},{"key":"533_CR55","doi-asserted-by":"crossref","unstructured":"Fisher RA (1992) Statistical Methods for Research Workers, pp. 66\u201370. Springer, ???","DOI":"10.1007\/978-1-4612-4380-9_6"},{"issue":"1","key":"533_CR56","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1038\/s41562-017-0189-z","volume":"2","author":"DJ Benjamin","year":"2018","unstructured":"Benjamin DJ, Berger JO, Johannesson M, Nosek BA, Wagenmakers E-J, Berk R, Bollen KA, Brembs B, Brown L, Camerer C et al (2018) Redefine statistical significance. Nature human behaviour. 2(1):6\u201310","journal-title":"Redefine statistical significance. Nature human behaviour."},{"issue":"2","key":"533_CR57","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1080\/00031305.2016.1154108","volume":"70","author":"RL Wasserstein","year":"2016","unstructured":"Wasserstein RL, Lazar NA (2016) The ASA statement on p-values: Context, process, and purpose. Am Stat 70(2):129\u2013133","journal-title":"Am Stat"},{"issue":"1","key":"533_CR58","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis G, Kumar V (1998) A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J Sci Comput 20(1):359\u2013392","journal-title":"SIAM J Sci Comput"},{"key":"533_CR59","doi-asserted-by":"crossref","unstructured":"Delling D, Goldberg AV, Razenshteyn I, Werneck RF (2011) Graph partitioning with natural cuts. In: 2011 IEEE International Parallel & Distributed Processing Symposium, pp. 1135\u20131146. IEEE","DOI":"10.1109\/IPDPS.2011.108"},{"key":"533_CR60","unstructured":"OpenStreetMap. https:\/\/www.openstreetmap.org\/"},{"key":"533_CR61","unstructured":"OSMnx. https:\/\/osmnx.readthedocs.io\/en\/stable\/"}],"container-title":["GeoInformatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-024-00533-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10707-024-00533-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10707-024-00533-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T02:16:38Z","timestamp":1757124998000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10707-024-00533-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,24]]},"references-count":61,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["533"],"URL":"https:\/\/doi.org\/10.1007\/s10707-024-00533-9","relation":{},"ISSN":["1384-6175","1573-7624"],"issn-type":[{"type":"print","value":"1384-6175"},{"type":"electronic","value":"1573-7624"}],"subject":[],"published":{"date-parts":[[2024,12,24]]},"assertion":[{"value":"15 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 September 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 December 2024","order":4,"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 competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}