{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T08:09:30Z","timestamp":1771315770859,"version":"3.50.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T00:00:00Z","timestamp":1771027200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T00:00:00Z","timestamp":1771286400000},"content-version":"vor","delay-in-days":3,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"DOI":"10.13039\/501100011033","name":"Agencia Estatal de Investigaci\u00f3n","doi-asserted-by":"crossref","award":["PID2024-155946NB-I00"],"award-info":[{"award-number":["PID2024-155946NB-I00"]}],"id":[{"id":"10.13039\/501100011033","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100011033","name":"Agencia Estatal de Investigaci\u00f3n","doi-asserted-by":"crossref","award":["PID2024-155946NB-I00"],"award-info":[{"award-number":["PID2024-155946NB-I00"]}],"id":[{"id":"10.13039\/501100011033","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Netw Sci"],"DOI":"10.1007\/s41109-025-00760-5","type":"journal-article","created":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T08:25:20Z","timestamp":1771057520000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Who is the root in a syntactic dependency structure?"],"prefix":"10.1007","volume":"11","author":[{"given":"Ramon","family":"Ferrer-i-Cancho","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7359-1815","authenticated-orcid":false,"given":"Marta","family":"Arias","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"key":"760_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2021.106204","volume":"174","author":"L Alemany-Puig","year":"2022","unstructured":"Alemany-Puig L, Esteban JL, Ferrer-i-Cancho R (2022) Minimum projective linearizations of trees in linear time. Inf Process Lett 174:106204. https:\/\/doi.org\/10.1016\/j.ipl.2021.106204","journal-title":"Inf Process Lett"},{"issue":"3","key":"760_CR2","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1162\/coli_a_00442","volume":"48","author":"L Alemany-Puig","year":"2022","unstructured":"Alemany-Puig L, Ferrer-i-Cancho R (2022) Linear-time calculation of the expected sum of edge lengths in random projective linearizations of trees. J Comp Ling 48(3):491\u2013516. https:\/\/doi.org\/10.1162\/coli_a_00442","journal-title":"J Comp Ling"},{"issue":"1","key":"760_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.15398\/jlm.v12i1.362","volume":"12","author":"L Alemany-Puig","year":"2024","unstructured":"Alemany-Puig L, Ferrer-i-Cancho R (2024) The expected sum of edge lengths in planar linearizations of trees. J Lang Modell 12(1):1\u201342. https:\/\/doi.org\/10.15398\/jlm.v12i1.362","journal-title":"J Lang Modell"},{"issue":"1","key":"760_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2010.11.002","volume":"499","author":"M Barth\u00e9lemy","year":"2011","unstructured":"Barth\u00e9lemy M (2011) Spatial networks. Phys Rep 499(1):1\u2013101. https:\/\/doi.org\/10.1016\/j.physrep.2010.11.002","journal-title":"Phys Rep"},{"key":"760_CR5","doi-asserted-by":"publisher","unstructured":"Britz T (2019) On the betweenness centrality of trees, forests and cycles. Sustainable Forestry 2(2), https:\/\/doi.org\/10.24294\/sf.v1i2.968","DOI":"10.24294\/sf.v1i2.968"},{"key":"760_CR6","first-page":"104","volume":"40","author":"X Chen","year":"2018","unstructured":"Chen X, G\u00f3mez-Rodr\u00edguez C, Ferrer-i-Cancho R (2018) A dependency look at the reality of constituency. Glottometrics 40:104\u2013106","journal-title":"Glottometrics"},{"issue":"1","key":"760_CR7","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0898-1221(84)90085-3","volume":"10","author":"FRK Chung","year":"1984","unstructured":"Chung FRK (1984) On optimal linear arrangements of trees. Comp Maths Appl 10(1):43\u201360","journal-title":"Comp Maths Appl"},{"key":"760_CR8","volume-title":"Practical nonparametric statistics","author":"WJ Conover","year":"1999","unstructured":"Conover WJ (1999) Practical nonparametric statistics, 3rd edn. Wiley, New York","edition":"3"},{"key":"760_CR9","unstructured":"Covington MA (2001) A fundamental algorithm for dependency parsing. Proceedings of the 39th annual ACM Southeast conference (pp 95\u2013102). New York, NY, USA:ACM"},{"key":"760_CR10","unstructured":"Croft B, Metzler D, Strohman T (2010) Search engines: Information retrieval in practice. Addison Wesley"},{"issue":"1","key":"760_CR11","doi-asserted-by":"publisher","DOI":"10.1063\/1.2150162","volume":"16","author":"P Crucitti","year":"2006","unstructured":"Crucitti P, Latora V, Porta S (2006) Centrality in networks of urban streets. Chaos An Inter J Nonl Sci 16(1):015113. https:\/\/doi.org\/10.1063\/1.2150162","journal-title":"Chaos An Inter J Nonl Sci"},{"key":"760_CR12","unstructured":"Dryer MS, Haspelmath M (Eds) (2013) WALS Online. Leipzig: Max Planck Institute for Evolutionary Anthropology. http:\/\/wals.info\/"},{"key":"760_CR13","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.056135","volume":"70","author":"R Ferrer-i-Cancho","year":"2004","unstructured":"Ferrer-i-Cancho R (2004) Euclidean distance between syntactically linked words. Phys Rev E 70:056135. https:\/\/doi.org\/10.1103\/PhysRevE.70.056135","journal-title":"Phys Rev E"},{"key":"760_CR14","first-page":"1","volume":"25","author":"R Ferrer-i-Cancho","year":"2013","unstructured":"Ferrer-i-Cancho R (2013) Hubiness, length, crossings and their relationships in dependency trees. Glottometrics 25:1\u201321","journal-title":"Glottometrics"},{"issue":"1","key":"760_CR15","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1080\/09296174.2024.2400847","volume":"32","author":"R Ferrer-i-Cancho","year":"2024","unstructured":"Ferrer-i-Cancho R (2024) The optimal placement of the head in the noun phrase. The case of demonstrative, numeral, adjective and noun. J Quant Lingu 32(1):26\u201353. https:\/\/doi.org\/10.1080\/09296174.2024.2400847","journal-title":"J Quant Lingu"},{"issue":"1","key":"760_CR16","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1080\/09296174.2019.1645547","volume":"28","author":"R Ferrer-i-Cancho","year":"2021","unstructured":"Ferrer-i-Cancho R, G\u00f3mez-Rodr\u00edguez C (2021) Anti dependency distance minimization in short sequences. A graph theoretic approach. J Quant Ling 28(1):50\u201376. https:\/\/doi.org\/10.1080\/09296174.2019.1645547","journal-title":"J Quant Ling"},{"key":"760_CR17","unstructured":"Ferrer-i-Cancho R, G\u00f3mez-Rodr\u00edguez C (2021b) Dependency distance minimization predicts compression. Proceedings of the second workshop on quantitative syntax (Quasy, Syntax Fest 2021) (pp\u00a045-57). Sofia, Bulgaria:Association for Computational Linguistics. https:\/\/aclanthology.org\/2021.quasy-1.4\/"},{"key":"760_CR18","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/j.physa.2017.10.048","volume":"493","author":"R Ferrer-i-Cancho","year":"2018","unstructured":"Ferrer-i-Cancho R, G\u00f3mez-Rodr\u00edguez C, Esteban JL (2018) Are crossing dependencies really scarce? Physica A 493:311\u2013329","journal-title":"Physica A"},{"key":"760_CR19","doi-asserted-by":"crossref","unstructured":"Ferrer-i-Cancho R, G\u00f3mez-Rodr\u00edguez C, Esteban JL (2021) Bounds of the sum of edge lengths in linear arrangements of trees. J Stati Mech, 023403","DOI":"10.1088\/1742-5468\/abd4d7"},{"key":"760_CR20","doi-asserted-by":"publisher","unstructured":"Ferrer-i-Cancho R, G\u00f3mez-Rodr\u00edguez C, Esteban JL, Alemany-Puig L (2022) Optimality of syntactic dependency distances. Phys Rev E 1051014308. https:\/\/doi.org\/10.1103\/PhysRevE.105.014308","DOI":"10.1103\/PhysRevE.105.014308"},{"key":"760_CR21","doi-asserted-by":"publisher","unstructured":"Ferrer-i-Cancho R, Hern\u00e1ndez-Fern\u00e1ndez A (2013) The failure of the law of brevity in two New World primates. Statistical caveats Glottotheory 41. https:\/\/doi.org\/10.1524\/glot.2013.0004","DOI":"10.1524\/glot.2013.0004"},{"key":"760_CR22","doi-asserted-by":"crossref","unstructured":"Ferrer-i-Cancho R, McCowan B (2012) The span of dependencies in dolphin whistle sequences. J Stat Mech, P06002","DOI":"10.1088\/1742-5468\/2012\/06\/P06002"},{"issue":"33","key":"760_CR23","doi-asserted-by":"publisher","first-page":"10336","DOI":"10.1073\/pnas.1502134112","volume":"112","author":"R Futrell","year":"2015","unstructured":"Futrell R, Mahowald K, Gibson E (2015) Large-scale evidence of dependency length minimization in 37 languages. Procee Nat Acad Sci USA 112(33):10336\u201310341. https:\/\/doi.org\/10.1073\/pnas.1502134112","journal-title":"Procee Nat Acad Sci USA"},{"issue":"3","key":"760_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0145289","volume":"11","author":"R Futrell","year":"2016","unstructured":"Futrell R, Stearns L, Everett DL, Piantadosi ST, Gibson E (2016) A corpus investigation of syntactic embedding in Pirah\u00e3. PLoS ONE 11(3):1\u201320. https:\/\/doi.org\/10.1371\/journal.pone.0145289","journal-title":"PLoS ONE"},{"key":"760_CR25","doi-asserted-by":"crossref","unstructured":"Gerdes K, Guillaume B, Kahane S, Perrier G (2018) SUD or surface-syntactic universal dependencies: An annotation scheme near-isomorphic to UD. Proceedings of the second workshop on universal dependencies (UDW 2018) (pp 66\u201374). Brussels, Belgium:Association for Computational Linguistics. https:\/\/www.aclweb.org\/anthology\/W18-6008","DOI":"10.18653\/v1\/W18-6008"},{"key":"760_CR26","unstructured":"Gildea D, Temperley D (2007) Optimizing grammars for minimum dependency length. Proceedings of the 45th annual meeting of the association of computational linguistics (pp 184\u2013191). Prague, Czech Republic:Association for Computational Linguistics. https:\/\/www.aclweb.org\/anthology\/P07-1024"},{"key":"760_CR27","doi-asserted-by":"crossref","unstructured":"Han W, Jiang Y, Ng HT, Tu K (2020) A survey of unsupervised dependency parsing. Proceedings of the 28th international conference on computational linguistics (pp 2522\u20132533). Barcelona, Spain (Online):International Committee on Computational Linguistics. https:\/\/aclanthology.org\/2020.coling-main.227","DOI":"10.18653\/v1\/2020.coling-main.227"},{"key":"760_CR28","doi-asserted-by":"publisher","DOI":"10.21236\/AD0705364","volume-title":"Graph theory","author":"F Harari","year":"1969","unstructured":"Harari F (1969) Graph theory. Addison-Wesley, Reading, MA"},{"key":"760_CR29","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0020-0190(03)00261-8","volume":"87","author":"RA Hochberg","year":"2003","unstructured":"Hochberg RA, Stallmann MF (2003) Optimal one-page tree embeddings in linear time. Inf Process Lett 87:59\u201366. https:\/\/doi.org\/10.1016\/S0020-0190(03)00261-8","journal-title":"Inf Process Lett"},{"issue":"2","key":"760_CR30","first-page":"272","volume":"218","author":"MA Iordanskii","year":"1974","unstructured":"Iordanskii MA (1974) Minimal numberings of the vertices of trees. Dokl Akad Nauk SSSR 218(2):272\u2013275","journal-title":"Dokl Akad Nauk SSSR"},{"key":"760_CR31","doi-asserted-by":"crossref","unstructured":"Iordanskii MA (1987) Minimal numberings of the vertices of trees \u2014 Approximate approach. Budach L, Bukharajev RG, Lupanov OB (Eds.), Fundamentals of computation theory (pp\u00a0214-217). Berlin, Heidelberg:Springer Berlin Heidelberg","DOI":"10.1007\/3-540-18740-5_44"},{"issue":"2","key":"760_CR32","first-page":"185","volume":"70","author":"C Jordan","year":"1869","unstructured":"Jordan C (1869) Sur les assemblages de lignes. Journal f\u00fcr die reine und angewandte Mathematik 70(2):185\u2013190","journal-title":"Journal f\u00fcr die reine und angewandte Mathematik"},{"key":"760_CR33","unstructured":"Jurafsky D, Martin JH (2024) Speech and language processing (3rd Ed). https:\/\/web.stanford.edu\/~jurafsky\/slp3\/"},{"key":"760_CR34","doi-asserted-by":"publisher","unstructured":"Kang AN, Ault DA (1975) Some properties of a centroid of a free tree. Information Processing Letters 4118\u201320, https:\/\/doi.org\/10.1016\/0020-0190(75)90055-1","DOI":"10.1016\/0020-0190(75)90055-1"},{"key":"760_CR35","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-31955-9_3","volume-title":"Network analysis: Methodological foundations","author":"D Kosch\u00fctzki","year":"2005","unstructured":"Kosch\u00fctzki D, Lehmann KA, Peeters L, Richter S, Tenfelde-Podehl D, Zlotowski O (2005) Centrality indices. In: Brandes U, Erlebach T (eds) Network analysis: Methodological foundations. Springer, Berlin Heidelberg, Berlin, Heidelberg, pp 16\u201361"},{"issue":"1","key":"760_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-031-02131-2","volume":"1","author":"S K\u00fcbler","year":"2009","unstructured":"K\u00fcbler S, McDonald R, Nivre J (2009) Dependency parsing. Synthesis Lectures on Human Language Technologies 1(1):1\u2013127","journal-title":"Synthesis Lectures on Human Language Technologies"},{"key":"760_CR37","doi-asserted-by":"crossref","unstructured":"Kulmizev A, de Lhoneux M, Gontrum J, Fano E, Nivre J (2019) Deep contextualized word embeddings in transition-based and graph-based dependency parsing - a tale of two parsers revisited. Inui K, Jiang J, Ng V, Wan X (eds), Proceedings of the 2019 conference on empirical methods in natural language processing and the 9th international joint conference on natural language processing (EMNLP-IJCNLP) (pp 2755\u20132768). Hong Kong, China:Association for Computational Linguistics","DOI":"10.18653\/v1\/D19-1277"},{"key":"760_CR38","doi-asserted-by":"crossref","unstructured":"Lin D (1996) On the structural complexity of natural language sentences. COLING 1996 volume 2: The 16th international conference on computational linguistics. https:\/\/aclanthology.org\/C96-2123","DOI":"10.3115\/993268.993295"},{"key":"760_CR39","doi-asserted-by":"publisher","first-page":"159","DOI":"10.17791\/jcs.2008.9.2.159","volume":"9","author":"H Liu","year":"2008","unstructured":"Liu H (2008) Dependency distance as a metric of language comprehension difficulty. J Cogn Sci 9:159\u2013191. https:\/\/doi.org\/10.17791\/jcs.2008.9.2.159","journal-title":"J Cogn Sci"},{"issue":"6","key":"760_CR40","doi-asserted-by":"publisher","first-page":"1567","DOI":"10.1016\/j.lingua.2009.10.001","volume":"120","author":"H Liu","year":"2010","unstructured":"Liu H (2010) Dependency direction as a means of word-order typology: a method based on dependency treebanks. Lingua 120(6):1567\u20131578","journal-title":"Lingua"},{"key":"760_CR41","unstructured":"Marecek D (2016) Twelve years of unsupervised dependency parsing. B.\u00a0Brejov\u00e1 (ed), Proceedings of the 16th ITAT conference information technologies - applications and theory, tatransk\u00e9 matliare, slovakia, september 15-19, 2016 (VOL 1649, pp 56\u201362). CEUR-WS.org. https:\/\/ceur-ws.org\/Vol-1649\/56.pdf"},{"key":"760_CR42","volume-title":"Dependency syntax: theory and practice","author":"I Mel\u2019\u010duk","year":"1988","unstructured":"Mel\u2019\u010duk I (1988) Dependency syntax: theory and practice. State of New York University Press, Albany"},{"key":"760_CR43","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks. An introduction","author":"MEJ Newman","year":"2010","unstructured":"Newman MEJ (2010) Networks. An introduction. Oxford University Press, Oxford"},{"key":"760_CR44","unstructured":"Pullum GK (2024) Daniel Everett on Pirah\u00e3 syntax. Gibson E, Poliak M (Eds), From fieldwork to linguistic theory: A tribute to Dan Everett. Language Science Press"},{"issue":"1","key":"760_CR45","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/241723","volume":"2014","author":"SK Raghavan Unnithan","year":"2014","unstructured":"Raghavan Unnithan SK, Kannan B, Jathavedan M (2014) Betweenness centrality in some classes of graphs. Inter J Comb 2014(1):241723. https:\/\/doi.org\/10.1155\/2014\/241723","journal-title":"Inter J Comb"},{"key":"760_CR46","doi-asserted-by":"crossref","unstructured":"Reid KB (2010) Centrality measures in trees. Advances in interdisciplinary applied discrete mathematics (pp\u00a0167\u2013197). World Scientific","DOI":"10.1142\/9789814299152_0009"},{"key":"760_CR47","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1075\/bjl.1.05rij","volume":"1","author":"J Rijkhoff","year":"1986","unstructured":"Rijkhoff J (1986) Word order universals revisited: The principle of head proximity. Belgian J Lingu 1:95\u2013125. https:\/\/doi.org\/10.1075\/bjl.1.05rij","journal-title":"Belgian J Lingu"},{"key":"760_CR48","unstructured":"Riveros C, Salas J (2020) A family of centrality measures for graph data based on subgraphs. Lutz C, Jung JC (Eds), 23rd international conference on database theory (ICDT 2020) (Vol\u00a0155, pp 23:1\u201323:18). Dagstuhl, Germany:Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik"},{"key":"760_CR49","unstructured":"Riveros C, Salas J, Skibski O (2023) How do centrality measures choose the root of trees? Geerts F, Vandevoort B (Eds), 26th international conference on database theory (2023) (Vol\u00a0255, pp 12:1\u201312:17). Dagstuhl, Germany:Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik"},{"issue":"1","key":"760_CR50","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1137\/0208002","volume":"8","author":"Y Shiloach","year":"1979","unstructured":"Shiloach Y (1979) A minimum linear arrangement algorithm for undirected trees. SIAM J Comput 8(1):15\u201332","journal-title":"SIAM J Comput"},{"key":"760_CR51","doi-asserted-by":"publisher","unstructured":"Sigmundson R, Girard-Buttoz C, Le Floch A, Azaiez TS, McElreath R, Zuberb\u00fchler K, Crockford C (2025) Vocal sequence diversity and length remain stable across ontogeny in a catarrhine monkey (Cercocebus atys). Communications Biology 81. https:\/\/doi.org\/10.1038\/s42003-025-07922-2","DOI":"10.1038\/s42003-025-07922-2"},{"issue":"3\u20134","key":"760_CR52","doi-asserted-by":"publisher","first-page":"107","DOI":"10.6028\/jres.079B.011","volume":"79B","author":"PJ Slater","year":"1975","unstructured":"Slater PJ (1975) Maximin facility location. J Res Natl Bur Stand 79B(3\u20134):107\u2013115","journal-title":"J Res Natl Bur Stand"},{"key":"760_CR53","unstructured":"S\u00f8gaard A (2012a) Two baselines for unsupervised dependency parsing. Cohn T, Blunsom P, Graca J (Eds), Proceedings of the NAACL-HLT workshop on the induction of linguistic structure (pp 81\u201383). Montr\u00e9al, Canada:Association for Computational Linguistics. https:\/\/aclanthology.org\/W12-1910"},{"issue":"2","key":"760_CR54","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1017\/S1351324912000022","volume":"18","author":"A S\u00f8gaard","year":"2012","unstructured":"S\u00f8gaard A (2012) Unsupervised dependency parsing without training. Nat Lang Eng 18(2):187\u2013203. https:\/\/doi.org\/10.1017\/S1351324912000022","journal-title":"Nat Lang Eng"},{"key":"760_CR55","unstructured":"Steinbach P (1995) Field guide to simple graphs. In: (2nd ed., VOL\u00a03, chap. 2: Centers and Centroids). Albuquerque, NM:Design Lab, Albuquerque Technical-Vocational"},{"issue":"5","key":"760_CR56","doi-asserted-by":"publisher","first-page":"1251","DOI":"10.1515\/ling-2019-0049","volume":"59","author":"B Winter","year":"2021","unstructured":"Winter B, Grice M (2021) Independence and generalizability in linguistics. Linguistics 59(5):1251\u20131277. https:\/\/doi.org\/10.1515\/ling-2019-0049","journal-title":"Linguistics"},{"key":"760_CR57","unstructured":"Zeman D, Nivre J, Abrams M, Ackermann E, Aepli N, Agi\u0107 \u017d. ... others (2020) Universal dependencies 2.6. http:\/\/hdl.handle.net\/11234\/1-3226 LINDAT\/CLARIAH-CZ digital library at the Institute of Formal and Applied Linguistics (\u00daFAL), Faculty of Mathematics and Physics, Charles University"},{"key":"760_CR58","doi-asserted-by":"crossref","unstructured":"Zeman D, Popel M, Straka M, Haji\u010d J, Nivre J, Ginter F others (2017) CoNLL 2017 shared task: multilingual parsing from raw text to universal dependencies. Proceedings of the CoNLL 2017 shared task: Multilingual parsing from raw text to universal dependencies (pp 1\u201319). Vancouver, Canada:Association for Computational Linguistics. https:\/\/www.aclweb.org\/anthology\/K17-3001","DOI":"10.18653\/v1\/K17-3001"}],"container-title":["Applied Network Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41109-025-00760-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-025-00760-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41109-025-00760-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T07:25:24Z","timestamp":1771313124000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41109-025-00760-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,14]]},"references-count":58,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["760"],"URL":"https:\/\/doi.org\/10.1007\/s41109-025-00760-5","relation":{},"ISSN":["2364-8228"],"issn-type":[{"value":"2364-8228","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,14]]},"assertion":[{"value":"23 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 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"}}],"article-number":"20"}}