{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:18:37Z","timestamp":1759637917165},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,9,1]],"date-time":"1989-09-01T00:00:00Z","timestamp":620611200000},"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":8720,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[1989,9]]},"DOI":"10.1016\/0097-3165(89)90062-9","type":"journal-article","created":{"date-parts":[[2004,10,5]],"date-time":"2004-10-05T15:09:06Z","timestamp":1096988946000},"page":"62-76","source":"Crossref","is-referenced-by-count":42,"title":["Ulam's searching game with lies"],"prefix":"10.1016","volume":"52","author":[{"given":"Jurek","family":"Czyzowicz","sequence":"first","affiliation":[]},{"given":"Daniele","family":"Mundici","sequence":"additional","affiliation":[]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0097-3165(89)90062-9_BIB1","series-title":"Error-Correcting Codes","first-page":"61","article-title":"Block coding for the binary symmetric channel with noiseless, delayless feedback","author":"Berlekamp","year":"1968"},{"key":"10.1016\/0097-3165(89)90062-9_BIB2","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/0097-3165(88)90065-9","article-title":"Solution of Ulam's problem on binary search with two lies","volume":"49","author":"Czyzowicz","year":"1988","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0097-3165(89)90062-9_BIB3","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0097-3165(87)90065-3","article-title":"Solution of Ulam's problem on searching with a lie","volume":"44","author":"Pelc","year":"1987","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/0097-3165(89)90062-9_BIB4","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1016\/0022-0000(80)90014-8","article-title":"Coping with errors in binary search procedures","volume":"20","author":"Rivest","year":"1980","journal-title":"J. Comput. System Sci."},{"issue":"No. 2","key":"10.1016\/0097-3165(89)90062-9_BIB5","doi-asserted-by":"crossref","first-page":"105","DOI":"10.2307\/2689593","article-title":"Guess a Number\u2014with Lying","volume":"57","author":"Spencer","year":"1984","journal-title":"Math. Mag."},{"key":"10.1016\/0097-3165(89)90062-9_BIB6","first-page":"281","article-title":"Adventures of a Mathematician","author":"Ulam","year":"1976"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316589900629?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097316589900629?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T07:28:42Z","timestamp":1549178922000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0097316589900629"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,9]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,9]]}},"alternative-id":["0097316589900629"],"URL":"https:\/\/doi.org\/10.1016\/0097-3165(89)90062-9","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[1989,9]]}}}