{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T06:44:44Z","timestamp":1769237084034,"version":"3.49.0"},"reference-count":4,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,11,1]],"date-time":"1998-11-01T00:00:00Z","timestamp":909878400000},"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":5372,"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":[[1998,11]]},"DOI":"10.1016\/s0304-3975(98)00070-x","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"319-328","source":"Crossref","is-referenced-by-count":12,"title":["On common information"],"prefix":"10.1016","volume":"207","author":[{"given":"An.A.","family":"Muchnik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00070-X_BIB1","first-page":"149","article-title":"Common information is far less than mutual information","volume":"2","author":"G\u00e1cs","year":"1973","journal-title":"Problems of Control and Information Theory"},{"issue":"1","key":"10.1016\/S0304-3975(98)00070-X_BIB2","first-page":"1","article-title":"Three approaches to the quantitative definition of information","volume":"1","author":"Kolmogorov","year":"1965","journal-title":"Problems in Information Transmission"},{"key":"10.1016\/S0304-3975(98)00070-X_BIB3","series-title":"Pervyi Vsemirnyi Kongress Obshestva matematicheskoi statistiki i teorii veroyatnostei imeni Bernulli","first-page":"453","article-title":"On the extraction of common information of two words","volume":"vol. 1","author":"Muchnik","year":"1986"},{"key":"10.1016\/S0304-3975(98)00070-X_BIB4","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1070\/RM1970v025n06ABEH001269","article-title":"The complexity of finite objects and the algorithmic concepts of information and randomness","volume":"25","author":"Zvonkin","year":"1970","journal-title":"Russ. Math. Surv."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759800070X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759800070X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T13:02:26Z","timestamp":1555419746000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439759800070X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,11]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,11]]}},"alternative-id":["S030439759800070X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00070-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,11]]}}}