{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T14:44:21Z","timestamp":1772376261039,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1999,9,1]],"date-time":"1999-09-01T00:00:00Z","timestamp":936144000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,9,1]],"date-time":"1999-09-01T00:00:00Z","timestamp":936144000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Order"],"published-print":{"date-parts":[[1999,9]]},"DOI":"10.1023\/a:1006419611661","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T02:03:28Z","timestamp":1040522608000},"page":"231-244","source":"Crossref","is-referenced-by-count":3,"title":["On Edge Decompositions of Posets"],"prefix":"10.1007","volume":"16","author":[{"given":"Oleg","family":"Pikhurko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"264878_CR1","unstructured":"Anderson, I. (1967) Some problems in combinatorial number theory, Ph.D. Thesis, University of Nottingham."},{"key":"264878_CR2","unstructured":"Anderson, I. (1987) Combinatorics of Finite Sets, Oxford University Press."},{"key":"264878_CR3","first-page":"91","volume":"9","author":"L. D. Baumert","year":"1980","unstructured":"Baumert, L. D., McEliece, R. J., Rodermich, R. J. and Rumsey, H. (1980) A probabilistic version of Sperner's theorem, Ars Combin.\n9, 91\u2013100.","journal-title":"Ars Combin."},{"key":"264878_CR4","first-page":"191","volume":"23","author":"N. Bruijn","year":"1951","unstructured":"Bruijn, N., Tengbergen, C. and Kruyswijk, D. (1951) On the set of divisors of a number, Nieuw Arch. Wisk.\n23, 191\u2013193.","journal-title":"Nieuw Arch. Wisk."},{"key":"264878_CR5","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1109\/TSE.1982.236161","volume":"SE-8","author":"F. Chin","year":"1982","unstructured":"Chin, F. and Ozsoyoglu, G. (1982) Auditing and inference control in statistical databases, IEEE Trans. Software Eng. SE-8, 574\u2013582.","journal-title":"IEEE Trans. Software Eng"},{"key":"264878_CR6","doi-asserted-by":"crossref","unstructured":"Dantzig, G. B. and Hoffman, A. J. (1956) Dilworth's theorem on partially ordered sets, in H. W. Kuhn and A. W. Tucker (eds.), Linear Inequalities and Related Systems, Ann. Math. Stud. 38, pp. 207\u2013214.","DOI":"10.1515\/9781400881987-012"},{"issue":"2","key":"264878_CR7","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R. P. Dilworth","year":"1950","unstructured":"Dilworth, R. P. (1950) A decomposition theorem for partially ordered sets, Ann. of Math.\n51(2), 161\u2013166.","journal-title":"Ann. of Math."},{"key":"264878_CR8","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1145\/360933.360991","volume":"18","author":"S. P. Ghosh","year":"1975","unstructured":"Ghosh, S. P. (1975) Consecutive storage of relevant records with redundancy, Comm. ACM\n18, 464\u2013471.","journal-title":"Comm. ACM"},{"key":"264878_CR9","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0097-3165(76)90079-0","volume":"20","author":"C. Greene","year":"1976","unstructured":"Greene, C. and Kleitman, D. J. (1976) Strong versions of Sperner's theorem, J. Combin. Theory Ser. A\n20, 80\u201388.","journal-title":"J. Combin. Theory Ser. A"},{"key":"264878_CR10","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1137\/0132068","volume":"32","author":"J. R. Griggs","year":"1977","unstructured":"Griggs, J. R. (1977) Sufficient conditions for a symmetirc chain order, SIAM J. Appl. Math.\n32, 807\u2013809.","journal-title":"SIAM J. Appl. Math."},{"key":"264878_CR11","first-page":"223","volume":"7","author":"J. R. Griggs","year":"1999","unstructured":"Griggs, J. R. (1999) Database security and the distribution of subset sums in R\nm, in Graph Theory and Combinatorial Biology (Balatonlelle, 1996), J\u00e1nos Bolyai Math. Soc. 7, pp. 223\u2013252.","journal-title":"Graph Theory and Combinatorial Biology (Balatonlelle, 1996)"},{"key":"264878_CR12","first-page":"1088","volume":"262","author":"G. Hansel","year":"1966","unstructured":"Hansel, G. (1966) Sur de nombre des fonctions bool\u00e9ennes monotones de n variables, C.R. Acad. Sci. Paris S\u00e9r. A-B\n262, 1088\u20131090.","journal-title":"C.R. Acad. Sci. Paris S\u00e9r. A-B"},{"key":"264878_CR13","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1002\/sapm1979603271","volume":"60","author":"D. J. Kleitman","year":"1979","unstructured":"Kleitman, D. J. and Shearer, J. B. (1979) Probabilities of independent choices being ordered, Stud. Appl. Math.\n60, 271\u2013276.","journal-title":"Stud. Appl. Math."},{"key":"264878_CR14","first-page":"5","volume":"38","author":"A. D. Korshunov","year":"1981","unstructured":"Korshunov, A. D. (1981) The number of monotone Boolean functions, Probl. Kibernet.\n38, 5\u2013108.","journal-title":"Probl. Kibernet."},{"key":"264878_CR15","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(78)90157-7","volume":"21","author":"W. Lipski","year":"1978","unstructured":"Lipski, W. (1978) On strings containing all subsets as substrings, Discrete Math.\n21, 253\u2013259.","journal-title":"Discrete Math."},{"key":"264878_CR16","first-page":"57","volume":"13","author":"K. C. Miller","year":"1995","unstructured":"Miller, K. C. and Sarvate, D. G. (1995) An application of symmetric chains to a statistical database compromise prevention problem, Bull. ICA\n13, 57\u201364.","journal-title":"Bull. ICA"},{"key":"264878_CR17","first-page":"47","volume":"2","author":"M. Miller","year":"1991","unstructured":"Miller, M., Roberts, I. and Simpson, J. (1991) Application of symmetric chains to an optimization problem in the security of statistical databases, Bull. ICA\n2, 47\u201358.","journal-title":"Bull. ICA"},{"key":"264878_CR18","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0012-365X(86)90077-4","volume":"59","author":"M. Saks","year":"1986","unstructured":"Saks, M. (1986) Some sequences associated with combinatorial structures, Discrete Math.\n59, 135\u2013166.","journal-title":"Discrete Math."}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1006419611661.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1006419611661\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1006419611661.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T08:54:33Z","timestamp":1751878473000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1006419611661"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,9]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,9]]}},"alternative-id":["264878"],"URL":"https:\/\/doi.org\/10.1023\/a:1006419611661","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"value":"0167-8094","type":"print"},{"value":"1572-9273","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,9]]}}}