{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T04:30:14Z","timestamp":1763699414049,"version":"3.45.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"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":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s11390-025-4126-8","type":"journal-article","created":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T04:25:30Z","timestamp":1763699130000},"page":"1454-1467","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fault-Tolerant Routing Under Conditional Fault Pattern in Data Center Network of RRect"],"prefix":"10.1007","volume":"40","author":[{"given":"Ni","family":"An","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meng-Jie","family":"Lyu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei-Bei","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fu","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,21]]},"reference":[{"key":"4126_CR1","doi-asserted-by":"publisher","unstructured":"Chang F, Dean J, Ghemawat S, Hsieh W C, Wallach D A, Burrows M, Chandra T, Fikes A, Gruber R E. Bigtable: A distributed storage system for structured data. ACM Trans. Computer Systems (TOCS), 2018, 26(2): Article No. 4. DOI: https:\/\/doi.org\/10.1145\/1365815.1365816.","DOI":"10.1145\/1365815.1365816"},{"issue":"1","key":"4126_CR2","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean J, Ghemawat S. MapReduce: Simplified data processing on large clusters. Communications of the ACM, 2008, 51(1): 107\u2013113. DOI: https:\/\/doi.org\/10.1145\/1327452.1327492.","journal-title":"Communications of the ACM"},{"key":"4126_CR3","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/945445.945450","volume-title":"Proc. the 19th ACM Symposium on Operating Systems Principles","author":"S Ghemawat","year":"2003","unstructured":"Ghemawat S, Gobioff H, Leung S T. The Google file system. In Proc. the 19th ACM Symposium on Operating Systems Principles, Oct. 2003, pp.29\u201343. DOI: https:\/\/doi.org\/10.1145\/945445.945450."},{"key":"4126_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/1592568.1592576","volume-title":"Proc. the ACM SIGCOMM 2009 Conference on Data Communication","author":"A Greenberg","year":"2009","unstructured":"Greenberg A, Hamilton J R, Jain N, Kandula S, Kim C, Lahiri P, Maltz D A, Patel P, Sengupta S. VL2: A scalable and flexible data center network. In Proc. the ACM SIGCOMM 2009 Conference on Data Communication, Aug. 2009, pp.51\u201362. DOI: https:\/\/doi.org\/10.1145\/1592568.1592576."},{"key":"4126_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.5555\/2228298.2228322","volume-title":"Proc. the 9th USENIX Conference on Networked Systems Design and Implementation","author":"A Singla","year":"2012","unstructured":"Singla A, Hong C Y, Popa L, Godfrey P B. Jellyfish: Networking data centers randomly. In Proc. the 9th USENIX Conference on Networked Systems Design and Implementation, Apr. 2012, p.17. DOI: https:\/\/doi.org\/10.5555\/2228298.2228322."},{"issue":"8","key":"4126_CR6","doi-asserted-by":"publisher","first-page":"2373","DOI":"10.1109\/TPDS.2017.2666807","volume":"28","author":"M Adda","year":"2017","unstructured":"Adda M, Peratikou A. Routing and fault tolerance in Z-Fat trees. IEEE Trans. Parallel and Distributed Systems, 2017, 28(8): 2373\u20132386. DOI: https:\/\/doi.org\/10.1109\/TPDS.2017.2666807.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"4126_CR7","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/1592568.1592577","volume-title":"Proc. the ACM SIGCOMM 2009 Conference on Data Communication","author":"C Guo","year":"2009","unstructured":"Guo C, Lu G, Li D, Wu H, Zhang X, Shi Y, Tian C, Zhang Y, Lu S. BCube: A high performance, server-centric network architecture for modular data centers. In Proc. the ACM SIGCOMM 2009 Conference on Data Communication, Aug. 2009, pp.63\u201374. DOI: https:\/\/doi.org\/10.1145\/1592568.1592577."},{"key":"4126_CR8","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/1402958.1402968","volume-title":"Proc. the ACM SIGCOMM 2008 Conference on Data Communication","author":"C Guo","year":"2008","unstructured":"Guo C, Wu H, Tan K, Shi L, Zhang Y, Lu S. Dcell: A scalable and fault-tolerant network structure for data centers. In Proc. the ACM SIGCOMM 2008 Conference on Data Communication, Aug. 2008, pp.75\u201386. DOI: https:\/\/doi.org\/10.1145\/1402958.1402968."},{"issue":"2","key":"4126_CR9","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1109\/TPDS.2017.2762297","volume":"29","author":"Z Li","year":"2018","unstructured":"Li Z, Yang Y. A novel network structure with power efficiency and high availability for data centers. IEEE Trans. Parallel and Distributed Systems, 2018, 29(2): 254\u2013268. DOI: https:\/\/doi.org\/10.1109\/TPDS.2017.2762297.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"issue":"3","key":"4126_CR10","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1109\/TCC.2018.2816650","volume":"8","author":"Z Li","year":"2020","unstructured":"Li Z, Yang Y. RRect: A novel server-centric data center network with high power efficiency and availability. IEEE Trans. Cloud Computing, 2020, 8(3): 914\u2013927. DOI: https:\/\/doi.org\/10.1109\/TCC.2018.2816650.","journal-title":"IEEE Trans. Cloud Computing"},{"issue":"10","key":"4126_CR11","doi-asserted-by":"publisher","first-page":"2895","DOI":"10.1109\/TPDS.2015.2511725","volume":"27","author":"Z Li","year":"2016","unstructured":"Li Z, Yang Y. GBC3: A versatile cube-based server-centric network for data centers. IEEE Trans. Parallel and Distributed Systems, 2016, 27(10): 2895\u20132910. DOI: https:\/\/doi.org\/10.1109\/TPDS.2015.2511725.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"4126_CR12","doi-asserted-by":"publisher","DOI":"10.1109\/DSNW.2012.6264696","volume-title":"Proc. the IEEE\/IFIP International Conference on Dependable Systems and Networks Workshops","author":"Y Liu","year":"2012","unstructured":"Liu Y, Lin D, Muppala J K, Hamdi M. A study of fault-tolerance characteristics of data center networks. In Proc. the IEEE\/IFIP International Conference on Dependable Systems and Networks Workshops, Jun. 2012. DOI: https:\/\/doi.org\/10.1109\/DSNW.2012.6264696."},{"key":"4126_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.tcs.2020.10.036","volume":"850","author":"X Li","year":"2021","unstructured":"Li X, Zhou S, Guo X, Ma T. The h-restricted connectivity of the generalized hypercubes. Theoretical Computer Science, 2021, 850: 135\u2013147. DOI: https:\/\/doi.org\/10.1016\/J.TCS.2020.10.036.","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"4126_CR14","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/s10766-021-00699-x","volume":"49","author":"H Dong","year":"2021","unstructured":"Dong H, Fan J, Cheng B, Wang Y, Zhou J. Fault-tolerant and unicast performances of the data center network HSDC. International Journal of Parallel Programming, 2021, 49(5): 700\u2013714. DOI: https:\/\/doi.org\/10.1007\/S10766-021-00699-X.","journal-title":"International Journal of Parallel Programming"},{"issue":"9","key":"4126_CR15","doi-asserted-by":"publisher","first-page":"2467","DOI":"10.1109\/TC.2023.3251849","volume":"72","author":"W Fan","year":"2023","unstructured":"Fan W, Xiao F, Cai H, Chen X, Yu S. Disjoint paths construction and fault-tolerant routing in BCube of data center networks. IEEE Trans. Computers, 2023, 72(9): 2467\u20132481. DOI: https:\/\/doi.org\/10.1109\/TC.2023.3251849.","journal-title":"IEEE Trans. Computers"},{"issue":"4","key":"4126_CR16","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0020-0190(88)90025-7","volume":"27","author":"A H Esfahanian","year":"1988","unstructured":"Esfahanian A H, Hakimi S L. On computing a conditional edge-connectivity of a graph. Information Processing Letters, 1988, 27(4): 195\u2013199. DOI: https:\/\/doi.org\/10.1016\/0020-0190(88)90025-7.","journal-title":"Information Processing Letters"},{"issue":"2","key":"4126_CR17","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1109\/12.262126","volume":"43","author":"S Latifi","year":"1994","unstructured":"Latifi S, Hegde M, Naraghi-Pour M. Conditional connectivity measures for large multiprocessor systems. IEEE Trans. Computers, 1994, 43(2): 218\u2013222. DOI: https:\/\/doi.org\/10.1109\/12.262126.","journal-title":"IEEE Trans. Computers"},{"key":"4126_CR18","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.tcs.2015.11.050","volume":"615","author":"S Y Hsieh","year":"2016","unstructured":"Hsieh S Y, Huang H W, Lee C W. {2, 3}-restricted connectivity of locally twisted cubes. Theoretical Computer Science, 2016, 615: 78\u201390. DOI: https:\/\/doi.org\/10.1016\/J.TCS.2015.11.050.","journal-title":"Theoretical Computer Science"},{"key":"4126_CR19","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/j.dam.2016.08.012","volume":"217","author":"C C Wei","year":"2017","unstructured":"Wei C C, Hsieh S Y. h-restricted connectivity of locally twisted cubes. Discrete Applied Mathematics, 2017, 217: 330\u2013339. DOI: https:\/\/doi.org\/10.1016\/J.DAM.2016.08.012.","journal-title":"Discrete Applied Mathematics"},{"issue":"9","key":"4126_CR20","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1093\/comjnl\/bxz071","volume":"63","author":"H Yu","year":"2020","unstructured":"Yu H, Yang J, Lin L, Huang Y, Li J, Chen R. {1, 2, 3}-restricted connectivity of (n, k)-enhanced hypercubes. The Computer Journal, 2020, 63(9): 1355\u20131371. DOI: https:\/\/doi.org\/10.1093\/COMJNL\/BXZ071.","journal-title":"The Computer Journal"},{"issue":"2","key":"4126_CR21","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TPDS.2015.2400459","volume":"27","author":"L Lin","year":"2016","unstructured":"Lin L, Xu L, Zhou S, Hsieh S Y. The extra, restricted connectivity and conditional diagnosability of split-star networks. IEEE Trans. Parallel and Distributed Systems, 2016, 27(2): 533\u2013545. DOI: https:\/\/doi.org\/10.1109\/TPDS.2015.2400459.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"4126_CR22","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.tcs.2020.04.015","volume":"824\u2013825","author":"L Lin","year":"2020","unstructured":"Lin L, Huang Y, Wang X, Xu L. Restricted connectivity and good-neighbor diagnosability of split-star networks. Theoretical Computer Science, 2020, 824\u2013825: 81\u201391. DOI: https:\/\/doi.org\/10.1016\/J.TCS.2020.04.015.","journal-title":"Theoretical Computer Science"},{"issue":"9","key":"4126_CR23","doi-asserted-by":"publisher","first-page":"2528","DOI":"10.1093\/comjnl\/bxab105","volume":"65","author":"X Li","year":"2022","unstructured":"Li X, Zhou S, Ma T, Guo X, Ren X. The h-restricted connectivity of a class of hypercube-based compound networks. The Computer Journal, 2022, 65(9): 2528\u20132534. DOI: https:\/\/doi.org\/10.1093\/COMJNL\/BXAB105.","journal-title":"The Computer Journal"},{"issue":"9","key":"4126_CR24","doi-asserted-by":"publisher","first-page":"1451","DOI":"10.1093\/comjnl\/bxaa078","volume":"64","author":"M Lv","year":"2021","unstructured":"Lv M, Cheng B, Fan J, Wang X, Zhou J, Yu J. The conditional reliability evaluation of data center network BCDC. The Computer Journal, 2021, 64(9): 1451\u20131464. DOI: https:\/\/doi.org\/10.1093\/COMJNL\/BXAA078.","journal-title":"The Computer Journal"},{"issue":"12","key":"4126_CR25","doi-asserted-by":"publisher","first-page":"3199","DOI":"10.1093\/comjnl\/bxab137","volume":"65","author":"Y Yi","year":"2022","unstructured":"Yi Y, Fan J, Cheng B, Wang Y, Yu J. The 3-extra connectivity of the data center network BCube. The Computer Journal, 2022, 65(12): 3199\u20133208. DOI: https:\/\/doi.org\/10.1093\/COMJNL\/BXAB137.","journal-title":"The Computer Journal"},{"key":"4126_CR26","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.dam.2015.09.002","volume":"203","author":"X Wang","year":"2016","unstructured":"Wang X, Fan J, Zhou J, Lin C K. The restricted h-connectivity of the data center network DCell. Discrete Applied Mathematics, 2016, 203: 144\u2013157. DOI: https:\/\/doi.org\/10.1016\/J.DAM.2015.09.002.","journal-title":"Discrete Applied Mathematics"},{"key":"4126_CR27","doi-asserted-by":"publisher","first-page":"125941","DOI":"10.1016\/j.amc.2020.125941","volume":"396","author":"X Liu","year":"2021","unstructured":"Liu X, Meng J. The k-restricted edge-connectivity of the data center network DCell. Applied Mathematics and Computation, 2021, 396: 125941. DOI: https:\/\/doi.org\/10.1016\/J.AMC.2020.125941.","journal-title":"Applied Mathematics and Computation"},{"issue":"2","key":"4126_CR28","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1109\/TDSC.2017.2693372","volume":"16","author":"D Xiang","year":"2019","unstructured":"Xiang D, Li B, Fu Y. Fault- tolerant adaptive routing in dragonfly networks. IEEE Trans. Dependable and Secure Computing, 2019, 16(2): 259\u2013271. DOI: https:\/\/doi.org\/10.1109\/TDSC.2017.2693372.","journal-title":"IEEE Trans. Dependable and Secure Computing"},{"key":"4126_CR29","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-981-16-7913-1_2","volume-title":"Proc. the 7th International Symposium on Security and Privacy in Social Networks and Big Data","author":"N Liu","year":"2021","unstructured":"Liu N, Fan W, Fan J. Performance evaluation of fault tolerant routing algorithm in data center networks. In Proc. the 7th International Symposium on Security and Privacy in Social Networks and Big Data, Nov. 2021, pp.17\u201333. DOI: https:\/\/doi.org\/10.1007\/978-981-16-7913-1_2."},{"issue":"1","key":"4126_CR30","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/TDSC.2021.3126627","volume":"20","author":"W Fan","year":"2023","unstructured":"Fan W, Xiao F, Fan J, Han Z, Sun L, Wang R. Fault-tolerant routing with load balancing in LeTQ networks. IEEE Trans. Dependable and Secure Computing, 2023, 20(1): 68\u201382. DOI: https:\/\/doi.org\/10.1109\/TDSC.2021.3126627.","journal-title":"IEEE Trans. Dependable and Secure Computing"},{"issue":"4","key":"4126_CR31","doi-asserted-by":"publisher","first-page":"1689","DOI":"10.1109\/TNET.2022.3147320","volume":"30","author":"X Y Li","year":"2022","unstructured":"Li X Y, Lin W, Chang J M, Jia X. Transmission failure analysis of multi-protection routing in data center networks with heterogeneous edge-core servers. IEEE\/ACM Trans. Networking, 2022, 30(4): 1689\u20131702. DOI: https:\/\/doi.org\/10.1109\/TNET.2022.3147320.","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"4126_CR32","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.tcs.2015.09.022","volume":"609","author":"X Wang","year":"2016","unstructured":"Wang X, Fan J, Jia X, Lin C K. An efficient algorithm to construct disjoint path covers of DCell networks. Theoretical Computer Science, 2016, 609: 197\u2013210. DOI: https:\/\/doi.org\/10.1016\/J.TCS.2015.09.022.","journal-title":"Theoretical Computer Science"},{"key":"4126_CR33","doi-asserted-by":"publisher","unstructured":"Lu J, Du X, Li H, Han Z. BCCC disjoint path construction algorithm and fault-tolerant routing algorithm under restricted connectivity. Algorithms, 2022, 15(12): Article No. 481. DOI: https:\/\/doi.org\/10.3390\/A15120481.","DOI":"10.3390\/A15120481"},{"issue":"8","key":"4126_CR34","doi-asserted-by":"publisher","first-page":"1939","DOI":"10.1109\/TPDS.2021.3133595","volume":"33","author":"X Y Li","year":"2022","unstructured":"Li X Y, Lin W, Liu X, Lin C K, Pai K J, Chang J M. Completely independent spanning trees on BCCC data center networks with an application to fault-tolerant routing. IEEE Trans. Parallel and Distributed Systems, 2022, 33(8): 1939\u20131952. DOI: https:\/\/doi.org\/10.1109\/TPDS.2021.3133595.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"4126_CR35","series-title":"Master\u2019s Thesis","volume-title":"Research on conditional connectivity and fault-tolerant routing of generalized hypercubes","author":"L L Guo","year":"2018","unstructured":"Guo L L. Research on conditional connectivity and fault-tolerant routing of generalized hypercubes [Master\u2019s Thesis]. Soochow University, Suzhou, 2018. (in Chinese)"},{"key":"4126_CR36","doi-asserted-by":"publisher","first-page":"1320","DOI":"10.1109\/ISPA-BDCloud-SocialComSustainCom52081.2021.00181","volume-title":"Proc. the 2021 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking","author":"C Shu","year":"2021","unstructured":"Shu C, Wang Y, Fan J, Zhang H. Fault-tolerant routing of generalized hypercubes under 3-component connectivity. In Proc. the 2021 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking, Sept. 30\u2013Oct. 3, 2021, pp.1320\u20131327. DOI: https:\/\/doi.org\/10.1109\/ISPA-BDCloud-SocialComSustainCom52081.2021.00181."},{"issue":"11","key":"4126_CR37","doi-asserted-by":"publisher","first-page":"13090","DOI":"10.1007\/s11227-021-03799-0","volume":"77","author":"Y Zhang","year":"2021","unstructured":"Zhang Y, Fan W, Han Z, Song Y, Wang R. Fault-tolerant routing algorithm based on disjoint paths in 3-ary n-cube networks with structure faults. The Journal of Supercomputing, 2021, 77(11): 13090\u201313114. DOI: https:\/\/doi.org\/10.1007\/S11227-021-03799-0.","journal-title":"The Journal of Supercomputing"},{"key":"4126_CR38","doi-asserted-by":"publisher","first-page":"113858","DOI":"10.1016\/j.tcs.2023.113858","volume":"959","author":"B Niu","year":"2023","unstructured":"Niu B, Zhou S, Zhang H, Zhang Q. Fault tolerability analysis of folded crossed cubes based on g-component and g-good neighbor fault pattern. Theoretical Computer Science, 2023, 959: 113858. DOI: https:\/\/doi.org\/10.1016\/J.TCS.2023.113858.","journal-title":"Theoretical Computer Science"},{"key":"4126_CR39","volume-title":"Introduction to Algorithms","author":"T H Cormen","year":"2009","unstructured":"Cormen T H, Leiserson C E, Rivest R L, Stein C. Introduction to Algorithms (3rd edition). The MIT Press, 2009.","edition":"3rd edition"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-025-4126-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11390-025-4126-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-025-4126-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T04:25:31Z","timestamp":1763699131000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11390-025-4126-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9]]},"references-count":39,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["4126"],"URL":"https:\/\/doi.org\/10.1007\/s11390-025-4126-8","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9]]},"assertion":[{"value":"16 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 November 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Conflict of Interest\n                      The authors declare that they have no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics"}}]}}