{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DUOSJJ53R6RC2FPPNQDFFJPIFS","short_pith_number":"pith:DUOSJJ53","schema_version":"1.0","canonical_sha256":"1d1d24a7bb8fa22d15ef6c0652a5e82c81c963efd088a1dea5fbc373a3410eae","source":{"kind":"arxiv","id":"2412.20735","version":3},"attestation_state":"computed","paper":{"title":"HunyuanProver: A Scalable Data Synthesis Framework and Guided Tree Search for Automated Theorem Proving","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.AI","authors_text":"Chen Li, Dong Du, Haitao Mi, Linfeng Song, Tao Yang, Weikang Wang, Yang Li","submitted_at":"2024-12-30T06:18:33Z","abstract_excerpt":"We introduce HunyuanProver, an language model finetuned from the Hunyuan 7B for interactive automatic theorem proving with LEAN4. To alleviate the data sparsity issue, we design a scalable framework to iterative synthesize data with low cost. Besides, guided tree search algorithms are designed to enable effective ``system 2 thinking`` of the prover. HunyuanProver achieves state-of-the-art (SOTA) performances on major benchmarks. Specifically, it achieves a pass of 68.4% on the miniF2F-test compared to 65.9%, the current SOTA results. It proves 4 IMO statements (imo_1960_p2, imo_1962_p2}, imo_1"},"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":"2412.20735","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-12-30T06:18:33Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"cf96dee40ec84c089d03757cbe817716490351eb7f3a1e4e65d82ebc7f6b5445","abstract_canon_sha256":"108e4c4c3a0fb438835b75473889950a662e213c09c5c8e554cb694fef471588"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:36:33.781636Z","signature_b64":"m/MpPkr3jMH1AEw9RS6fxw+yhHRoJuu7yzAxbRpmoQKmQR6JRxgLrMqtaK4AjuJD3J/hDFKXekjfxzinCQGCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d1d24a7bb8fa22d15ef6c0652a5e82c81c963efd088a1dea5fbc373a3410eae","last_reissued_at":"2026-07-05T10:36:33.781070Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:36:33.781070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HunyuanProver: A Scalable Data Synthesis Framework and Guided Tree Search for Automated Theorem Proving","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.AI","authors_text":"Chen Li, Dong Du, Haitao Mi, Linfeng Song, Tao Yang, Weikang Wang, Yang Li","submitted_at":"2024-12-30T06:18:33Z","abstract_excerpt":"We introduce HunyuanProver, an language model finetuned from the Hunyuan 7B for interactive automatic theorem proving with LEAN4. To alleviate the data sparsity issue, we design a scalable framework to iterative synthesize data with low cost. Besides, guided tree search algorithms are designed to enable effective ``system 2 thinking`` of the prover. HunyuanProver achieves state-of-the-art (SOTA) performances on major benchmarks. Specifically, it achieves a pass of 68.4% on the miniF2F-test compared to 65.9%, the current SOTA results. It proves 4 IMO statements (imo_1960_p2, imo_1962_p2}, imo_1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.20735","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.20735/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2412.20735","created_at":"2026-07-05T10:36:33.781130+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.20735v3","created_at":"2026-07-05T10:36:33.781130+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.20735","created_at":"2026-07-05T10:36:33.781130+00:00"},{"alias_kind":"pith_short_12","alias_value":"DUOSJJ53R6RC","created_at":"2026-07-05T10:36:33.781130+00:00"},{"alias_kind":"pith_short_16","alias_value":"DUOSJJ53R6RC2FPP","created_at":"2026-07-05T10:36:33.781130+00:00"},{"alias_kind":"pith_short_8","alias_value":"DUOSJJ53","created_at":"2026-07-05T10:36:33.781130+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":10,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07779","citing_title":"From Solvers to Research: Large Language Model-Driven Formal Mathematics at the Research Frontier","ref_index":134,"is_internal_anchor":true},{"citing_arxiv_id":"2606.09450","citing_title":"TheoremBench: Evaluating LLMs on Theorem Proving in Formal Mathematics","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2606.06468","citing_title":"Goedel-Architect: Streamlining Formal Theorem Proving with Blueprint Generation and Refinement","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2605.22257","citing_title":"What are the Right Symmetries for Formal Theorem Proving?","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17255","citing_title":"CAM-Bench: A Benchmark for Computational and Applied Mathematics in Lean","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2601.13209","citing_title":"AI for Mathematics: Progress, Challenges, and Prospects","ref_index":96,"is_internal_anchor":false},{"citing_arxiv_id":"2602.24273","citing_title":"A Minimal Agent for Automated Theorem Proving","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2510.01346","citing_title":"Aristotle: IMO-level Automated Theorem Proving","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06651","citing_title":"AI co-mathematician: Accelerating mathematicians with agentic AI","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06651","citing_title":"AI co-mathematician: Accelerating mathematicians with agentic AI","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DUOSJJ53R6RC2FPPNQDFFJPIFS","json":"https://pith.science/pith/DUOSJJ53R6RC2FPPNQDFFJPIFS.json","graph_json":"https://pith.science/api/pith-number/DUOSJJ53R6RC2FPPNQDFFJPIFS/graph.json","events_json":"https://pith.science/api/pith-number/DUOSJJ53R6RC2FPPNQDFFJPIFS/events.json","paper":"https://pith.science/paper/DUOSJJ53"},"agent_actions":{"view_html":"https://pith.science/pith/DUOSJJ53R6RC2FPPNQDFFJPIFS","download_json":"https://pith.science/pith/DUOSJJ53R6RC2FPPNQDFFJPIFS.json","view_paper":"https://pith.science/paper/DUOSJJ53","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.20735&json=true","fetch_graph":"https://pith.science/api/pith-number/DUOSJJ53R6RC2FPPNQDFFJPIFS/graph.json","fetch_events":"https://pith.science/api/pith-number/DUOSJJ53R6RC2FPPNQDFFJPIFS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DUOSJJ53R6RC2FPPNQDFFJPIFS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DUOSJJ53R6RC2FPPNQDFFJPIFS/action/storage_attestation","attest_author":"https://pith.science/pith/DUOSJJ53R6RC2FPPNQDFFJPIFS/action/author_attestation","sign_citation":"https://pith.science/pith/DUOSJJ53R6RC2FPPNQDFFJPIFS/action/citation_signature","submit_replication":"https://pith.science/pith/DUOSJJ53R6RC2FPPNQDFFJPIFS/action/replication_record"}},"created_at":"2026-07-05T10:36:33.781130+00:00","updated_at":"2026-07-05T10:36:33.781130+00:00"}