{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T18:02:54Z","timestamp":1784311374913,"version":"3.55.0"},"reference-count":47,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.ins.2026.123811","type":"journal-article","created":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T23:17:15Z","timestamp":1781911035000},"page":"123811","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Hamiltonian connectivity in k-ary n-cubes under a region-based fault model"],"prefix":"10.1016","volume":"755","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1417-5752","authenticated-orcid":false,"given":"Yiquan","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jingfan","family":"Zai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ziyang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jingyi","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eminjan","family":"Sabir","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2026.123811_bib0005","series-title":"Proceedings of the 50th Annual International Symposium on Computer Architecture","first-page":"1","article-title":"TPU V4: an optically reconfigurable supercomputer for machine learning with hardware support for embeddings","author":"Jouppi","year":"2023"},{"issue":"2","key":"10.1016\/j.ins.2026.123811_bib0010","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1109\/TNSE.2022.3205706","article-title":"A high-performantal and server-centric based data center network","volume":"10","author":"Lv","year":"2022","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"key":"10.1016\/j.ins.2026.123811_bib0015","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.jnca.2017.01.020","article-title":"LaCoDa: layered connected topology for massive data centers","volume":"83","author":"Chkirbene","year":"2017","journal-title":"J. Netw. Comput. Appl."},{"issue":"3","key":"10.1016\/j.ins.2026.123811_bib0020","doi-asserted-by":"crossref","first-page":"1660","DOI":"10.1109\/TNSE.2025.3537698","article-title":"The Hamiltonian property of the data center network DPCell","volume":"12","author":"Dong","year":"2025","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"key":"10.1016\/j.ins.2026.123811_bib0025","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.dam.2017.06.001","article-title":"Matching preclusion for k-ary n-cubes with odd k\u22653","volume":"229","author":"Hu","year":"2017","journal-title":"Discrete Appl. Math."},{"issue":"8","key":"10.1016\/j.ins.2026.123811_bib0030","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.3390\/sym16081063","article-title":"On the spanning cyclability of k-ary n-cube networks","volume":"16","author":"Qiao","year":"2024","journal-title":"Symmetry"},{"key":"10.1016\/j.ins.2026.123811_bib0035","series-title":"2024 IEEE International Conference on High Performance Computing and Communications (HPCC)","first-page":"432","article-title":"Examining SSD-correlated failures within racks in production data centers","author":"Xian","year":"2024"},{"key":"10.1016\/j.ins.2026.123811_bib0040","series-title":"Proceedings of the IEEE INDICON 2004. First India Annual Conference, 2004","first-page":"419","article-title":"Feasibility of a fault tolerant routing algorithm for hypercube multiprocessors","author":"Ali","year":"2004"},{"issue":"1","key":"10.1016\/j.ins.2026.123811_bib0045","doi-asserted-by":"crossref","first-page":"9203","DOI":"10.1038\/s41467-024-53303-4","article-title":"Deep learning resilience inference for complex networked systems","volume":"15","author":"Liu","year":"2024","journal-title":"Nat. Commun."},{"key":"10.1016\/j.ins.2026.123811_bib0050","doi-asserted-by":"crossref","first-page":"41814","DOI":"10.1109\/ACCESS.2026.3673933","article-title":"Predictive maintenance and reliability in intelligent 5G networks based on graph neural networks","volume":"14","author":"Ampratwum","year":"2026","journal-title":"IEEE Access"},{"issue":"1","key":"10.1016\/j.ins.2026.123811_bib0055","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1142\/S0219265905001290","article-title":"Hypercube network fault tolerance: a probabilistic approach","volume":"6","author":"Chen","year":"2005","journal-title":"J. Interconnect. Netw."},{"issue":"4","key":"10.1016\/j.ins.2026.123811_bib0060","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/j.jpdc.2005.10.004","article-title":"Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes","volume":"67","author":"Yang","year":"2007","journal-title":"J. Parallel Distrib. Comput."},{"issue":"6","key":"10.1016\/j.ins.2026.123811_bib0065","first-page":"1802","article-title":"An efficient algorithm for Hamiltonian path embedding of k-ary n-cubes under the partitioned edge fault model","volume":"34","author":"Zhuang","year":"2023","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"11","key":"10.1016\/j.ins.2026.123811_bib0070","doi-asserted-by":"crossref","first-page":"3245","DOI":"10.1109\/TC.2023.3288766","article-title":"Embedding Hamiltonian paths in k-ary n-cubes with exponentially-many faulty edges","volume":"72","author":"Zhuang","year":"2023","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.ins.2026.123811_bib0075","series-title":"Concurrency: The Works of Leslie Lamport","first-page":"203","article-title":"The Byzantine generals problem","author":"Lamport","year":"2019"},{"issue":"2","key":"10.1016\/j.ins.2026.123811_bib0080","doi-asserted-by":"crossref","first-page":"932","DOI":"10.1109\/TNSE.2022.3140329","article-title":"Configuring protection routing via completely independent spanning trees in dense Gaussian on-chip networks","volume":"9","author":"Pai","year":"2022","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"issue":"9","key":"10.1016\/j.ins.2026.123811_bib0085","doi-asserted-by":"crossref","first-page":"1108","DOI":"10.1109\/12.464389","article-title":"Subcube fault tolerance in hypercube multiprocessors","volume":"44","author":"Chang","year":"2002","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.ins.2026.123811_bib0090","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/j.ins.2013.10.031","article-title":"Reliability analysis and fault tolerance for hypercube multi-computer networks","volume":"276","author":"Abd-El-Barr","year":"2014","journal-title":"Inf. Sci."},{"issue":"3","key":"10.1016\/j.ins.2026.123811_bib0095","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1137\/S0895480196311183","article-title":"Fault-tolerant embeddings of Hamiltonian circuits in k-ary n-cubes","volume":"15","author":"Ashir","year":"2002","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.ins.2026.123811_bib0100","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/j.jpdc.2018.06.007","article-title":"Hamiltonian cycle and path embeddings in 3-ary n-cubes based on K1,3-structure faults","volume":"120","author":"Lv","year":"2018","journal-title":"J. Parallel Distrib. Comput."},{"issue":"12","key":"10.1016\/j.ins.2026.123811_bib0105","doi-asserted-by":"crossref","first-page":"13641","DOI":"10.1007\/s11227-023-05141-2","article-title":"Reliability of augmented k-ary n-cubes under the extra connectivity condition","volume":"79","author":"Sun","year":"2023","journal-title":"J. Supercomput."},{"key":"10.1016\/j.ins.2026.123811_bib0110","doi-asserted-by":"crossref","DOI":"10.1016\/j.jnca.2025.104133","article-title":"Efficient fault tolerance and diagnosis mechanism for network-on-chips","volume":"237","author":"Lv","year":"2025","journal-title":"J. Netw. Comput. Appl."},{"issue":"4","key":"10.1016\/j.ins.2026.123811_bib0115","doi-asserted-by":"crossref","first-page":"1565","DOI":"10.1109\/TC.2026.3654555","article-title":"Optimal fault-tolerant path and cycle embedding of hypercube networks under the PEF model","volume":"75","author":"Zhuang","year":"2026","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/j.ins.2026.123811_bib0120","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/TR.2023.3294929","article-title":"Structure fault-tolerant Hamiltonian cycle and path embeddings in bipartite k-ary n-cube networks","volume":"73","author":"Sabir","year":"2023","journal-title":"IEEE Trans. Reliab."},{"issue":"9","key":"10.1016\/j.ins.2026.123811_bib0125","doi-asserted-by":"crossref","first-page":"1532","DOI":"10.3390\/math13091532","article-title":"Structure fault tolerance of fully connected cubic networks","volume":"13","author":"Sabir","year":"2025","journal-title":"Mathematics"},{"issue":"3","key":"10.1016\/j.ins.2026.123811_bib0130","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1080\/17445760.2020.1748188","article-title":"Faulty diagnosability and g-extra connectivity of DQcube","volume":"36","author":"Zhang","year":"2021","journal-title":"Int. J. Parallel Emergent Distrib. Syst."},{"issue":"1","key":"10.1016\/j.ins.2026.123811_bib0135","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1002\/jgt.22807","article-title":"\u2113-connectivity and \u2113-edge-connectivity of random graphs","volume":"101","author":"Gu","year":"2022","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.ins.2026.123811_bib0140","series-title":"International Conference on Combinatorial Optimization and Applications","first-page":"133","article-title":"Mixed connectivity of random graphs","author":"Gu","year":"2017"},{"issue":"7","key":"10.1016\/j.ins.2026.123811_bib0145","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1016\/j.jpdc.2009.03.007","article-title":"An analysis of clustered failures on large supercomputing systems","volume":"69","author":"Hacker","year":"2009","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/j.ins.2026.123811_bib0150","doi-asserted-by":"crossref","DOI":"10.1016\/j.physa.2020.125071","article-title":"Cascading failures in spatial complex networks","volume":"559","author":"Xia","year":"2020","journal-title":"Phys. a Stat. Mech. Appl."},{"key":"10.1016\/j.ins.2026.123811_bib0155","series-title":"Graph Theory with Applications","volume":"vol. 290","author":"Bondy","year":"1976"},{"issue":"1","key":"10.1016\/j.ins.2026.123811_bib0160","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/S0166-218X(02)00238-X","article-title":"On k-ary n-cubes: theory and applications","volume":"129","author":"Mao","year":"2003","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.ins.2026.123811_bib0165","series-title":"Proceedings of the Fourth International Conference for Young Computer Scientists","first-page":"662","article-title":"Combinatorics of k-ary n-cubes with applications to partitioning","author":"Mao","year":"1995"},{"issue":"6","key":"10.1016\/j.ins.2026.123811_bib0170","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1109\/12.53599","article-title":"Performance analysis of k-ary n-cube interconnection networks","volume":"39","author":"Dally","year":"2002","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.ins.2026.123811_bib0175","series-title":"2025 IEEE International Symposium on High Performance Computer Architecture (HPCA)","first-page":"1259","article-title":"Revisiting reliability in large-scale machine learning research clusters","author":"Kokolis","year":"2025"},{"key":"10.1016\/j.ins.2026.123811_bib0180","series-title":"Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis","first-page":"1145","article-title":"Story of two GPUs: characterizing the resilience of Hopper H100 and Ampere A100 GPUs","author":"Cui","year":"2025"},{"key":"10.1016\/j.ins.2026.123811_bib0185","series-title":"Proceedings of the ACM SIGOPS 31st Symposium on Operating Systems Principles","first-page":"186","article-title":"Robust LLM training infrastructure at ByteDance","author":"Wan","year":"2025"},{"issue":"2","key":"10.1016\/j.ins.2026.123811_bib0190","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","article-title":"Error detecting and error correcting codes","volume":"29","author":"Hamming","year":"1950","journal-title":"Bell Syst. Tech. J."},{"key":"10.1016\/j.ins.2026.123811_bib0195","series-title":"Introduction to Coding Theory","author":"Roth","year":"2006"},{"issue":"3","key":"10.1016\/j.ins.2026.123811_bib0200","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0020-0190(93)90060-M","article-title":"On the fault-diameter of the star graph","volume":"46","author":"Latifi","year":"1993","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.ins.2026.123811_bib0205","series-title":"Proceedings of the ACM SIGCOMM 2011 Conference","first-page":"350","article-title":"Understanding network failures in data centers: measurement, analysis, and implications","author":"Gill","year":"2011"},{"issue":"4","key":"10.1016\/j.ins.2026.123811_bib0210","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/1402946.1402967","article-title":"A scalable, commodity data center network architecture","volume":"38","author":"Al-Fares","year":"2008","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"issue":"3","key":"10.1016\/j.ins.2026.123811_bib0215","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/1394608.1382129","article-title":"Technology-driven, highly-scalable dragonfly topology","volume":"36","author":"Kim","year":"2008","journal-title":"ACM SIGARCH Comput. Archit. News"},{"key":"10.1016\/j.ins.2026.123811_bib0220","series-title":"SC\u201914: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis","first-page":"348","article-title":"Slim fly: a cost effective low-diameter network topology","author":"Besta","year":"2014"},{"issue":"5","key":"10.1016\/j.ins.2026.123811_bib0225","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1109\/TC.1987.1676939","article-title":"Deadlock-free message routing in multiprocessor interconnection networks","volume":"C-36","author":"Dally","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.ins.2026.123811_bib0230","series-title":"Principles and Practices of Interconnection Networks","author":"Dally","year":"2004"},{"key":"10.1016\/j.ins.2026.123811_bib0235","doi-asserted-by":"crossref","DOI":"10.1016\/j.jnca.2024.103986","article-title":"CIBORG: CIrcuit-Based and ORiented graph theory permutation routing protocol for single-hop IoT networks","volume":"231","author":"Bomgni","year":"2024","journal-title":"J. Netw. Comput. Appl."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526007425?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526007425?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T17:06:24Z","timestamp":1784307984000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025526007425"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":47,"alternative-id":["S0020025526007425"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2026.123811","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Hamiltonian connectivity in -ary -cubes under a region-based fault model","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2026.123811","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"123811"}}