{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T02:51:11Z","timestamp":1777517471440,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.3233\/com-2012-006","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T14:59:53Z","timestamp":1575298793000},"page":"39-43","source":"Crossref","is-referenced-by-count":1,"title":["Limitations of Efficient Reducibility to the Kolmogorov Random Strings"],"prefix":"10.1177","volume":"1","author":[{"given":"John M.","family":"Hitchcock","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Wyoming, 1000 E. University Ave. Laramie, WY 82071, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","container-title":["Computability"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/COM-2012-006","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T16:02:46Z","timestamp":1777392166000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/COM-2012-006"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012]]}},"URL":"https:\/\/doi.org\/10.3233\/com-2012-006","relation":{},"ISSN":["2211-3568"],"issn-type":[{"value":"2211-3568","type":"print"}],"subject":[],"published":{"date-parts":[[2012]]}}}