{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T02:09:37Z","timestamp":1784081377051,"version":"3.55.0"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"7844","license":[{"start":{"date-parts":[[2021,2,3]],"date-time":"2021-02-03T00:00:00Z","timestamp":1612310400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,3]],"date-time":"2021-02-03T00:00:00Z","timestamp":1612310400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nature"],"published-print":{"date-parts":[[2021,2,4]]},"DOI":"10.1038\/s41586-021-03229-4","type":"journal-article","created":{"date-parts":[[2021,2,3]],"date-time":"2021-02-03T17:07:31Z","timestamp":1612372051000},"page":"67-73","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":48,"title":["Generating conjectures on fundamental constants with the Ramanujan Machine"],"prefix":"10.1038","volume":"590","author":[{"given":"Gal","family":"Raayoni","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shahar","family":"Gottlieb","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yahel","family":"Manor","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"George","family":"Pisha","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yoav","family":"Harris","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Uri","family":"Mendlovic","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Doron","family":"Haviv","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yaron","family":"Hadad","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2691-1892","authenticated-orcid":false,"given":"Ido","family":"Kaminer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,2,3]]},"reference":[{"key":"3229_CR1","doi-asserted-by":"crossref","unstructured":"Finch, S. Mathematical Constants (Cambridge Univ. Press, 2003).","DOI":"10.1017\/CBO9780511550447"},{"key":"3229_CR2","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/BF03024340","volume":"19","author":"D Bailey","year":"1997","unstructured":"Bailey, D., Plouffe, S. M., Borwein, P. & Borwein, J. The quest for pi. Math. Intell. 19, 50\u201356 (1997).","journal-title":"Math. Intell."},{"key":"3229_CR3","first-page":"1","volume":"61","author":"R Ap\u00e9ry","year":"1979","unstructured":"Ap\u00e9ry, R. Irrationalit\u00e9 de \u03b6(2) et \u03b6(3). Asterisque 61, 11\u201313 (1979).","journal-title":"Asterisque"},{"key":"3229_CR4","doi-asserted-by":"publisher","first-page":"407","DOI":"10.2140\/moscow.2020.9.407","volume":"9","author":"D Zeilberger","year":"2019","unstructured":"Zeilberger, D. & Zudilin, W. The irrationality measure of pi is at most 7.103205334137\u2026. Moscow J. Combin. Number. Theory 9, 407\u2013419 (2019).","journal-title":"Moscow J. Combin. Number. Theory"},{"key":"3229_CR5","doi-asserted-by":"publisher","first-page":"R14","DOI":"10.37236\/1707","volume":"10","author":"W Zudilin","year":"2003","unstructured":"Zudilin, W. An Ap\u00e9ry-like difference equation for Catalan\u2019s constant. J. Combin. 10, R14 (2003).","journal-title":"J. Combin."},{"key":"3229_CR6","unstructured":"Hardy, G. H. & Wright, E. M. An Introduction to the Theory of Numbers 5th edn (Oxford Univ. Press, 1980)."},{"key":"3229_CR7","unstructured":"Berndt, B. C. Ramanujan\u2019s Notebooks (Springer Science & Business Media, 2012)."},{"key":"3229_CR8","doi-asserted-by":"crossref","unstructured":"Appel, K. I. & Haken, W. Every Planar Map Is Four Colorable Vol. 98 (American Mathematical Society, 1989).","DOI":"10.1090\/conm\/098"},{"key":"3229_CR9","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1090\/S0894-0347-1990-1007910-7","volume":"3","author":"HS Wilf","year":"1990","unstructured":"Wilf, H. S. & Zeilberger, D. Rational functions certify combinatorial identities. J. Am. Math. Soc. 3, 147\u2013158 (1990).","journal-title":"J. Am. Math. Soc."},{"key":"3229_CR10","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1023\/A:1005843212881","volume":"19","author":"W McCune","year":"1997","unstructured":"McCune, W. Solution of the Robbins problem. J. Autom. Reason. 19, 263\u2013276 (1997).","journal-title":"J. Autom. Reason."},{"key":"3229_CR11","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.4007\/annals.2005.162.1065","volume":"162","author":"TC Hales","year":"2005","unstructured":"Hales, T. C. A proof of the Kepler conjecture. Ann. Math. 162, 1065\u20131185 (2005).","journal-title":"Ann. Math."},{"key":"3229_CR12","unstructured":"Lample, G. & Charton, F. Deep learning for symbolic mathematics. In ICLR Conf. https:\/\/openreview.net\/forum?id=S1eZYeHFDS (2020)."},{"key":"3229_CR13","unstructured":"Cranmer, M. et al. Discovering symbolic models from deep learning with inductive biases. Preprint at https:\/\/arxiv.org\/abs\/2006.11287 (2020)."},{"key":"3229_CR14","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1112\/plms\/s2-42.1.230","volume":"s2-42","author":"AM Turing","year":"1937","unstructured":"Turing, A. M. On computable numbers, with an application to the Entscheidungsproblem. Proc. Lond. Math. Soc. s2-42, 230\u2013265 (1937).","journal-title":"Proc. Lond. Math. Soc."},{"key":"3229_CR15","unstructured":"Asimov, I. & Shulman, J. A. Isaac Asimov\u2019s Book of Science and Nature Quotations (Weidenfeld & Nicolson, 1988)."},{"key":"3229_CR16","unstructured":"Bohr, N. Rydberg\u2019s Discovery Of The Spectral Laws (C.W.K. Gleerup, 1954)."},{"key":"3229_CR17","doi-asserted-by":"crossref","unstructured":"Shimura, G. Modular forms of half integral weight. In Modular Functions of One Variable I 57\u201374 (Springer, 1973).","DOI":"10.1007\/978-3-540-38509-7_3"},{"key":"3229_CR18","unstructured":"Cuyt, A. A., Petersen, V., Verdonk, B., Waadeland, H. & Jones, W. B. Handbook Of Continued Fractions For Special Functions (Springer Science & Business Media, 2008)."},{"key":"3229_CR19","unstructured":"Scott, J. F. The Mathematical Work Of John Wallis (1616\u20131703) (Taylor and Francis, 1938)."},{"key":"3229_CR20","doi-asserted-by":"publisher","first-page":"329","DOI":"10.4064\/aa103-4-3","volume":"103","author":"D Bowman","year":"2002","unstructured":"Bowman, D. & Laughlin, J. M. Polynomial continued fractions. Acta Arith. 103, 329\u2013342 (2002).","journal-title":"Acta Arith."},{"key":"3229_CR21","doi-asserted-by":"publisher","first-page":"63","DOI":"10.4064\/aa116-1-6","volume":"116","author":"JM McLaughlin","year":"2005","unstructured":"McLaughlin, J. M. & Wyshinski, N. J. Real numbers with polynomial continued fraction expansions. Acta Arith. 116, 63\u201379 (2005).","journal-title":"Acta Arith."},{"key":"3229_CR22","unstructured":"Press, W. H. Seemingly Remarkable Mathematical Coincidences Are Easy To Generate (Univ. Texas, 2009)."},{"key":"3229_CR23","unstructured":"Euler, L. Introductio In Analysin Infinitorum Vol. 2 (MM Bousquet, 1748)."},{"key":"3229_CR24","doi-asserted-by":"crossref","unstructured":"Petkov\u0161ek, M., Wilf, H. S. & Zeilberger, D. A = B (A. K. Peters Ltd., 1996).","DOI":"10.1201\/9781439864500"},{"key":"3229_CR25","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1080\/10586458.1994.10504573","volume":"3","author":"D Bailey","year":"1994","unstructured":"Bailey, D., Borwein, J. & Girgensohn, R. Experimental evaluation of Euler sums. Exp. Math. 3, 17\u201330 (1994).","journal-title":"Exp. Math."},{"key":"3229_CR26","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1147\/rd.41.0002","volume":"4","author":"H Wang","year":"1960","unstructured":"Wang, H. Toward mechanical mathematics. IBM J. Res. Develop. 4, 2\u201322 (1960).","journal-title":"IBM J. Res. Develop."},{"key":"3229_CR27","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0004-3702(84)90016-X","volume":"23","author":"DB Lenat","year":"1984","unstructured":"Lenat, D. B. & Brown, J. S. Why AM and EURISKO appear to work. Artif. Intell. 23, 269\u2013294 (1984).","journal-title":"Artif. Intell."},{"key":"3229_CR28","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0004-3702(82)90036-4","volume":"19","author":"DB Lenat","year":"1982","unstructured":"Lenat, D. B. The nature of heuristics. Artif. Intell. 19, 189\u2013249 (1982).","journal-title":"Artif. Intell."},{"key":"3229_CR29","unstructured":"Davis, R. & Lenat, D. B. Knowledge-Based Systems In Artificial Intelligence (McGraw-Hill, 1982)."},{"key":"3229_CR30","doi-asserted-by":"crossref","unstructured":"Fajtlowicz, S. On conjectures of Graffiti. In Annals of Discrete Mathematics Vol. 38, 113\u2013118 (Elsevier, 1988).","DOI":"10.1016\/S0167-5060(08)70776-3"},{"key":"3229_CR31","unstructured":"Alessandretti, L., Baronchelli, A. & He, Y.-H. Machine learning meets number theory: the data science of Birch\u2013Swinnerton-Dyer. Preprint at https:\/\/arxiv.org\/abs\/1911.02008 (2019)."},{"key":"3229_CR32","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1080\/10236198.2016.1142541","volume":"22","author":"WY Chen","year":"2016","unstructured":"Chen, W. Y., Hou, Q. H. & Zeilberger, D. Automated discovery and proof of congruence theorems for partial sums of combinatorial sequences. J. Diff. Equ. Appl. 22, 780\u2013788 (2016).","journal-title":"J. Diff. Equ. Appl."},{"key":"3229_CR33","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/j.jal.2005.10.006","volume":"4","author":"B Buchberger","year":"2006","unstructured":"Buchberger, B. et al. Theorema: towards computer-aided mathematical theory exploration. J. Appl. Log. 4, 470\u2013504 (2006).","journal-title":"J. Appl. Log."},{"key":"3229_CR34","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1090\/S0025-5718-99-00995-3","volume":"68","author":"H Ferguson","year":"1999","unstructured":"Ferguson, H., Bailey, D. & Arno, S. Analysis of PSLQ, an integer relation finding algorithm. Math. Comput. Am. Math. Soc. 68, 351\u2013369 (1999).","journal-title":"Math. Comput. Am. Math. Soc."},{"key":"3229_CR35","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1090\/S0025-5718-97-00856-9","volume":"66","author":"D Bailey","year":"1997","unstructured":"Bailey, D., Borwein, P. & Plouffe, S. On the rapid computation of various polylogarithmic constants. Math. Comput. Am. Math. Soc. 66, 903\u2013913 (1997).","journal-title":"Math. Comput. Am. Math. Soc."},{"key":"3229_CR36","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.1090\/S0025-5718-00-01278-3","volume":"70","author":"D Bailey","year":"2000","unstructured":"Bailey, D. & Broadhurst, D. J. Parallel integer relation detection: techniques and applications. Math. Comput. 70, 1719\u20131737 (2000).","journal-title":"Math. Comput."},{"key":"3229_CR37","unstructured":"Wolfram, S. A New Kind Of Science Vol. 5 (Wolfram Media, 2002)."},{"key":"3229_CR38","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1126\/science.1165893","volume":"324","author":"M Schmidt","year":"2009","unstructured":"Schmidt, M. & Lipson, H. Distilling free-form natural laws from experimental data. Science 324, 81\u201385 (2009).","journal-title":"Science"},{"key":"3229_CR39","unstructured":"He, Y.-H. Deep-learning the landscape. Preprint at https:\/\/arxiv.org\/abs\/1706.02714 (2017)."},{"key":"3229_CR40","doi-asserted-by":"publisher","first-page":"033311","DOI":"10.1103\/PhysRevE.100.033311","volume":"100","author":"T Wu","year":"2019","unstructured":"Wu, T. & Tegmark, M. Toward an artificial intelligence physicist for unsupervised learning. Phys. Rev. E 100, 033311 (2019).","journal-title":"Phys. Rev. E"},{"key":"3229_CR41","unstructured":"Greydanus, S., Dzamba, M. & Yosinski, J. Hamiltonian neural networks. In Advances in Neural Information Processing Systems (NEURIPS2019) Vol. 32, 15379\u221215389 (2019)."},{"key":"3229_CR42","doi-asserted-by":"publisher","first-page":"010508","DOI":"10.1103\/PhysRevLett.124.010508","volume":"124","author":"R Iten","year":"2020","unstructured":"Iten, R., Metger, T., Wilming, H., del Rio, L. & Renner, R. Discovering physical concepts with neural networks. Phys. Rev. Lett. 124, 010508 (2020).","journal-title":"Phys. Rev. Lett."},{"key":"3229_CR43","doi-asserted-by":"publisher","first-page":"eaay2631","DOI":"10.1126\/sciadv.aay2631","volume":"6","author":"S Udrescu","year":"2020","unstructured":"Udrescu, S. & Tegmark, M. AI Feynman: a physics-inspired method for symbolic regression. Sci. Adv. 6, eaay2631 (2020).","journal-title":"Sci. Adv."},{"key":"3229_CR44","doi-asserted-by":"publisher","first-page":"443","DOI":"10.2307\/2118559","volume":"141","author":"A Wiles","year":"1995","unstructured":"Wiles, A. Modular elliptic curves and Fermat\u2019s last theorem. Ann. Math. 141, 443\u2013551 (1995).","journal-title":"Ann. Math."},{"key":"3229_CR45","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF03025291","volume":"20","author":"S Smale","year":"1998","unstructured":"Smale, S. Mathematical problems for the next century. Math. Intell. 20, 7\u201315 (1998).","journal-title":"Math. Intell."},{"key":"3229_CR46","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF03028234","volume":"1","author":"A Van der Poorten","year":"1979","unstructured":"Van der Poorten, A. & Ap\u00e9ry, R. A proof that Euler missed\u2026. Math. Intell. 1, 195\u2013203 (1979).","journal-title":"Math. Intell."},{"key":"3229_CR47","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1080\/00029890.1989.11972169","volume":"96","author":"J Borwein","year":"1989","unstructured":"Borwein, J., Borwein, P. & Bailey, D. Ramanujan, modular equations, and approximations to pi or how to compute one billion digits of pi. Am. Math. Mon. 96, 201\u2013219 (1989).","journal-title":"Am. Math. Mon."},{"key":"3229_CR48","first-page":"223","volume":"12","author":"KH Pilehrood","year":"2010","unstructured":"Pilehrood, K. H. & Pilehrood, T. H. Series acceleration formulas for beta values. Discret. Math. Theor. Comput. Sci. 12, 223\u2013236 (2010).","journal-title":"Discret. Math. Theor. Comput. Sci."},{"key":"3229_CR49","unstructured":"Kim, S. Normality analysis of current world record computations for Catalan\u2019s constant and arc length of a lemniscate with a = 1. Preprint at https:\/\/arxiv.org\/abs\/1908.08925 (2019)."},{"key":"3229_CR50","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1134\/S0081543816010107","volume":"292","author":"YV Nesterenko","year":"2016","unstructured":"Nesterenko, Y. V. On Catalan\u2019s constant. Proc. Steklov Inst. Math. 292, 153\u2013170 (2016).","journal-title":"Proc. Steklov Inst. Math."},{"key":"3229_CR51","doi-asserted-by":"publisher","first-page":"593","DOI":"10.5802\/jtnb.415","volume":"15","author":"W Zudilin","year":"2003","unstructured":"Zudilin, W. Well-poised hypergeometric service for diophantine problems of zeta values. J. Th\u00e9or. Nomb. Bordeaux 15, 593\u2013626 (2003).","journal-title":"J. Th\u00e9or. Nomb. Bordeaux"},{"key":"3229_CR52","unstructured":"Zudilin, W. One of the odd zeta values from \u03b6(5) to \u03b6(25) is irrational. By elementary means. Symmetry Integr. Geom. 14, 028 (2018)."},{"key":"3229_CR53","unstructured":"Raayoni, G. et al. The Ramanujan machine: automatically generated conjectures on fundamental constants. Preprint at https:\/\/arxiv.org\/abs\/1907.00205 (2019)."},{"key":"3229_CR54","doi-asserted-by":"crossref","unstructured":"Dougherty-Bliss, R. & Zeilberger, D. Automatic conjecturing and proving of exact values of some infinite families of infinite continued fractions. Preprint at https:\/\/arxiv.org\/abs\/2004.00090 (2020).","DOI":"10.1007\/s11139-020-00345-z"},{"key":"3229_CR55","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1038\/s41586-019-1335-8","volume":"571","author":"V Tshitoyan","year":"2019","unstructured":"Tshitoyan, V. et al. Unsupervised word embeddings capture latent knowledge from materials science literature. Nature 571, 95\u201398 (2019).","journal-title":"Nature"},{"key":"3229_CR56","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1023\/A:1021473409544","volume":"72","author":"W Zudilin","year":"2002","unstructured":"Zudilin, W. A third-order Ap\u00e9ry-like recursion for \u03b6(5). Mathematical Notes [Mat. Zametki] 72, 733\u2013737 [796\u2013800] (2002).","journal-title":"Mathematical Notes [Mat. Zametki]"},{"key":"3229_CR57","doi-asserted-by":"publisher","first-page":"6115","DOI":"10.1090\/S0002-9947-09-04905-8","volume":"361","author":"T Rivoal","year":"2009","unstructured":"Rivoal, T. Rational approximations for values of derivatives of the Gamma function. Trans. Am. Math. Soc. 361, 6115\u20136149 (2009).","journal-title":"Trans. Am. Math. Soc."}],"container-title":["Nature"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.nature.com\/articles\/s41586-021-03229-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/www.nature.com\/articles\/s41586-021-03229-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/www.nature.com\/articles\/s41586-021-03229-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,20]],"date-time":"2023-05-20T22:08:59Z","timestamp":1684620539000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41586-021-03229-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,3]]},"references-count":57,"journal-issue":{"issue":"7844","published-print":{"date-parts":[[2021,2,4]]}},"alternative-id":["3229"],"URL":"https:\/\/doi.org\/10.1038\/s41586-021-03229-4","relation":{},"ISSN":["0028-0836","1476-4687"],"issn-type":[{"value":"0028-0836","type":"print"},{"value":"1476-4687","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,3]]},"assertion":[{"value":"30 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2021","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"}}]}}