{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:K7IPMLJU7IOK3EVB73O4YQRAAK","short_pith_number":"pith:K7IPMLJU","schema_version":"1.0","canonical_sha256":"57d0f62d34fa1cad92a1feddcc422002b8dd5731e2d1a6eeb891d08c69ccb8a2","source":{"kind":"arxiv","id":"2112.10664","version":1},"attestation_state":"computed","paper":{"title":"Proving Theorems using Incremental Learning and Hindsight Experience Replay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Ankit Anand, Doina Precup, Eser Ayg\\\"un, Laurent Orseau, Lei M. Zhang, Shibl Mourad, Vlad Firoiu, Xavier Glorot","submitted_at":"2021-12-20T16:40:26Z","abstract_excerpt":"Traditional automated theorem provers for first-order logic depend on speed-optimized search and many handcrafted heuristics that are designed to work best over a wide range of domains. Machine learning approaches in literature either depend on these traditional provers to bootstrap themselves or fall short on reaching comparable performance. In this paper, we propose a general incremental learning algorithm for training domain specific provers for first-order logic without equality, based only on a basic given-clause algorithm, but using a learned clause-scoring function. Clauses are represen"},"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":"2112.10664","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-12-20T16:40:26Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"485d950a5ee5655140d80d7130944a47248ee75ea4c1fa54f59fd648b203748c","abstract_canon_sha256":"894405113033b4e962e3a0e3f800665a2dfd8d8a3f3cb8668744a313b3b60d47"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:42:17.771611Z","signature_b64":"QW+lXOvCMNYYLS6Y9j34rpazn7s6CpF1NyGI+MdFer6PZulGCZLeM1BRcmpeoPkPFFmMAFHaM8mZN0eEFdy1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57d0f62d34fa1cad92a1feddcc422002b8dd5731e2d1a6eeb891d08c69ccb8a2","last_reissued_at":"2026-07-05T03:42:17.771120Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:42:17.771120Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Proving Theorems using Incremental Learning and Hindsight Experience Replay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Ankit Anand, Doina Precup, Eser Ayg\\\"un, Laurent Orseau, Lei M. Zhang, Shibl Mourad, Vlad Firoiu, Xavier Glorot","submitted_at":"2021-12-20T16:40:26Z","abstract_excerpt":"Traditional automated theorem provers for first-order logic depend on speed-optimized search and many handcrafted heuristics that are designed to work best over a wide range of domains. Machine learning approaches in literature either depend on these traditional provers to bootstrap themselves or fall short on reaching comparable performance. In this paper, we propose a general incremental learning algorithm for training domain specific provers for first-order logic without equality, based only on a basic given-clause algorithm, but using a learned clause-scoring function. Clauses are represen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.10664","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/2112.10664/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":"2112.10664","created_at":"2026-07-05T03:42:17.771176+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.10664v1","created_at":"2026-07-05T03:42:17.771176+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.10664","created_at":"2026-07-05T03:42:17.771176+00:00"},{"alias_kind":"pith_short_12","alias_value":"K7IPMLJU7IOK","created_at":"2026-07-05T03:42:17.771176+00:00"},{"alias_kind":"pith_short_16","alias_value":"K7IPMLJU7IOK3EVB","created_at":"2026-07-05T03:42:17.771176+00:00"},{"alias_kind":"pith_short_8","alias_value":"K7IPMLJU","created_at":"2026-07-05T03:42:17.771176+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.01734","citing_title":"Reformalization of the Jordan Curve Theorem","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K7IPMLJU7IOK3EVB73O4YQRAAK","json":"https://pith.science/pith/K7IPMLJU7IOK3EVB73O4YQRAAK.json","graph_json":"https://pith.science/api/pith-number/K7IPMLJU7IOK3EVB73O4YQRAAK/graph.json","events_json":"https://pith.science/api/pith-number/K7IPMLJU7IOK3EVB73O4YQRAAK/events.json","paper":"https://pith.science/paper/K7IPMLJU"},"agent_actions":{"view_html":"https://pith.science/pith/K7IPMLJU7IOK3EVB73O4YQRAAK","download_json":"https://pith.science/pith/K7IPMLJU7IOK3EVB73O4YQRAAK.json","view_paper":"https://pith.science/paper/K7IPMLJU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.10664&json=true","fetch_graph":"https://pith.science/api/pith-number/K7IPMLJU7IOK3EVB73O4YQRAAK/graph.json","fetch_events":"https://pith.science/api/pith-number/K7IPMLJU7IOK3EVB73O4YQRAAK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K7IPMLJU7IOK3EVB73O4YQRAAK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K7IPMLJU7IOK3EVB73O4YQRAAK/action/storage_attestation","attest_author":"https://pith.science/pith/K7IPMLJU7IOK3EVB73O4YQRAAK/action/author_attestation","sign_citation":"https://pith.science/pith/K7IPMLJU7IOK3EVB73O4YQRAAK/action/citation_signature","submit_replication":"https://pith.science/pith/K7IPMLJU7IOK3EVB73O4YQRAAK/action/replication_record"}},"created_at":"2026-07-05T03:42:17.771176+00:00","updated_at":"2026-07-05T03:42:17.771176+00:00"}