{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7Q35S6WKZIBDOG4HBXOTP6MX4Y","short_pith_number":"pith:7Q35S6WK","schema_version":"1.0","canonical_sha256":"fc37d97acaca02371b870ddd37f997e63a44ee96a1e5a4305cf653597f5292be","source":{"kind":"arxiv","id":"2606.03303","version":1},"attestation_state":"computed","paper":{"title":"LEAP: Supercharging LLMs for Formal Mathematics with Agentic Frameworks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Burak Gokturk, Chun-Liang Li, Dawsen Hwang, Edward Lockhart, Jinsung Yoon, Linfeng Song, Mirek Ol\\v{s}\\'ak, Nanyun Peng, Po-Nien Kung, Quoc V Le, Simone Severini, Thang Luong, Tomas Pfister","submitted_at":"2026-06-02T08:16:42Z","abstract_excerpt":"Large Language Models (LLMs) exhibit strong informal mathematical reasoning but struggle to generate mechanically verifiable proofs in formal languages like Lean. We present LEAP, an agentic framework that enables general-purpose foundation models to achieve state-of-the-art performance on automated formal theorem proving. LEAP leverages foundation model capabilities, such as informal reasoning, instruction following, and iterative self-refinement. By decomposing complex problems into smaller units, the system bridges formal proof construction with informal blueprints through continuous intera"},"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":"2606.03303","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-06-02T08:16:42Z","cross_cats_sorted":[],"title_canon_sha256":"114acb1beb22c3175c668bec3d4124d3e76b6c1b24a311eb745b21356f92889f","abstract_canon_sha256":"77d51ecb96a447488143981c5945ad1942becf6c9c7bab0cb20b6e9ebfc977c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:54.497396Z","signature_b64":"9fdjhcaCSNlTeN/LYOiSk+y7uClYFtEDpXgK1q/KMZRyvje6/AjX4w8BT4WWck1MxRCG9TECPRKmjreAumSyAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc37d97acaca02371b870ddd37f997e63a44ee96a1e5a4305cf653597f5292be","last_reissued_at":"2026-06-03T01:05:54.496856Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:54.496856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LEAP: Supercharging LLMs for Formal Mathematics with Agentic Frameworks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Burak Gokturk, Chun-Liang Li, Dawsen Hwang, Edward Lockhart, Jinsung Yoon, Linfeng Song, Mirek Ol\\v{s}\\'ak, Nanyun Peng, Po-Nien Kung, Quoc V Le, Simone Severini, Thang Luong, Tomas Pfister","submitted_at":"2026-06-02T08:16:42Z","abstract_excerpt":"Large Language Models (LLMs) exhibit strong informal mathematical reasoning but struggle to generate mechanically verifiable proofs in formal languages like Lean. We present LEAP, an agentic framework that enables general-purpose foundation models to achieve state-of-the-art performance on automated formal theorem proving. LEAP leverages foundation model capabilities, such as informal reasoning, instruction following, and iterative self-refinement. By decomposing complex problems into smaller units, the system bridges formal proof construction with informal blueprints through continuous intera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.03303","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/2606.03303/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":"2606.03303","created_at":"2026-06-03T01:05:54.496914+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.03303v1","created_at":"2026-06-03T01:05:54.496914+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.03303","created_at":"2026-06-03T01:05:54.496914+00:00"},{"alias_kind":"pith_short_12","alias_value":"7Q35S6WKZIBD","created_at":"2026-06-03T01:05:54.496914+00:00"},{"alias_kind":"pith_short_16","alias_value":"7Q35S6WKZIBDOG4H","created_at":"2026-06-03T01:05:54.496914+00:00"},{"alias_kind":"pith_short_8","alias_value":"7Q35S6WK","created_at":"2026-06-03T01:05:54.496914+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7Q35S6WKZIBDOG4HBXOTP6MX4Y","json":"https://pith.science/pith/7Q35S6WKZIBDOG4HBXOTP6MX4Y.json","graph_json":"https://pith.science/api/pith-number/7Q35S6WKZIBDOG4HBXOTP6MX4Y/graph.json","events_json":"https://pith.science/api/pith-number/7Q35S6WKZIBDOG4HBXOTP6MX4Y/events.json","paper":"https://pith.science/paper/7Q35S6WK"},"agent_actions":{"view_html":"https://pith.science/pith/7Q35S6WKZIBDOG4HBXOTP6MX4Y","download_json":"https://pith.science/pith/7Q35S6WKZIBDOG4HBXOTP6MX4Y.json","view_paper":"https://pith.science/paper/7Q35S6WK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.03303&json=true","fetch_graph":"https://pith.science/api/pith-number/7Q35S6WKZIBDOG4HBXOTP6MX4Y/graph.json","fetch_events":"https://pith.science/api/pith-number/7Q35S6WKZIBDOG4HBXOTP6MX4Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7Q35S6WKZIBDOG4HBXOTP6MX4Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7Q35S6WKZIBDOG4HBXOTP6MX4Y/action/storage_attestation","attest_author":"https://pith.science/pith/7Q35S6WKZIBDOG4HBXOTP6MX4Y/action/author_attestation","sign_citation":"https://pith.science/pith/7Q35S6WKZIBDOG4HBXOTP6MX4Y/action/citation_signature","submit_replication":"https://pith.science/pith/7Q35S6WKZIBDOG4HBXOTP6MX4Y/action/replication_record"}},"created_at":"2026-06-03T01:05:54.496914+00:00","updated_at":"2026-06-03T01:05:54.496914+00:00"}