{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T02:39:07Z","timestamp":1777516747049,"version":"3.51.4"},"reference-count":11,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:00:00Z","timestamp":1488326400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Computability"],"published-print":{"date-parts":[[2017,3,16]]},"abstract":"<jats:p>We introduce and study several notions of computability-theoretic reducibility between subsets of \u03c9 that are \u201crobust\u201d in the sense that if only partial information is available about the oracle, then partial information can be recovered about the output. These notions are motivated by reductions between [Formula: see text] principles in the context of reverse mathematics, where some of our results have already been applied, e.g., by Hirschfeldt and Jockusch [to appear]. Our work also encompasses generic and coarse reducibilities, previously studied by Jockusch and Schupp [ J. Lond. Math. Soc. (2) 85(2) (2012), 472\u2013490].<\/jats:p>","DOI":"10.3233\/com-160059","type":"journal-article","created":{"date-parts":[[2017,3,10]],"date-time":"2017-03-10T10:39:59Z","timestamp":1489142399000},"page":"105-124","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":3,"title":["Notions of robust information coding"],"prefix":"10.1177","volume":"6","author":[{"given":"Damir D.","family":"Dzhafarov","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Connecticut, 196 Auditorium Road, Storrs, CT 06269, U.S.A.."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory","family":"Igusa","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Notre Dame, 255 Hurley Hall, Notre Dame, IN 46556, U.S.A.."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2017,3,1]]},"reference":[{"key":"ref001","unstructured":"P.A.\u00a0Cholak and G.\u00a0Igusa, Density-1-bounding and quasiminimality in the generic degrees (to appear)."},{"key":"ref002","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68441-3"},{"key":"ref003","doi-asserted-by":"publisher","DOI":"10.1142\/S0219061313500050"},{"key":"ref004","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-2014-12261-1"},{"key":"ref005","unstructured":"D.R.\u00a0Hirschfeldt and C.G.\u00a0JockuschJr., On notions of computability theoretic reduction between \u03a021 principles (to appear)."},{"key":"ref006","unstructured":"D.R.\u00a0Hirschfeldt, C.G.\u00a0JockuschJr., R.\u00a0Kuyper and P.E.\u00a0Schupp, Coarse reducibility and algorithmic randomness (to appear)."},{"key":"ref007","doi-asserted-by":"publisher","DOI":"10.2178\/jsl.7802090"},{"key":"ref008","unstructured":"G.\u00a0Igusa, The generic degrees of density-1 sets, and a characterization of the hyperarithmetic reals,\n                      J. Symbolic Logic\n                      (to appear)."},{"key":"ref009","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/jdr051"},{"key":"ref010","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12013-2"},{"key":"ref011","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02460-7"}],"container-title":["Computability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/COM-160059","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/COM-160059","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/COM-160059","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T15:59:52Z","timestamp":1777391992000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/COM-160059"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,1]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,3,16]]}},"alternative-id":["10.3233\/COM-160059"],"URL":"https:\/\/doi.org\/10.3233\/com-160059","relation":{},"ISSN":["2211-3568","2211-3576"],"issn-type":[{"value":"2211-3568","type":"print"},{"value":"2211-3576","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,1]]}}}