{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HKOKCO6WG5A2OY5WGFYU5WZLAV","short_pith_number":"pith:HKOKCO6W","schema_version":"1.0","canonical_sha256":"3a9ca13bd63741a763b631714edb2b05738b600b80780e40ebf7d6415e5bf78d","source":{"kind":"arxiv","id":"1904.03241","version":3},"attestation_state":"computed","paper":{"title":"HOList: An Environment for Machine Learning of Higher-Order Theorem Proving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.LO","authors_text":"Christian Szegedy, Kshitij Bansal, Markus N. Rabe, Sarah M. Loos, Stewart Wilcox","submitted_at":"2019-04-05T19:04:33Z","abstract_excerpt":"We present an environment, benchmark, and deep learning driven automated theorem prover for higher-order logic. Higher-order interactive theorem provers enable the formalization of arbitrary mathematical theories and thereby present an interesting, open-ended challenge for deep learning. We provide an open-source framework based on the HOL Light theorem prover that can be used as a reinforcement learning environment. HOL Light comes with a broad coverage of basic mathematical theorems on calculus and the formal proof of the Kepler conjecture, from which we derive a challenging benchmark for au"},"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":"1904.03241","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2019-04-05T19:04:33Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"61504a75c88c7a6533e02f66037ef46813688af067af4661de9a93b2424966d1","abstract_canon_sha256":"6b57f829247ddc9b3eaedd1ad9bce175b08c7e4dd237c13c5d8b22b96b9e978e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:16:33.632882Z","signature_b64":"jG6qrZOza85QPAGfRaczMrQtaZqv+7JlO72RK0fa/Oh2evnVbPIrnfndaFowPWGdWxy6Hx2m4WJV4MRojbtWDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3a9ca13bd63741a763b631714edb2b05738b600b80780e40ebf7d6415e5bf78d","last_reissued_at":"2026-07-05T00:16:33.632441Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:16:33.632441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HOList: An Environment for Machine Learning of Higher-Order Theorem Proving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.LO","authors_text":"Christian Szegedy, Kshitij Bansal, Markus N. Rabe, Sarah M. Loos, Stewart Wilcox","submitted_at":"2019-04-05T19:04:33Z","abstract_excerpt":"We present an environment, benchmark, and deep learning driven automated theorem prover for higher-order logic. Higher-order interactive theorem provers enable the formalization of arbitrary mathematical theories and thereby present an interesting, open-ended challenge for deep learning. We provide an open-source framework based on the HOL Light theorem prover that can be used as a reinforcement learning environment. HOL Light comes with a broad coverage of basic mathematical theorems on calculus and the formal proof of the Kepler conjecture, from which we derive a challenging benchmark for au"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03241","kind":"arxiv","version":3},"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/1904.03241/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":"1904.03241","created_at":"2026-07-05T00:16:33.632498+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.03241v3","created_at":"2026-07-05T00:16:33.632498+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03241","created_at":"2026-07-05T00:16:33.632498+00:00"},{"alias_kind":"pith_short_12","alias_value":"HKOKCO6WG5A2","created_at":"2026-07-05T00:16:33.632498+00:00"},{"alias_kind":"pith_short_16","alias_value":"HKOKCO6WG5A2OY5W","created_at":"2026-07-05T00:16:33.632498+00:00"},{"alias_kind":"pith_short_8","alias_value":"HKOKCO6W","created_at":"2026-07-05T00:16:33.632498+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.09450","citing_title":"TheoremBench: Evaluating LLMs on Theorem Proving in Formal Mathematics","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HKOKCO6WG5A2OY5WGFYU5WZLAV","json":"https://pith.science/pith/HKOKCO6WG5A2OY5WGFYU5WZLAV.json","graph_json":"https://pith.science/api/pith-number/HKOKCO6WG5A2OY5WGFYU5WZLAV/graph.json","events_json":"https://pith.science/api/pith-number/HKOKCO6WG5A2OY5WGFYU5WZLAV/events.json","paper":"https://pith.science/paper/HKOKCO6W"},"agent_actions":{"view_html":"https://pith.science/pith/HKOKCO6WG5A2OY5WGFYU5WZLAV","download_json":"https://pith.science/pith/HKOKCO6WG5A2OY5WGFYU5WZLAV.json","view_paper":"https://pith.science/paper/HKOKCO6W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.03241&json=true","fetch_graph":"https://pith.science/api/pith-number/HKOKCO6WG5A2OY5WGFYU5WZLAV/graph.json","fetch_events":"https://pith.science/api/pith-number/HKOKCO6WG5A2OY5WGFYU5WZLAV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HKOKCO6WG5A2OY5WGFYU5WZLAV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HKOKCO6WG5A2OY5WGFYU5WZLAV/action/storage_attestation","attest_author":"https://pith.science/pith/HKOKCO6WG5A2OY5WGFYU5WZLAV/action/author_attestation","sign_citation":"https://pith.science/pith/HKOKCO6WG5A2OY5WGFYU5WZLAV/action/citation_signature","submit_replication":"https://pith.science/pith/HKOKCO6WG5A2OY5WGFYU5WZLAV/action/replication_record"}},"created_at":"2026-07-05T00:16:33.632498+00:00","updated_at":"2026-07-05T00:16:33.632498+00:00"}