{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,3]],"date-time":"2026-05-03T00:26:04Z","timestamp":1777767964872,"version":"3.51.4"},"reference-count":17,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"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","award":["12171028"],"award-info":[{"award-number":["12171028"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12371326"],"award-info":[{"award-number":["12371326"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.jcta.2025.106131","type":"journal-article","created":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T18:42:35Z","timestamp":1763750555000},"page":"106131","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On cover-free families of finite vector spaces"],"prefix":"10.1016","volume":"220","author":[{"given":"Yunjing","family":"Shan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5725-4920","authenticated-orcid":false,"given":"Junling","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.jcta.2025.106131_br0010","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1016\/j.jcta.2009.10.010","article-title":"Shadows and intersections in vector spaces","volume":"117","author":"Chowdhury","year":"2010","journal-title":"J. Comb. Theory, Ser. A"},{"key":"10.1016\/j.jcta.2025.106131_br0020","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1109\/18.841169","article-title":"Tracing traitors","volume":"46","author":"Chor","year":"2000","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.jcta.2025.106131_br0030","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0012-365X(92)90622-M","article-title":"q-Analogs of the inclusion-exclusion principle and permutations with restricted position","volume":"104","author":"Chen","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/j.jcta.2025.106131_br0040","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF00191355","article-title":"On key storage in secure networks","volume":"8","author":"Dyer","year":"1995","journal-title":"J. Cryptol."},{"key":"10.1016\/j.jcta.2025.106131_br0050","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/0097-3165(82)90004-8","article-title":"Families of finite sets in which no set is covered by the union of two others","volume":"33","author":"Erd\u0151s","year":"1982","journal-title":"J. Comb. Theory, Ser. A"},{"key":"10.1016\/j.jcta.2025.106131_br0060","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF02772959","article-title":"Families of finite sets in which no set is covered by the union of r others","volume":"51","author":"Erd\u0151s","year":"1985","journal-title":"Isr. J. Math."},{"key":"10.1016\/j.jcta.2025.106131_br0070","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0097-3165(86)90063-4","article-title":"The Erd\u0151s-Ko-Rado theorem for vector spaces","volume":"43","author":"Frankl","year":"1986","journal-title":"J. Comb. Theory, Ser. A"},{"key":"10.1016\/j.jcta.2025.106131_br0080","first-page":"257","article-title":"Non-adaptive hypergeometric group testing","volume":"22","author":"Hwang","year":"1987","journal-title":"Studia Sci. Math. Hung."},{"key":"10.1016\/j.jcta.2025.106131_br0090","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1109\/TIT.1964.1053689","article-title":"Nonrandom binary superimposed codes","volume":"10","author":"Kautz","year":"1964","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.jcta.2025.106131_br0100","series-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","year":"1993"},{"key":"10.1016\/j.jcta.2025.106131_br0110","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0166-218X(88)90068-6","article-title":"Key storage in secure networks","volume":"21","author":"Mitchell","year":"1988","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.jcta.2025.106131_br0120","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1016\/S0012-365X(03)00287-5","article-title":"Generalized cover-free families","volume":"279","author":"Stinson","year":"2004","journal-title":"Discrete Math."},{"key":"10.1016\/j.jcta.2025.106131_br0130","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1109\/18.915661","article-title":"Combinatorial properties of frameproof and traceability codes","volume":"47","author":"Staddon","year":"2001","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"10.1016\/j.jcta.2025.106131_br0140","doi-asserted-by":"crossref","first-page":"7518","DOI":"10.1109\/TIT.2016.2614726","article-title":"New bounds on the number of tests for disjunct matrices","volume":"62","author":"Shangguan","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.jcta.2025.106131_br0150","series-title":"Advances in Cryptology: Eurocrypt'98","first-page":"527","article-title":"New results on multi-receiver authentication codes","volume":"vol. 1403","author":"Safavi-Naini","year":"1998"},{"key":"10.1016\/j.jcta.2025.106131_br0160","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1016\/j.jcta.2005.08.006","article-title":"Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs","volume":"113","author":"Tanaka","year":"2006","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"12","key":"10.1016\/j.jcta.2025.106131_br0170","doi-asserted-by":"crossref","first-page":"8636","DOI":"10.1109\/TIT.2024.3411150","article-title":"Improved upper bounds for wide-sense frameproof codes","volume":"70","author":"Zhao","year":"2024","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097316525001268?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097316525001268?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T15:48:22Z","timestamp":1777477702000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0097316525001268"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":17,"alternative-id":["S0097316525001268"],"URL":"https:\/\/doi.org\/10.1016\/j.jcta.2025.106131","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On cover-free families of finite vector spaces","name":"articletitle","label":"Article Title"},{"value":"Journal of Combinatorial Theory, Series A","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jcta.2025.106131","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"106131"}}