{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:SPQ7YVSAOG2OGQTAYZK5I2I6QS","short_pith_number":"pith:SPQ7YVSA","schema_version":"1.0","canonical_sha256":"93e1fc564071b4e34260c655d4691e8481c49983ac70a125d6173f1d17ce9690","source":{"kind":"arxiv","id":"2106.03906","version":1},"attestation_state":"computed","paper":{"title":"Learning to Guide a Saturation-Based Theorem Prover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Achille Fokoue, Bassem Makni, Cristina Cornelio, Ibrahim Abdelaziz, Kavitha Srinivas, Maxwell Crouse, Michael Witbrock, Ndivhuwo Makondo, Pavan Kapanipathi, Shajith Ikbal, Vernon Austil","submitted_at":"2021-06-07T18:35:57Z","abstract_excerpt":"Traditional automated theorem provers have relied on manually tuned heuristics to guide how they perform proof search. Recently, however, there has been a surge of interest in the design of learning mechanisms that can be integrated into theorem provers to improve their performance automatically. In this work, we introduce TRAIL, a deep learning-based approach to theorem proving that characterizes core elements of saturation-based theorem proving within a neural framework. TRAIL leverages (a) an effective graph neural network for representing logical formulas, (b) a novel neural representation"},"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":"2106.03906","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-06-07T18:35:57Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"dbb8018372d5784260e6c928e1476bfa41962a52d38b0b85d948d6cd171438ac","abstract_canon_sha256":"03949abdb3ba83bcee0ecfbb581b0c9df647eeebcc27eac891cc40d6c25092b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:47:10.167238Z","signature_b64":"G/FcEQiWE4KlnT0njt37QhJpeg9gc3OmNXq9RuaUkbCOdDLzOK+Wuf5OndtRHVxQPBlYydRV0RTThBBzuGcYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93e1fc564071b4e34260c655d4691e8481c49983ac70a125d6173f1d17ce9690","last_reissued_at":"2026-07-05T02:47:10.166827Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:47:10.166827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Guide a Saturation-Based Theorem Prover","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Achille Fokoue, Bassem Makni, Cristina Cornelio, Ibrahim Abdelaziz, Kavitha Srinivas, Maxwell Crouse, Michael Witbrock, Ndivhuwo Makondo, Pavan Kapanipathi, Shajith Ikbal, Vernon Austil","submitted_at":"2021-06-07T18:35:57Z","abstract_excerpt":"Traditional automated theorem provers have relied on manually tuned heuristics to guide how they perform proof search. Recently, however, there has been a surge of interest in the design of learning mechanisms that can be integrated into theorem provers to improve their performance automatically. In this work, we introduce TRAIL, a deep learning-based approach to theorem proving that characterizes core elements of saturation-based theorem proving within a neural framework. TRAIL leverages (a) an effective graph neural network for representing logical formulas, (b) a novel neural representation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.03906","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/2106.03906/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":"2106.03906","created_at":"2026-07-05T02:47:10.166884+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.03906v1","created_at":"2026-07-05T02:47:10.166884+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.03906","created_at":"2026-07-05T02:47:10.166884+00:00"},{"alias_kind":"pith_short_12","alias_value":"SPQ7YVSAOG2O","created_at":"2026-07-05T02:47:10.166884+00:00"},{"alias_kind":"pith_short_16","alias_value":"SPQ7YVSAOG2OGQTA","created_at":"2026-07-05T02:47:10.166884+00:00"},{"alias_kind":"pith_short_8","alias_value":"SPQ7YVSA","created_at":"2026-07-05T02:47:10.166884+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SPQ7YVSAOG2OGQTAYZK5I2I6QS","json":"https://pith.science/pith/SPQ7YVSAOG2OGQTAYZK5I2I6QS.json","graph_json":"https://pith.science/api/pith-number/SPQ7YVSAOG2OGQTAYZK5I2I6QS/graph.json","events_json":"https://pith.science/api/pith-number/SPQ7YVSAOG2OGQTAYZK5I2I6QS/events.json","paper":"https://pith.science/paper/SPQ7YVSA"},"agent_actions":{"view_html":"https://pith.science/pith/SPQ7YVSAOG2OGQTAYZK5I2I6QS","download_json":"https://pith.science/pith/SPQ7YVSAOG2OGQTAYZK5I2I6QS.json","view_paper":"https://pith.science/paper/SPQ7YVSA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.03906&json=true","fetch_graph":"https://pith.science/api/pith-number/SPQ7YVSAOG2OGQTAYZK5I2I6QS/graph.json","fetch_events":"https://pith.science/api/pith-number/SPQ7YVSAOG2OGQTAYZK5I2I6QS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SPQ7YVSAOG2OGQTAYZK5I2I6QS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SPQ7YVSAOG2OGQTAYZK5I2I6QS/action/storage_attestation","attest_author":"https://pith.science/pith/SPQ7YVSAOG2OGQTAYZK5I2I6QS/action/author_attestation","sign_citation":"https://pith.science/pith/SPQ7YVSAOG2OGQTAYZK5I2I6QS/action/citation_signature","submit_replication":"https://pith.science/pith/SPQ7YVSAOG2OGQTAYZK5I2I6QS/action/replication_record"}},"created_at":"2026-07-05T02:47:10.166884+00:00","updated_at":"2026-07-05T02:47:10.166884+00:00"}