{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:SXCYVHMXTM4OROEQXDS4F5RW7L","short_pith_number":"pith:SXCYVHMX","schema_version":"1.0","canonical_sha256":"95c58a9d979b38e8b890b8e5c2f636fac442506105316631adcd1f8b7041c41f","source":{"kind":"arxiv","id":"2507.15225","version":1},"attestation_state":"computed","paper":{"title":"Solving Formal Math Problems by Decomposition and Iterative Reflection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.LO"],"primary_cat":"cs.AI","authors_text":"Allan Jie, Bohan Wang, Hang Li, Haocheng Wang, Haowei Chen, Huishuai Zhang, Jiahui Wang, Jianqiu Zhao, Luong Trung, Luoxin Chen, Peng Sun, Phan Nhat Hoang, Rong Ye, Siran Wang, Xinbo Zhang, Yichi Zhou, Yongxin Zhang","submitted_at":"2025-07-21T03:56:35Z","abstract_excerpt":"General-purpose Large Language Models (LLMs) have achieved remarkable success in intelligence, performing comparably to human experts on complex reasoning tasks such as coding and mathematical reasoning. However, generating formal proofs in specialized languages like Lean 4 remains a significant challenge for these models, limiting their application in complex theorem proving and automated verification. Current approaches typically require specializing models through fine-tuning on dedicated formal corpora, incurring high costs for data collection and training. In this work, we introduce \\text"},"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":"2507.15225","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-07-21T03:56:35Z","cross_cats_sorted":["cs.LG","cs.LO"],"title_canon_sha256":"953ff0055653d43910e0a404b2d22994e03135a02915bd6c323ae98dae6ee026","abstract_canon_sha256":"036eb46aa1e7cc57e3fe422f5e421fdd46a756270ea0ba06b7e5d88a077771eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:45:37.772234Z","signature_b64":"Ct9MDyBfpuqh0m4tXv7EISutIqPiYGq3RKKsWv4Of83Ti4aQ+cXgTXH/iJYu+cuPg7b6IMbvThB4e/aCG3plDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95c58a9d979b38e8b890b8e5c2f636fac442506105316631adcd1f8b7041c41f","last_reissued_at":"2026-07-05T11:45:37.771756Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:45:37.771756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Formal Math Problems by Decomposition and Iterative Reflection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.LO"],"primary_cat":"cs.AI","authors_text":"Allan Jie, Bohan Wang, Hang Li, Haocheng Wang, Haowei Chen, Huishuai Zhang, Jiahui Wang, Jianqiu Zhao, Luong Trung, Luoxin Chen, Peng Sun, Phan Nhat Hoang, Rong Ye, Siran Wang, Xinbo Zhang, Yichi Zhou, Yongxin Zhang","submitted_at":"2025-07-21T03:56:35Z","abstract_excerpt":"General-purpose Large Language Models (LLMs) have achieved remarkable success in intelligence, performing comparably to human experts on complex reasoning tasks such as coding and mathematical reasoning. However, generating formal proofs in specialized languages like Lean 4 remains a significant challenge for these models, limiting their application in complex theorem proving and automated verification. Current approaches typically require specializing models through fine-tuning on dedicated formal corpora, incurring high costs for data collection and training. In this work, we introduce \\text"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.15225","kind":"arxiv","version":1},"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/2507.15225/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":"2507.15225","created_at":"2026-07-05T11:45:37.771814+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.15225v1","created_at":"2026-07-05T11:45:37.771814+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.15225","created_at":"2026-07-05T11:45:37.771814+00:00"},{"alias_kind":"pith_short_12","alias_value":"SXCYVHMXTM4O","created_at":"2026-07-05T11:45:37.771814+00:00"},{"alias_kind":"pith_short_16","alias_value":"SXCYVHMXTM4OROEQ","created_at":"2026-07-05T11:45:37.771814+00:00"},{"alias_kind":"pith_short_8","alias_value":"SXCYVHMX","created_at":"2026-07-05T11:45:37.771814+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.31134","citing_title":"Beyond the Library: An Agentic Framework for Autoformalizing Research Mathematics","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2606.01861","citing_title":"A Theoretical Framework for Self-Play Theorem Proving Algorithms","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2606.31134","citing_title":"Beyond the Library: An Agentic Framework for Autoformalizing Research Mathematics","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27485","citing_title":"Automating Formal Verification with Agent-Guided Tree Search","ref_index":97,"is_internal_anchor":false},{"citing_arxiv_id":"2606.04883","citing_title":"Optimizing the Cost-Quality Tradeoff of Agentic Theorem Provers in Lean","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2601.13209","citing_title":"AI for Mathematics: Progress, Challenges, and Prospects","ref_index":179,"is_internal_anchor":false},{"citing_arxiv_id":"2510.01346","citing_title":"Aristotle: IMO-level Automated Theorem Proving","ref_index":64,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09271","citing_title":"Shaping Schema via Language Representation as the Next Frontier for LLM Intelligence Expanding","ref_index":65,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SXCYVHMXTM4OROEQXDS4F5RW7L","json":"https://pith.science/pith/SXCYVHMXTM4OROEQXDS4F5RW7L.json","graph_json":"https://pith.science/api/pith-number/SXCYVHMXTM4OROEQXDS4F5RW7L/graph.json","events_json":"https://pith.science/api/pith-number/SXCYVHMXTM4OROEQXDS4F5RW7L/events.json","paper":"https://pith.science/paper/SXCYVHMX"},"agent_actions":{"view_html":"https://pith.science/pith/SXCYVHMXTM4OROEQXDS4F5RW7L","download_json":"https://pith.science/pith/SXCYVHMXTM4OROEQXDS4F5RW7L.json","view_paper":"https://pith.science/paper/SXCYVHMX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.15225&json=true","fetch_graph":"https://pith.science/api/pith-number/SXCYVHMXTM4OROEQXDS4F5RW7L/graph.json","fetch_events":"https://pith.science/api/pith-number/SXCYVHMXTM4OROEQXDS4F5RW7L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SXCYVHMXTM4OROEQXDS4F5RW7L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SXCYVHMXTM4OROEQXDS4F5RW7L/action/storage_attestation","attest_author":"https://pith.science/pith/SXCYVHMXTM4OROEQXDS4F5RW7L/action/author_attestation","sign_citation":"https://pith.science/pith/SXCYVHMXTM4OROEQXDS4F5RW7L/action/citation_signature","submit_replication":"https://pith.science/pith/SXCYVHMXTM4OROEQXDS4F5RW7L/action/replication_record"}},"created_at":"2026-07-05T11:45:37.771814+00:00","updated_at":"2026-07-05T11:45:37.771814+00:00"}