{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,21]],"date-time":"2025-04-21T04:24:55Z","timestamp":1745209495885},"reference-count":3,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":4215,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1016\/s0304-3975(01)00036-6","type":"journal-article","created":{"date-parts":[[2002,10,15]],"date-time":"2002-10-15T09:27:27Z","timestamp":1034674047000},"page":"131-143","source":"Crossref","is-referenced-by-count":17,"title":["Independent minimum length programs to translate between given strings"],"prefix":"10.1016","volume":"271","author":[{"given":"Nikolai K.","family":"Vereshchagin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael V.","family":"Vyugin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0304-3975(01)00036-6_BIB1","doi-asserted-by":"crossref","first-page":"1407","DOI":"10.1109\/18.681318","article-title":"Information distance","volume":"44","author":"Bennett","year":"1998","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(01)00036-6_BIB2","series-title":"An Introduction to Kolmogorov Complexity and its Applications","author":"Li","year":"1997"},{"key":"10.1016\/S0304-3975(01)00036-6_BIB3","unstructured":"An.A. Muchnik, Conditional complexity and codes, Theoret. Comput. Sci. 2001."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000366?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000366?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T06:23:35Z","timestamp":1556864615000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501000366"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":3,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0304397501000366"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00036-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}