{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,21]],"date-time":"2024-07-21T15:10:44Z","timestamp":1721574644523},"reference-count":5,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1995,5,1]],"date-time":"1995-05-01T00:00:00Z","timestamp":799286400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6652,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[1995,5]]},"DOI":"10.1016\/0195-6698(95)90031-4","type":"journal-article","created":{"date-parts":[[2004,8,5]],"date-time":"2004-08-05T04:27:27Z","timestamp":1091680047000},"page":"263-266","source":"Crossref","is-referenced-by-count":11,"title":["Cancellative pairs of families of sets"],"prefix":"10.1016","volume":"16","author":[{"given":"Ron","family":"Holzman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e1nos","family":"K\u00f6rner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0195-6698(95)90031-4_BIB1","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/0012-365X(94)90129-5","article-title":"On the optimal structure of recovering set pairs in lattices: the sandglass conjecture","volume":"128","author":"Ahlswede","year":"1994","journal-title":"Discr. Math."},{"key":"10.1016\/0195-6698(95)90031-4_BIB2","series-title":"Information Theory: Coding Theorems for Discrete Memoryless Systems","author":"Csisz\u00e1r","year":"1982"},{"key":"10.1016\/0195-6698(95)90031-4_BIB3","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0195-6698(84)80025-6","article-title":"Union-free hypergraphs and probability theory","volume":"5","author":"Frankl","year":"1984","journal-title":"Europ. J. Combin."},{"key":"10.1016\/0195-6698(95)90031-4_BIB4","first-page":"13","article-title":"Extremal problems for hypergraphs","volume":"56","author":"Katona","year":"1974","journal-title":"Math. Ctr. Tracts"},{"key":"10.1016\/0195-6698(95)90031-4_BIB5","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1109\/18.30992","article-title":"On write-unidirectional memory codes","volume":"IT-35","author":"Simonyi","year":"1989","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0195669895900314?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0195669895900314?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,5]],"date-time":"2019-02-05T05:34:29Z","timestamp":1549344869000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0195669895900314"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,5]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,5]]}},"alternative-id":["0195669895900314"],"URL":"https:\/\/doi.org\/10.1016\/0195-6698(95)90031-4","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[1995,5]]}}}