{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T02:56:19Z","timestamp":1773802579055,"version":"3.50.1"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T00:00:00Z","timestamp":1773792000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T00:00:00Z","timestamp":1773792000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62372031, 62202037"],"award-info":[{"award-number":["62372031, 62202037"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s11280-026-01411-0","type":"journal-article","created":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T00:35:15Z","timestamp":1773794115000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards effective and efficient graph alignment without supervision"],"prefix":"10.1007","volume":"29","author":[{"given":"Songyang","family":"Chen","sequence":"first","affiliation":[]},{"given":"Youfang","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Yu","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Shuai","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Lei","family":"Zou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,18]]},"reference":[{"key":"1411_CR1","doi-asserted-by":"crossref","unstructured":"Zhang, S., Tong, H., Jin, L., Xia, Y., Guo, Y.: Balancing consistency and disparity in network alignment. In: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, pp. 2212\u20132222 (2021)","DOI":"10.1145\/3447548.3467331"},{"key":"1411_CR2","doi-asserted-by":"crossref","unstructured":"Tang, J., Zhang, J., Yao, L., Li, J., Zhang, L., Su, Z.: Arnetminer: extraction and mining of academic social networks. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 990\u2013998 (2008)","DOI":"10.1145\/1401890.1402008"},{"key":"1411_CR3","doi-asserted-by":"crossref","unstructured":"Zhang, J., Philip, S.Y.: Multiple anonymized social networks alignment. In: 2015 IEEE International Conference on Data Mining, pp. 599\u2013608 (2015). IEEE","DOI":"10.1109\/ICDM.2015.114"},{"key":"1411_CR4","doi-asserted-by":"crossref","unstructured":"Li, C., Wang, S., Wang, H., Liang, Y., Yu, P.S., Li, Z., Wang, W.: Partially shared adversarial learning for semi-supervised multi-platform user identity linkage. In: Proceedings of the 28th ACM International Conference on Information and Knowledge Management, pp. 249\u2013258 (2019)","DOI":"10.1145\/3357384.3357904"},{"key":"1411_CR5","doi-asserted-by":"crossref","unstructured":"Tang, J., Zhang, W., Li, J., Zhao, K., Tsung, F., Li, J.: Robust attributed graph alignment via joint structure learning and optimal transport. In: 2023 IEEE 39th International Conference on Data Engineering (ICDE), pp. 1638\u20131651 (2023). IEEE","DOI":"10.1109\/ICDE55515.2023.00129"},{"key":"1411_CR6","unstructured":"Cheng, H., Luo, D., Xu, H.: Dhot-gm: Robust graph matching using a differentiable hierarchical optimal transport framework. arXiv preprint arXiv:2310.12081 (2023)"},{"key":"1411_CR7","doi-asserted-by":"crossref","unstructured":"Liu, Y., Ding, H., Chen, D., Xu, J.: Novel geometric approach for global alignment of ppi networks. In: Proceedings of the AAAI conference on artificial intelligence, vol. 31 (2017)","DOI":"10.1609\/aaai.v31i1.10504"},{"key":"1411_CR8","doi-asserted-by":"crossref","unstructured":"Trung, H.T., Van Vinh, T., Tam, N.T., Yin, H., Weidlich, M., Hung, N.Q.V.: Adaptive network alignment with unsupervised and multi-order convolutional networks. In: 2020 IEEE 36th International Conference on Data Engineering (ICDE), pp. 85\u201396 (2020). IEEE","DOI":"10.1109\/ICDE48307.2020.00015"},{"key":"1411_CR9","doi-asserted-by":"crossref","unstructured":"Gao, J., Huang, X., Li, J.: Unsupervised graph alignment with wasserstein distance discriminator. In: Proceedings of the 27th ACM SIGKDD conference on knowledge discovery & data mining, pp. 426\u2013435 (2021)","DOI":"10.1145\/3447548.3467332"},{"key":"1411_CR10","doi-asserted-by":"crossref","unstructured":"Wang, C., Jiang, P., Zhang, X., Wang, P., Qin, T., Guan, X.: Gtcalign: Global topology consistency-based graph alignment. IEEE Trans. Knowl. Data Eng. (2023)","DOI":"10.1109\/TKDE.2023.3312358"},{"key":"1411_CR11","unstructured":"Xu, H., Luo, D., Zha, H., Duke, L.C.: Gromov-wasserstein learning for graph matching and node embedding. In: International Conference on Machine Learning, pp. 6932\u20136941 (2019). PMLR"},{"key":"1411_CR12","unstructured":"Titouan, V., Courty, N., Tavenard, R., Flamary, R.: Optimal transport for structured data with application on graphs. In: International Conference on Machine Learning, pp. 6275\u20136284 (2019). PMLR"},{"key":"1411_CR13","doi-asserted-by":"crossref","unstructured":"Peng, J., Xiong, F., Pan, S., Wang, L., Xiong, X.: Robust network alignment with the combination of structure and attribute embeddings. In: 2023 IEEE International Conference on Data Mining (ICDM), pp. 498\u2013507 (2023). IEEE","DOI":"10.1109\/ICDM58522.2023.00059"},{"key":"1411_CR14","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10208-011-9093-5","volume":"11","author":"F M\u00e9moli","year":"2011","unstructured":"M\u00e9moli, F.: Gromov-wasserstein distances and the metric approach to object matching. Found. Comput. Math. 11, 417\u2013487 (2011)","journal-title":"Found. Comput. Math."},{"key":"1411_CR15","unstructured":"Kipf, T.N., Welling, M.: Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)"},{"key":"1411_CR16","unstructured":"Xu, K., Hu, W., Leskovec, J., Jegelka, S.: How powerful are graph neural networks? arXiv preprint arXiv:1810.00826 (2018)"},{"key":"1411_CR17","doi-asserted-by":"crossref","unstructured":"Zeng, Z., Zhang, S., Xia, Y., Tong, H.: Parrot: Position-aware regularized optimal transport for network alignment. In: Proceedings of the ACM Web Conference 2023, pp. 372\u2013382 (2023)","DOI":"10.1145\/3543507.3583357"},{"key":"1411_CR18","unstructured":"Vaswani, A., Shazeer, N., Parmar, N., Uszkoreit, J., Jones, L., Gomez, A.N., Kaiser, \u0141., Polosukhin, I.: Attention is all you need. In: Advances in Neural Information Processing Systems, pp. 5998\u20136008 (2017)"},{"key":"1411_CR19","unstructured":"Wu, Q., Zhao, W., Yang, C., Zhang, H., Nie, F., Jiang, H., Bian, Y., Yan, J.: Simplifying and empowering transformers for large-graph representations. Adv. Neural Inf. Process. Syst. 36 (2024)"},{"key":"1411_CR20","doi-asserted-by":"crossref","unstructured":"Villani, C., et al.: Optimal Transport: Old and New, vol. 338, (2009)","DOI":"10.1007\/978-3-540-71050-9"},{"issue":"4","key":"1411_CR21","doi-asserted-by":"publisher","first-page":"1512","DOI":"10.1080\/10618600.2023.2165500","volume":"32","author":"M Li","year":"2023","unstructured":"Li, M., Yu, J., Xu, H., Meng, C.: Efficient approximation of gromov-wasserstein distance using importance sparsification. J. Comput. Graph. Stat. 32(4), 1512\u20131523 (2023)","journal-title":"J. Comput. Graph. Stat."},{"key":"1411_CR22","unstructured":"Kantorovich, L.: On the transfer of masses (in russian). In: Doklady Akademii Nauk, vol. 37, p. 227 (1942)"},{"key":"1411_CR23","unstructured":"Peyr\u00e9, G., Cuturi, M., Solomon, J.: Gromov-wasserstein averaging of kernel and distance matrices. In: International conference on machine learning, pp. 2664\u20132672 (2016). PMLR"},{"key":"1411_CR24","unstructured":"Cuturi, M.: Sinkhorn distances: Lightspeed computation of optimal transport. Adv Neural Inf Process Syst 26 (2013)"},{"issue":"2","key":"1411_CR25","doi-asserted-by":"publisher","first-page":"343","DOI":"10.2140\/pjm.1967.21.343","volume":"21","author":"R Sinkhorn","year":"1967","unstructured":"Sinkhorn, R., Knopp, P.: Concerning nonnegative matrices and doubly stochastic matrices. Pac. J. Math. 21(2), 343\u2013348 (1967)","journal-title":"Pac. J. Math."},{"key":"1411_CR26","unstructured":"Cuturi, M.: Sinkhorn distances: Lightspeed computation of optimal transport. Advances in neural information processing systems 26 (2013)"},{"key":"1411_CR27","doi-asserted-by":"crossref","unstructured":"Li, Q., Han, Z., Wu, X.-M.: Deeper insights into graph convolutional networks for semi-supervised learning. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 32 (2018)","DOI":"10.1609\/aaai.v32i1.11604"},{"key":"1411_CR28","unstructured":"Alon, U., Yahav, E.: On the bottleneck of graph neural networks and its practical implications. arXiv preprint arXiv:2006.05205 (2020)"},{"key":"1411_CR29","unstructured":"Wu, Q., Yang, C., Zhao, W., He, Y., Wipf, D., Yan, J.: Difformer: Scalable (graph) transformers induced by energy constrained diffusion. arXiv preprint arXiv:2301.09474 (2023)"},{"key":"1411_CR30","volume-title":"The pagerank citation ranking: Bringing order to the web","author":"L Page","year":"1999","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical report, Stanford infolab (1999)"},{"key":"1411_CR31","doi-asserted-by":"publisher","unstructured":"Bojchevski, A., Klicpera, J., Perozzi, B., Kapoor, A., Blais, M., R\u00f3zemberczki, B., Lukasik, M., G\u00fcnnemann, S.: Scaling graph neural networks with approximate pagerank. In: Gupta, R., Liu, Y., Tang, J., Prakash, B.A. (eds.) KDD \u201920: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Virtual Event, CA, USA, August 23\u201327, 2020, pp. 2464\u20132473. ACM, (2020). https:\/\/doi.org\/10.1145\/3394486.3403296","DOI":"10.1145\/3394486.3403296"},{"issue":"1","key":"1411_CR32","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte, J., Sabach, S., Teboulle, M.: Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Program. 146(1), 459\u2013494 (2014)","journal-title":"Math. Program."},{"key":"1411_CR33","doi-asserted-by":"crossref","unstructured":"Zhang, S., Tong, H.: Final: Fast attributed network alignment. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1345\u20131354 (2016)","DOI":"10.1145\/2939672.2939766"},{"issue":"9","key":"1411_CR34","doi-asserted-by":"publisher","first-page":"1680","DOI":"10.1109\/TKDE.2018.2866440","volume":"31","author":"S Zhang","year":"2018","unstructured":"Zhang, S., Tong, H.: Attributed network alignment: Problem definitions and fast solutions. IEEE Trans. Knowl. Data Eng. 31(9), 1680\u20131692 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1411_CR35","unstructured":"Shchur, O., Mumme, M., Bojchevski, A., G\u00fcnnemann, S.: Pitfalls of graph neural network evaluation. arXiv preprint arXiv:1811.05868 (2018)"},{"key":"1411_CR36","doi-asserted-by":"crossref","unstructured":"Wang, Z., Lv, Q., Lan, X., Zhang, Y.: Cross-lingual knowledge graph alignment via graph convolutional networks. In: Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, pp. 349\u2013357 (2018)","DOI":"10.18653\/v1\/D18-1032"},{"key":"1411_CR37","doi-asserted-by":"crossref","unstructured":"Heimann, M., Shen, H., Safavi, T., Koutra, D.: Regal: Representation learning-based graph alignment. In: Proceedings of the 27th ACM International Conference on Information and Knowledge Management, pp. 117\u2013126 (2018)","DOI":"10.1145\/3269206.3271788"},{"key":"1411_CR38","unstructured":"Xu, H., Luo, D., Carin, L.: Scalable gromov-wasserstein learning for graph partitioning and matching. Adv. Neural Inf. Process. Syst. 32 (2019)"},{"issue":"4","key":"1411_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3561058","volume":"17","author":"J Hermanns","year":"2023","unstructured":"Hermanns, J., Skitsas, K., Tsitsulin, A., Munkhoeva, M., Kyster, A., Nielsen, S., Bronstein, A.M., Mottin, D., Karras, P.: Grasp: Scalable graph alignment by spectral corresponding functions. ACM Trans. Knowl. Discov. Data 17(4), 1\u201326 (2023)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"1411_CR40","doi-asserted-by":"crossref","unstructured":"Jonker, R., Volgenant, T.: A shortest augmenting path algorithm for dense and sparse linear assignment problems. In: DGOR\/NSOR: Papers of the 16th Annual Meeting of DGOR in Cooperation with NSOR\/Vortr\u00e4ge der 16. Jahrestagung der DGOR Zusammen Mit der NSOR, pp. 622\u2013622 (1988). Springer","DOI":"10.1007\/978-3-642-73778-7_164"},{"issue":"1\u20132","key":"1411_CR41","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The hungarian method for the assignment problem. Naval Res Logist Quart 2(1\u20132), 83\u201397 (1955)","journal-title":"Naval Res Logist Quart"},{"key":"1411_CR42","doi-asserted-by":"publisher","unstructured":"Bayati, M., Gerritsen, M., Gleich, D.F., Saberi, A., Wang, Y.: Algorithms for large, sparse network alignment problems. In: Wang, W., Kargupta, H., Ranka, S., Yu, P.S., Wu, X. (eds.) ICDM 2009, The Ninth IEEE International Conference on Data Mining, Miami, Florida, USA, 6\u20139 December 2009, pp. 705\u2013710. IEEE Computer Society, (2009). https:\/\/doi.org\/10.1109\/ICDM.2009.135","DOI":"10.1109\/ICDM.2009.135"},{"key":"1411_CR43","doi-asserted-by":"publisher","unstructured":"Klau, G.W.: A new graph-based method for pairwise global network alignment. BMC Bioinform. 10(S-1) (2009). https:\/\/doi.org\/10.1186\/1471-2105-10-S1-S59","DOI":"10.1186\/1471-2105-10-S1-S59"},{"key":"1411_CR44","doi-asserted-by":"publisher","unstructured":"Singh, R., Xu, J., Berger, B.: Pairwise global alignment of protein interaction networks by matching neighborhood topology. In: Speed, T.P., Huang, H. (eds.) Research in Computational Molecular Biology, 11th Annual International Conference, RECOMB 2007, Oakland, CA, USA, April 21\u201325, 2007, Proceedings. Lecture Notes in Computer Science, vol. 4453, pp. 16\u201331. Springer, (2007). https:\/\/doi.org\/10.1007\/978-3-540-71681-5_2","DOI":"10.1007\/978-3-540-71681-5_2"},{"issue":"3","key":"1411_CR45","doi-asserted-by":"publisher","first-page":"1182","DOI":"10.1109\/TNSE.2019.2913233","volume":"7","author":"S Feizi","year":"2020","unstructured":"Feizi, S., Quon, G.T., Mendoza, M.R., M\u00e9dard, M., Kellis, M., Jadbabaie, A.: Spectral alignment of graphs. IEEE Trans. Netw. Sci. Eng. 7(3), 1182\u20131197 (2020). https:\/\/doi.org\/10.1109\/TNSE.2019.2913233","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"key":"1411_CR46","doi-asserted-by":"publisher","unstructured":"Karakasis, P.A., Konar, A., Sidiropoulos, N.D.: Joint graph embedding and alignment with spectral pivot. In: Zhu, F., Ooi, B.C., Miao, C. (eds.) KDD \u201921: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Virtual Event, Singapore, August 14\u201318, 2021, pp. 851\u2013859. ACM, (2021). https:\/\/doi.org\/10.1145\/3447548.3467377","DOI":"10.1145\/3447548.3467377"},{"key":"1411_CR47","unstructured":"Petric Maretic, H., El Gheche, M., Chierchia, G., Frossard, P.: Got: an optimal transport framework for graph comparison. Adv. Neural Inf. Process. Syst. 32 (2019)"},{"key":"1411_CR48","unstructured":"Chen, L., Gan, Z., Cheng, Y., Li, L., Carin, L., Liu, J.: Graph optimal transport for cross-domain alignment. In: International Conference on Machine Learning, pp. 1542\u20131553 (2020). PMLR"},{"key":"1411_CR49","doi-asserted-by":"crossref","unstructured":"Jiao, P., Liu, Y., Wang, Y., Zhang, G.: Cina: Curvature-based integrated network alignment with hypergraph. In: 2024 IEEE 40th International Conference on Data Engineering (ICDE), pp. 2709\u20132722 (2024). IEEE","DOI":"10.1109\/ICDE60146.2024.00212"},{"key":"1411_CR50","doi-asserted-by":"crossref","unstructured":"Zhang, S., Tong, H., Jin, L., Xia, Y., Guo, Y.: Balancing consistency and disparity in network alignment. In: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, pp. 2212\u20132222 (2021)","DOI":"10.1145\/3447548.3467331"},{"key":"1411_CR51","doi-asserted-by":"crossref","unstructured":"Heimann, M., Shen, H., Safavi, T., Koutra, D.: Regal: Representation learning-based graph alignment. In: Proceedings of the 27th ACM International Conference on Information and Knowledge Management, pp. 117\u2013126 (2018)","DOI":"10.1145\/3269206.3271788"},{"key":"1411_CR52","doi-asserted-by":"crossref","unstructured":"Yan, Y., Zhang, S., Tong, H.: Bright: A bridging algorithm for network alignment. In: Proceedings of the Web Conference 2021, pp. 3907\u20133917 (2021)","DOI":"10.1145\/3442381.3450053"},{"key":"1411_CR53","doi-asserted-by":"crossref","unstructured":"Wang, Z., Yang, J., Ye, X.: Knowledge graph alignment with entity-pair embedding. In: Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP), pp. 1672\u20131680 (2020)","DOI":"10.18653\/v1\/2020.emnlp-main.130"},{"key":"1411_CR54","doi-asserted-by":"crossref","unstructured":"Sun, Z., Hu, W., Zhang, Q., Qu, Y.: Bootstrapping entity alignment with knowledge graph embedding. In: IJCAI, vol. 18 (2018)","DOI":"10.24963\/ijcai.2018\/611"},{"key":"1411_CR55","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.aiopen.2021.02.002","volume":"2","author":"K Zeng","year":"2021","unstructured":"Zeng, K., Li, C., Hou, L., Li, J., Feng, L.: A comprehensive survey of entity alignment for knowledge graphs. AI Open 2, 1\u201313 (2021)","journal-title":"AI Open"},{"key":"1411_CR56","doi-asserted-by":"crossref","unstructured":"Qi, Z., Zhang, Z., Chen, J., Chen, X., Xiang, Y., Zhang, N., Zheng, Y.: Unsupervised knowledge graph alignment by probabilistic reasoning and semantic embedding. arXiv preprint arXiv:2105.05596 (2021)","DOI":"10.24963\/ijcai.2021\/278"},{"key":"1411_CR57","doi-asserted-by":"crossref","unstructured":"Liu, X., Hong, H., Wang, X., Chen, Z., Kharlamov, E., Dong, Y., Tang, J.: Selfkg: Self-supervised entity alignment in knowledge graphs. In: Proceedings of the ACM Web Conference 2022, pp. 860\u2013870 (2022)","DOI":"10.1145\/3485447.3511945"},{"key":"1411_CR58","doi-asserted-by":"crossref","unstructured":"Zeng, K., Dong, Z., Hou, L., Cao, Y., Hu, M., Yu, J., Lv, X., Cao, L., Wang, X., Liu, H., et al.: Interactive contrastive learning for self-supervised entity alignment. In: Proceedings of the 31st ACM International Conference on Information & Knowledge Management, pp. 2465\u20132475 (2022)","DOI":"10.1145\/3511808.3557364"},{"key":"1411_CR59","doi-asserted-by":"crossref","unstructured":"Mao, X., Wang, W., Wu, Y., Lan, M.: From alignment to assignment: Frustratingly simple unsupervised entity alignment. arXiv preprint arXiv:2109.02363 (2021)","DOI":"10.18653\/v1\/2021.emnlp-main.226"},{"key":"1411_CR60","doi-asserted-by":"crossref","unstructured":"Mao, X., Wang, W., Wu, Y., Lan, M.: Lightea: A scalable, robust, and interpretable entity alignment framework via three-view label propagation. arXiv preprint arXiv:2210.10436 (2022)","DOI":"10.18653\/v1\/2022.emnlp-main.52"},{"key":"1411_CR61","doi-asserted-by":"crossref","unstructured":"Tang, J., Zhao, K., Li, J.: A fused gromov-wasserstein framework for unsupervised knowledge graph entity alignment. arXiv preprint arXiv:2305.06574 (2023)","DOI":"10.18653\/v1\/2023.findings-acl.205"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-026-01411-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-026-01411-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-026-01411-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T00:35:21Z","timestamp":1773794121000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-026-01411-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,18]]},"references-count":61,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["1411"],"URL":"https:\/\/doi.org\/10.1007\/s11280-026-01411-0","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,18]]},"assertion":[{"value":"12 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"The authors declare no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"We confirm that this manuscript has not been published elsewhere and is not under consideration by another journal. All authors have approved the manuscript and agree with its submission to World Wide Web.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"22"}}