{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T03:51:42Z","timestamp":1783655502531,"version":"3.55.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,1,7]],"date-time":"2019-01-07T00:00:00Z","timestamp":1546819200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,7]],"date-time":"2019-01-07T00:00:00Z","timestamp":1546819200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Mach Intell"],"DOI":"10.1038\/s42256-018-0005-0","type":"journal-article","created":{"date-parts":[[2018,12,18]],"date-time":"2018-12-18T07:13:02Z","timestamp":1545117182000},"page":"58-66","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":65,"title":["Causal deconvolution by algorithmic generative models"],"prefix":"10.1038","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0634-4384","authenticated-orcid":false,"given":"Hector","family":"Zenil","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Narsis A.","family":"Kiani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4042-3775","authenticated-orcid":false,"given":"Allan A.","family":"Zea","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9568-5588","authenticated-orcid":false,"given":"Jesper","family":"Tegn\u00e9r","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,1,7]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Zenil, H. et al. An algorithmic information calculus for causal discovery and reprogramming systems. Preprint at https:\/\/doi.org\/10.2139\/ssrn.3193409 (2018).","DOI":"10.2139\/ssrn.3193409"},{"key":"5_CR2","unstructured":"Zenil, H., Kiani, N. A., Zea, A. A., Rueda-Toicen, A. & Tegn\u00e9r, J. Data dimension reduction and network sparsification based on minimal algorithmic information loss. Preprint at https:\/\/arxiv.org\/abs\/1802.05843 (2018)."},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"SP Lloyd","year":"1982","unstructured":"Lloyd, S. P. Least squares quantization in PCM. IEEE Trans. Inform. Theory 28, 129\u2013137 (1982).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5_CR4","volume-title":"Statistical Data Analysis Based on the L1-Norm and Related Methods","author":"L Kaufman","year":"1987","unstructured":"Kaufman, L. & Rousseeuw, P. J. in Statistical Data Analysis Based on the L1-Norm and Related Methods (North-Holland, Amsterdam, 1987)."},{"key":"5_CR5","first-page":"125","volume":"2","author":"A Ben-Hur","year":"2001","unstructured":"Ben-Hur, A., Horn, D., Siegelmann, H. & Vapnik, V. N. Support vector clustering. J. Mach. Learn. Res. 2, 125\u2013137 (2001).","journal-title":"J. Mach. Learn. Res."},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo, R. et al. Network motifs: simple building blocks of complex networks. Science 298, 824\u2013827 (2002).","journal-title":"Science"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"MEJ Newman","year":"2006","unstructured":"Newman, M. E. J. Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74, 036104 (2006).","journal-title":"Phys. Rev. E"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Benczur, A. & Karger, D. R. Approximating s-t minimum cuts in O(n 2)-time. In Proc. Twenty-Eighth Annual ACM Symposium on the Theory of Computing 47\u201355 (ACM, 1996).","DOI":"10.1145\/237814.237827"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Spielman, D. A. & Srivastava, N. Graph sparsification by effective resistances. In Proc. Fortieth Annual ACM Symposium on Theory of Computing 563\u2013568 (ACM, 2008).","DOI":"10.1145\/1374376.1374456"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1137\/08074489X","volume":"40","author":"DA Spielman","year":"2011","unstructured":"Spielman, D. A. & Teng, S.-H. Spectral sparsification of graphs. SIAM J. Comput. 40, 981\u20131025 (2011).","journal-title":"SIAM J. Comput."},{"key":"5_CR11","first-page":"112","volume":"22","author":"M Liu","year":"2011","unstructured":"Liu, M., Liu, B. & Wei, F. Graphs determined by their (signless) Laplacian spectra. Electron. J. Linear Algebra 22, 112\u2013124 (2011).","journal-title":"Electron. J. Linear Algebra"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"424","DOI":"10.2307\/1912791","volume":"37","author":"CWJ Granger","year":"1969","unstructured":"Granger, C. W. J. Investigating causal relations by econometric models and cross-spectral methods. Econometrica 37, 424\u2013438 (1969).","journal-title":"Econometrica"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1103\/PhysRevLett.85.461","volume":"85","author":"T Schreiber","year":"2000","unstructured":"Schreiber, T. Measuring information transfer. Phys. Rev. Lett. 85, 461\u2013464 (2000).","journal-title":"Phys. Rev. Lett."},{"key":"5_CR14","volume-title":"Causality: Models, Reasoning and Inference","author":"J Pearl","year":"2000","unstructured":"Pearl, J. Causality: Models, Reasoning and Inference (Cambridge University Press, Cambridge, 2000)."},{"key":"5_CR15","first-page":"1\u201322","volume":"7","author":"RJ Solomonoff","year":"1964","unstructured":"Solomonoff, R. J. A formal theory of inductive inference: parts 1 and 2. Inform. Control 7, 1\u201322\u2013224\u2013254 (1964).","journal-title":"Inform. Control"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Watanabe, S. in Frontiers of Pattern Recognition (ed. Watanabe, S.) 561\u2013568 (Academic Press, New York, 1972).","DOI":"10.1016\/B978-0-12-737140-5.50032-4"},{"key":"5_CR17","unstructured":"Williams, P. L. & Beer, R. D. Nonnegative decomposition of multivariate information. Preprint at https:\/\/arxiv.org\/abs\/1004.2515 (2010)."},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"307","DOI":"10.3390\/e20040307","volume":"20","author":"JT Lizier","year":"2018","unstructured":"Lizier, J. T., Bertschinger, N., Jost, J. & Wibral, M. Information decomposition of target effects from multi-source interactions: perspectives on previous, current and future work. Entropy 20, 307 (2018).","journal-title":"Entropy"},{"key":"5_CR19","unstructured":"Li, M. & Vit\u00e1nyi, P. M. B. An Introduction to Kolmogorov Complexity and Its Applications 3rd edn (Springer, New York, 2009)."},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"3250","DOI":"10.1109\/TIT.2004.838101","volume":"50","author":"M Li","year":"2004","unstructured":"Li, M., Chen, X., Li, X., Ma, B. & Vit\u00e1nyi, P. M. B. The similarity metric. IEEE Trans. Inf. Theory 50, 3250\u20133264 (2004).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"1407","DOI":"10.1109\/18.681318","volume":"44","author":"CH Bennett","year":"1998","unstructured":"Bennett, C. H., G\u00e1cs, P., Li, M., Vit\u00e1nyi, P. M. B. & Zurek, W. H. Information distance. IEEE Trans. Inf. Theory 44, 1407\u20131423 (1998).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"1523","DOI":"10.1109\/TIT.2005.844059","volume":"51","author":"R Cilibrasi","year":"2005","unstructured":"Cilibrasi, R. & Vitanyi, P. M. B. Clustering by compression. IEEE Trans. Inf. Theory 51, 1523\u20131545 (2005).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon, C. E. A mathematical theory of communication. Bell Syst. Tech. J. 27, 379\u2013423 (1948).","journal-title":"Bell Syst. Tech. J."},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"318","DOI":"10.3390\/e19070318","volume":"19","author":"RAA Ince","year":"2017","unstructured":"Ince, R. A. A. Measuring multivariate redundant information with pointwise common change in surprisal. Entropy 19, 318 (2017).","journal-title":"Entropy"},{"key":"5_CR25","doi-asserted-by":"publisher","first-page":"042119","DOI":"10.1103\/PhysRevE.89.042119","volume":"89","author":"CC Strelioff","year":"2014","unstructured":"Strelioff, C. C. & Crutchfield, J. P. Bayesian structural inference for hidden processes. Phys. Rev. E 89, 042119 (2014).","journal-title":"Phys. Rev. E"},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1023\/A:1010388907793","volume":"104","author":"CR Shalizi","year":"2001","unstructured":"Shalizi, C. R. & Crutchfield, J. P. Computational mechanics: pattern and prediction, structure and simplicity. J. Stat. Phys. 104, 819\u2013881 (2001).","journal-title":"J. Stat. Phys."},{"key":"5_CR27","first-page":"63","volume":"219","author":"JP Delahaye","year":"2012","unstructured":"Delahaye, J.-P. & Zenil, H. Numerical evaluation of the complexity of short strings: a glance into the innermost structure of algorithmic randomness. Appl. Math. Comput. 219, 63\u201377 (2012).","journal-title":"Appl. Math. Comput."},{"key":"5_CR28","doi-asserted-by":"publisher","first-page":"e96223","DOI":"10.1371\/journal.pone.0096223","volume":"9","author":"F Soler-Toscano","year":"2014","unstructured":"Soler-Toscano, F., Zenil, H., Delahaye, J.-P. & Gauvrit, N. Calculating Kolmogorov complexity from the frequency output distributions of small Turing machines. PLoS ONE 9, e96223 (2014).","journal-title":"PLoS ONE"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Hutter, M. Universal Artificial Intelligence (EATCS Series, Springer, Berlin, 2005).","DOI":"10.1007\/b138233"},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Gauvrit, N., Zenil, H. & Tegn\u00e9r, J. in Representation and Reality: Humans, Animals and Machines (eds Dodig-Crnkovic, G. & Giovagnoli, R.) 117\u2013139 (Springer, Berlin,Berlin, 2017).","DOI":"10.1007\/978-3-319-43784-2_7"},{"key":"5_CR31","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J Rissanen","year":"1978","unstructured":"Rissanen, J. Modeling by shortest data description. Automatica 14, 465\u2013658 (1978).","journal-title":"Automatica"},{"key":"5_CR32","first-page":"265","volume":"9","author":"LA Levin","year":"1973","unstructured":"Levin, L. A. Universal search problems. Probl. Inform. Transm. 9, 265\u2013266 (1973).","journal-title":"Probl. Inform. Transm."},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Schmidhuber, J. The speed prior: a new simplicity measure yielding, near-optimal computable predictions. In Proc. 15th annual conference on Computational Learning Theory (COLT 2002) (eds Kivinen, J. & Sloan, R. H.) 216\u2013228 (Springer, Sydney, 2002).","DOI":"10.1007\/3-540-45435-7_15"},{"key":"5_CR34","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01698128","volume":"9","author":"RP Daley","year":"1975","unstructured":"Daley, R. P. Minimal-program complexity of pseudo-recursive and pseudo-random sequences. Math. Syst. Theory 9, 83\u201394 (1975).","journal-title":"Math. Syst. Theory"},{"key":"5_CR35","doi-asserted-by":"publisher","unstructured":"Zenil, H., Badillo, L., Hern\u00e1ndez-Orozco, S. & Hern\u00e1ndez-Quiroz, F. Coding-theorem like behaviour and emergence of the universal distribution from resource-bounded algorithmic probability. Int. J. Parallel Emergent Distrib. Syst. https:\/\/doi.org\/10.1080\/17445760.2018.1448932 (2018).","DOI":"10.1080\/17445760.2018.1448932"},{"key":"5_CR36","first-page":"49","volume":"13","author":"J Hern\u00e1ndez-Orallo","year":"2000","unstructured":"Hern\u00e1ndez-Orallo, J. Computational measures of information gain and reinforcement in inference processes. AI Commun. 13, 49\u201350 (2000).","journal-title":"AI Commun."},{"key":"5_CR37","unstructured":"Hern\u00e1ndez-Orallo, J. Universal and cognitive notions of part. In Proc. 4th Systems Science European Congress 711\u2013722 (EC, 1999)."},{"key":"5_CR38","doi-asserted-by":"crossref","first-page":"149","DOI":"10.3233\/HSM-1985-5207","volume":"5","author":"RJ Solomonoff","year":"1985","unstructured":"Solomonoff, R. J. The time scale of artificial intelligence: reflections on social effects. Human. Syst. Manag. 5, 149\u2013153 (1985).","journal-title":"Human. Syst. Manag."},{"key":"5_CR39","doi-asserted-by":"publisher","first-page":"605","DOI":"10.3390\/e20080605","volume":"20","author":"H Zenil","year":"2018","unstructured":"Zenil, H. et al. A decomposition method for global evaluation of Shannon entropy and local estimations of algorithmic complexity. Entropy 20, 605 (2018).","journal-title":"Entropy"},{"key":"5_CR40","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1145\/321356.321363","volume":"13","author":"GJ Chaitin","year":"1966","unstructured":"Chaitin, G. J. On the length of programs for computing finite binary sequences. J. ACM 13, 547\u2013569 (1966).","journal-title":"J. ACM"},{"key":"5_CR41","first-page":"206","volume":"10","author":"LA Levin","year":"1974","unstructured":"Levin, L. A. Laws of information conservation (non-growth) and aspects of the foundation of probability theory. Probl. Inf. Transm. 10, 206\u2013210 (1974).","journal-title":"Probl. Inf. Transm."},{"key":"5_CR42","doi-asserted-by":"publisher","first-page":"534","DOI":"10.3390\/e20070534","volume":"20","author":"H Zenil","year":"2018","unstructured":"Zenil, H., Kiani, N. A. & Tegn\u00e9r, J. Symmetry and correspondence of algorithmic complexity over geometric, spatial and topological representations. Entropy 20, 534 (2018).","journal-title":"Entropy"},{"key":"5_CR43","doi-asserted-by":"publisher","first-page":"e23","DOI":"10.7717\/peerj-cs.23","volume":"1","author":"H Zenil","year":"2013","unstructured":"Zenil, H., Soler-Toscano, F., Delahaye, J.-P. & Gauvrit, N. Two-dimensional Kolmogorov complexity and validation of the coding theorem method by compressibility. PeerJ Comput. Sci. 1, e23 (2013).","journal-title":"PeerJ Comput. Sci."},{"key":"5_CR44","first-page":"479","volume":"13","author":"J Riedel","year":"2018","unstructured":"Riedel, J. & Zenil, H. Rule primality and compositional emergence of Turing-universality from elementary cellular automata. J. Cell. Autom. 13, 479\u2013497 (2018).","journal-title":"J. Cell. Autom."},{"key":"5_CR45","unstructured":"Pearl, J. To build truly intelligent machines, teach them cause and effect. Quanta Magazine (15 May 2018)."},{"key":"5_CR46","unstructured":"Minsky, M. The limits of understanding. World Science Festival https:\/\/www.worldsciencefestival.com\/videos\/the-limits-of-understanding\/(2014)."}],"container-title":["Nature Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s42256-018-0005-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s42256-018-0005-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s42256-018-0005-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T15:52:15Z","timestamp":1775317935000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s42256-018-0005-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,7]]},"references-count":46,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2019,1]]}},"alternative-id":["5"],"URL":"https:\/\/doi.org\/10.1038\/s42256-018-0005-0","relation":{},"ISSN":["2522-5839"],"issn-type":[{"value":"2522-5839","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,7]]},"assertion":[{"value":"29 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 November 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}