{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AZAG5ORXAWMWQ3WHA5K7KHDFKL","short_pith_number":"pith:AZAG5ORX","schema_version":"1.0","canonical_sha256":"06406eba370599686ec70755f51c6552c5ae8cbaafc96ee87d68fd9dc7a6a731","source":{"kind":"arxiv","id":"2410.04753","version":2},"attestation_state":"computed","paper":{"title":"ImProver: Agent-Based Automated Proof Optimization","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CL","cs.LG","cs.LO"],"primary_cat":"cs.AI","authors_text":"Jeremy Avigad, Prasad Tetali, Riyaz Ahuja, Sean Welleck","submitted_at":"2024-10-07T05:14:18Z","abstract_excerpt":"Large language models (LLMs) have been used to generate formal proofs of mathematical theorems in proofs assistants such as Lean. However, we often want to optimize a formal proof with respect to various criteria, depending on its downstream use. For example, we may want a proof to adhere to a certain style, or to be readable, concise, or modularly structured. Having suitably optimized proofs is also important for learning tasks, especially since human-written proofs may not optimal for that purpose. To this end, we study a new problem of automated proof optimization: rewriting a proof so that"},"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":"2410.04753","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2024-10-07T05:14:18Z","cross_cats_sorted":["cs.CL","cs.LG","cs.LO"],"title_canon_sha256":"32ac24a4751bd3713c80abb13749a5668bececc5be62c1abdeeddc462f424a05","abstract_canon_sha256":"841a8e90cf7605ff9b21d1911673f727df309c2fa6257020474611935521bd86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-22T01:03:40.530368Z","signature_b64":"3+Z8bMQ4fEXo3LdZ4CBHNjVVVbj2kdsZlDG1397Px7zEl4jYYtoEfW0IlP05QvLW78lPfQG/7dVI3XxHI6PsAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06406eba370599686ec70755f51c6552c5ae8cbaafc96ee87d68fd9dc7a6a731","last_reissued_at":"2026-05-22T01:03:40.529565Z","signature_status":"signed_v1","first_computed_at":"2026-05-22T01:03:40.529565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ImProver: Agent-Based Automated Proof Optimization","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CL","cs.LG","cs.LO"],"primary_cat":"cs.AI","authors_text":"Jeremy Avigad, Prasad Tetali, Riyaz Ahuja, Sean Welleck","submitted_at":"2024-10-07T05:14:18Z","abstract_excerpt":"Large language models (LLMs) have been used to generate formal proofs of mathematical theorems in proofs assistants such as Lean. However, we often want to optimize a formal proof with respect to various criteria, depending on its downstream use. For example, we may want a proof to adhere to a certain style, or to be readable, concise, or modularly structured. Having suitably optimized proofs is also important for learning tasks, especially since human-written proofs may not optimal for that purpose. To this end, we study a new problem of automated proof optimization: rewriting a proof so that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.04753","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/2410.04753/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":"2410.04753","created_at":"2026-05-22T01:03:40.529678+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.04753v2","created_at":"2026-05-22T01:03:40.529678+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.04753","created_at":"2026-05-22T01:03:40.529678+00:00"},{"alias_kind":"pith_short_12","alias_value":"AZAG5ORXAWMW","created_at":"2026-05-22T01:03:40.529678+00:00"},{"alias_kind":"pith_short_16","alias_value":"AZAG5ORXAWMWQ3WH","created_at":"2026-05-22T01:03:40.529678+00:00"},{"alias_kind":"pith_short_8","alias_value":"AZAG5ORX","created_at":"2026-05-22T01:03:40.529678+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.20244","citing_title":"Lean Refactor: Multi-Objective Controllable Proof Optimization via Agentic Strategy Search","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AZAG5ORXAWMWQ3WHA5K7KHDFKL","json":"https://pith.science/pith/AZAG5ORXAWMWQ3WHA5K7KHDFKL.json","graph_json":"https://pith.science/api/pith-number/AZAG5ORXAWMWQ3WHA5K7KHDFKL/graph.json","events_json":"https://pith.science/api/pith-number/AZAG5ORXAWMWQ3WHA5K7KHDFKL/events.json","paper":"https://pith.science/paper/AZAG5ORX"},"agent_actions":{"view_html":"https://pith.science/pith/AZAG5ORXAWMWQ3WHA5K7KHDFKL","download_json":"https://pith.science/pith/AZAG5ORXAWMWQ3WHA5K7KHDFKL.json","view_paper":"https://pith.science/paper/AZAG5ORX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.04753&json=true","fetch_graph":"https://pith.science/api/pith-number/AZAG5ORXAWMWQ3WHA5K7KHDFKL/graph.json","fetch_events":"https://pith.science/api/pith-number/AZAG5ORXAWMWQ3WHA5K7KHDFKL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AZAG5ORXAWMWQ3WHA5K7KHDFKL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AZAG5ORXAWMWQ3WHA5K7KHDFKL/action/storage_attestation","attest_author":"https://pith.science/pith/AZAG5ORXAWMWQ3WHA5K7KHDFKL/action/author_attestation","sign_citation":"https://pith.science/pith/AZAG5ORXAWMWQ3WHA5K7KHDFKL/action/citation_signature","submit_replication":"https://pith.science/pith/AZAG5ORXAWMWQ3WHA5K7KHDFKL/action/replication_record"}},"created_at":"2026-05-22T01:03:40.529678+00:00","updated_at":"2026-05-22T01:03:40.529678+00:00"}