{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T05:36:42Z","timestamp":1774330602614,"version":"3.50.1"},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001352","name":"National University of Singapore","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001352","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2024-05956"],"award-info":[{"award-number":["RGPIN-2024-05956"]}],"id":[{"id":"10.13039\/501100000038","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,8]]},"DOI":"10.1016\/j.jcta.2026.106182","type":"journal-article","created":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T08:18:52Z","timestamp":1773994732000},"page":"106182","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On the smallest antichain that generates an ideal of a given size"],"prefix":"10.1016","volume":"222","author":[{"given":"L.","family":"Sunil Chandran","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8726-3465","authenticated-orcid":false,"given":"Rishikesh","family":"Gajjala","sequence":"additional","affiliation":[]},{"given":"Kuldeep S.","family":"Meel","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jcta.2026.106182_br0060","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF00536201","article-title":"An inequality for the weights of two families of sets, their unions and intersections","volume":"43","author":"Ahlswede","year":"1978","journal-title":"Z. Wahrscheinlichk.theor. Verw. Geb."},{"issue":"2","key":"10.1016\/j.jcta.2026.106182_br0090","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0012-365X(83)90253-4","article-title":"On the density of sets of vectors","volume":"46","author":"Alon","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/j.jcta.2026.106182_br0070","series-title":"The Probabilistic Method","first-page":"81","author":"Alon","year":"2000"},{"key":"10.1016\/j.jcta.2026.106182_br0030","series-title":"Combinatorics: Set Systems, Hypergraphs, Families of Vectors, and Combinatorial Probability","author":"Bollob\u00e1s","year":"1986"},{"key":"10.1016\/j.jcta.2026.106182_br0040","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02579198","article-title":"Threshold functions","volume":"7","author":"Bollob\u00e1s","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/j.jcta.2026.106182_br0150","series-title":"Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence","first-page":"689","article-title":"From weighted to unweighted model counting","author":"Chakraborty","year":"2015"},{"key":"10.1016\/j.jcta.2026.106182_br0010","series-title":"28th International Conference on Theory and Applications of Satisfiability Testing, SAT 2025","first-page":"9:1","article-title":"CNFs and DNFs with exactly k solutions","volume":"vol. 341","author":"Chandran","year":"2025"},{"key":"10.1016\/j.jcta.2026.106182_br0180","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1613\/jair.2289","article-title":"Probabilistic planning via heuristic forward search and weighted model counting","volume":"30","author":"Domshlak","year":"2007","journal-title":"J. Artif. Intell. Res."},{"key":"10.1016\/j.jcta.2026.106182_br0130","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.ejc.2018.11.005","article-title":"The width of downsets","volume":"79","author":"Duffus","year":"2019","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.jcta.2026.106182_br0100","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0097-3165(83)90038-9","article-title":"On the trace of finite sets","volume":"34","author":"Frankl","year":"1983","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"1","key":"10.1016\/j.jcta.2026.106182_br0050","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0021-9800(66)80012-1","article-title":"Families of non-disjoint subsets","volume":"1","author":"Kleitman","year":"1966","journal-title":"J. Comb. Theory"},{"issue":"2","key":"10.1016\/j.jcta.2026.106182_br0080","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0021-9800(66)80027-3","article-title":"On a combinatorial conjecture of Erd\u00f6s","volume":"1","author":"Kleitman","year":"1966","journal-title":"J. Comb. Theory"},{"key":"10.1016\/j.jcta.2026.106182_br0120","article-title":"Greedoids","volume":"vol. 4","author":"Korte","year":"1991"},{"key":"10.1016\/j.jcta.2026.106182_br0110","article-title":"Introduction to Topological Manifolds","volume":"vol. 202","author":"Lee","year":"2011"},{"issue":"1\u20132","key":"10.1016\/j.jcta.2026.106182_br0160","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0004-3702(94)00092-1","article-title":"On the hardness of approximate reasoning","volume":"82","author":"Roth","year":"1996","journal-title":"Artif. Intell."},{"key":"10.1016\/j.jcta.2026.106182_br0170","series-title":"SAT 2004 - The Seventh International Conference on Theory and Applications of Satisfiability Testing","article-title":"Combining component caching and clause learning for effective model counting","author":"Sang","year":"2004"},{"key":"10.1016\/j.jcta.2026.106182_br0020","series-title":"Enumerative Combinatorics","first-page":"282","volume":"vol. 1","author":"Stanley","year":"2011"},{"key":"10.1016\/j.jcta.2026.106182_br0200","author":"Szeider"},{"issue":"3","key":"10.1016\/j.jcta.2026.106182_br0140","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","article-title":"The complexity of enumeration and reliability problems","volume":"8","author":"Valiant","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jcta.2026.106182_br0190","series-title":"Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence","first-page":"842","article-title":"Basing decisions on sentences in decision diagrams","author":"Xue","year":"2012"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097316526000257?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097316526000257?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T03:30:38Z","timestamp":1774323038000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0097316526000257"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":20,"alternative-id":["S0097316526000257"],"URL":"https:\/\/doi.org\/10.1016\/j.jcta.2026.106182","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the smallest antichain that generates an ideal of a given size","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.2026.106182","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}],"article-number":"106182"}}