{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T03:36:04Z","timestamp":1769225764830,"version":"3.49.0"},"reference-count":7,"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)00032-9","type":"journal-article","created":{"date-parts":[[2002,10,15]],"date-time":"2002-10-15T13:27:27Z","timestamp":1034688447000},"page":"69-95","source":"Crossref","is-referenced-by-count":25,"title":["Upper semi-lattice of binary strings with the relation \u201cx is simple conditional to y\u201d"],"prefix":"10.1016","volume":"271","author":[{"given":"Alexei","family":"Chernov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrej","family":"Muchnik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrei","family":"Romashchenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolai","family":"Vereshchagin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00032-9_BIB1","first-page":"149","article-title":"Common information is far less than mutual information","volume":"2","author":"G\u00e1cs","year":"1973","journal-title":"Problems Control Inform. Theory"},{"key":"10.1016\/S0304-3975(01)00032-9_BIB2","doi-asserted-by":"crossref","unstructured":"D. Hammer, A. Romashchenko, A. Shen, N. Vereshchagin, Inequalities for Shannon entropies and Kolmogorov complexities, in: Proc. 12th Annu IEEE Conf. on Computational Complexity, Ulm, Germany, June 1997, pp. 13\u201323 (Final version: Journal of Computer and System Sciences, 60 (2000), p. 442\u2013464).","DOI":"10.1006\/jcss.1999.1677"},{"key":"10.1016\/S0304-3975(01)00032-9_BIB3","series-title":"An Introduction to Kolmogorov Complexity and its Applications","author":"Li","year":"1997"},{"key":"10.1016\/S0304-3975(01)00032-9_BIB4","unstructured":"An.A. Muchnik, On the extraction of common information of two strings, Abstracts of talks at the First World Congress of Bernoulli Society, Moscow, Nauka, 1986, p. 453 (in Russian)."},{"key":"10.1016\/S0304-3975(01)00032-9_BIB5","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/S0304-3975(98)00070-X","article-title":"On common information","volume":"207","author":"Muchnik","year":"1998","journal-title":"Theoret. Comput. Sci"},{"key":"10.1016\/S0304-3975(01)00032-9_BIB6","first-page":"3","article-title":"Pary slov s nematerialisuemoi vzaimnoi informatsiei (Pairs of strings with no extractable mutual information, in Russian)","volume":"36","author":"Romashchenko","year":"2000","journal-title":"Problemy peredachi informatsii (Problems Inform. Transmission)"},{"key":"10.1016\/S0304-3975(01)00032-9_BIB7","series-title":"Degrees of Unsolvability","author":"Shoenfield","year":"1971"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000329?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000329?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T10:23:38Z","timestamp":1556879018000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501000329"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":7,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0304397501000329"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00032-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}