{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T17:55:02Z","timestamp":1778522102772,"version":"3.51.4"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,5,18]],"date-time":"2020-05-18T00:00:00Z","timestamp":1589760000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,18]],"date-time":"2020-05-18T00:00:00Z","timestamp":1589760000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11301342"],"award-info":[{"award-number":["11301342"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007219","name":"Natural Science Foundation of Shanghai","doi-asserted-by":"publisher","award":["17ZR1419900"],"award-info":[{"award-number":["17ZR1419900"]}],"id":[{"id":"10.13039\/100007219","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s00373-020-02176-7","type":"journal-article","created":{"date-parts":[[2020,5,18]],"date-time":"2020-05-18T19:03:25Z","timestamp":1589828605000},"page":"1203-1218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Consecutive Detecting Arrays for Interaction Faults"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6758-4114","authenticated-orcid":false,"given":"Ce","family":"Shi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1438-5496","authenticated-orcid":false,"given":"Aiyuan","family":"Tao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,5,18]]},"reference":[{"key":"2176_CR1","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1214\/aoms\/1177729449","volume":"23","author":"KA Bush","year":"1952","unstructured":"Bush, K.A.: A generalization of the theorem due to MacNeish. Ann. Math. Stat. 23, 293\u2013295 (1952)","journal-title":"Ann. Math. Stat."},{"key":"2176_CR2","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1214\/aoms\/1177729387","volume":"23","author":"KA Bush","year":"1952","unstructured":"Bush, K.A.: Orthogonal arrays of index unity. Ann. Math. Stat. 23, 426\u2013434 (1952)","journal-title":"Ann. Math. Stat."},{"issue":"3","key":"2176_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1008379710317","volume":"16","author":"M Chateauneuf","year":"1999","unstructured":"Chateauneuf, M., Colbourn, C.J., Kreher, D.L.: Covering arrays of strength three. Des. Codes Cryptogr. 16(3), 235\u2013242 (1999)","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"2176_CR4","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/jcd.10002","volume":"10","author":"M Chateauneuf","year":"2002","unstructured":"Chateauneuf, M., Kreher, D.L.: On the state of strength-three covering arrays. J. Combin. Des. 10(4), 217\u2013238 (2002)","journal-title":"J. Combin. Des."},{"key":"2176_CR5","unstructured":"Chen, Y.: Constructions of Optimal Detecting Arrays of Degree 5 and Strength 2. Master\u2019s Thesis, Soochow University (2011)"},{"key":"2176_CR6","first-page":"121","volume":"58","author":"CJ Colbourn","year":"2004","unstructured":"Colbourn, C.J.: Combinatorial aspects of covering arrays. LeMatematiche (Catania) 58, 121\u2013167 (2004)","journal-title":"LeMatematiche (Catania)"},{"issue":"5\u20136","key":"2176_CR7","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1016\/j.disc.2007.07.050","volume":"308","author":"CJ Colbourn","year":"2008","unstructured":"Colbourn, C.J.: Strength two covering arrays: existence tables and projection. Discret. Math. 308(5\u20136), 772\u2013786 (2008)","journal-title":"Discret. Math."},{"key":"2176_CR8","volume-title":"The CRC Handbook of Combinatorial Designs","author":"CJ Colbourn","year":"2007","unstructured":"Colbourn, C.J., Dinitz, J.H.: The CRC Handbook of Combinatorial Designs. CRC Press, Boca Raton (2007)"},{"issue":"1","key":"2176_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10623-006-0020-8","volume":"41","author":"CJ Colbourn","year":"2006","unstructured":"Colbourn, C.J., Martirosyan, S.S., Trung, T.V., Walker II, R.A.: Roux-type constructions for covering arrays of strengths three and four. Des. Codes Cryptogr. 41(1), 33\u201357 (2006)","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"2176_CR10","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s10878-007-9082-4","volume":"15","author":"CJ Colbourn","year":"2008","unstructured":"Colbourn, C.J., McClary, D.W.: Locating and detecting arrays for interaction faults. J. Comb. Optim. 15(1), 17\u201348 (2008)","journal-title":"J. Comb. Optim."},{"issue":"5","key":"2176_CR11","doi-asserted-by":"publisher","first-page":"1292","DOI":"10.1016\/j.jspi.2009.11.016","volume":"140","author":"AP Godbole","year":"2010","unstructured":"Godbole, A.P., Koutras, M.V., Milienos, F.S.: Consecutive covering arrays and a new randomness test. J. Statist. Plann. Inference 140(5), 1292\u20131305 (2010)","journal-title":"J. Statist. Plann. Inference"},{"issue":"3","key":"2176_CR12","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s10463-009-0240-6","volume":"63","author":"AP Godbole","year":"2011","unstructured":"Godbole, A.P., Koutras, M.V., Milienos, F.S.: Binary consecutive covering arrays. Ann. Inst. Stat. Math. 63(3), 559\u2013584 (2011)","journal-title":"Ann. Inst. Stat. Math."},{"issue":"5","key":"2176_CR13","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1002\/1520-6610(2000)8:5<311::AID-JCD1>3.0.CO;2-1","volume":"8","author":"S Hartman","year":"2000","unstructured":"Hartman, S.: On simple and supersimple transversal designs. J. Comb. Des. 8(5), 311\u2013322 (2000)","journal-title":"J. Comb. Des."},{"issue":"1\u20133","key":"2176_CR14","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.disc.2003.11.029","volume":"284","author":"S Hartman","year":"2004","unstructured":"Hartman, S., Raskin, L.: Problems and algorithms for covering arrays. Discret. Math. 284(1\u20133), 149\u2013156 (2004)","journal-title":"Discret. Math."},{"key":"2176_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1478-6","volume-title":"Orthogonal Arrays","author":"AS Hedayat","year":"1999","unstructured":"Hedayat, A.S., Slone, N.J.A., Stufken, J.: Orthogonal Arrays. Springer, New York (1999)"},{"issue":"3","key":"2176_CR16","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.jcta.2009.06.002","volume":"117","author":"L Ji","year":"2010","unstructured":"Ji, L., Yin, J.: Constructions of new orthogonal arrays and covering arrays of strength three. J. Combin. Theory (A) 117(3), 236\u2013247 (2010)","journal-title":"J. Combin. Theory (A)"},{"issue":"11","key":"2176_CR17","doi-asserted-by":"publisher","first-page":"2629","DOI":"10.1007\/s10623-018-0465-6","volume":"86","author":"JT Jimenez","year":"2018","unstructured":"Jimenez, J.T., Marquez, I.I.: Covering arrays of strength three from extended permutation vectors. Des. Codes Cryptogr. 86(11), 2629\u20132643 (2018)","journal-title":"Des. Codes Cryptogr."},{"key":"2176_CR18","unstructured":"Kuhn, D. R., Reilly, M. J.: An investigation of the applicability of design of experiments to software testing. In: Proceedings of the 27th NASA\/ IEEE Software Engineering Workshop, NASA Goddard Space Flight Center, pp. 91\u201395 (2002)"},{"issue":"6","key":"2176_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TSE.2004.24","volume":"30","author":"DR Kuhn","year":"2004","unstructured":"Kuhn, D.R., Wallace, D.R.: Software fault interaction and implication for software testing. IEEE Trans. Softw. Eng. 30(6), 1\u20134 (2004)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"9","key":"2176_CR20","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1002\/jcd.21602","volume":"26","author":"S Raaphorst","year":"2018","unstructured":"Raaphorst, S., Moura, L., Stevens, B.: Variable strength covering arrays. J. Combin. Des. 26(9), 417\u2013438 (2018)","journal-title":"J. Combin. Des."},{"key":"2176_CR21","doi-asserted-by":"publisher","first-page":"128","DOI":"10.2307\/2983576","volume":"9","author":"CR Rao","year":"1947","unstructured":"Rao, C.R.: Factorial experiments derivable from combinatorial arrangements of arrays. Suppl. J. R. Stat. Soc. 9, 128\u2013139 (1947)","journal-title":"Suppl. J. R. Stat. Soc."},{"issue":"2","key":"2176_CR22","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s10623-011-9498-9","volume":"62","author":"C Shi","year":"2012","unstructured":"Shi, C., Tang, Y., Yin, J.: The equivalence between optimal detecting arrays and super-simple OAs. Des. Codes Cryptogr. 62(2), 131\u2013142 (2012)","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"2176_CR23","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10623-012-9771-6","volume":"72","author":"C Shi","year":"2014","unstructured":"Shi, C., Yin, J.: Existence of super-simple $$\\text{ OA }_\\lambda (3,5, v)]^{\\prime }$$s. Des. Codes Cryptogr. 72(2), 369\u2013380 (2014)","journal-title":"Des. Codes Cryptogr."},{"issue":"12","key":"2176_CR24","doi-asserted-by":"publisher","first-page":"2309","DOI":"10.1007\/s10114-011-0184-7","volume":"27","author":"Y Tang","year":"2011","unstructured":"Tang, Y., Yin, J.: Detecting arrays and their optimality. Acta Math. Sin. Engl. Ser. 27(12), 2309\u20132318 (2011)","journal-title":"Acta Math. Sin. Engl. Ser."},{"issue":"3","key":"2176_CR25","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s10623-016-0316-2","volume":"85","author":"G Tzanakis","year":"2017","unstructured":"Tzanakis, G., Moura, L., Panario, D., Stevens, B.: Covering arrays from $$m$$-sequences and character sums. Des. Codes Cryptogr. 85(3), 437\u2013456 (2017)","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"2176_CR26","first-page":"200","volume":"30","author":"Z Wang","year":"2007","unstructured":"Wang, Z., Nie, C., Xu, B., Shi, L.: Optimal test suite generation methods for neighbor factors combinatorial testing (in Chinese). Chin. J. Comput. 30(2), 200\u2013211 (2007)","journal-title":"Chin. J. Comput."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02176-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-020-02176-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02176-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,17]],"date-time":"2021-05-17T23:33:27Z","timestamp":1621294407000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-020-02176-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,18]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["2176"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02176-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,18]]},"assertion":[{"value":"13 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}