{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T04:14:09Z","timestamp":1767845649607,"version":"3.49.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2023,7,25]],"date-time":"2023-07-25T00:00:00Z","timestamp":1690243200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,25]],"date-time":"2023-07-25T00:00:00Z","timestamp":1690243200000},"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":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1007\/s10623-023-01267-9","type":"journal-article","created":{"date-parts":[[2023,7,25]],"date-time":"2023-07-25T15:30:05Z","timestamp":1690299005000},"page":"3741-3755","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Constructions of column-orthogonal strong orthogonal arrays via matchings of bipartite graphs"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3398-5443","authenticated-orcid":false,"given":"Jingjun","family":"Bao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,25]]},"reference":[{"key":"1267_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1017\/CBO9780511984068","volume-title":"Bipartite Graphs and Their Applications","author":"AS Asratian","year":"1998","unstructured":"Asratian A.S., Denley T.M.J., Haggkvist R.: Bipartite Graphs and Their Applications, pp. 75\u201381. Cambridge University Press, Cambridge (1998)."},{"key":"1267_CR2","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1360\/SSM-2022-0062","volume":"53","author":"J Bao","year":"2023","unstructured":"Bao J., Ji L., Pan Y.: Constructions of column-orthogonal strong orthogonal arrays. Sci. Sin. Math. 53, 233\u2013248 (2023) in Chinese.","journal-title":"Sci. Sin. Math."},{"key":"1267_CR3","unstructured":"Bao, J., Ji, L., Xu, J.: Direct constructions of column-orthogonal strong orthogonal arrays. Submitted."},{"key":"1267_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1093\/biomet\/asn057","volume":"96","author":"D Bingham","year":"2009","unstructured":"Bingham D., Sitter R.R., Tang B.: Orthogonal and nearly orthogonal designs for computer experiments. Biometrika 96, 51\u201365 (2009).","journal-title":"Biometrika"},{"key":"1267_CR5","volume-title":"Design and Modeling for Computer Experiments","author":"K Fang","year":"2006","unstructured":"Fang K., Li R., Sudjianto A.: Design and Modeling for Computer Experiments. Hall\/CRC, Boca Raton (2006)."},{"key":"1267_CR6","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1214\/17-AOS1555","volume":"46","author":"Y He","year":"2018","unstructured":"He Y., Cheng C., Tang B.: Strong orthogonal arrays of strength two plus. Ann. Stat. 46, 457\u2013468 (2018).","journal-title":"Ann. Stat."},{"key":"1267_CR7","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1093\/biomet\/ass065","volume":"100","author":"Y He","year":"2013","unstructured":"He Y., Tang B.: Strong orthogonal arrays and associated Latin hypercubes for computer experiments. Biometrika 100, 254\u2013260 (2013).","journal-title":"Biometrika"},{"key":"1267_CR8","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1214\/14-AOS1225","volume":"42","author":"Y He","year":"2014","unstructured":"He Y., Tang B.: A characterization of strong orthogonal arrays of strength three. Ann. Stat. 42, 115\u2013128 (2014).","journal-title":"Ann. Stat."},{"key":"1267_CR9","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., Sloane N.J.A., Stufken J.: Orthogonal Arrays. Springer, New York (1999)."},{"key":"1267_CR10","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s00362-021-01249-w","volume":"63","author":"W Li","year":"2022","unstructured":"Li W., Liu M., Yang J.: Construction of column-orthogonal strong orthogonal arrays. Stat. Pap. 63, 515\u2013530 (2022).","journal-title":"Stat. Pap."},{"key":"1267_CR11","first-page":"1713","volume":"25","author":"H Liu","year":"2015","unstructured":"Liu H., Liu M.: Column-orthogonal strong orthogonal arrays and sliced strong orthogonal arrays. Stat. Sin. 25, 1713\u20131734 (2015).","journal-title":"Stat. Sin."},{"key":"1267_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3799-8","volume-title":"The Design and Analysis of Computer Experiments","author":"TJ Santner","year":"2003","unstructured":"Santner T.J., Williams B.J., Notz W.I.: The Design and Analysis of Computer Experiments. Springer, New York (2003)."},{"key":"1267_CR13","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1093\/biomet\/asz043","volume":"106","author":"Y Zhou","year":"2019","unstructured":"Zhou Y., Tang B.: Column-orthogonal strong orthogonal arrays of strength two plus and three minus. Biometrika 106, 997\u20131004 (2019).","journal-title":"Biometrika"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01267-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01267-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01267-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T19:16:14Z","timestamp":1698174974000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01267-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,25]]},"references-count":13,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["1267"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01267-9","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,25]]},"assertion":[{"value":"6 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 July 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}