{"work":{"id":"6c61af2f-a34a-4647-9111-6ba5a60f6bc2","openalex_id":"https://openalex.org/W4414815946","doi":"10.48550/arxiv.2510.01346","arxiv_id":"2510.01346","raw_key":null,"title":"Aristotle: IMO-level Automated Theorem Proving","authors":null,"authors_text":"Tudor Achim, Alex Best, Alberto Bietti, Kevin Der, Math\\\"is F\\'ed\\'erico, Sergei Gukov","year":2025,"venue":"cs.AI","abstract":"We introduce Aristotle, an AI system that combines formal verification with informal reasoning, achieving gold-medal-equivalent performance on the 2025 International Mathematical Olympiad problems. Aristotle integrates three main components: a Lean proof search system, an informal reasoning system that generates and formalizes lemmas, and a dedicated geometry solver. Our system demonstrates state-of-the-art performance with favorable scaling properties for automated theorem proving.","external_url":"https://arxiv.org/abs/2510.01346","cited_by_count":1,"metadata_source":"pith","metadata_fetched_at":"2026-08-05T02:28:24.338817+00:00","pith_arxiv_id":"2510.01346","created_at":"2026-05-09T06:05:35.600074+00:00","updated_at":"2026-08-05T02:28:24.338817+00:00","title_quality_ok":true,"display_title":"Aristotle: IMO-level Automated Theorem Proving","render_title":"Aristotle: IMO-level Automated Theorem Proving"},"hub":{"state":{"work_id":"6c61af2f-a34a-4647-9111-6ba5a60f6bc2","tier":"hub","tier_reason":"10+ Pith inbound or 1,000+ external citations","pith_inbound_count":44,"external_cited_by_count":1,"distinct_field_count":12,"first_pith_cited_at":"2025-10-14T17:57:04+00:00","last_pith_cited_at":"2026-07-08T17:46:36+00:00","author_build_status":"not_needed","summary_status":"needed","contexts_status":"needed","graph_status":"needed","ask_index_status":"not_needed","reader_status":"not_needed","recognition_status":"not_needed","updated_at":"2026-08-23T21:19:29.537840+00:00","tier_text":"hub"},"tier":"hub","role_counts":[{"context_role":"background","n":6},{"context_role":"method","n":2}],"polarity_counts":[{"context_polarity":"background","n":6},{"context_polarity":"use_method","n":2}],"runs":{},"summary":{},"graph":{},"authors":[]}}