{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T07:51:16Z","timestamp":1770537076194,"version":"3.49.0"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T00:00:00Z","timestamp":1762560000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T00:00:00Z","timestamp":1762560000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s00778-025-00951-7","type":"journal-article","created":{"date-parts":[[2025,11,8]],"date-time":"2025-11-08T17:51:11Z","timestamp":1762624271000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Querying Historical Connectivity in Large-scale Temporal Graphs"],"prefix":"10.1007","volume":"35","author":[{"given":"Lantian","family":"Xu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0903-1503","authenticated-orcid":false,"given":"Dong","family":"Wen","sequence":"additional","affiliation":[]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xubo","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,8]]},"reference":[{"issue":"2","key":"951_CR1","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1145\/66926.66950","volume":"18","author":"R Agrawal","year":"1989","unstructured":"Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases. SIGMOD Rec. 18(2), 253\u2013262 (1989). https:\/\/doi.org\/10.1145\/66926.66950","journal-title":"SIGMOD Rec."},{"key":"951_CR2","doi-asserted-by":"crossref","unstructured":"Ajieren, E., Hourani, K., Moses\u00a0Jr, W.K., Pandurangan, G.: Distributed algorithms for connectivity and mst in large graphs with efficient local computation. Proceedings of the 23rd International Conference on Distributed Computing and Networking, 40\u201349 (2022)","DOI":"10.1145\/3491003.3491011"},{"key":"951_CR3","doi-asserted-by":"crossref","unstructured":"Akram, V.K., Dagdeviren, O.: On k-connectivity problems in distributed systems. Advanced Methods for Complex Network Analysis 30\u201357 (2016)","DOI":"10.4018\/978-1-4666-9964-9.ch002"},{"key":"951_CR4","doi-asserted-by":"crossref","unstructured":"Anyanwu, K., Sheth, A.: $$\\rho $$-queries: enabling querying for semantic associations on the semantic web. WWW, 690\u2013699 (2003)","DOI":"10.1145\/775152.775249"},{"issue":"5","key":"951_CR5","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1109\/TKDE.2009.117","volume":"22","author":"R Bramandia","year":"2010","unstructured":"Bramandia, R., Choi, B., Ng, W.K.: Incremental maintenance of 2-hop labeling of large graphs. IEEE Trans. Knowl. Data Eng. 22(5), 682\u2013698 (2010). https:\/\/doi.org\/10.1109\/TKDE.2009.117","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"5","key":"951_CR6","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1016\/j.dam.2009.10.005","volume":"158","author":"G Cattaneo","year":"2010","unstructured":"Cattaneo, G., Faruolo, P., Petrillo, U.F., Italiano, G.F.: Maintaining dynamic minimum spanning trees: An experimental study. Discret. Appl. Math. 158(5), 404\u2013425 (2010)","journal-title":"Discret. Appl. Math."},{"issue":"11","key":"951_CR7","doi-asserted-by":"publisher","first-page":"3263","DOI":"10.14778\/3551793.3551868","volume":"15","author":"Q Chen","year":"2022","unstructured":"Chen, Q., Lachish, O., Helmer, S., B\u00f6hlen, M.H.: Dynamic spanning trees for connectivity queries on fully-dynamic undirected graphs. Proc. VLDB Endow 15(11), 3263\u20133276 (2022). https:\/\/doi.org\/10.14778\/3551793.3551868","journal-title":"Proc. VLDB Endow"},{"key":"951_CR8","doi-asserted-by":"publisher","unstructured":"Cheng, J., Huang, S., Wu, H., Fu, A.W.C.: Tf-label: A topological-folding labeling scheme for reachability querying in a large graph. Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, SIGMOD \u201913, 193\u2013204. Association for Computing Machinery, New York, NY, USA (2013). https:\/\/doi.org\/10.1145\/2463676.2465286","DOI":"10.1145\/2463676.2465286"},{"key":"951_CR9","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201902, 937\u2013946. Society for Industrial and Applied Mathematics (2002)"},{"key":"951_CR10","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-642-40450-4_29","volume":"8125","author":"MS Crouch","year":"2013","unstructured":"Crouch, M.S., McGregor, A., Stubbs, D.M.: Dynamic graphs in the sliding-window model. ESA, Lecture Notes in Computer Science 8125, 337\u2013348 (2013)","journal-title":"ESA, Lecture Notes in Computer Science"},{"key":"951_CR11","doi-asserted-by":"crossref","unstructured":"Gou, X., Zou, L.: Sliding window-based approximate triangle counting over streaming graphs with duplicate edges. SIGMOD, 645\u2013657 (2021)","DOI":"10.1145\/3448016.3452800"},{"key":"951_CR12","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1007\/3-540-63165-8_214","volume-title":"Automata, Languages and Programming","author":"MR Henzinger","year":"1997","unstructured":"Henzinger, M.R., King, V.: Maintaining minimum spanning trees in dynamic graphs. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) Automata, Languages and Programming, pp. 594\u2013604. Springer, Berlin Heidelberg, Berlin, Heidelberg (1997)"},{"issue":"4","key":"951_CR13","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1145\/320211.320215","volume":"46","author":"MR Henzinger","year":"1999","unstructured":"Henzinger, M.R., King, V.: Randomized fully dynamic graph algorithms with polylogarithmic time per operation. J. ACM 46(4), 502\u2013516 (1999). https:\/\/doi.org\/10.1145\/320211.320215","journal-title":"J. ACM"},{"issue":"2","key":"951_CR14","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/S0097539797327209","volume":"31","author":"MR Henzinger","year":"2001","unstructured":"Henzinger, M.R., King, V.: Maintaining minimum spanning forests in dynamic graphs. SIAM J. Comput. 31(2), 364\u2013374 (2001). https:\/\/doi.org\/10.1137\/S0097539797327209","journal-title":"SIAM J. Comput."},{"issue":"4","key":"951_CR15","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1145\/502090.502095","volume":"48","author":"J Holm","year":"2001","unstructured":"Holm, J., de Lichtenberg, K., Thorup, M.: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. J. ACM 48(4), 723\u2013760 (2001). https:\/\/doi.org\/10.1145\/502090.502095","journal-title":"J. ACM"},{"key":"951_CR16","doi-asserted-by":"crossref","unstructured":"Huang, S.E., Huang, D., Kopelowitz, T., Pettie, S.: Fully dynamic connectivity in o(log n(log log n)2) amortized expected time. Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201917, p. 510\u2013520. Society for Industrial and Applied Mathematics, USA (2017)","DOI":"10.1137\/1.9781611974782.32"},{"key":"951_CR17","doi-asserted-by":"publisher","unstructured":"Jin, R., Xiang, Y., Ruan, N., Fuhry, D.: 3-hop: A high-compression indexing scheme for reachability query. Proceedings of the 2009 ACM SIGMOD International Conference on Management of Data, SIGMOD \u201909, p. 813\u2013826. Association for Computing Machinery, New York, NY, USA (2009). https:\/\/doi.org\/10.1145\/1559845.1559930","DOI":"10.1145\/1559845.1559930"},{"key":"951_CR18","doi-asserted-by":"crossref","unstructured":"Jin, R., Xiang, Y., Ruan, N., Wang, H.: Efficiently answering reachability queries on very large directed graphs. SIGMOD, 595\u2013608 (2008)","DOI":"10.1145\/1376616.1376677"},{"key":"951_CR19","doi-asserted-by":"crossref","unstructured":"Kapron, B.M., King, V., Mountjoy, B.: Dynamic graph connectivity in polylogarithmic worst case time. In: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA \u201913, 1131\u20131142. Society for Industrial and Applied Mathematics, USA (2013)","DOI":"10.1137\/1.9781611973105.81"},{"key":"951_CR20","doi-asserted-by":"crossref","unstructured":"Khurana, U., Deshpande, A.: Efficient snapshot retrieval over historical graph data. 2013 IEEE 29th International Conference on Data Engineering (ICDE), 997\u20131008. IEEE (2013)","DOI":"10.1109\/ICDE.2013.6544892"},{"key":"951_CR21","doi-asserted-by":"crossref","unstructured":"Li, M., Choudhury, F.M., Borovica-Gajic, R., Wang, Z., Xin, J., Li, J.: Crashsim: An efficient algorithm for computing simrank over static and temporal graphs. ICDE, 1141\u20131152. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00103"},{"key":"951_CR22","doi-asserted-by":"publisher","unstructured":"Lyu, Q., Li, Y., He, B., Gong, B.: Dbl: Efficient reachability queries on dynamic graphs. In: Database Systems for Advanced Applications: 26th International Conference, DASFAA 2021, Taipei, Taiwan, April 11\u201314, 2021, Proceedings, Part II, p. 761\u2013777. Springer-Verlag, Berlin, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-73197-7_52","DOI":"10.1007\/978-3-030-73197-7_52"},{"key":"951_CR23","doi-asserted-by":"crossref","unstructured":"Mao, Z., Yao, H., Zou, Q., Zhang, W., Dong, Y.: Digital contact tracing based on a graph database algorithm for emergency management during the covid-19 epidemic: Case study. JMIR mHealth and uHealth 9 (2021). https:\/\/api.semanticscholar.org\/CorpusID:231726592","DOI":"10.2196\/26836"},{"issue":"1","key":"951_CR24","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/2627692.2627694","volume":"43","author":"A McGregor","year":"2014","unstructured":"McGregor, A.: Graph stream algorithms: a survey. SIGMOD Rec. 43(1), 9\u201320 (2014)","journal-title":"SIGMOD Rec."},{"issue":"2","key":"951_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3694966","volume":"57","author":"L Meng","year":"2024","unstructured":"Meng, L., Shao, Y., Yuan, L., Lai, L., Cheng, P., Li, X., Yu, W., Zhang, W., Lin, X., Zhou, J.: A survey of distributed graph algorithms on massive graphs. ACM Comput. Surv. 57(2), 1\u201339 (2024)","journal-title":"ACM Comput. Surv."},{"key":"951_CR26","doi-asserted-by":"crossref","unstructured":"Pacaci, A., Bonifati, A., \u00d6zsu, M.T.: Regular path query evaluation on streaming graphs. SIGMOD, 1415\u20131430 (2020)","DOI":"10.1145\/3318464.3389733"},{"issue":"1","key":"951_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3209689","volume":"5","author":"G Pandurangan","year":"2018","unstructured":"Pandurangan, G., Robinson, P., Scquizzato, M.: Fast distributed algorithms for connectivity and mst in large graphs. ACM Transactions on Parallel Computing (TOPC) 5(1), 1\u201322 (2018)","journal-title":"ACM Transactions on Parallel Computing (TOPC)"},{"key":"951_CR28","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1186\/1756-0381-4-10","volume":"4","author":"GA Pavlopoulos","year":"2011","unstructured":"Pavlopoulos, G.A., Secrier, M., Moschopoulos, C.N., Soldatos, T.G., Kossida, S., Aerts, J., Schneider, R., Bagos, P.G.: Using graph theory to analyze biological networks. BioData Min. 4, 10 (2011)","journal-title":"BioData Min."},{"issue":"5","key":"951_CR29","doi-asserted-by":"publisher","first-page":"1455","DOI":"10.1137\/060650271","volume":"37","author":"L Roditty","year":"2008","unstructured":"Roditty, L., Zwick, U.: Improved dynamic reachability algorithms for directed graphs. SIAM J. Comput. 37(5), 1455\u20131471 (2008). https:\/\/doi.org\/10.1137\/060650271","journal-title":"SIAM J. Comput."},{"issue":"3","key":"951_CR30","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1137\/13093618X","volume":"45","author":"L Roditty","year":"2016","unstructured":"Roditty, L., Zwick, U.: A fully dynamic reachability algorithm for directed graphs with an almost linear update time. SIAM J. Comput. 45(3), 712\u2013733 (2016). https:\/\/doi.org\/10.1137\/13093618X","journal-title":"SIAM J. Comput."},{"key":"951_CR31","doi-asserted-by":"publisher","unstructured":"Sallinen, S., Pearce, R., Ripeanu, M.: Incremental graph processing for on-line analytics. In: 2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 1007\u20131018 (2019). https:\/\/doi.org\/10.1109\/IPDPS.2019.00108","DOI":"10.1109\/IPDPS.2019.00108"},{"key":"951_CR32","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-540-24741-8_15","volume-title":"Advances in Database Technology - EDBT 2004","author":"R Schenkel","year":"2004","unstructured":"Schenkel, R., Theobald, A., Weikum, G.: Hopi: An efficient connection index for complex xml document collections. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., B\u00f6hm, K., Ferrari, E. (eds.) Advances in Database Technology - EDBT 2004, pp. 237\u2013255. Springer, Berlin Heidelberg, Berlin, Heidelberg (2004)"},{"key":"951_CR33","doi-asserted-by":"publisher","unstructured":"Schenkel, R., Theobald, A., Weikum, G.: Efficient creation and incremental maintenance of the hopi index for complex xml document collections. 21st International Conference on Data Engineering (ICDE\u201905), 360\u2013371 (2005). https:\/\/doi.org\/10.1109\/ICDE.2005.57","DOI":"10.1109\/ICDE.2005.57"},{"key":"951_CR34","doi-asserted-by":"publisher","unstructured":"Semertzidis, K., Lili, K., Pitoura, E.: Timereach: Historical reachability queries on evolving graphs (2015). https:\/\/doi.org\/10.5441\/002\/edbt.2015.01","DOI":"10.5441\/002\/edbt.2015.01"},{"key":"951_CR35","doi-asserted-by":"publisher","unstructured":"Sleator, D.D., Endre Tarjan, R.: A data structure for dynamic trees. J. Comput. Syst. Sci. 26(3), 362\u2013391 (1983). https:\/\/doi.org\/10.1016\/0022-0000(83)90006-5. https:\/\/www.sciencedirect.com\/science\/article\/pii\/0022000083900065","DOI":"10.1016\/0022-0000(83)90006-5"},{"key":"951_CR36","doi-asserted-by":"publisher","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing, STOC \u201981, 114\u2013122. Association for Computing Machinery, New York, NY, USA (1981). https:\/\/doi.org\/10.1145\/800076.802464","DOI":"10.1145\/800076.802464"},{"issue":"3","key":"951_CR37","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. J. ACM 32(3), 652\u2013686 (1985). https:\/\/doi.org\/10.1145\/3828.3835","journal-title":"J. ACM"},{"key":"951_CR38","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1109\/SFCS.1984.715896","volume":"1984","author":"R Tarjan","year":"1984","unstructured":"Tarjan, R., Vishkin, U.: Finding biconnected componemts and computing tree functions in logarithmic parallel time. 25th Annual Symposium onFoundations of Computer Science 1984, 12\u201320 (1984). https:\/\/doi.org\/10.1109\/SFCS.1984.715896","journal-title":"25th Annual Symposium onFoundations of Computer Science"},{"issue":"2","key":"951_CR39","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/62.2160","volume":"31","author":"RE Tarjan","year":"1984","unstructured":"Tarjan, R.E., van Leeuwen, J.: Worst-case analysis of set union algorithms. J. ACM 31(2), 245\u2013281 (1984)","journal-title":"J. ACM"},{"key":"951_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00778-017-0468-3","volume":"27","author":"H Wei","year":"2014","unstructured":"Wei, H., Yu, J.X., Lu, C., Jin, R.: Reachability querying: an independent permutation labeling approach. VLDB J. 27, 1\u201326 (2014)","journal-title":"VLDB J."},{"key":"951_CR41","doi-asserted-by":"publisher","unstructured":"Wen, D., Huang, Y., Zhang, Y., Qin, L., Zhang, W., Lin, X.: Efficiently answering span-reachability queries in large temporal graphs. 2020 IEEE 36th International Conference on Data Engineering (ICDE), 1153\u20131164 (2020). https:\/\/doi.org\/10.1109\/ICDE48307.2020.00104","DOI":"10.1109\/ICDE48307.2020.00104"},{"issue":"4","key":"951_CR42","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/s00778-021-00715-z","volume":"31","author":"D Wen","year":"2022","unstructured":"Wen, D., Yang, B., Zhang, Y., Qin, L., Cheng, D., Zhang, W.: Span-reachability querying in large temporal graphs. VLDB J. 31(4), 629\u2013647 (2022)","journal-title":"VLDB J."},{"key":"951_CR43","doi-asserted-by":"crossref","unstructured":"Wu, H., Huang, Y., Cheng, J., Li, J., Ke, Y.: Reachability and time-based path queries in temporal graphs. 2016 IEEE 32nd International Conference on Data Engineering (ICDE), 145\u2013156 (2016). IEEE","DOI":"10.1109\/ICDE.2016.7498236"},{"key":"951_CR44","doi-asserted-by":"publisher","unstructured":"Xie, H., Fang, Y., Xia, Y., Luo, W., Ma, C.: On querying connected components in large temporal graphs. Proc. ACM Manag. Data 1(2), (2023). https:\/\/doi.org\/10.1145\/3589315","DOI":"10.1145\/3589315"},{"issue":"14","key":"951_CR45","doi-asserted-by":"publisher","first-page":"1821","DOI":"10.14778\/2733085.2733089","volume":"7","author":"D Yan","year":"2014","unstructured":"Yan, D., Cheng, J., Xing, K., Lu, Y., Ng, W., Bu, Y.: Pregel algorithms for graph connectivity problems with performance guarantees. Proceedings of the VLDB Endowment 7(14), 1821\u20131832 (2014)","journal-title":"Proceedings of the VLDB Endowment"},{"key":"951_CR46","unstructured":"Yildirim, H., Chaoji, V., Zaki, M.J.: DAGGER: A scalable index for reachability queries in large dynamic graphs. CoRR abs\/1301.0977 (2013). http:\/\/arxiv.org\/abs\/1301.0977"},{"key":"951_CR47","doi-asserted-by":"publisher","unstructured":"Yu, J.X., Cheng, J.: Graph Reachability Queries: A Survey, pp. 181\u2013215. Springer US, Boston, MA (2010). https:\/\/doi.org\/10.1007\/978-1-4419-6045-0_6","DOI":"10.1007\/978-1-4419-6045-0_6"},{"key":"951_CR48","doi-asserted-by":"crossref","unstructured":"Yu, M., Wen, D., Qin, L., Zhang, Y., Zhang, W., Lin, X.: On querying historical k-cores. Proceedings of the VLDB Endowment (2021)","DOI":"10.14778\/3476249.3476260"},{"issue":"2","key":"951_CR49","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/s00778-025-00903-1","volume":"34","author":"Y Yu","year":"2025","unstructured":"Yu, Y., Wen, D., Yu, M., Qin, L., Zhang, Y., Zhang, W., Lin, X.: Querying historical k-cores in large temporal graphs. VLDB J. 34(2), 26 (2025)","journal-title":"VLDB J."},{"key":"951_CR50","doi-asserted-by":"publisher","unstructured":"Zhu, A.D., Lin, W., Wang, S., Xiao, X.: Reachability queries on large dynamic graphs: A total order approach. Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, SIGMOD \u201914, p. 1323\u20131334. Association for Computing Machinery, New York, NY, USA (2014).https:\/\/doi.org\/10.1145\/2588555.2612181","DOI":"10.1145\/2588555.2612181"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-025-00951-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-025-00951-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-025-00951-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T07:27:41Z","timestamp":1770449261000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-025-00951-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,8]]},"references-count":50,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["951"],"URL":"https:\/\/doi.org\/10.1007\/s00778-025-00951-7","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,8]]},"assertion":[{"value":"27 February 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"2"}}