{"_canonicalization":{"envelope_id":"axm_ + sha256(envelope minus {signature, axiom_id, anchors})","envelope_signature":"ed25519(envelope minus {signature, axiom_id})","json":"sort_keys=True, separators=(',',':'), ensure_ascii=False, allow_nan=False, utf-8","leaf_hash":"sha256(0x00 || canonical_json(envelope_full))","seal_signature":"ed25519(seal minus {signature, sig_algorithm})"},"axiom_id":"axm_bce7d2ccdffa58e838d8707f2d2a0917f57ef5c00eb5266b2a52f5347ee28d5b","bitcoin_anchor":{"bitcoin_attestations":[],"calendar_attestations":[],"ots_url":"","stamped_at":"","status":"pending_next_stamp"},"envelope":{"anchors":[{"chain":"crovia.axiom_graph","height":0,"merkle_proof":"spider_vendor_press_v1","root_at_anchor":"spider_vendor_press_v1"}],"axiom_id":"axm_bce7d2ccdffa58e838d8707f2d2a0917f57ef5c00eb5266b2a52f5347ee28d5b","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"e80b3eb5719b6a5cdb77f8f611874ecfb808018cf868cec1a8f89a279834704e","published":"Mon, 25 May 2026 00:00:00 -0400","receipt_hash":"e80b3eb5719b6a5cdb77f8f611874ecfb808018cf868cec1a8f89a279834704e","schema":"spider.news.vendor_press.v1","spider":"vendor_press","spider_record":{"axiom_subtype":"news.vendor_press.v1","category":"news","decision_hint":"POSITIVE","envelope_target":"AX.OBS","fingerprint":"e80b3eb5719b6a5cdb77f8f611874ecfb808018cf868cec1a8f89a279834704e","observed_at":"2026-05-25T04:43:48.841018Z","parent_run_hash":"56713422f06ad87427cd8cdcdb1ed341feb016b33c37198d9b168328d1df15fb","published":"Mon, 25 May 2026 00:00:00 -0400","runtime_version":"0.1.0","schema":"spider.news.vendor_press.v1","source_status":200,"source_url":"https://export.arxiv.org/rss/cs.AI","spider":"vendor_press","summary_excerpt":"arXiv:2605.22885v1 Announce Type: new \nAbstract: Formal mathematics libraries are rapidly expanding, creating a growing need to refactor verified proofs for maintainability and to improve training data quality for neural provers. However, scalable proof optimization is hindered by heterogeneous and heuristically specified objectives, scarce data, and high training and inference costs. To overcome these challenges, we introduce ImProver 2, a neurosymbolic framework for automated proof optimization in Lean 4. ImProver 2 combines a data-efficient expert-iteration pipeline with a scaffold that exposes formal structure alongside lightweight informal abstractions. We further introduce a suite of metrics capturing structural proof properties. Using ImProver 2, we train a 7B-parameter model that outperforms orders-of-magnitude larger models within the same model family, and is competitive with mid-tier frontier models across metrics. We additionally demonstrate that our neurosymbolic scaffold ","title":"ImProver 2: Iteratively Self-Improving LMs for Neurosymbolic Proof Optimization","url":"https://arxiv.org/abs/2605.22885","vendor":"arxiv_cs_ai"},"summary":"arXiv:2605.22885v1 Announce Type: new \nAbstract: Formal mathematics libraries are rapidly expanding, creating a growing need to refactor verified proofs for maintainability and to improve training data quality for neural provers. However, scalable proof optimization is hindered by heterogeneous and heuristically specified objectives, scarce data, and high training and inference costs. To overcome these challenges, we introduce ImProver 2, a neurosymbolic framework for automated proof optimization in Lean 4. ImProver 2 combines a data-efficient expert-iteration pipeline with a scaffold that exposes formal structure alongside lightweight informal abstractions. We further introduce a suite of metrics capturing structural proof properties. Using ImProver 2, we train a 7B-parameter model that outperforms orders-of-magnitude larger models within the same model family, and is competitive with mid-tier frontier models across metrics. We additionally demonstrate that our neurosymbolic scaffold ","title":"ImProver 2: Iteratively Self-Improving LMs for Neurosymbolic Proof Optimization","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-05-25T04:43:48Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2605.22885"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:f804b67b5660e1f9fe902f7f15f52d0456bb29c1949f63c06d162a68327b1323b75d38228c0e5313130843bcffd588981055211510df1a32f9cb857491930401","signer":"crovia.substrate","subject":{"observed_at":"2026-05-25T04:43:48Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2605.22885"},"tsa":{"authority":"crovia.substrate.bootstrap","rfc3161_token":"{\"kind\":\"crovia.bootstrap.tsa\",\"source_jsonl\":\"/opt/crovia/spider/data/news/vendor_press_v1.jsonl\",\"source_seal_merkle_root\":\"spider_vendor_press_v1\",\"upgrade_path\":\"Sessione H \\u2014 OpenTimestamps weekly anchor\"}"},"zk_mode":"clear","zk_proof":null},"ledger":{"leaf_hash":"8a6a9f6edae40dcb2cd1cdeb35e8ee2997297a3f0e55a0e5aefdd131ebade725","leaf_index":149501,"ledger_path":"/opt/crovia/substrate/axiom_ledger.jsonl"},"merkle_proof":{"hash_alg":"sha256","leaf_prefix":"0x00","node_prefix":"0x01","odd_leaf_rule":"duplicate_last","path":[{"sibling":"7e16c5bc46d54a98a4204fbfd9d1cd60b66dfe46d4bae2c252961ef3ee36f133","side":"left"},{"sibling":"4872b974f5d0a69e5835c4fe68f8bfc285c808b752824f9c894861fbe1890788","side":"right"},{"sibling":"450a3aecab5181ac00eca53ce430a4d8aaefc76ba62621e5881e993afae83948","side":"left"},{"sibling":"b87dbe2b43899c74b28ad085c30d33f69521df3a62a61e562518f01cc90713a6","side":"left"},{"sibling":"0973ebb24ae125a119ed08470818481ea7b936dcc098aa6d88ea91b521a4b1c2","side":"left"},{"sibling":"13f293e7219e1da9ee1afaaee2334491d441f9774e29819572c50d793ba1cddf","side":"left"},{"sibling":"f84ffab05727d6f15e45b6dd52a40aa8d141b54111ae32c0adbaa67e72efec6f","side":"left"},{"sibling":"71bef7e86c9fe98d23af0e5458edddd60dee4bc05ee18768643670728a3486fb","side":"left"},{"sibling":"262c75c0e50905dc91ef8de66ed202b3ff2b8b1c3502663b051ae040e34c458e","side":"left"},{"sibling":"85db764d2c320c82e1731739119f4ff1ff347788d3271ec1568027e5f6ad0ad2","side":"left"},{"sibling":"5c4ff01819c3dfe5105c2c31139b878c525a66d2ed2f835e2d6579c68da04611","side":"left"},{"sibling":"c00108054464ebcf24c02562e77444a342511cb2954108a37a79b6e104f1b6d8","side":"right"},{"sibling":"debbc1a6232ea7970009b91bdc2345041b2de5ac59551f955855d579001e512c","side":"right"},{"sibling":"216869846f40bd905626884f58cb67b9019e488b3656946a7808c436ab7339ac","side":"right"},{"sibling":"35ca36cee447f0ef7064a25d55f59357c66901e31427729c4c1d8b14aa8adb6c","side":"left"},{"sibling":"e734b0c6d6d13acb5f4cf00367b3913e5bbf1aa717377aa4e4820c6de24b7673","side":"right"},{"sibling":"4bbb7f78e96179bb9cdd06d7207b66b3503ab68e4880438263025b04ebe8f7ec","side":"right"},{"sibling":"d841ad93efda0869e5eb97678f348f03f5caab4353e05ff4bf18f47fb945b822","side":"left"}]},"schema":"crovia.axiom_proof.v1","seal":{"first_collector_run_id":"","first_receipt_hash":"","jsonl_path":"/opt/crovia/substrate/axiom_ledger.jsonl","key_id":"430895f101d38164","last_collector_run_id":"","last_receipt_hash":"","leaf_count":149835,"merkle_root":"51484a548bc0cf3d178eec868e98935c87f0aa83369143b7c96b048585e5ba01","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260525T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-05-25T05:37:33Z","sig_algorithm":"ed25519","signature":"99a657e53a015ace0bade5d7fbb3f60f950b6d1e1128251a63afcc454a492422cae5efdc0c18503b4f7e62f371bd48f2889be78d9048c4681d6c1e73f754d705","signer_version":"1.1.0"},"trust_root":{"key_id":"430895f101d38164","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","signature_algorithm":"ed25519","url":"/registry/canon/TRUST_ROOT.md"},"verifier":{"spec":"/registry/canon/AXIOM_RECEIPT_v1.md","url":"/v/axm_bce7d2ccdffa58e838d8707f2d2a0917f57ef5c00eb5266b2a52f5347ee28d5b"}}