{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T17:52:02Z","timestamp":1769017922117,"version":"3.49.0"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T00:00:00Z","timestamp":1768953600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T00:00:00Z","timestamp":1768953600000},"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":["Front. Comput. Sci."],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s11704-025-50487-w","type":"journal-article","created":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T02:18:00Z","timestamp":1768961880000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fault-tolerant path and disjoint path construction in data center network based on augmented cube"],"prefix":"10.1007","volume":"20","author":[{"given":"Weibei","family":"Fan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingman","family":"Pei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengjie","family":"Lv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xueli","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guijuan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,21]]},"reference":[{"issue":"1","key":"50487_CR1","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/TR.2023.3301629","volume":"73","author":"Y Huang","year":"2024","unstructured":"Huang Y, Lin L, Xu L, Hsieh S Y. Probabilistic reliability via subsystem structures of arrangement graph networks. IEEE Transactions on Reliability, 2024, 73(1): 279\u2013289","journal-title":"IEEE Transactions on Reliability"},{"issue":"3","key":"50487_CR2","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1109\/TPDS.2020.3029654","volume":"32","author":"G Chen","year":"2021","unstructured":"Chen G, Cheng B, Wang D. Constructing completely independent spanning trees in data center network based on augmented cube. IEEE Transactions on Parallel and Distributed Systems, 2021, 32(3): 665\u2013673","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"50487_CR3","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/j.jpdc.2023.03.007","volume":"177","author":"X Y Li","year":"2023","unstructured":"Li X Y, Zhao K, Zhuang H, Jia X. Novel schemes for embedding Hamiltonian paths and cycles in balanced hypercubes with exponential faulty edges. Journal of Parallel and Distributed Computing, 2023, 177: 182\u2013191","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"6","key":"50487_CR4","first-page":"1802","volume":"34","author":"H Zhuang","year":"2023","unstructured":"Zhuang H, Li X Y, Chang J M, Wang D. An efficient algorithm for Hamiltonian path embedding of k-Ary n-cubes under the partitioned edge fault model. IEEE Transactions on Parallel and Distributed Systems, 2023, 34(6): 1802\u20131815","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"9","key":"50487_CR5","doi-asserted-by":"publisher","first-page":"2305","DOI":"10.1109\/TC.2024.3416695","volume":"73","author":"W Fan","year":"2024","unstructured":"Fan W, Xiao F, Lv M, Han L, Yu S. Efficient fault-tolerant path embedding for 3D torus network using locally faulty blocks. IEEE Transactions on Computers, 2024, 73(9): 2305\u20132319","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"50487_CR6","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1145\/3597433","volume":"29","author":"D Xiang","year":"2024","unstructured":"Xiang D. Test compression for launch-on-capture transition fault testing. ACM Transactions on Design Automation of Electronic Systems, 2024, 29(1): 7","journal-title":"ACM Transactions on Design Automation of Electronic Systems"},{"key":"50487_CR7","doi-asserted-by":"publisher","first-page":"128716","DOI":"10.1016\/j.amc.2024.128716","volume":"475","author":"R X Hao","year":"2024","unstructured":"Hao R X, Qin X W, Zhang H, Chang J M. Two-disjoint-cycle-cover pancyclicity of data center networks. Applied Mathematics and Computation, 2024, 475: 128716","journal-title":"Applied Mathematics and Computation"},{"issue":"1","key":"50487_CR8","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s11227-024-06736-z","volume":"81","author":"Y Li","year":"2025","unstructured":"Li Y, Zhou S, Cheng E. Paired 2-disjoint path covers of balanced hypercube under the partitioned edge fault model. The Journal of Supercomputing, 2025, 81(1): 273","journal-title":"The Journal of Supercomputing"},{"key":"50487_CR9","doi-asserted-by":"publisher","first-page":"126990","DOI":"10.1016\/j.amc.2022.126990","volume":"422","author":"S L Zhao","year":"2022","unstructured":"Zhao S L, Hao R X, Wei C. Internally disjoint trees in the line graph and total graph of the complete bipartite graph. Applied Mathematics and Computation, 2022, 422: 126990","journal-title":"Applied Mathematics and Computation"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-025-50487-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-025-50487-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-025-50487-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T02:18:00Z","timestamp":1768961880000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-025-50487-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,21]]},"references-count":9,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["50487"],"URL":"https:\/\/doi.org\/10.1007\/s11704-025-50487-w","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,21]]},"assertion":[{"value":"21 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests or financial conflicts to disclose.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"2006109"}}