{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,10]],"date-time":"2026-05-10T00:37:48Z","timestamp":1778373468702,"version":"3.51.4"},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,8,25]],"date-time":"2025-08-25T00:00:00Z","timestamp":1756080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,8,25]],"date-time":"2025-08-25T00:00:00Z","timestamp":1756080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2025,9]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>With the development of location-based services, smart cities, and intelligent transportation, route planning has evolved beyond shortest path finding to satisfy user\u2019s flexible travel purposes through the Optimal Routes with Collective Spatial Keywords (ORCSK) routing. Because different Points of Interest (POIs) contain different sets of keywords, the user usually needs to visit multiple POIs to fulfill all needs. Moreover, the POIs\u2019 stop hardness (time and cost) also influences user experience, but it was ignored by the existing solutions. Therefore, this work proposes to extend the ORCSK problem into Skyline Optimal Routes with Collective Spatial Keyword (Sky-ORCSK) by considering both distance and stop hardness. Specifically, we first propose the IG-Sky algorithm from the spatial keyword search perspective by extending the IG-Tree. Then we propose the DA-Sky algorithm from the path enumeration perspective by extending our previous DA-CSK. Furthermore, five optimization strategies are proposed to improve efficiency by pruning the search space. Extensive experimental evaluations on real-world datasets demonstrate the algorithms\u2019 efficacy and reliability, marking a significant step forward in refined route planning for modern urban environments.<\/jats:p>","DOI":"10.1007\/s00778-025-00940-w","type":"journal-article","created":{"date-parts":[[2025,8,25]],"date-time":"2025-08-25T19:21:56Z","timestamp":1756149716000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Route optimization with collective spatial keywords: A skyline-based approach"],"prefix":"10.1007","volume":"34","author":[{"given":"Jiajia","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiulin","family":"An","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xing","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1386-767X","authenticated-orcid":false,"given":"Lei","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fengmei","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofang","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,25]]},"reference":[{"key":"940_CR1","unstructured":"9th dimacs implementation challenge - shortest paths. http:\/\/users.diag.uniroma1.it\/challenge9\/download.shtml"},{"key":"940_CR2","unstructured":"Openstreetmap. https:\/\/www.openstreetmap.org\/"},{"key":"940_CR3","unstructured":"Real datasets for spatial databases: Road networks and points of interest. http:\/\/www.cs.utah.edu\/~lifeifei\/SpatialDataset.htm"},{"key":"940_CR4","unstructured":"Real query data in bj. https:\/\/www.didiglobal.com\/\/"},{"key":"940_CR5","unstructured":"Real query data in ny. https:\/\/www.kaggle.com\/competitions\/nyc-taxi-trip-duration\/data\/"},{"key":"940_CR6","doi-asserted-by":"crossref","unstructured":"Aljubayrin, S., He, Z., Zhang, R.: Skyline trips of multiple pois categories. In: DASFAA (2015)","DOI":"10.1007\/978-3-319-18123-3_12"},{"issue":"11","key":"940_CR7","first-page":"1136","volume":"5","author":"X Cao","year":"2012","unstructured":"Cao, X., Chen, L., Cong, G., Xiao, X.: Keyword-aware optimal route search. VLDB 5(11), 1136\u20131147 (2012)","journal-title":"Keyword-aware optimal route search. VLDB"},{"key":"940_CR8","unstructured":"Chang, L., Lin, X., Qin, L., Yu, J.X., Pei, J.: Efficiently computing top-k shortest path join. In: EDBT (2015)"},{"issue":"5","key":"940_CR9","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.1007\/s00778-020-00604-x","volume":"29","author":"T Chondrogiannis","year":"2020","unstructured":"Chondrogiannis, T., Bouros, P., Gamper, J., Leser, U., Blumenthal, D.B.: Finding k-shortest paths with limited overlap. VLDB J. 29(5), 1023\u20131047 (2020)","journal-title":"VLDB J."},{"key":"940_CR10","doi-asserted-by":"crossref","unstructured":"Deng, K., Zhou, X., Shen, H.T.: Multi-source skyline query processing in road networks. pp. 796\u2013805. IEEE (2007)","DOI":"10.1109\/ICDE.2007.367925"},{"key":"940_CR11","unstructured":"Felipe, I.D., Hristidis, V., Rishe, N.: Keyword search on spatial databases. In: ICDE (2008)"},{"key":"940_CR12","doi-asserted-by":"crossref","unstructured":"Gao, J., Qiu, H., Jiang, X., Wang, T., Yang, D.: Fast top-k simple shortest paths discovery in graphs. In: CIKM, pp. 509\u2013518 (2010)","DOI":"10.1145\/1871437.1871504"},{"key":"940_CR13","doi-asserted-by":"crossref","unstructured":"Gong, Q., Cao, H., Nagarkar, P.: Skyline queries constrained by multi-cost transportation networks. In: 2019 IEEE 35th International Conference on Data Engineering (ICDE), pp. 926\u2013937. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00087"},{"issue":"5","key":"940_CR14","first-page":"5325","volume":"35","author":"NAH Haldar","year":"2022","unstructured":"Haldar, N.A.H., Li, J., Ali, M.E., Cai, T., Chen, Y., Sellis, T., Reynolds, M.: Top-k socio-spatial co-engaged location selection for social users. IEEE Trans. Knowl. Data Eng. 35(5), 5325\u20135340 (2022)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"6","key":"940_CR15","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s00778-019-00553-0","volume":"28","author":"NAH Haldar","year":"2019","unstructured":"Haldar, N.A.H., Li, J., Reynolds, M., Sellis, T., Yu, J.X.: Location prediction in large-scale social networks: an in-depth benchmarking study. VLDB J. 28(6), 623\u2013648 (2019)","journal-title":"VLDB J."},{"issue":"4","key":"940_CR16","doi-asserted-by":"publisher","first-page":"1359","DOI":"10.1007\/s11280-018-0643-5","volume":"22","author":"AA Haryanto","year":"2019","unstructured":"Haryanto, A.A., Islam, M., Taniar, D., Cheema, M.A., et al.: Ig-tree: an efficient spatial keyword index for planning best path queries on road networks. World Wide Web 22(4), 1359\u20131399 (2019)","journal-title":"World Wide Web"},{"key":"940_CR17","doi-asserted-by":"publisher","first-page":"1359","DOI":"10.1007\/s11280-018-0643-5","volume":"22","author":"AA Haryanto","year":"2019","unstructured":"Haryanto, A.A., Islam, M.S., Taniar, D., Cheema, M.A.: Ig-tree: an efficient spatial keyword index for planning best path queries on road networks. World Wide Web 22, 1359\u20131399 (2019)","journal-title":"World Wide Web"},{"key":"940_CR18","doi-asserted-by":"crossref","unstructured":"Hershberger, J., Maxel, M., Suri, S.: Finding the k shortest simple paths: A new algorithm and its implementation. ACM Trans. Algorithms 3(4), (2007)","DOI":"10.1145\/1290672.1290682"},{"key":"940_CR19","doi-asserted-by":"crossref","unstructured":"Huang, X., Jensen, C.S.: In-route skyline querying for location-based services. In: W2GIS, pp. 120\u2013135. Springer (2004)","DOI":"10.1007\/11427865_10"},{"issue":"11","key":"940_CR20","first-page":"712","volume":"17","author":"YY Jin","year":"1971","unstructured":"Jin, Y.Y.: Finding the k shortest loopless paths in a network. Manage. Sci. 17(11), 712\u2013716 (1971)","journal-title":"Manage. Sci."},{"key":"940_CR21","doi-asserted-by":"crossref","unstructured":"Karypis, G., Kumar, V.: Multilevel algorithms for multi-constraint graph partitioning. In: SC\u201998: Proceedings of the 1998 ACM\/IEEE Conference on Supercomputing, pp. 28\u201328. IEEE (1998)","DOI":"10.1109\/SC.1998.10018"},{"key":"940_CR22","doi-asserted-by":"crossref","unstructured":"Kossmann, D., Ramsak, F., Rost, S.: Shooting stars in the sky: An online algorithm for skyline queries. In: VLDB (2002)","DOI":"10.1016\/B978-155860869-6\/50032-9"},{"key":"940_CR23","doi-asserted-by":"crossref","unstructured":"Kriegel, H.P., Renz, M., Schubert, M.: Route skyline queries: A multi-preference path planning approach. In: 2010 IEEE 26th international conference on data engineering (ICDE 2010), pp. 261\u2013272. IEEE (2010)","DOI":"10.1109\/ICDE.2010.5447845"},{"key":"940_CR24","doi-asserted-by":"crossref","unstructured":"Li, J., Hu, J., Li, L., Xiong, X., Xia, X.: Efficient multi-request route planning on road network. In: ISPA, pp. 617\u2013624. IEEE (2020)","DOI":"10.1109\/ISPA-BDCloud-SocialCom-SustainCom51426.2020.00103"},{"key":"940_CR25","doi-asserted-by":"crossref","unstructured":"Li, J., Wang, Z., Zhang, Y., Zhao, L., Li, L., Zong, C.: Continuously monitoring optimal routes with collective spatial keywords on road networks. In: UIC, pp. 41\u201348. IEEE (2022)","DOI":"10.1109\/SmartWorld-UIC-ATC-ScalCom-DigitalTwin-PriComp-Metaverse56740.2022.00033"},{"key":"940_CR26","doi-asserted-by":"crossref","unstructured":"Li, J., Xiong, X., Li, L., He, D., Zong, C., Zhou, X.: Finding top-k optimal routes with collective spatial keywords on road networks. In: ICDE, pp. 368\u2013380. IEEE (2023)","DOI":"10.1109\/ICDE55515.2023.00035"},{"key":"940_CR27","doi-asserted-by":"crossref","unstructured":"Li, J., Yang, Y.D., Mamoulis, N.: Optimal route queries with arbitrary order constraints. TKDE (2013)","DOI":"10.1109\/TKDE.2012.36"},{"key":"940_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.bdr.2021.100246","volume":"26","author":"K Li","year":"2021","unstructured":"Li, K., Rao, X., Pang, X., Chen, L., Fan, S.: Route search and planning: a survey. Big Data Research 26, 100246 (2021)","journal-title":"Big Data Research"},{"key":"940_CR29","first-page":"1274","volume":"10","author":"L Li","year":"2017","unstructured":"Li, L., Hua, W., Du, X., Zhou, X.: Minimal on-road time route scheduling on time-dependent graphs. VLDB 10, 1274\u20131285 (2017)","journal-title":"VLDB"},{"key":"940_CR30","doi-asserted-by":"crossref","unstructured":"Li, L., Wang, S.: Fastest path query answering using time-dependent hop-labeling in road network. TKDE (2020)","DOI":"10.1109\/TKDE.2020.2981062"},{"key":"940_CR31","doi-asserted-by":"crossref","unstructured":"Li, L., Wang, S., Zhou, X.: Time-dependent hop labeling on road network. In: ICDE, pp. 902\u2013913. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00085"},{"key":"940_CR32","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00778-018-0499-4","volume":"27","author":"L Li","year":"2018","unstructured":"Li, L., Zheng, K., Wang, S., Hua, W., Zhou, X.: Go slow to go fast: minimal on-road time route scheduling with parking facilities using historical trajectory. VLDB J. 27, 321\u2013345 (2018)","journal-title":"VLDB J."},{"issue":"7","key":"940_CR33","first-page":"3196","volume":"34","author":"Y Li","year":"2020","unstructured":"Li, Y., Yuan, Y., Wang, Y., Lian, X., Ma, Y., Wang, G.: Distributed multimodal path queries. TKDE 34(7), 3196\u20133210 (2020)","journal-title":"Distributed multimodal path queries. TKDE"},{"key":"940_CR34","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S.: An effective heuristic algorithm for the traveling salesman problem. Annals of Ops. Res 21, 498\u2013516 (1973)","journal-title":"Annals of Ops. Res"},{"issue":"3","key":"940_CR35","first-page":"488","volume":"30","author":"H Liu","year":"2017","unstructured":"Liu, H., Jin, C., Yang, B., Zhou, A.: Finding top-k shortest paths with diversity. TKDE 30(3), 488\u2013502 (2017)","journal-title":"TKDE"},{"key":"940_CR36","doi-asserted-by":"crossref","unstructured":"Liu, H., Jin, C., Yang, B., Zhou, A.: Finding top-k optimal sequenced routes. In: ICDE, pp. 569\u2013580. IEEE Computer Society (2018)","DOI":"10.1109\/ICDE.2018.00058"},{"key":"940_CR37","doi-asserted-by":"crossref","unstructured":"Liu, H., Tong, Y., Zhang, P., Lu, X., Duan, J., Xiong, H.: Hydra: A personalized and context-aware multi-modal transportation recommendation system. In: SIGMOD, pp. 2314\u20132324 (2019)","DOI":"10.1145\/3292500.3330660"},{"key":"940_CR38","doi-asserted-by":"crossref","unstructured":"Liu, Z., Li, L., Zhang, M., Hua, W., Chao, P., Zhou, X.: Efficient constrained shortest path query answering with forest hop labeling. In: ICDE, pp. 1763\u20131774. IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00155"},{"issue":"11","key":"940_CR39","first-page":"3112","volume":"15","author":"Z Liu","year":"2022","unstructured":"Liu, Z., Li, L., Zhang, M., Hua, W., Zhou, X.: Fhl-cube: multi-constraint shortest path querying with flexible combination of constraints. VLDB 15(11), 3112\u20133125 (2022)","journal-title":"VLDB"},{"key":"940_CR40","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s00778-022-00760-2","volume":"32","author":"Z Liu","year":"2023","unstructured":"Liu, Z., Li, L., Zhang, M., Hua, W., Zhou, X.: Multi-constraint shortest path using forest hop labeling. VLDB J. 32, 595\u2013621 (2023)","journal-title":"VLDB J."},{"key":"940_CR41","unstructured":"Lu, H.C., Chen, H.S., Tseng, V.S.: An efficient framework for multirequest route planning in urban environments. TITS (2016)"},{"key":"940_CR42","first-page":"3199","volume":"15","author":"Z Luo","year":"2022","unstructured":"Luo, Z., Li, L., Zhang, M., Hua, W., Xu, Y., Zhou, X.: Diversified top-k route planning in road network. VLDB 15, 3199\u20133212 (2022)","journal-title":"VLDB"},{"key":"940_CR43","doi-asserted-by":"crossref","unstructured":"Mouratidis, K., Lin, Y., Yiu, M.L.: Preference queries in large multi-cost transportation networks. In: 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010), pp. 533\u2013544. IEEE (2010)","DOI":"10.1109\/ICDE.2010.5447851"},{"key":"940_CR44","doi-asserted-by":"crossref","unstructured":"Ouyang, D., Qin, L., Chang, L., Lin, X., Zhang, Y., Zhu, Q.: When hierarchy meets 2-hop-labeling: Efficient shortest distance queries on road networks. In: SIGMOD, pp. 709\u2013724. ACM (2018)","DOI":"10.1145\/3183713.3196913"},{"key":"940_CR45","doi-asserted-by":"crossref","unstructured":"Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In: VLDB, pp. 802\u2013813 (2003)","DOI":"10.1016\/B978-012722442-8\/50076-8"},{"key":"940_CR46","doi-asserted-by":"crossref","unstructured":"Peng, Y., Ma, Z., Zhang, W., Lin, X., Zhang, Y., Chen, X.: Efficiently answering quality constrained shortest distance queries in large graphs. In: ICDE, pp. 856\u2013868. IEEE (2023)","DOI":"10.1109\/ICDE55515.2023.00071"},{"key":"940_CR47","doi-asserted-by":"crossref","unstructured":"Sahasrabudhe, S., Dev, M.: Assessment of parking policy in case of tier ii cities in india: Case of aurangabad, maharashtra. In: Transport Research Arena Conference, pp. 702\u2013709. Springer (2024)","DOI":"10.1007\/978-3-031-85578-8_95"},{"key":"940_CR48","doi-asserted-by":"crossref","unstructured":"Salgado, C.: Keyword-aware skyline routes search in indoor venues. In: SIGSPATIAL (2018)","DOI":"10.1145\/3282461.3282467"},{"issue":"4","key":"940_CR49","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1007\/s00778-006-0038-6","volume":"17","author":"M Sharifzadeh","year":"2008","unstructured":"Sharifzadeh, M., Kolahdouzan, M., Shahabi, C.: The optimal sequenced route query. VLDB J. 17(4), 765\u2013787 (2008)","journal-title":"VLDB J."},{"key":"940_CR50","unstructured":"Sharifzadeh, M., Shahabi, C.: The spatial skyline queries. In: VLDB (2006)"},{"key":"940_CR51","first-page":"1","volume":"1","author":"L Wang","year":"2023","unstructured":"Wang, L., Wong, R.C.W.: Qhl: a fast algorithm for exact constrained shortest path search on road networks. SIGMOD 1, 1\u201325 (2023)","journal-title":"SIGMOD"},{"key":"940_CR52","doi-asserted-by":"crossref","unstructured":"Wang, S., Xiao, X., Yang, Y., Lin, W.: Effective indexing for approximate constrained shortest path queries on large road networks. Proceedings of the VLDB Endowment 10(2) (2016)","DOI":"10.14778\/3015274.3015277"},{"key":"940_CR53","doi-asserted-by":"crossref","unstructured":"Yu, Z., Yu, X., Koudas, N., Chen, Y., Liu, Y.: A distributed solution for efficient k shortest paths computation over dynamic road networks. TKDE (2024)","DOI":"10.1109\/TKDE.2023.3346377"},{"key":"940_CR54","first-page":"1212","volume":"29","author":"Y Yuan","year":"2017","unstructured":"Yuan, Y., Lian, X., Chen, L., Yu, J.X., Wang, G., Sun, Y.: Keyword search over distributed graphs with compressed signature. TKDE 29, 1212\u20131225 (2017)","journal-title":"TKDE"},{"key":"940_CR55","doi-asserted-by":"crossref","unstructured":"Yuan, Y., Lian, X., Wang, G., Chen, L., Ma, Y., Wang, Y.: Weight-constrained route planning over time-dependent graphs. In: ICDE, pp. 914\u2013925. IEEE (2019)","DOI":"10.1109\/ICDE.2019.00086"},{"key":"940_CR56","doi-asserted-by":"crossref","unstructured":"Zhang, M., Li, L., Hua, W., Mao, R., Chao, P., Zhou, X.: Dynamic hub labeling for road networks. In: ICDE, pp. 336\u2013347. IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00036"},{"key":"940_CR57","doi-asserted-by":"crossref","unstructured":"Zhang, M., Li, L., Hua, W., Zhou, X.: Efficient 2-hop labeling maintenance in dynamic small-world networks. In: ICDE, pp. 133\u2013144. IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00019"},{"issue":"11","key":"940_CR58","first-page":"2127","volume":"14","author":"M Zhang","year":"2021","unstructured":"Zhang, M., Li, L., Zhou, X.: An experimental evaluation and guideline for path finding in weighted dynamic network. VLDB 14(11), 2127\u20132140 (2021)","journal-title":"VLDB"},{"key":"940_CR59","doi-asserted-by":"crossref","unstructured":"Zhang, U., Yuan, L., Li, W., Qin, L., Zhang, Y.: Efficient label-constrained shortest path queries on road networks: A tree decomposition approach. VLDB (2021)","DOI":"10.14778\/3494124.3494148"},{"issue":"5","key":"940_CR60","first-page":"488","volume":"12","author":"X Zhang","year":"2019","unstructured":"Zhang, X., \u00d6zsu, M.T.: Correlation constraint shortest path over large multi-relation graphs. VLDB 12(5), 488\u2013501 (2019)","journal-title":"VLDB"},{"key":"940_CR61","doi-asserted-by":"crossref","unstructured":"Zhao, J., Li, L., Zhang, M., Luo, Z., Zhao, X., Zhou, X.: A just-in-time framework for continuous routing. In: ICDE. IEEE (2024)","DOI":"10.1109\/ICDE60146.2024.00350"},{"key":"940_CR62","doi-asserted-by":"crossref","unstructured":"Zheng, B., Zheng, K., Xiao, X., Su, H., Li, G.: Keyword-aware continuous knn query on road networks. In: ICDE, pp. 871\u2013882 (2016)","DOI":"10.1109\/ICDE.2016.7498297"},{"key":"940_CR63","doi-asserted-by":"crossref","unstructured":"Zheng, K., Su, H., Zheng, B., Shang, S., Xu, J., Liu, J., Zhou, X.: Interactive top-k spatial keyword queries. In: ICDE (2015)","DOI":"10.1109\/ICDE.2015.7113303"},{"key":"940_CR64","doi-asserted-by":"crossref","unstructured":"Zhong, R., Li, G., Tan, K.L., Zhou, L., Gong, Z.: G-tree: An efficient and scalable index for spatial search on road networks. TKDE (2015)","DOI":"10.1109\/TKDE.2015.2399306"},{"issue":"1","key":"940_CR65","doi-asserted-by":"crossref","first-page":"3","DOI":"10.37307\/j.1868-775X.2022.01.03","volume":"7","author":"H Zhu","year":"2022","unstructured":"Zhu, H., Li, W., Liu, W., Yin, J., Xu, J.: Top k optimal sequenced route query with poi preferences. DSE 7(1), 3\u201315 (2022)","journal-title":"DSE"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-025-00940-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-025-00940-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-025-00940-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,18]],"date-time":"2025-09-18T12:03:50Z","timestamp":1758197030000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-025-00940-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,25]]},"references-count":65,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["940"],"URL":"https:\/\/doi.org\/10.1007\/s00778-025-00940-w","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,25]]},"assertion":[{"value":"30 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 August 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"61"}}