{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T01:22:22Z","timestamp":1770686542817,"version":"3.49.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":"publisher","award":["No.62262067"],"award-info":[{"award-number":["No.62262067"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s13042-025-02982-6","type":"journal-article","created":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T07:47:19Z","timestamp":1768636039000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient rotated graph similarity learning via linear graph transformer networks"],"prefix":"10.1007","volume":"17","author":[{"given":"Cangfeng","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhaoyao","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lerong","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"You","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,17]]},"reference":[{"issue":"1","key":"2982_CR1","doi-asserted-by":"publisher","first-page":"12005","DOI":"10.1038\/s41598-023-38761-y","volume":"13","author":"FB Biggers","year":"2023","unstructured":"Biggers FB, Mohanty SD, Manda P (2023) A deep semantic matching approach for identifying relevant messages for social media analysis. Sci Rep 13(1):12005. https:\/\/doi.org\/10.1038\/s41598-023-38761-y","journal-title":"Sci Rep"},{"issue":"3","key":"2982_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3554981","volume":"17","author":"X Wei","year":"2023","unstructured":"Wei X, Liu Y, Sun J, Jiang Y, Tang Q, Yuan K (2023) Dual subgraph-based graph neural network for friendship prediction in location-based social networks. ACM Trans Knowl Discov Data 17(3):1\u201328. https:\/\/doi.org\/10.1145\/3554981","journal-title":"ACM Trans Knowl Discov Data"},{"key":"2982_CR3","doi-asserted-by":"publisher","first-page":"2743","DOI":"10.1145\/3357384.9443357815","volume-title":"Proceedings of the 28th ACM International Conference on Information and Knowledge Management","author":"G Ma","year":"2019","unstructured":"Ma G, Ahmed NK, Willke TL, Sengupta D, Cole MW, Turk-Browne NB, Yu PS (2019) Deep graph similarity learning for brain data analysis. Proceedings of the 28th ACM International Conference on Information and Knowledge Management. ACM International, New York, NY, USA, pp 2743\u20132751. https:\/\/doi.org\/10.1145\/3357384.9443357815"},{"issue":"2","key":"2982_CR4","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1093\/bioinformatics\/btl571","volume":"23","author":"Y Tian","year":"2007","unstructured":"Tian Y, Mceachin RC, Santos C, States DJ, Patel JM (2007) Saga: a subgraph matching tool for biological graphs. Bioinformatics 23(2):232\u2013239. https:\/\/doi.org\/10.1093\/bioinformatics\/btl571","journal-title":"Bioinformatics"},{"key":"2982_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.mlwa.2022.100441","volume":"11","author":"Y Li","year":"2023","unstructured":"Li Y, Xie S, Wan Z, Lv H, Song H, Lv Z (2023) Graph-powered learning methods in the internet of things: a survey. Mach Learn Appl 11:100441. https:\/\/doi.org\/10.1016\/j.mlwa.2022.100441","journal-title":"Mach Learn Appl"},{"key":"2982_CR6","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1109\/BigData47090.2019.9005586","volume-title":"Proceedings of the 2019 IEEE international conference on big data","author":"J Liu","year":"2019","unstructured":"Liu J, Ma G, Jiang F, Lu C-T, Yu PS, Ragin AB (2019) Community-preserving graph convolutions for structural and functional joint embedding of brain networks. Proceedings of the 2019 IEEE international conference on big data. IEEE, Geneva, pp 1163\u20131168. https:\/\/doi.org\/10.1109\/BigData47090.2019.9005586"},{"key":"2982_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2022.109368","volume":"218","author":"W Li","year":"2022","unstructured":"Li W, Zhang X-Y, Bao H, Wang Q, Li Z (2022) Robust network traffic identification with graph matching. Comput Netw 218:109368. https:\/\/doi.org\/10.1016\/j.comnet.2022.109368","journal-title":"Comput Netw"},{"key":"2982_CR8","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-642-37210-0_37","volume-title":"Proceedings of the social computing, behavioral-cultural modeling and prediction: 6th international conference","author":"K Ogaard","year":"2013","unstructured":"Ogaard K, Roy H, Kase S, Nagi R, Sambhoos K, Sudit M (2013) Discovering patterns in social networks with graph matching algorithms. Proceedings of the social computing, behavioral-cultural modeling and prediction: 6th international conference. Springer, Cham, pp 341\u2013349. https:\/\/doi.org\/10.1007\/978-3-642-37210-0_37"},{"key":"2982_CR9","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10044-008-0141-y","volume":"13","author":"X Gao","year":"2010","unstructured":"Gao X, Xiao B, Tao D, Li X (2010) A survey of graph edit distance. Pattern Anal Appl 13:113\u2013129. https:\/\/doi.org\/10.1007\/s10044-008-0141-y","journal-title":"Pattern Anal Appl"},{"issue":"3","key":"2982_CR10","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0167-8655(97)00179-7","volume":"19","author":"H Bunke","year":"1998","unstructured":"Bunke H, Shearer K (1998) A graph distance metric based on the maximal common subgraph. Pattern Recogn Lett 19(3):255\u2013259. https:\/\/doi.org\/10.1016\/S0167-8655(97)00179-7","journal-title":"Pattern Recogn Lett"},{"issue":"1","key":"2982_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.14778\/1687627.1687631","volume":"2","author":"Z Zeng","year":"2009","unstructured":"Zeng Z, Tung AKH, Wang J, Feng J, Zhou L (2009) Comparing stars: on approximating graph edit distance. Proc VLDB Endow 2(1):25\u201336. https:\/\/doi.org\/10.14778\/1687627.1687631","journal-title":"Proc VLDB Endow"},{"issue":"1","key":"2982_CR12","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","volume":"32","author":"Z Wu","year":"2020","unstructured":"Wu Z, Pan S, Chen F, Long G, Zhang C, Philip SY (2020) A comprehensive survey on graph neural networks. IEEE Trans Neural Netw Learn Syst 32(1):4\u201324. https:\/\/doi.org\/10.1109\/TNNLS.2020.2978386","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"2982_CR13","unstructured":"Rong Y, Huang W, Xu T, Huang J (2020) Dropedge: towards deep graph convolutional networks on node classification. In: Proceedings of the 8th International Conference on Learning Representations, Addis Ababa, Ethiopia"},{"key":"2982_CR14","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1145\/3437963.3441720","volume-title":"Proceedings of the 14th ACM international conference on web search and data mining","author":"T Zhao","year":"2021","unstructured":"Zhao T, Zhang X, Wang S (2021) Graphsmote: imbalanced node classification on graphs with graph neural networks. Proceedings of the 14th ACM international conference on web search and data mining. ACM International, New York, NY, USA, pp 833\u2013841. https:\/\/doi.org\/10.1145\/3437963.3441720"},{"key":"2982_CR15","doi-asserted-by":"publisher","unstructured":"Zhang M, Cui Z, Neumann M, Chen Y (2018). An end-to-end deep learning architecture for graph classification. In: Proceedings of the AAAI conference on artificial intelligencehttps:\/\/doi.org\/10.1609\/aaai.v32i1.11782","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"2982_CR16","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1145\/3292500.3330950","volume-title":"Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining","author":"J Wu","year":"2019","unstructured":"Wu J, He J, Xu J (2019) Demo-net: degree-specific graph neural networks for node and graph classification. Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining. ACM Digital Library, New York, NY, USA, pp 406\u2013415. https:\/\/doi.org\/10.1145\/3292500.3330950"},{"key":"2982_CR17","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1145\/3289600.3290967","volume-title":"Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining","author":"Y Bai","year":"2019","unstructured":"Bai Y, Ding H, Bian S, Chen T, Sun Y, Wang W (2019) Simgnn: a neural network approach to fast graph similarity computation. Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining. ACM International, New York, NY, USA, pp 384\u2013392. https:\/\/doi.org\/10.1145\/3289600.3290967"},{"key":"2982_CR18","doi-asserted-by":"publisher","first-page":"3219","DOI":"10.1609\/aaai.v34i04.5720","volume":"34","author":"Y Bai","year":"2020","unstructured":"Bai Y, Ding H, Gu K, Sun Y, Wang W (2020) Learning-based efficient graph similarity computation via multi-scale convolutional set matching. Proc AAAI Conf Artif Intell 34:3219\u20133226. https:\/\/doi.org\/10.1609\/aaai.v34i04.5720","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"2982_CR19","first-page":"22518","volume":"35","author":"R Ranjan","year":"2022","unstructured":"Ranjan R, Grover S, Medya S, Chakaravarthy V, Sabharwal Y, Ranu S (2022) Greed: a neural framework for learning graph distance functions. Adv Neural Inf Process Syst 35:22518\u201322530","journal-title":"Adv Neural Inf Process Syst"},{"issue":"2","key":"2982_CR20","doi-asserted-by":"publisher","first-page":"335","DOI":"10.14778\/3489496.3489513","volume":"15","author":"J Bai","year":"2021","unstructured":"Bai J, Zhao P (2021) Tagsim: type-aware graph similarity learning and computation. Proc VLDB Endow 15(2):335\u2013347","journal-title":"Proc VLDB Endow"},{"issue":"2","key":"2982_CR21","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1109\/TNNLS.2021.3102234","volume":"34","author":"X Ling","year":"2023","unstructured":"Ling X, Wu L, Wang S, Ma T, Xu F, Liu AX, Wu C, Ji S (2023) Multilevel graph matching networks for deep graph similarity learning. IEEE Trans Neural Netw Learn Syst 34(2):799\u2013813. https:\/\/doi.org\/10.1109\/TNNLS.2021.3102234","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"2982_CR22","doi-asserted-by":"publisher","first-page":"2274","DOI":"10.1145\/3447548.3467328","volume-title":"Procedings of the 27th ACM SIGKDD conference on knowledge discovery & data mining","author":"Z Zhang","year":"2021","unstructured":"Zhang Z, Bu J, Ester M, Li Z, Yao C, Yu Z, Wang C (2021) H2mn: graph similarity learning with hierarchical hypergraph matching networks. Procedings of the 27th ACM SIGKDD conference on knowledge discovery & data mining. ACM International, New York, NY, USA, pp 2274\u20132284. https:\/\/doi.org\/10.1145\/3447548.3467328"},{"key":"2982_CR23","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/j.neucom.2021.01.068","volume":"439","author":"H Xu","year":"2021","unstructured":"Xu H, Duan Z, Wang Y, Feng J, Chen R, Zhang Q, Xu Z (2021) Graph partitioning and graph neural network based hierarchical graph matching for graph similarity computation. Neurocomputing 439:348\u2013362. https:\/\/doi.org\/10.1016\/j.neucom.2021.01.068","journal-title":"Neurocomputing"},{"key":"2982_CR24","unstructured":"Sun Z, Deng Z-H, Nie J-Y, Tang J (2019) Rotate: knowledge graph embedding by relational rotation in complex space. arXiv preprint arXiv:1902.10197"},{"key":"2982_CR25","first-page":"27387","volume":"35","author":"Q Wu","year":"2022","unstructured":"Wu Q, Zhao W, Li Z, Wipf DP, Yan J (2022) Nodeformer: a scalable graph structure learning transformer for node classification. Proc Adv Neural Info Process Syst 35:27387\u201327401","journal-title":"Proc Adv Neural Info Process Syst"},{"key":"2982_CR26","unstructured":"Socher R, Chen D, Manning CD, Ng A (2013) Reasoning with neural tensor networks for knowledge base completion. In: Proceedings of the Advances in Neural Information Processing Systems, vol. 26"},{"issue":"2","key":"2982_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3580511","volume":"18","author":"L Wang","year":"2024","unstructured":"Wang L, Zheng Y, Jin D, Li F, Qiao Y, Pan S (2024) Contrastive graph similarity networks. ACM Trans Web 18(2):1\u201320. https:\/\/doi.org\/10.1145\/3580511","journal-title":"ACM Trans Web"},{"issue":"1","key":"2982_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3633518","volume":"15","author":"S Khoshraftar","year":"2024","unstructured":"Khoshraftar S, An A (2024) A survey on graph representation learning methods. ACM Trans Intell Syst Technol 15(1):1\u201355. https:\/\/doi.org\/10.1145\/3633518","journal-title":"ACM Trans Intell Syst Technol"},{"key":"2982_CR29","doi-asserted-by":"publisher","unstructured":"Shi Y, Zhengjie H, Feng S, Zhong H, Wang W, Sun Y (2021) Masked label prediction: Unified message passing model for semi-supervised classification, pp. 1548\u20131554 . https:\/\/doi.org\/10.24963\/ijcai.2021\/214","DOI":"10.24963\/ijcai.2021\/214"},{"key":"2982_CR30","unstructured":"Choromanski KM, Likhosherstov V, Dohan D, Song X, Gane A, Sarlos T, Hawkins P, Davis JQ, Mohiuddin A, Kaiser L, Belanger DB, Colwell LJ, Weller A (2021) Rethinking attention with performers. In: Proceedings of the International Conference on Learning Representations"},{"key":"2982_CR31","unstructured":"Li G, Xiong C, Thabet A, Ghanem B (2020) DeeperGCN: All You Need to Train Deeper GCNs"},{"key":"2982_CR32","unstructured":"Hu W, Fey M, Zitnik M, Dong Y, Ren H, Liu B, Catasta M, Leskovec J (2020). Open graph benchmark: datasets for machine learning on graphs. In: Proceedings of the 34th International Conference on Neural Information Processing Systems, Red Hook, NY, USA"},{"key":"2982_CR33","doi-asserted-by":"publisher","unstructured":"Yanardag P, Vishwanathan SVN (2015). Deep graph kernels. In: Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, NY, USA, pp 1365\u20131374. https:\/\/doi.org\/10.1145\/2783258.2783417","DOI":"10.1145\/2783258.2783417"},{"key":"2982_CR34","doi-asserted-by":"publisher","unstructured":"Wang X, Ding X, Tung AKH, Ying S, Jin H (2012) An efficient graph indexing method. In: Proceedings of the 2012 IEEE 28th International Conference on Data Engineering, pp 210\u2013221. https:\/\/doi.org\/10.1109\/ICDE.2012.28","DOI":"10.1109\/ICDE.2012.28"},{"issue":"2","key":"2982_CR35","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cyber 4(2):100\u2013107. https:\/\/doi.org\/10.1109\/TSSC.1968.300136","journal-title":"IEEE Trans Syst Sci Cyber"},{"key":"2982_CR36","unstructured":"Li Y, Gu C, Dullien T, Vinyals O, Kohli P (2019) Graph matching networks for learning the similarity of graph structured objects. In: Proceedings of the 36th International Conference on Machine Learning, vol. 97, pp. 3835\u20133845"},{"key":"2982_CR37","unstructured":"Qin C, Zhao H, Wang L, Wang H, Zhang Y, Fu Y (2021) Slow learning and fast inference: Efficient graph similarity computation via knowledge distillation. In: Proceedings of the Advances in Neural Information Processing Systems, vol. 34, pp. 14110\u201314121"},{"key":"2982_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2023.110739","volume":"276","author":"W Tan","year":"2023","unstructured":"Tan W, Gao X, Li Y, Wen G, Cao P, Yang J, Li W, Zaiane OR (2023) Exploring attention mechanism for graph similarity learning. Knowl-Based Syst 276:110739. https:\/\/doi.org\/10.1016\/j.knosys.2023.110739","journal-title":"Knowl-Based Syst"},{"key":"2982_CR39","first-page":"30181","volume":"35","author":"W Zhuo","year":"2022","unstructured":"Zhuo W, Tan G (2022) Efficient graph similarity computation with alignment regularization. Proc Adv Neural Info Process Syst 35:30181\u201330193","journal-title":"Proc Adv Neural Info Process Syst"},{"key":"2982_CR40","unstructured":"Paszke A, Gross S, Massa F, Lerer A, Bradbury J, Chanan G, Killeen T, Lin Z, Gimelshein N, Antiga, L, Desmaison A, Kopf A, Yang E, DeVito Z, Raison M, Tejani A, Chilamkurthy S, Steiner B, Fang L, Bai J, Chintala S (2019) Pytorch: An imperative style, high-performance deep learning library. In: Proceedings of the Advances in Neural Information Processing Systems, vol. 32"},{"key":"2982_CR41","unstructured":"Fey M, Lenssen JE (2019) Fast graph representation learning with PyTorch Geometric. In: Proceedings of the ICLR 2019 Workshop on Representation Learning on Graphs and Manifolds"},{"key":"2982_CR42","unstructured":"Kingma DP, Ba J (2015) Adam: A method for stochastic optimization. In: Proceedings of the 3rd International Conference on Learning Representations, San Diego, CA, USA"},{"key":"2982_CR43","doi-asserted-by":"publisher","unstructured":"Spearman C (1961) The proof and measurement of association between two things. https:\/\/doi.org\/10.1037\/11491-005","DOI":"10.1037\/11491-005"},{"issue":"1\/2","key":"2982_CR44","doi-asserted-by":"publisher","first-page":"81","DOI":"10.2307\/2332226","volume":"30","author":"MG Kendall","year":"1938","unstructured":"Kendall MG (1938) A new measure of rank correlation. Biometrika 30(1\/2):81\u201393","journal-title":"Biometrika"},{"issue":"7","key":"2982_CR45","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1016\/S0031-3203(96)00142-2","volume":"30","author":"AP Bradley","year":"1997","unstructured":"Bradley AP (1997) The use of the area under the roc curve in the evaluation of machine learning algorithms. Pattern Recogn 30(7):1145\u20131159. https:\/\/doi.org\/10.1016\/S0031-3203(96)00142-2","journal-title":"Pattern Recogn"},{"key":"2982_CR46","unstructured":"Xu H, Chen R, Wang Y, Duan Z, Feng J (2020) Cosimgnn: towards large-scale graph similarity computation. arXiv preprint arXiv:2005.07115"},{"key":"2982_CR47","unstructured":"Wu Q, Zhao W, Li Z, Wipf DP, Yan J (2022) Nodeformer: A scalable graph structure learning transformer for node classification. In: Proceedings of the Advances in Neural Information Processing Systems, vol. 35, pp. 27387\u201327401"},{"key":"2982_CR48","unstructured":"Kipf TN, Welling M (2017) Semi-supervised classification with graph convolutional networks. In: Proceedings of the 5th International Conference on Learning Representations, Toulon, France"},{"key":"2982_CR49","unstructured":"Hamilton W, Ying Z, Leskovec J (2017) Inductive representation learning on large graphs. In: Proceedings of the Advances in Neural Information Processing Systems, vol. 30"},{"key":"2982_CR50","unstructured":"Xu K, Hu W, Leskovec J, Jegelka S (2019) How powerful are graph neural networks. In: Proceedings of the 7th International Conference on Learning Representations, New Orleans, LA, USA"},{"key":"2982_CR51","unstructured":"Li Y, Tarlow D, Brockschmidt M, Zemel RS (2016) Gated graph sequence neural networks. In: Proceedings of the 4th International Conference on Learning Representations, In: Juan S, Rico P (eds)"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-025-02982-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-025-02982-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-025-02982-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T09:38:45Z","timestamp":1770629925000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-025-02982-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["2982"],"URL":"https:\/\/doi.org\/10.1007\/s13042-025-02982-6","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1]]},"assertion":[{"value":"23 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 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":"23"}}