{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:PBBSPMNYDVGE523LHINBTBK6MC","short_pith_number":"pith:PBBSPMNY","schema_version":"1.0","canonical_sha256":"784327b1b81d4c4eeb6b3a1a19855e6095cca512b95c11a7143d3f10546313a6","source":{"kind":"arxiv","id":"2205.11491","version":1},"attestation_state":"computed","paper":{"title":"HyperTree Proof Search for Neural Theorem Proving","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Amaury Hayat, Aur\\'elien Rodriguez, Gabriel Ebner, Guillaume Lample, Marie-Anne Lachaux, Thibaut Lavril, Timoth\\'ee Lacroix, Xavier Martinet","submitted_at":"2022-05-23T17:49:55Z","abstract_excerpt":"We propose an online training procedure for a transformer-based automated theorem prover. Our approach leverages a new search algorithm, HyperTree Proof Search (HTPS), inspired by the recent success of AlphaZero. Our model learns from previous proof searches through online training, allowing it to generalize to domains far from the training distribution. We report detailed ablations of our pipeline's main components by studying performance on three environments of increasing complexity. In particular, we show that with HTPS alone, a model trained on annotated proofs manages to prove 65.4% of a"},"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":"2205.11491","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2022-05-23T17:49:55Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d449459e2b32e8bd8b0880355abb3215ec5b16da7b9de0de4adc5c27c9a14db0","abstract_canon_sha256":"9904f25eec261a2e818fc108e17b2be01adcc39f7ae5b08d06fdf1746cd74cdd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:25:37.791616Z","signature_b64":"w3ZOPzX3uoKiqv+hSfBfcwT0WRhU0aywXRL7FdUd3DjS2NKbvhR3S6Jhaf6ePOjbmaMV/hU5jG8r2LkC/u1VAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"784327b1b81d4c4eeb6b3a1a19855e6095cca512b95c11a7143d3f10546313a6","last_reissued_at":"2026-07-05T04:25:37.791139Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:25:37.791139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HyperTree Proof Search for Neural Theorem Proving","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CL","authors_text":"Amaury Hayat, Aur\\'elien Rodriguez, Gabriel Ebner, Guillaume Lample, Marie-Anne Lachaux, Thibaut Lavril, Timoth\\'ee Lacroix, Xavier Martinet","submitted_at":"2022-05-23T17:49:55Z","abstract_excerpt":"We propose an online training procedure for a transformer-based automated theorem prover. Our approach leverages a new search algorithm, HyperTree Proof Search (HTPS), inspired by the recent success of AlphaZero. Our model learns from previous proof searches through online training, allowing it to generalize to domains far from the training distribution. We report detailed ablations of our pipeline's main components by studying performance on three environments of increasing complexity. In particular, we show that with HTPS alone, a model trained on annotated proofs manages to prove 65.4% of a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.11491","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/2205.11491/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":"2205.11491","created_at":"2026-07-05T04:25:37.791192+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.11491v1","created_at":"2026-07-05T04:25:37.791192+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.11491","created_at":"2026-07-05T04:25:37.791192+00:00"},{"alias_kind":"pith_short_12","alias_value":"PBBSPMNYDVGE","created_at":"2026-07-05T04:25:37.791192+00:00"},{"alias_kind":"pith_short_16","alias_value":"PBBSPMNYDVGE523L","created_at":"2026-07-05T04:25:37.791192+00:00"},{"alias_kind":"pith_short_8","alias_value":"PBBSPMNY","created_at":"2026-07-05T04:25:37.791192+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":10,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.02390","citing_title":"DecompRL: Solving Harder Problems by Learning Modular Code Generation","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2606.09450","citing_title":"TheoremBench: Evaluating LLMs on Theorem Proving in Formal Mathematics","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2606.05400","citing_title":"LeanMarathon: Toward Reliable AI Co-Mathematicians through Long-Horizon Lean Autoformalization","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27485","citing_title":"Automating Formal Verification with Agent-Guided Tree Search","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2605.30914","citing_title":"Automating Formal Verification with Reinforcement Learning and Recursive Inference","ref_index":50,"is_internal_anchor":false},{"citing_arxiv_id":"2502.02871","citing_title":"Position: Multimodal Large Language Models Can Significantly Advance Scientific Reasoning","ref_index":84,"is_internal_anchor":false},{"citing_arxiv_id":"2310.10631","citing_title":"Llemma: An Open Language Model For Mathematics","ref_index":156,"is_internal_anchor":false},{"citing_arxiv_id":"2602.24273","citing_title":"A Minimal Agent for Automated Theorem Proving","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2603.11164","citing_title":"Learning to Unscramble: Simplifying Symbolic Expressions via Self-Supervised Oracle Trajectories","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2605.06690","citing_title":"State Representation and Termination for Recursive Reasoning Systems","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PBBSPMNYDVGE523LHINBTBK6MC","json":"https://pith.science/pith/PBBSPMNYDVGE523LHINBTBK6MC.json","graph_json":"https://pith.science/api/pith-number/PBBSPMNYDVGE523LHINBTBK6MC/graph.json","events_json":"https://pith.science/api/pith-number/PBBSPMNYDVGE523LHINBTBK6MC/events.json","paper":"https://pith.science/paper/PBBSPMNY"},"agent_actions":{"view_html":"https://pith.science/pith/PBBSPMNYDVGE523LHINBTBK6MC","download_json":"https://pith.science/pith/PBBSPMNYDVGE523LHINBTBK6MC.json","view_paper":"https://pith.science/paper/PBBSPMNY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.11491&json=true","fetch_graph":"https://pith.science/api/pith-number/PBBSPMNYDVGE523LHINBTBK6MC/graph.json","fetch_events":"https://pith.science/api/pith-number/PBBSPMNYDVGE523LHINBTBK6MC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PBBSPMNYDVGE523LHINBTBK6MC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PBBSPMNYDVGE523LHINBTBK6MC/action/storage_attestation","attest_author":"https://pith.science/pith/PBBSPMNYDVGE523LHINBTBK6MC/action/author_attestation","sign_citation":"https://pith.science/pith/PBBSPMNYDVGE523LHINBTBK6MC/action/citation_signature","submit_replication":"https://pith.science/pith/PBBSPMNYDVGE523LHINBTBK6MC/action/replication_record"}},"created_at":"2026-07-05T04:25:37.791192+00:00","updated_at":"2026-07-05T04:25:37.791192+00:00"}