{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SLNSCT436W4VGWGCT2UQSFUN6I","short_pith_number":"pith:SLNSCT43","schema_version":"1.0","canonical_sha256":"92db214f9bf5b95358c29ea909168df23b3eb3ee766dd4f1d3c66db8828fcb16","source":{"kind":"arxiv","id":"2605.26959","version":1},"attestation_state":"computed","paper":{"title":"MerLean-Prover: A Recursive Looping Harness for End-to-End Lean 4 Theorem Proving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LO","authors_text":"Jinzheng Li, Yuanjie Ren, Zeru Zhu","submitted_at":"2026-05-26T12:49:49Z","abstract_excerpt":"MerLean-Prover is an end-to-end Lean4 theorem prover that replaces sorry declarations with kernel-checkable proofs. It is built from three agent types (Planning, Check, and Lean) composed by a recursive outer loop whose unit of revision is the proof plan itself, and uses no fine-tuning, no custom RL objective, and no theorem-specific scaffolding. On FormalQualBench, a benchmark of 23 PhD-qualifying-exam theorems, MerLean-Prover solves 10/23, surpassing the strongest published open-source baseline (OpenGauss, 8/23). On Putnam2025, the same harness closes 12/12 with substantially lower total wal"},"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":"2605.26959","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2026-05-26T12:49:49Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"61db02bbbf6f457458ff68aec0a0d22776f14b246402d20bd2b8954ef52f9ef4","abstract_canon_sha256":"d291d9a004f286df64dc33a221f41645eda911f7107fa31947499a8b4be0cb11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:06:21.678012Z","signature_b64":"ej8VvsX8hU7ZeVrlEzQsbRvmRyY+s7eoBhdaBc2FQ+1/owfaTCQxqSc71uByStG2Z/D6q2mHldoVT/yVJMAtDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92db214f9bf5b95358c29ea909168df23b3eb3ee766dd4f1d3c66db8828fcb16","last_reissued_at":"2026-05-27T01:06:21.677259Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:06:21.677259Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MerLean-Prover: A Recursive Looping Harness for End-to-End Lean 4 Theorem Proving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.LO","authors_text":"Jinzheng Li, Yuanjie Ren, Zeru Zhu","submitted_at":"2026-05-26T12:49:49Z","abstract_excerpt":"MerLean-Prover is an end-to-end Lean4 theorem prover that replaces sorry declarations with kernel-checkable proofs. It is built from three agent types (Planning, Check, and Lean) composed by a recursive outer loop whose unit of revision is the proof plan itself, and uses no fine-tuning, no custom RL objective, and no theorem-specific scaffolding. On FormalQualBench, a benchmark of 23 PhD-qualifying-exam theorems, MerLean-Prover solves 10/23, surpassing the strongest published open-source baseline (OpenGauss, 8/23). On Putnam2025, the same harness closes 12/12 with substantially lower total wal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.26959","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/2605.26959/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":"2605.26959","created_at":"2026-05-27T01:06:21.677406+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.26959v1","created_at":"2026-05-27T01:06:21.677406+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26959","created_at":"2026-05-27T01:06:21.677406+00:00"},{"alias_kind":"pith_short_12","alias_value":"SLNSCT436W4V","created_at":"2026-05-27T01:06:21.677406+00:00"},{"alias_kind":"pith_short_16","alias_value":"SLNSCT436W4VGWGC","created_at":"2026-05-27T01:06:21.677406+00:00"},{"alias_kind":"pith_short_8","alias_value":"SLNSCT43","created_at":"2026-05-27T01:06:21.677406+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/SLNSCT436W4VGWGCT2UQSFUN6I","json":"https://pith.science/pith/SLNSCT436W4VGWGCT2UQSFUN6I.json","graph_json":"https://pith.science/api/pith-number/SLNSCT436W4VGWGCT2UQSFUN6I/graph.json","events_json":"https://pith.science/api/pith-number/SLNSCT436W4VGWGCT2UQSFUN6I/events.json","paper":"https://pith.science/paper/SLNSCT43"},"agent_actions":{"view_html":"https://pith.science/pith/SLNSCT436W4VGWGCT2UQSFUN6I","download_json":"https://pith.science/pith/SLNSCT436W4VGWGCT2UQSFUN6I.json","view_paper":"https://pith.science/paper/SLNSCT43","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.26959&json=true","fetch_graph":"https://pith.science/api/pith-number/SLNSCT436W4VGWGCT2UQSFUN6I/graph.json","fetch_events":"https://pith.science/api/pith-number/SLNSCT436W4VGWGCT2UQSFUN6I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SLNSCT436W4VGWGCT2UQSFUN6I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SLNSCT436W4VGWGCT2UQSFUN6I/action/storage_attestation","attest_author":"https://pith.science/pith/SLNSCT436W4VGWGCT2UQSFUN6I/action/author_attestation","sign_citation":"https://pith.science/pith/SLNSCT436W4VGWGCT2UQSFUN6I/action/citation_signature","submit_replication":"https://pith.science/pith/SLNSCT436W4VGWGCT2UQSFUN6I/action/replication_record"}},"created_at":"2026-05-27T01:06:21.677406+00:00","updated_at":"2026-05-27T01:06:21.677406+00:00"}