{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T09:11:17Z","timestamp":1718442677972},"reference-count":3,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0020-0190(02)00475-1","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"75-78","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["A lower bound for the hitting set size for combinatorial rectangles and an application"],"prefix":"10.1016","volume":"86","author":[{"given":"L.Sunil","family":"Chandran","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0020-0190(02)00475-1_BIB001","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01200907","article-title":"Efficient construction of a small hitting set for combinatorial rectangles in high dimension","volume":"17","author":"Linial","year":"1997","journal-title":"Combinatorica"},{"key":"10.1016\/S0020-0190(02)00475-1_BIB002","series-title":"Proc. 24th ACM Symposium on Theory of Computing","first-page":"10","article-title":"Approximation of general independent distributions","author":"Even","year":"1992"},{"key":"10.1016\/S0020-0190(02)00475-1_BIB003","series-title":"Approximation Algorithms","author":"Vazirani","year":"2001"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002004751?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019002004751?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,6,15]],"date-time":"2024-06-15T08:28:28Z","timestamp":1718440108000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019002004751"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":3,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0020019002004751"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(02)00475-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A lower bound for the hitting set size for combinatorial rectangles and an application","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0020-0190(02)00475-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}