{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T02:49:43Z","timestamp":1784342983985,"version":"3.55.0"},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"7995","license":[{"start":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T00:00:00Z","timestamp":1705449600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T00:00:00Z","timestamp":1705449600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nature"],"published-print":{"date-parts":[[2024,1,18]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Proving mathematical theorems at the olympiad level represents a notable milestone in human-level automated reasoning<jats:sup>1\u20134<\/jats:sup>, owing to their reputed difficulty among the world\u2019s best talents in pre-university mathematics. Current machine-learning approaches, however, are not applicable to most mathematical domains owing to the high cost of translating human proofs into machine-verifiable format. The problem is even worse for geometry because of its unique translation challenges<jats:sup>1,5<\/jats:sup>, resulting in severe scarcity of training data. We propose AlphaGeometry, a theorem prover for Euclidean plane geometry that sidesteps the need for human demonstrations by synthesizing millions of theorems and proofs across different levels of complexity. AlphaGeometry is a neuro-symbolic system that uses a neural language model, trained from scratch on our large-scale synthetic data, to guide a symbolic deduction engine through infinite branching points in challenging problems. On a test set of 30 latest olympiad-level problems, AlphaGeometry solves 25, outperforming the previous best method that only solves ten problems and approaching the performance of an average International Mathematical Olympiad (IMO) gold medallist. Notably, AlphaGeometry produces human-readable proofs, solves all geometry problems in the IMO 2000 and 2015 under human expert evaluation and discovers a generalized version of a\u00a0translated IMO theorem in 2004.<\/jats:p>","DOI":"10.1038\/s41586-023-06747-5","type":"journal-article","created":{"date-parts":[[2024,1,17]],"date-time":"2024-01-17T17:37:30Z","timestamp":1705513050000},"page":"476-482","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":268,"title":["Solving olympiad geometry without human demonstrations"],"prefix":"10.1038","volume":"625","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3597-6073","authenticated-orcid":false,"given":"Trieu H.","family":"Trinh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuhuai","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Quoc V.","family":"Le","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"He","family":"He","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thang","family":"Luong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,1,17]]},"reference":[{"key":"6747_CR1","doi-asserted-by":"publisher","unstructured":"Zheng, K., Han, J. M. & Polu, S. MiniF2F: a cross-system benchmark for formal olympiad-level mathematics. Preprint at https:\/\/doi.org\/10.48550\/arXiv.2109.00110 (2022).","DOI":"10.48550\/arXiv.2109.00110"},{"key":"6747_CR2","doi-asserted-by":"publisher","unstructured":"Polu, S. et al. Formal mathematics statement curriculum learning. Preprint at https:\/\/doi.org\/10.48550\/arXiv.2202.01344 (2023).","DOI":"10.48550\/arXiv.2202.01344"},{"key":"6747_CR3","first-page":"26337","volume":"35","author":"G Lample","year":"2022","unstructured":"Lample, G. et al. Hypertree proof search for neural theorem proving. Adv. Neural Inf. Process. Syst. 35, 26337\u201326349 (2022).","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"6747_CR4","unstructured":"Potapov, A. et al. in Proc. 13th International Conference on Artificial General Intelligence, AGI 2020 (eds Goertzel, B., Panov, A., Potapov, A. & Yampolskiy, R.) 279\u2013289 (Springer, 2020)."},{"key":"6747_CR5","doi-asserted-by":"crossref","unstructured":"Mari\u0107, F. Formalizing IMO problems and solutions in Isabelle\/HOL. Preprint at https:\/\/arxiv.org\/abs\/2010.16015 (2020).","DOI":"10.4204\/EPTCS.328.3"},{"key":"6747_CR6","unstructured":"Gelernter, H. L. in Proc. First International Conference on Information Processing (IFIP) 273\u2013281 (UNESCO, 1959)."},{"key":"6747_CR7","doi-asserted-by":"crossref","unstructured":"Gelernter, H., Hansen, J. R. & Loveland, D. W. in Papers presented at the May 3\u20135, 1960, western joint IRE-AIEE-ACM computer conference 143\u2013149 (ACM, 1960).","DOI":"10.1145\/1460361.1460381"},{"key":"6747_CR8","doi-asserted-by":"crossref","unstructured":"Harrison, J., Urban, J. & Wiedijk, F. in Handbook of the History of Logic Vol. 9 (ed. Siekmann, J. H.) 135\u2013214 (North Holland, 2014).","DOI":"10.1016\/B978-0-444-51624-4.50004-6"},{"key":"6747_CR9","doi-asserted-by":"crossref","unstructured":"van Doorn, F., Ebner, G. & Lewis, R. Y. in Proc. 13th International Conference on Intelligent Computer Mathematics, CICM 2020 (eds Benzm\u00fcller, C. & Miller, B.) 251\u2013267 (Springer, 2020).","DOI":"10.1007\/978-3-030-53518-6_16"},{"key":"6747_CR10","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1023\/A:1006171315513","volume":"25","author":"SC Chou","year":"2000","unstructured":"Chou, S. C., Gao, X. S. & Zhang, J. Z. A deductive database approach to automated geometry theorem proving and discovering. J. Autom. Reason. 25, 219\u2013246 (2000).","journal-title":"J. Autom. Reason."},{"key":"6747_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/B:JARS.0000021960.39761.b7","volume":"32","author":"N Matsuda","year":"2004","unstructured":"Matsuda, N. & Vanlehn, K. GRAMY: a geometry theorem prover capable of construction. J. Autom. Reason. 32, 3\u201333 (2004).","journal-title":"J. Autom. Reason."},{"key":"6747_CR12","unstructured":"Wang, K. & Su, Z. in Proc. Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015) (ACM, 2015)."},{"key":"6747_CR13","unstructured":"Gao, X. S. & Lin, Q. in Proc. Automated Deduction in Geometry: 4th International Workshop, ADG 2002 (ed. Winkler, F.) 44\u201366 (Springer, 2004)."},{"key":"6747_CR14","unstructured":"Zhou, M. & Yu, X. in Proc. 2nd International Conference on Artificial Intelligence in Education: Emerging Technologies, Models and Applications, AIET 2021 (eds Cheng, E. C. K., Koul, R. B., Wang, T. & Yu, X.) 151\u2013161 (Springer, 2022)."},{"key":"6747_CR15","unstructured":"Polu, S. & Sutskever, I. Generative language modeling for automated theorem proving. Preprint at https:\/\/arxiv.org\/abs\/2009.03393 (2020)."},{"key":"6747_CR16","doi-asserted-by":"publisher","unstructured":"Han, J. M., Rute, J., Wu, Y., Ayers, E. W., & Polu, S. Proof artifact co-training for theorem proving with language models. Preprint at https:\/\/doi.org\/10.48550\/arXiv.2102.06203 (2022).","DOI":"10.48550\/arXiv.2102.06203"},{"key":"6747_CR17","doi-asserted-by":"crossref","unstructured":"Ye, Z., Chou, S. C. & Gao, X. S. in Proc. Automated Deduction in Geometry: 7th International Workshop, ADG 2008 (eds Sturm, T. & Zengler, C.) 189\u2013195 (Springer, 2011).","DOI":"10.1007\/978-3-642-21046-4_10"},{"key":"6747_CR18","unstructured":"Vaswani, A. et al. Attention is all you need. Adv. Neural Inf. Process. Syst. 30 (2017)."},{"key":"6747_CR19","unstructured":"Ol\u0161\u00e1k, M. in Proc. 7th International Conference on Mathematical Software \u2013 ICMS 2020 (eds Bigatti, A., Carette, J., Davenport, J., Joswig, M. & de Wolff, T.) 263\u2013271 (Springer, 2020)."},{"key":"6747_CR20","doi-asserted-by":"crossref","unstructured":"Bose, N. K. in Multidimensional Systems Theory and Applications 89\u2013127 (Springer, 1995).","DOI":"10.1007\/978-94-017-0275-1_4"},{"key":"6747_CR21","first-page":"159","volume":"21","author":"W-T Wu","year":"1978","unstructured":"Wu, W.-T. On the decision problem and the mechanization of theorem-proving in elementary geometry. Sci. Sin. 21, 159\u2013172 (1978).","journal-title":"Sci. Sin."},{"key":"6747_CR22","unstructured":"Radford, A., Narasimhan, K., Salimans, T. & Sutskever, I. Improving language understanding by generative pre-training. Preprint at https:\/\/paperswithcode.com\/paper\/improving-language-understanding-by (2018)."},{"key":"6747_CR23","unstructured":"Radford, A. et al. Better language models and their implications. OpenAI Blog https:\/\/openai.com\/blog\/better-language-models (2019)."},{"key":"6747_CR24","first-page":"1877","volume":"33","author":"T Brown","year":"2020","unstructured":"Brown, T. et al. Language models are few-shot learners. Adv. Neural Inf. Process. Syst. 33, 1877\u20131901 (2020).","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"6747_CR25","unstructured":"Bubeck, S. et al. Sparks of artificial general intelligence: early experiments with GPT-4. Preprint at https:\/\/arxiv.org\/abs\/2303.12712 (2023)."},{"key":"6747_CR26","first-page":"3843","volume":"35","author":"A Lewkowycz","year":"2022","unstructured":"Lewkowycz, A. et al. Solving quantitative reasoning problems with language models. Adv. Neural Inf. Process. Syst. 35, 3843\u20133857 (2022).","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"6747_CR27","doi-asserted-by":"publisher","unstructured":"Liang, P. et al. Holistic evaluation of language models. Transact. Mach. Learn. Res. https:\/\/doi.org\/10.48550\/arXiv.2211.09110 (2023).","DOI":"10.48550\/arXiv.2211.09110"},{"key":"6747_CR28","doi-asserted-by":"publisher","unstructured":"Srivastava, A. et al. Beyond the imitation game: quantifying and extrapolating the capabilities of language models. Transact. Mach. Learn. Res. https:\/\/doi.org\/10.48550\/arXiv.2206.04615 (2023).","DOI":"10.48550\/arXiv.2206.04615"},{"key":"6747_CR29","doi-asserted-by":"publisher","unstructured":"Wei, J. et al. Emergent abilities of large language models. Transact. Mach. Learn. Res. https:\/\/doi.org\/10.48550\/arXiv.2206.07682 (2022).","DOI":"10.48550\/arXiv.2206.07682"},{"key":"6747_CR30","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF00283134","volume":"17","author":"SC Chou","year":"1996","unstructured":"Chou, S. C., Gao, X. S. & Zhang, J. Z. Automated generation of readable proofs with geometric invariants: II. Theorem proving with full-angles. J. Autom. Reason. 17, 349\u2013370 (1996).","journal-title":"J. Autom. Reason."},{"key":"6747_CR31","doi-asserted-by":"crossref","unstructured":"de Moura, L. & Ullrich, S. in Proc. 28th International Conference on Automated Deduction, CADE 28 (eds Platzer, A. & Sutcliffe, G.) 625\u2013635 (Springer, 2021).","DOI":"10.1007\/978-3-030-79876-5_37"},{"key":"6747_CR32","doi-asserted-by":"crossref","unstructured":"Krueger, R., Han, J. M. & Selsam, D. in Proc. 28th International Conference on Automated Deduction, CADE 28 (eds Platzer, A. & Sutcliffe, G.) 577\u2013588 (Springer, 2021).","DOI":"10.1007\/978-3-030-79876-5_33"},{"key":"6747_CR33","doi-asserted-by":"crossref","unstructured":"de Moura, L. & Bj\u00f8rner, N. in Proc. 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2008 (eds Ramakrishnan, C. R. & Rehof, J.) 337\u2013340 (Springer, 2008).","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"6747_CR34","doi-asserted-by":"crossref","unstructured":"Todd, P. A method for the automated discovery of angle theorems. EPTCS 352, 148\u2013155 (2021).","DOI":"10.4204\/EPTCS.352.17"},{"key":"6747_CR35","unstructured":"Hutchins, D., Rabe, M., Wu, Y., Schlag, I. & Staats, C. Meliad. Github https:\/\/github.com\/google-research\/meliad (2022)."},{"key":"6747_CR36","doi-asserted-by":"crossref","unstructured":"Kudo, T. & Richardson, J. SentencePiece: a simple and language independent subword tokenizer and detokenizer for neural text processing. Preprint at https:\/\/arxiv.org\/abs\/1808.06226 (2018).","DOI":"10.18653\/v1\/D18-2012"},{"key":"6747_CR37","first-page":"5485","volume":"21","author":"C Raffel","year":"2020","unstructured":"Raffel, C. et al. Exploring the limits of transfer learning with a unified text-to-text transformer. J. Mach. Learn. Res. 21, 5485\u20135551 (2020).","journal-title":"J. Mach. Learn. Res."},{"key":"6747_CR38","unstructured":"Kosec, M., Fu, S. & Krell, M. M. Packing: towards 2x NLP BERT acceleration. Preprint at https:\/\/openreview.net\/forum?id=3_MUAtqR0aA (2021)."},{"key":"6747_CR39","unstructured":"Krell, M. M., Kosec, M., Perez, S. P. & Iyer, M., Fitzgibbon A. W. Efficient sequence packing without cross-contamination: accelerating large language models without impacting performance. Preprint at https:\/\/arxiv.org\/abs\/2107.02027 (2022)."},{"key":"6747_CR40","first-page":"1929","volume":"15","author":"N Srivastava","year":"2014","unstructured":"Srivastava, N., Hinton, G., Krizhevsky, A., Sutskever, I. & Salakhutdinov, R. Dropout: a simple way to prevent neural networks from overfitting. J. Mach. Learn. Res. 15, 1929\u20131958 (2014).","journal-title":"J. Mach. Learn. Res."},{"key":"6747_CR41","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1109\/MM.2021.3058217","volume":"41","author":"T Norrie","year":"2021","unstructured":"Norrie, T. et al. The design process for Google\u2019s training chips: TPUv2 and TPUv3. IEEE Micro. 41, 56\u201363 (2021) Feb 9.","journal-title":"IEEE Micro."},{"key":"6747_CR42","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1147\/rd.41.0028","volume":"4","author":"PC Gilmore","year":"1960","unstructured":"Gilmore, P. C. A proof method for quantification theory: its justification and realization. IBM J. Res. Dev. 4, 28\u201335 (1960).","journal-title":"IBM J. Res. Dev."},{"key":"6747_CR43","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M Davis","year":"1960","unstructured":"Davis, M. & Putnam, H. A computing procedure for quantification theory. J. ACM. 7, 201\u2013215 (1960).","journal-title":"J. ACM."},{"key":"6747_CR44","first-page":"111","volume":"15","author":"S Schulz","year":"2002","unstructured":"Schulz, S. E \u2013 a brainiac theorem prover. AI Commun. 15, 111\u2013126 (2002).","journal-title":"AI Commun."},{"key":"6747_CR45","doi-asserted-by":"crossref","unstructured":"Riazanov, A. & Voronkov, A. in Proc. First International Joint Conference on Automated Reasoning, IJCAR 2001 (eds Gor\u00e9, R., Leitsch, A. & Nipkow, T.) 376\u2013380 (Springer, 2001).","DOI":"10.1007\/3-540-45744-5_29"},{"key":"6747_CR46","doi-asserted-by":"publisher","unstructured":"Irving, G. et al. DeepMath - deep sequence models for premise selection. Adv. Neural Inf. Process. Syst. https:\/\/doi.org\/10.48550\/arXiv.1606.04442 (2016).","DOI":"10.48550\/arXiv.1606.04442"},{"key":"6747_CR47","doi-asserted-by":"publisher","unstructured":"Wang, M., Tang, Y., Wang, J. & Deng, J. Premise selection for theorem proving by deep graph embedding. Adv. Neural Inf. Process. Syst. https:\/\/doi.org\/10.48550\/arXiv.1709.09994 (2017).","DOI":"10.48550\/arXiv.1709.09994"},{"key":"6747_CR48","unstructured":"Loos, S., Irving, G., Szegedy, C. & Kaliszyk, C. Deep network guided proof search. Preprint at https:\/\/arxiv.org\/abs\/1701.06972 (2017)."},{"key":"6747_CR49","unstructured":"Bansal, K., Loos, S., Rabe, M., Szegedy, C. & Wilcox S. in Proc. 36th International Conference on Machine Learning 454\u2013463 (PMLR, 2019)."},{"key":"6747_CR50","doi-asserted-by":"publisher","unstructured":"Selsam, D. et al. Learning a SAT solver from single-bit supervision. Preprint at https:\/\/doi.org\/10.48550\/arXiv.1802.03685 (2019).","DOI":"10.48550\/arXiv.1802.03685"},{"key":"6747_CR51","doi-asserted-by":"publisher","unstructured":"Saxton, D., Grefenstette, E., Hill, F. & Kohli, P. Analysing mathematical reasoning abilities of neural models. Preprint at https:\/\/doi.org\/10.48550\/arXiv.1904.01557 (2019).","DOI":"10.48550\/arXiv.1904.01557"},{"key":"6747_CR52","doi-asserted-by":"publisher","unstructured":"Lample, G. & Charton F. Deep learning for symbolic mathematics. Preprint at https:\/\/doi.org\/10.48550\/arXiv.1912.01412 (2019).","DOI":"10.48550\/arXiv.1912.01412"},{"key":"6747_CR53","doi-asserted-by":"publisher","unstructured":"Charton, F., Hayat, A. & Lample, G. Learning advanced mathematical computations from examples. Preprint at https:\/\/doi.org\/10.48550\/arXiv.2006.06462 (2021).","DOI":"10.48550\/arXiv.2006.06462"},{"key":"6747_CR54","doi-asserted-by":"crossref","unstructured":"Collins, G. E. in Proc. 2nd GI Conference on Automata Theory and Formal Languages (ed. Barkhage, H.) 134\u2013183 (Springer, 1975).","DOI":"10.1007\/3-540-07407-4_17"},{"key":"6747_CR55","doi-asserted-by":"crossref","unstructured":"Ritt, J. F. Differential Algebra (Colloquium Publications, 1950).","DOI":"10.1090\/coll\/033"},{"key":"6747_CR56","doi-asserted-by":"crossref","unstructured":"Chou, S. C. Proving Elementary Geometry Theorems Using Wu\u2019s Algorithm. Doctoral dissertation, Univ. Texas at Austin (1985).","DOI":"10.1090\/conm\/029\/14"},{"key":"6747_CR57","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0004-3702(75)90013-2","volume":"6","author":"AJ Nevins","year":"1975","unstructured":"Nevins, A. J. Plane geometry theorem proving using forward chaining. Artif. Intell. 6, 1\u201323 (1975).","journal-title":"Artif. Intell."},{"key":"6747_CR58","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF00248249","volume":"2","author":"H Coelho","year":"1986","unstructured":"Coelho, H. & Pereira, L. M. Automated reasoning in geometry theorem proving with Prolog. J. Autom. Reason. 2, 329\u2013390 (1986).","journal-title":"J. Autom. Reason."},{"key":"6747_CR59","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF00245024","volume":"5","author":"A Quaife","year":"1989","unstructured":"Quaife, A. Automated development of Tarski\u2019s geometry. J. Autom. Reason. 5, 97\u2013118 (1989).","journal-title":"J. Autom. Reason."},{"key":"6747_CR60","unstructured":"McCharen, J. D., Overbeek, R. A. & Lawrence, T. in The Collected Works of Larry Wos 166\u2013196 (2000)."},{"key":"6747_CR61","doi-asserted-by":"crossref","unstructured":"Chou, S. C., Gao, X. S. & Zhang, J. Machine Proofs in Geometry: Automated Production of Readable Proofs for Geometry Theorems (World Scientific, 1994).","DOI":"10.1142\/9789812798152"},{"key":"6747_CR62","doi-asserted-by":"crossref","unstructured":"Paulson, L. C. (ed.) Isabelle: A Generic Theorem Prover (Springer, 1994).","DOI":"10.1007\/BFb0030541"},{"key":"6747_CR63","doi-asserted-by":"publisher","unstructured":"Wu, Y., Jiang, A. Q., Ba, J. & Grosse, R. INT: an inequality benchmark for evaluating generalization in theorem proving. Preprint at https:\/\/doi.org\/10.48550\/arXiv.2007.02924 (2021).","DOI":"10.48550\/arXiv.2007.02924"},{"key":"6747_CR64","doi-asserted-by":"crossref","unstructured":"Zombori, Z., Csisz\u00e1rik, A., Michalewski, H., Kaliszyk, C. & Urban, J. in Proc. 30th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (eds Das, A. & Negri, S.) 167\u2013186 (Springer, 2021).","DOI":"10.1007\/978-3-030-86059-2_10"},{"key":"6747_CR65","doi-asserted-by":"publisher","unstructured":"Fawzi, A., Malinowski, M., Fawzi, H., Fawzi, O. Learning dynamic polynomial proofs. Adv. Neural Inf. Process. Syst. https:\/\/doi.org\/10.48550\/arXiv.1906.01681 (2019).","DOI":"10.48550\/arXiv.1906.01681"},{"key":"6747_CR66","first-page":"18146","volume":"33","author":"M Wang","year":"2020","unstructured":"Wang, M. & Deng, J. Learning to prove theorems by learning to generate theorems. Adv. Neural Inf. Process. Syst. 33, 18146\u201318157 (2020).","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"6747_CR67","unstructured":"Ayg\u00fcn, E. et al. in Proc. 39th International Conference on Machine Learning 1198\u20131210 (PMLR, 2022)."},{"key":"6747_CR68","doi-asserted-by":"publisher","unstructured":"Andrychowicz, M. et al. Hindsight experience replay. Adv. Neural Inf. Process. Syst. https:\/\/doi.org\/10.48550\/arXiv.1707.01495 (2017).","DOI":"10.48550\/arXiv.1707.01495"},{"key":"6747_CR69","doi-asserted-by":"publisher","unstructured":"Firoiu, V. et al. Training a first-order theorem prover from synthetic data. Preprint at https:\/\/doi.org\/10.48550\/arXiv.2103.03798 (2021).","DOI":"10.48550\/arXiv.2103.03798"}],"updated-by":[{"DOI":"10.1038\/s41586-024-07115-7","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2024,2,23]],"date-time":"2024-02-23T00:00:00Z","timestamp":1708646400000}}],"container-title":["Nature"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s41586-023-06747-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41586-023-06747-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41586-023-06747-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,8]],"date-time":"2024-11-08T07:13:11Z","timestamp":1731049991000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41586-023-06747-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,17]]},"references-count":69,"journal-issue":{"issue":"7995","published-print":{"date-parts":[[2024,1,18]]}},"alternative-id":["6747"],"URL":"https:\/\/doi.org\/10.1038\/s41586-023-06747-5","relation":{"correction":[{"id-type":"doi","id":"10.1038\/s41586-024-07115-7","asserted-by":"object"}]},"ISSN":["0028-0836","1476-4687"],"issn-type":[{"value":"0028-0836","type":"print"},{"value":"1476-4687","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,17]]},"assertion":[{"value":"30 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 October 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2024","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1038\/s41586-024-07115-7","URL":"https:\/\/doi.org\/10.1038\/s41586-024-07115-7","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The following US patent is related to this work: \u201cTraining language model neural networks using synthetic reasoning data\u201d, filed in the United States Patent and Trademark Office (USPTO) on 1 May 2023 as application no. 63\/499,469.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}