{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:323JVV36PHUN47D43K4QCT5C7U","short_pith_number":"pith:323JVV36","schema_version":"1.0","canonical_sha256":"deb69ad77e79e8de7c7cdab9014fa2fd1d11c3fa58475319860c9e41d67315dd","source":{"kind":"arxiv","id":"1903.03182","version":1},"attestation_state":"computed","paper":{"title":"ENIGMA-NG: Efficient Neural and Gradient-Boosted Inference Guidance for E","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.LO"],"primary_cat":"cs.AI","authors_text":"Jan Jakub\\r{u}v, Josef Urban, Karel Chvalovsk\\'y, Martin Suda","submitted_at":"2019-03-07T20:54:12Z","abstract_excerpt":"We describe an efficient implementation of clause guidance in saturation-based automated theorem provers extending the ENIGMA approach. Unlike in the first ENIGMA implementation where fast linear classifier is trained and used together with manually engineered features, we have started to experiment with more sophisticated state-of-the-art machine learning methods such as gradient boosted trees and recursive neural networks. In particular the latter approach poses challenges in terms of efficiency of clause evaluation, however, we show that deep integration of the neural evaluation with the AT"},"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":"1903.03182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-03-07T20:54:12Z","cross_cats_sorted":["cs.LG","cs.LO"],"title_canon_sha256":"f7ceefedf20e528f22301a7ecec4d8cdfd06465ee629088c3ae5474f7d411d33","abstract_canon_sha256":"0e31725e80713bdf81cd20211621cae71e5e9d9b7ea296f4251d019967d32cf0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:46.194525Z","signature_b64":"UX3pGlCoQI6iZYLzXm6sY4tE5RDEFXQgH+mHantZ6akk8po9lMlDIyN5WF7W6NwYT4rb9Q0YkUugQIhq6AxiDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"deb69ad77e79e8de7c7cdab9014fa2fd1d11c3fa58475319860c9e41d67315dd","last_reissued_at":"2026-05-17T23:51:46.193974Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:46.193974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ENIGMA-NG: Efficient Neural and Gradient-Boosted Inference Guidance for E","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.LO"],"primary_cat":"cs.AI","authors_text":"Jan Jakub\\r{u}v, Josef Urban, Karel Chvalovsk\\'y, Martin Suda","submitted_at":"2019-03-07T20:54:12Z","abstract_excerpt":"We describe an efficient implementation of clause guidance in saturation-based automated theorem provers extending the ENIGMA approach. Unlike in the first ENIGMA implementation where fast linear classifier is trained and used together with manually engineered features, we have started to experiment with more sophisticated state-of-the-art machine learning methods such as gradient boosted trees and recursive neural networks. In particular the latter approach poses challenges in terms of efficiency of clause evaluation, however, we show that deep integration of the neural evaluation with the AT"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.03182","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":""},"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":"1903.03182","created_at":"2026-05-17T23:51:46.194055+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.03182v1","created_at":"2026-05-17T23:51:46.194055+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.03182","created_at":"2026-05-17T23:51:46.194055+00:00"},{"alias_kind":"pith_short_12","alias_value":"323JVV36PHUN","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"323JVV36PHUN47D4","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"323JVV36","created_at":"2026-05-18T12:33:07.085635+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/323JVV36PHUN47D43K4QCT5C7U","json":"https://pith.science/pith/323JVV36PHUN47D43K4QCT5C7U.json","graph_json":"https://pith.science/api/pith-number/323JVV36PHUN47D43K4QCT5C7U/graph.json","events_json":"https://pith.science/api/pith-number/323JVV36PHUN47D43K4QCT5C7U/events.json","paper":"https://pith.science/paper/323JVV36"},"agent_actions":{"view_html":"https://pith.science/pith/323JVV36PHUN47D43K4QCT5C7U","download_json":"https://pith.science/pith/323JVV36PHUN47D43K4QCT5C7U.json","view_paper":"https://pith.science/paper/323JVV36","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.03182&json=true","fetch_graph":"https://pith.science/api/pith-number/323JVV36PHUN47D43K4QCT5C7U/graph.json","fetch_events":"https://pith.science/api/pith-number/323JVV36PHUN47D43K4QCT5C7U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/323JVV36PHUN47D43K4QCT5C7U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/323JVV36PHUN47D43K4QCT5C7U/action/storage_attestation","attest_author":"https://pith.science/pith/323JVV36PHUN47D43K4QCT5C7U/action/author_attestation","sign_citation":"https://pith.science/pith/323JVV36PHUN47D43K4QCT5C7U/action/citation_signature","submit_replication":"https://pith.science/pith/323JVV36PHUN47D43K4QCT5C7U/action/replication_record"}},"created_at":"2026-05-17T23:51:46.194055+00:00","updated_at":"2026-05-17T23:51:46.194055+00:00"}