{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:17Z","timestamp":1740131657666,"version":"3.37.3"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2018,11,1]],"date-time":"2018-11-01T00:00:00Z","timestamp":1541030400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1109\/tit.2018.2856190","type":"journal-article","created":{"date-parts":[[2018,7,13]],"date-time":"2018-07-13T18:57:16Z","timestamp":1531508236000},"page":"6941-6953","source":"Crossref","is-referenced-by-count":5,"title":["Reducing Guesswork via an Unreliable Oracle"],"prefix":"10.1109","volume":"64","author":[{"given":"Amir","family":"Burin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4321-0318","authenticated-orcid":false,"given":"Ofer","family":"Shayevitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2013.6691341"},{"key":"ref32","volume":"169","author":"bhatia","year":"2013","journal-title":"Matrix Analysis"},{"journal-title":"Combinatorial Optimization Polyhedra and Efficiency","year":"2002","author":"schrijver","key":"ref31"},{"journal-title":"The Probabilistic Method","year":"2004","author":"alon","key":"ref30"},{"journal-title":"Elements of Information Theory","year":"2012","author":"cover","key":"ref35"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2355815"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023480"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.887466"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.836665"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.824921"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034179"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2090221"},{"journal-title":"Improved bounds on lossless source coding and guessing moments via R&#x00E9;nyi measures","year":"2018","author":"sason","key":"ref16"},{"key":"ref17","first-page":"211","article-title":"Guessing and cryptography","volume":"17","author":"arikan","year":"2008","journal-title":"Aspects of Network and Information Security"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187878"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2013.6810228"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104992"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1963.1057832"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.2601"},{"journal-title":"Information Theory and Reliable Communication","year":"1968","author":"gallager","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.641578"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.705557"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.669158"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.481781"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.782106"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1994.394764"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282723"},{"key":"ref22","first-page":"505","article-title":"On a problem of information theory","volume":"6","author":"r\u00e9nyi","year":"1961","journal-title":"MTA Mat Kut Int Kozl B"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006929"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00303-6"},{"journal-title":"Adventures of a Mathematician","year":"1978","author":"ulam","key":"ref23"},{"key":"ref26","first-page":"3","article-title":"On the number of correctable errors for transmission over a binary symmetrical channel with feedback","volume":"12","author":"zigangirov","year":"1976","journal-title":"Problemy Peredachi Informatsii"},{"article-title":"Block coding with noiseless feedback","year":"1964","author":"berlekamp","key":"ref25"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8497120\/08410937.pdf?arnumber=8410937","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T17:51:41Z","timestamp":1643219501000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8410937\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":35,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2018.2856190","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2018,11]]}}}