{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:DRJTWQFE2AWF4HZRIAU3NB6Y3L","short_pith_number":"pith:DRJTWQFE","schema_version":"1.0","canonical_sha256":"1c533b40a4d02c5e1f314029b687d8dacec45e00b3ae8a06b8d36d3c3c66c9d8","source":{"kind":"arxiv","id":"2505.14929","version":2},"attestation_state":"computed","paper":{"title":"Lean-auto: An Interface between Lean 4 and Automated Theorem Provers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Clark Barrett, Jeremy Avigad, Joshua Clune, Yicheng Qian","submitted_at":"2025-05-20T21:33:42Z","abstract_excerpt":"Proof automation is crucial to large-scale formal mathematics and software/hardware verification projects in ITPs. Sophisticated tools called hammers have been developed to provide general-purpose proof automation in ITPs such as Coq and Isabelle, leveraging the power of ATPs. An important component of a hammer is the translation algorithm from the ITP's logical system to the ATP's logical system. In this paper, we propose a novel translation algorithm for ITPs based on dependent type theory. The algorithm is implemented in Lean 4 under the name Lean-auto. When combined with ATPs, Lean-auto pr"},"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":"2505.14929","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2025-05-20T21:33:42Z","cross_cats_sorted":[],"title_canon_sha256":"1c59adb75aad5922a56cdca7b7459dd63fd3d8505f2864e741f89f63405df40b","abstract_canon_sha256":"7012ce8eaaa0c100054bd8c33a2d04ea63520078157bc1df5f2474c4312d5d51"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:08:41.761732Z","signature_b64":"G57gaKl2fIyYIrxAure0ORDzOaIN08AY+wnpMJbYQdbQ8kedOQ7s8P7qoyz4xhMgru1lsNGjmlMU9ayzCOxyAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c533b40a4d02c5e1f314029b687d8dacec45e00b3ae8a06b8d36d3c3c66c9d8","last_reissued_at":"2026-07-05T11:08:41.761221Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:08:41.761221Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lean-auto: An Interface between Lean 4 and Automated Theorem Provers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Clark Barrett, Jeremy Avigad, Joshua Clune, Yicheng Qian","submitted_at":"2025-05-20T21:33:42Z","abstract_excerpt":"Proof automation is crucial to large-scale formal mathematics and software/hardware verification projects in ITPs. Sophisticated tools called hammers have been developed to provide general-purpose proof automation in ITPs such as Coq and Isabelle, leveraging the power of ATPs. An important component of a hammer is the translation algorithm from the ITP's logical system to the ATP's logical system. In this paper, we propose a novel translation algorithm for ITPs based on dependent type theory. The algorithm is implemented in Lean 4 under the name Lean-auto. When combined with ATPs, Lean-auto pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.14929","kind":"arxiv","version":2},"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/2505.14929/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":"2505.14929","created_at":"2026-07-05T11:08:41.761278+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.14929v2","created_at":"2026-07-05T11:08:41.761278+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.14929","created_at":"2026-07-05T11:08:41.761278+00:00"},{"alias_kind":"pith_short_12","alias_value":"DRJTWQFE2AWF","created_at":"2026-07-05T11:08:41.761278+00:00"},{"alias_kind":"pith_short_16","alias_value":"DRJTWQFE2AWF4HZR","created_at":"2026-07-05T11:08:41.761278+00:00"},{"alias_kind":"pith_short_8","alias_value":"DRJTWQFE","created_at":"2026-07-05T11:08:41.761278+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.26017","citing_title":"Trustworthy Software Project Generation : a Case Study with an Interactive Theorem Prover","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08694","citing_title":"A Learning Method for Symbolic Systems Using Large Language Models","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DRJTWQFE2AWF4HZRIAU3NB6Y3L","json":"https://pith.science/pith/DRJTWQFE2AWF4HZRIAU3NB6Y3L.json","graph_json":"https://pith.science/api/pith-number/DRJTWQFE2AWF4HZRIAU3NB6Y3L/graph.json","events_json":"https://pith.science/api/pith-number/DRJTWQFE2AWF4HZRIAU3NB6Y3L/events.json","paper":"https://pith.science/paper/DRJTWQFE"},"agent_actions":{"view_html":"https://pith.science/pith/DRJTWQFE2AWF4HZRIAU3NB6Y3L","download_json":"https://pith.science/pith/DRJTWQFE2AWF4HZRIAU3NB6Y3L.json","view_paper":"https://pith.science/paper/DRJTWQFE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.14929&json=true","fetch_graph":"https://pith.science/api/pith-number/DRJTWQFE2AWF4HZRIAU3NB6Y3L/graph.json","fetch_events":"https://pith.science/api/pith-number/DRJTWQFE2AWF4HZRIAU3NB6Y3L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DRJTWQFE2AWF4HZRIAU3NB6Y3L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DRJTWQFE2AWF4HZRIAU3NB6Y3L/action/storage_attestation","attest_author":"https://pith.science/pith/DRJTWQFE2AWF4HZRIAU3NB6Y3L/action/author_attestation","sign_citation":"https://pith.science/pith/DRJTWQFE2AWF4HZRIAU3NB6Y3L/action/citation_signature","submit_replication":"https://pith.science/pith/DRJTWQFE2AWF4HZRIAU3NB6Y3L/action/replication_record"}},"created_at":"2026-07-05T11:08:41.761278+00:00","updated_at":"2026-07-05T11:08:41.761278+00:00"}