{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T11:05:36Z","timestamp":1779447936648,"version":"3.53.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"3","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\/501100021855","name":"University of Ioannina","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100021855","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2026,4]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    We study the problem of temporal database indexing, i.e., indexing versions of a database table in an evolving database. Although modern machines include large memory chips, data volumes quickly exceed resources, making it infeasible to keep the entire history in memory. Therefore we require temporal indices that optimize main memory usage while remaining scalable as the history grows. We depart from the classic indexing approach, where all data versions are indexed in a single data structure, and propose LIT, a hybrid index that decouples the management of the current and past states of the indexed column. LIT includes optimized indexing modules for current (i.e., live) and past (i.e., dead) records, supporting efficient queries and updates. Furthermore, our extended approach LIT\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$^+$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mmultiscripts>\n                            <mml:mrow\/>\n                            <mml:mrow\/>\n                            <mml:mo>+<\/mml:mo>\n                          <\/mml:mmultiscripts>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    handles record versions in memory using LIT bounded by a memory budget, while managing older versions (fossils) that exceed the budget on disk. We show that LIT outperforms state-of-the-art solutions by orders of magnitude while using space linearly proportional to the number of indexed record versions, making it suitable for main-memory temporal data management. In addition, we also show that LIT\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$^+$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mmultiscripts>\n                            <mml:mrow\/>\n                            <mml:mrow\/>\n                            <mml:mo>+<\/mml:mo>\n                          <\/mml:mmultiscripts>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    efficiently indexes long database histories on disk while maintaining scalability and query performance.\n                  <\/jats:p>","DOI":"10.1007\/s00778-026-00968-6","type":"journal-article","created":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T13:00:39Z","timestamp":1773147639000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Scalable lighting-fast temporal indexing"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8846-4330","authenticated-orcid":false,"given":"Panagiotis","family":"Simatis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"George","family":"Christodoulou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Panagiotis","family":"Bouros","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nikos","family":"Mamoulis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,3,10]]},"reference":[{"key":"968_CR1","doi-asserted-by":"crossref","unstructured":"Al-Kateb, M., Ghazal, A., Crolotte, A., Bhashyam, R., Chimanchode, J., Pakala, S.P.: Temporal query processing in teradata. In: EDBT, pp. 573\u2013578 (2013)","DOI":"10.1145\/2452376.2452443"},{"key":"968_CR2","doi-asserted-by":"crossref","unstructured":"Arge, L., Vitter, J.S.: Optimal dynamic interval management in external memory (extended abstract). In: FOCS, pp. 560\u2013569 (1996)","DOI":"10.1109\/SFCS.1996.548515"},{"issue":"6","key":"968_CR3","doi-asserted-by":"publisher","first-page":"1488","DOI":"10.1137\/S009753970240481X","volume":"32","author":"L Arge","year":"2003","unstructured":"Arge, L., Vitter, J.S.: Optimal external memory interval management. SIAM J. Comput. 32(6), 1488\u20131508 (2003)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"968_CR4","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/s007780050028","volume":"5","author":"B Becker","year":"1996","unstructured":"Becker, B., Gschwind, S., Ohler, T., Seeger, B., Widmayer, P.: An asymptotically optimal multiversion b-tree. VLDB J. 5(4), 264\u2013275 (1996)","journal-title":"VLDB J."},{"key":"968_CR5","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H., Schneider, R., Seeger, B.: The R*-Tree: an efficient and robust access method for points and rectangles. In: ACM SIGMOD, pp. 322\u2013331 (1990)","DOI":"10.1145\/93597.98741"},{"key":"968_CR6","doi-asserted-by":"crossref","unstructured":"Behrend, A., Dign\u00f6s, A., Gamper, J., Schmiegelt, P., Voigt, H., Rottmann, M., Kahl, K.: Period index: a learned 2d hash index for range and duration queries. In: SSTD, pp. 100\u2013109 (2019)","DOI":"10.1145\/3340964.3340965"},{"key":"968_CR7","doi-asserted-by":"crossref","unstructured":"Bellomarini, L., Nissl, M., Sallinger, E.: itemporal: an extensible generator of temporal benchmarks. In: IEEE ICDE, pp. 2021\u20132033 (2022)","DOI":"10.1109\/ICDE53745.2022.00197"},{"key":"968_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M de Berg","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M.J., Overmars, M.H.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Berlin, Heidelberg (2008)","edition":"3"},{"key":"968_CR9","doi-asserted-by":"crossref","unstructured":"Bernhardt, A., Tamimi, S., Vin\u00e7on, T., Kn\u00f6dler, C., Stock, F., Heinz, C., Koch, A., Petrov, I.: neodbms: in-situ snapshots for multi-version DBMS on native computational storage. In: IEEE ICDE, pp. 3170\u20133173 (2022)","DOI":"10.1109\/ICDE53745.2022.00290"},{"key":"968_CR10","doi-asserted-by":"crossref","unstructured":"B\u00f6hlen, M.H., Dign\u00f6s, A., Gamper, J., Jensen, C.S.: Temporal data management - an overview. In: eBISS, vol. 324, pp. 51\u201383 (2017)","DOI":"10.1007\/978-3-319-96655-7_3"},{"key":"968_CR11","unstructured":"B\u00f6hlen, M.H., Snodgrass, R.T., Soo, M.D.: Coalescing in temporal databases. In: VLDB, pp. 180\u2013191 (1996)"},{"issue":"1","key":"968_CR12","doi-asserted-by":"publisher","first-page":"65:1","DOI":"10.1145\/3588919","volume":"1","author":"L Bornemann","year":"2023","unstructured":"Bornemann, L., Bleifu\u00df, T., Kalashnikov, D.V., Nargesian, F., Naumann, F., Srivastava, D.: Matching roles from temporal data: why joe biden is not only president, but also commander-in-chief. Proc. ACM Manag. Data 1(1), 65:1-65:26 (2023)","journal-title":"Proc. ACM Manag. Data"},{"issue":"11","key":"968_CR13","doi-asserted-by":"publisher","first-page":"1346","DOI":"10.14778\/3137628.3137644","volume":"10","author":"P Bouros","year":"2017","unstructured":"Bouros, P., Mamoulis, N.: A forward scan based plane sweep algorithm for parallel interval joins. Proc. VLDB Endow. 10(11), 1346\u20131357 (2017)","journal-title":"Proc. VLDB Endow."},{"issue":"4","key":"968_CR14","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/s00778-020-00639-0","volume":"30","author":"P Bouros","year":"2021","unstructured":"Bouros, P., Mamoulis, N., Tsitsigkos, D., Terrovitis, M.: In-memory interval joins. VLDB J. 30(4), 667\u2013691 (2021)","journal-title":"VLDB J."},{"key":"968_CR15","doi-asserted-by":"crossref","unstructured":"Campbell, F.S., Arab, B.S., Glavic, B.: Efficient answering of historical what-if queries. In: ACM SIGMOD, pp. 1556\u20131569 (2022)","DOI":"10.1145\/3514221.3526138"},{"key":"968_CR16","doi-asserted-by":"crossref","unstructured":"Ceccarello, M., Dign\u00f6s, A., Gamper, J., Khnaisser, C.: Indexing temporal relations for range-duration queries. In: SSDBM, pp. 3:1\u20133:12 (2023)","DOI":"10.1145\/3603719.3603732"},{"key":"968_CR17","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Bouros, P., Mamoulis, N.: HINT: a hierarchical index for intervals in main memory. In: ACM SIGMOD, pp. 1257\u20131270 (2022)","DOI":"10.1145\/3514221.3517873"},{"issue":"1","key":"968_CR18","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s00778-023-00798-w","volume":"33","author":"G Christodoulou","year":"2024","unstructured":"Christodoulou, G., Bouros, P., Mamoulis, N.: HINT: a hierarchical interval index for allen relationships. VLDB J. 33(1), 73\u2013100 (2024)","journal-title":"VLDB J."},{"issue":"1","key":"968_CR19","doi-asserted-by":"publisher","first-page":"20:1","DOI":"10.1145\/3639275","volume":"2","author":"G Christodoulou","year":"2024","unstructured":"Christodoulou, G., Bouros, P., Mamoulis, N.: LIT: lightning-fast in-memory temporal indexing. Proc. ACM Manag. Data 2(1), 20:1-20:27 (2024)","journal-title":"Proc. ACM Manag. Data"},{"issue":"6","key":"968_CR20","doi-asserted-by":"publisher","first-page":"639","DOI":"10.14778\/3311880.3311882","volume":"12","author":"A Dign\u00f6s","year":"2019","unstructured":"Dign\u00f6s, A., Glavic, B., Niu, X., Gamper, J., B\u00f6hlen, M.H.: Snapshot semantics for temporal multiset relations. Proc. VLDB Endow. 12(6), 639\u2013652 (2019)","journal-title":"Proc. VLDB Endow."},{"issue":"2","key":"968_CR21","doi-asserted-by":"publisher","first-page":"74","DOI":"10.14778\/3425879.3425880","volume":"14","author":"J Ding","year":"2020","unstructured":"Ding, J., Nathan, V., Alizadeh, M., Kraska, T.: Tsunami: a learned multi-dimensional index for correlated data and skewed workloads. Proc. VLDB Endow. 14(2), 74\u201386 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"968_CR22","unstructured":"Edelsbrunner, H.: Dynamic rectangle intersection searching. Tech. Rep. 47, Institute for Information Processing, TU Graz, Austria (1980)"},{"key":"968_CR23","unstructured":"Elmasri, R., Wuu, G.T.J., Kim, Y.: The time index: An access structure for temporal data. In: VLDB, pp. 1\u201312 (1990)"},{"issue":"1","key":"968_CR24","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/s00778-003-0111-3","volume":"14","author":"D Gao","year":"2005","unstructured":"Gao, D., Jensen, C.S., Snodgrass, R.T., Soo, M.D.: Join operations in temporal databases. VLDB J. 14(1), 2\u201329 (2005)","journal-title":"VLDB J."},{"key":"968_CR25","doi-asserted-by":"crossref","unstructured":"Gao, J., Sintos, S., Agarwal, P.K., Yang, J.: Durable top-k instant-stamped temporal records with user-specified scoring functions. In: IEEE ICDE, pp. 720\u2013731 (2021)","DOI":"10.1109\/ICDE51399.2021.00068"},{"key":"968_CR26","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: ACM SIGMOD, pp. 47\u201357 (1984)","DOI":"10.1145\/971697.602266"},{"key":"968_CR27","first-page":"249","volume-title":"The TSQL2 Temporal Query Language","author":"SH Hsu","year":"1995","unstructured":"Hsu, S.H., Jensen, C.S., Snodgrass, R.T.: Valid-time selection and projection. In: Snodgrass, R.T. (ed.) The TSQL2 Temporal Query Language, pp. 249\u2013296. Kluwer (1995)"},{"key":"968_CR28","doi-asserted-by":"crossref","unstructured":"Hu, X., Sintos, S., Gao, J., Agarwal, P.K., Yang, J.: Computing complex temporal join queries efficiently. In: ACM SIGMOD, pp. 2076\u20132090 (2022)","DOI":"10.1145\/3514221.3517893"},{"key":"968_CR29","doi-asserted-by":"crossref","unstructured":"Kanellakis, P.C., Ramaswamy, S., Vengroff, D.E., Vitter, J.S.: Indexing for data models with constraints and classes. In: ACM PODS, pp. 233\u2013243 (1993)","DOI":"10.1145\/153850.153884"},{"key":"968_CR30","doi-asserted-by":"crossref","unstructured":"Kaufmann, M., Manjili, A.A., Vagenas, P., Fischer, P.M., Kossmann, D., F\u00e4rber, F., May, N.: Timeline index: a unified data structure for processing queries on temporal data in SAP HANA. In: ACM SIGMOD, pp. 1173\u20131184 (2013)","DOI":"10.1145\/2463676.2465293"},{"key":"968_CR31","doi-asserted-by":"crossref","unstructured":"Kline, N., Snodgrass, R.T.: Computing temporal aggregates. In: IEEE ICDE, pp. 222\u2013231 (1995)","DOI":"10.1109\/ICDE.1995.380389"},{"key":"968_CR32","doi-asserted-by":"crossref","unstructured":"Kraska, T., Beutel, A., Chi, E.H., Dean, J., Polyzotis, N.: The case for learned index structures. In: ACM SIGMOD, pp. 489\u2013504 (2018)","DOI":"10.1145\/3183713.3196909"},{"key":"968_CR33","unstructured":"Kriegel, H., P\u00f6tke, M., Seidl, T.: Managing intervals efficiently in object-relational databases. In: VLDB, pp. 407\u2013418 (2000)"},{"issue":"3","key":"968_CR34","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/2380776.2380786","volume":"41","author":"KG Kulkarni","year":"2012","unstructured":"Kulkarni, K.G., Michels, J.: Temporal features in SQL: 2011. SIGMOD Rec. 41(3), 34\u201343 (2012)","journal-title":"SIGMOD Rec."},{"key":"968_CR35","doi-asserted-by":"crossref","unstructured":"Leutenegger, S.T., Edgington, J., L\u00f3pez, M.A.: STR: a simple and efficient algorithm for r-tree packing. In: IEEE ICDE, pp. 497\u2013506 (1997)","DOI":"10.1109\/ICDE.1997.582015"},{"issue":"2","key":"968_CR36","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s00778-024-00893-6","volume":"34","author":"Q Liu","year":"2025","unstructured":"Liu, Q., Li, M., Zeng, Y., Shen, Y., Chen, L.: How good are multi-dimensional learned indexes? an experimental survey. VLDB J. 34(2), 17 (2025)","journal-title":"VLDB J."},{"key":"968_CR37","unstructured":"Loskot, M., Wulkiewicz, A.: (2019). https:\/\/github.com\/mloskot\/spatial_index_benchmark"},{"issue":"12","key":"968_CR38","doi-asserted-by":"publisher","first-page":"2035","DOI":"10.14778\/3352063.3352122","volume":"12","author":"W Lu","year":"2019","unstructured":"Lu, W., Zhao, Z., Wang, X., Li, H., Zhang, Z., Shui, Z., Ye, S., Pan, A., Du, X.: A lightweight and efficient temporal database management system in TDSQL. Proc. VLDB Endow. 12(12), 2035\u20132046 (2019)","journal-title":"Proc. VLDB Endow."},{"key":"968_CR39","doi-asserted-by":"crossref","unstructured":"Michalopoulos, A., Tsitsigkos, D., Bouros, P., Mamoulis, N., Terrovitis, M.: Efficient nearest neighbor queries on non-point data. In: ACM SIGSPATIAL, pp. 33:1\u201333:4 (2023)","DOI":"10.1145\/3589132.3625609"},{"issue":"3","key":"968_CR40","first-page":"744","volume":"15","author":"B Moon","year":"2003","unstructured":"Moon, B., L\u00f3pez, I.F.V., Immanuel, V.: Efficient algorithms for large-scale temporal aggregation. IEEE TKDE 15(3), 744\u2013759 (2003)","journal-title":"IEEE TKDE"},{"key":"968_CR41","doi-asserted-by":"crossref","unstructured":"Moro, M.M., Tsotras, V.J.: Transaction-time indexing. In: Encyclopedia of Database Systems, Second Edition. Springer (2018)","DOI":"10.1007\/978-1-4614-8265-9_399"},{"key":"968_CR42","doi-asserted-by":"crossref","unstructured":"Moro, M.M., Tsotras, V.J.: Valid-time indexing. In: Encyclopedia of Database Systems, Second Edition. Springer (2018)","DOI":"10.1007\/978-1-4614-8265-9_1513"},{"key":"968_CR43","doi-asserted-by":"crossref","unstructured":"Nathan, V., Ding, J., Alizadeh, M., Kraska, T.: Learning multi-dimensional indexes. In: ACM SIGMOD, pp. 985\u20131000 (2020)","DOI":"10.1145\/3318464.3380579"},{"key":"968_CR44","doi-asserted-by":"crossref","unstructured":"Papaioannou, K., Theobald, M., B\u00f6hlen, M.H.: Outer and anti joins in temporal-probabilistic databases. In: IEEE ICDE, pp. 1742\u20131745 (2019)","DOI":"10.1109\/ICDE.2019.00187"},{"key":"968_CR45","doi-asserted-by":"crossref","unstructured":"Piatov, D., Helmer, S.: Sweeping-based temporal aggregation. In: SSTD, pp. 125\u2013144 (2017)","DOI":"10.1007\/978-3-319-64367-0_7"},{"key":"968_CR46","doi-asserted-by":"crossref","unstructured":"Piatov, D., Helmer, S., Dign\u00f6s, A.: An interval join optimized for modern hardware. In: IEEE ICDE, pp. 1098\u20131109. IEEE Computer Society (2016)","DOI":"10.1109\/ICDE.2016.7498316"},{"issue":"3","key":"968_CR47","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s00778-020-00650-5","volume":"30","author":"D Piatov","year":"2021","unstructured":"Piatov, D., Helmer, S., Dign\u00f6s, A., Persia, F.: Cache-efficient sweeping-based interval joins for extended allen relation predicates. VLDB J. 30(3), 379\u2013402 (2021)","journal-title":"VLDB J."},{"issue":"11","key":"968_CR48","doi-asserted-by":"publisher","first-page":"2341","DOI":"10.14778\/3407790.3407829","volume":"13","author":"J Qi","year":"2020","unstructured":"Qi, J., Liu, G., Jensen, C.S., Kulik, L.: Effectively learning spatial indices. Proc. VLDB Endow. 13(11), 2341\u20132354 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"968_CR49","doi-asserted-by":"crossref","unstructured":"Salzberg, B., Tsotras, V.J.: Comparison of access methods for time-evolving data. ACM Comput. Surv. 31(2), 158\u2013221 (1999)","DOI":"10.1145\/319806.319816"},{"key":"968_CR50","unstructured":"Saracco, C.M., Nicola, M., Gandhi, L.: A matter of time: temporal data management in db2 10. Tech. rep., IBM (2012)"},{"issue":"9","key":"968_CR51","first-page":"35","volume":"19","author":"RT Snodgrass","year":"1986","unstructured":"Snodgrass, R.T., Ahn, I.: Temporal databases. Comput. 19(9), 35\u201342 (1986)","journal-title":"Comput."},{"key":"968_CR52","doi-asserted-by":"crossref","unstructured":"Song, Z., Roussopoulos, N.: Seb-tree: an approach to index continuously moving objects. In: MDM, pp. 340\u2013344 (2003)","DOI":"10.1007\/3-540-36389-0_25"},{"key":"968_CR53","doi-asserted-by":"crossref","unstructured":"Tao, Y., Papadias, D., Faloutsos, C.: Approximate temporal aggregation. In: IEEE ICDE, pp. 190\u2013201 (2004)","DOI":"10.1109\/ICDE.2004.1319996"},{"key":"968_CR54","doi-asserted-by":"crossref","unstructured":"Tsitsigkos, D., Lampropoulos, K., Bouros, P., Mamoulis, N., Terrovitis, M.: A two-layer partitioning for non-point spatial data. In: IEEE ICDE, pp. 1787\u20131798 (2021)","DOI":"10.1109\/ICDE51399.2021.00157"},{"key":"968_CR55","doi-asserted-by":"crossref","unstructured":"U, L.H., Mamoulis, N., Berberich, K., Bedathur, S.J.: Durable top-k search in document archives. In: ACM SIGMOD, pp. 555\u2013566 (2010)","DOI":"10.1145\/1807167.1807228"},{"issue":"2","key":"968_CR56","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/384192.384193","volume":"33","author":"JS Vitter","year":"2001","unstructured":"Vitter, J.S.: External memory algorithms and data structures. ACM Comput. Surv. 33(2), 209\u2013271 (2001)","journal-title":"ACM Comput. Surv."},{"key":"968_CR57","doi-asserted-by":"crossref","unstructured":"Zhang, D., Markowetz, A., Tsotras, V.J., Gunopulos, D., Seeger, B.: Efficient computation of temporal aggregates with range predicates. In: ACM PODS (2001)","DOI":"10.1145\/375551.375600"},{"key":"968_CR58","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Hu, H., Xue, Z., Chen, C., Yu, Y., Fu, C., Zhou, X., Li, F.: SLIMSTORE: a cloud-based deduplication system for multi-version backups. In: IEEE ICDE, pp. 1841\u20131846 (2021)","DOI":"10.1109\/ICDE51399.2021.00164"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-026-00968-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-026-00968-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-026-00968-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T10:16:19Z","timestamp":1779444979000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-026-00968-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,10]]},"references-count":58,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["968"],"URL":"https:\/\/doi.org\/10.1007\/s00778-026-00968-6","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,10]]},"assertion":[{"value":"22 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"17"}}