{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VCVJO6IAPBUJNZXJNPXA2QAA23","short_pith_number":"pith:VCVJO6IA","schema_version":"1.0","canonical_sha256":"a8aa977900786896e6e96bee0d4000d6ff9e1496dcc9344d781e39dc2899150b","source":{"kind":"arxiv","id":"2511.02864","version":3},"attestation_state":"computed","paper":{"title":"Mathematical exploration and discovery at scale","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","math.CA","math.CO","math.MG"],"primary_cat":"cs.NE","authors_text":"Adam Zsolt Wagner, Bogdan Georgiev, Javier G\\'omez-Serrano, Terence Tao","submitted_at":"2025-11-03T16:04:07Z","abstract_excerpt":"AlphaEvolve (Novikov et al., 2025) is a generic evolutionary coding agent that combines the generative capabilities of LLMs with automated evaluation in an iterative evolutionary framework that proposes, tests, and refines algorithmic solutions to challenging scientific and practical problems. In this paper we showcase AlphaEvolve as a tool for autonomously discovering novel mathematical constructions and advancing our understanding of long-standing open problems.\n  To demonstrate its breadth, we considered a list of 67 problems spanning mathematical analysis, combinatorics, geometry, and numb"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2511.02864","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.NE","submitted_at":"2025-11-03T16:04:07Z","cross_cats_sorted":["cs.AI","math.CA","math.CO","math.MG"],"title_canon_sha256":"8f407716717d90f56e181622cb5738c0e53a220fed74438178da0e54d200974c","abstract_canon_sha256":"50851506ea780cd866f7f631e9eee89a853f09d96d996c26658c03d066efea1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:14.535486Z","signature_b64":"n7S0vdZvMqLZ76jzXPcjar1v6+o9NO3FJeTYorzcbskLNCRSChMmZ7Ccx+ESY56JDNgY9aYZZzgA7a+GLGihCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8aa977900786896e6e96bee0d4000d6ff9e1496dcc9344d781e39dc2899150b","last_reissued_at":"2026-05-17T23:38:14.534788Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:14.534788Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mathematical exploration and discovery at scale","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","math.CA","math.CO","math.MG"],"primary_cat":"cs.NE","authors_text":"Adam Zsolt Wagner, Bogdan Georgiev, Javier G\\'omez-Serrano, Terence Tao","submitted_at":"2025-11-03T16:04:07Z","abstract_excerpt":"AlphaEvolve (Novikov et al., 2025) is a generic evolutionary coding agent that combines the generative capabilities of LLMs with automated evaluation in an iterative evolutionary framework that proposes, tests, and refines algorithmic solutions to challenging scientific and practical problems. In this paper we showcase AlphaEvolve as a tool for autonomously discovering novel mathematical constructions and advancing our understanding of long-standing open problems.\n  To demonstrate its breadth, we considered a list of 67 problems spanning mathematical analysis, combinatorics, geometry, and numb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.02864","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2511.02864","created_at":"2026-05-17T23:38:14.534899+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.02864v3","created_at":"2026-05-17T23:38:14.534899+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.02864","created_at":"2026-05-17T23:38:14.534899+00:00"},{"alias_kind":"pith_short_12","alias_value":"VCVJO6IAPBUJ","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"VCVJO6IAPBUJNZXJ","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"VCVJO6IA","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":21,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.20086","citing_title":"What Do Evolutionary Coding Agents Evolve?","ref_index":3,"is_internal_anchor":true},{"citing_arxiv_id":"2605.15308","citing_title":"SMCEvolve: Principled Scientific Discovery via Sequential Monte Carlo Evolution","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"2511.20019","citing_title":"How to Use Deep Learning to Identify Sufficient Conditions: A Case Study on Stanley's $e$-Positivity","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2512.03476","citing_title":"ATHENA: Agentic Team for Hierarchical Evolutionary Numerical Algorithms","ref_index":20,"is_internal_anchor":false},{"citing_arxiv_id":"2601.13209","citing_title":"AI for Mathematics: Progress, Challenges, and Prospects","ref_index":57,"is_internal_anchor":false},{"citing_arxiv_id":"2601.16175","citing_title":"Learning to Discover at Test Time","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09593","citing_title":"Benchmarking Compound AI Applications for Hardware-Software Co-Design","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06651","citing_title":"AI co-mathematician: Accelerating mathematicians with agentic AI","ref_index":51,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11117","citing_title":"GRAFT-ATHENA: Self-Improving Agentic Teams for Autonomous Discovery and Evolutionary Numerical Algorithms","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02994","citing_title":"Using Large Language Models as a Co-Author in Undergraduate Quantum Group Research","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2604.03312","citing_title":"Computer Architecture's AlphaZero Moment: Automated Discovery in an Encircled World","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06651","citing_title":"AI co-mathematician: Accelerating mathematicians with agentic AI","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05921","citing_title":"Intentmaking and Sensemaking: Human Interaction with AI-Guided Mathematical Discovery","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04850","citing_title":"Out-of-the-Box Global Optimization for Packing Problems: New Models and Improved Solutions","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05193","citing_title":"Grokability in five inequalities","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20622","citing_title":"pAI/MSc: ML Theory Research with Humans on the Loop","ref_index":73,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19341","citing_title":"Evaluation-driven Scaling for Scientific Discovery","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07240","citing_title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2604.16995","citing_title":"SPS: Steering Probability Squeezing for Better Exploration in Reinforcement Learning for Large Language Models","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2604.20622","citing_title":"pAI/MSc: ML Theory Research with Humans on the Loop","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27351","citing_title":"Heterogeneous Scientific Foundation Model Collaboration","ref_index":110,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VCVJO6IAPBUJNZXJNPXA2QAA23","json":"https://pith.science/pith/VCVJO6IAPBUJNZXJNPXA2QAA23.json","graph_json":"https://pith.science/api/pith-number/VCVJO6IAPBUJNZXJNPXA2QAA23/graph.json","events_json":"https://pith.science/api/pith-number/VCVJO6IAPBUJNZXJNPXA2QAA23/events.json","paper":"https://pith.science/paper/VCVJO6IA"},"agent_actions":{"view_html":"https://pith.science/pith/VCVJO6IAPBUJNZXJNPXA2QAA23","download_json":"https://pith.science/pith/VCVJO6IAPBUJNZXJNPXA2QAA23.json","view_paper":"https://pith.science/paper/VCVJO6IA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.02864&json=true","fetch_graph":"https://pith.science/api/pith-number/VCVJO6IAPBUJNZXJNPXA2QAA23/graph.json","fetch_events":"https://pith.science/api/pith-number/VCVJO6IAPBUJNZXJNPXA2QAA23/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VCVJO6IAPBUJNZXJNPXA2QAA23/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VCVJO6IAPBUJNZXJNPXA2QAA23/action/storage_attestation","attest_author":"https://pith.science/pith/VCVJO6IAPBUJNZXJNPXA2QAA23/action/author_attestation","sign_citation":"https://pith.science/pith/VCVJO6IAPBUJNZXJNPXA2QAA23/action/citation_signature","submit_replication":"https://pith.science/pith/VCVJO6IAPBUJNZXJNPXA2QAA23/action/replication_record"}},"created_at":"2026-05-17T23:38:14.534899+00:00","updated_at":"2026-05-17T23:38:14.534899+00:00"}