{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CLUF4EYQNQJILC4KWTMRUBPDRM","short_pith_number":"pith:CLUF4EYQ","schema_version":"1.0","canonical_sha256":"12e85e13106c12858b8ab4d91a05e38b0ef304ecffdfd2e213b1742b5ad9c40f","source":{"kind":"arxiv","id":"1805.03107","version":3},"attestation_state":"computed","paper":{"title":"Machine Learning Guidance and Proof Certification for Connection Tableaux","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Cezary Kaliszyk, Josef Urban, Michael F\\\"arber","submitted_at":"2018-05-08T15:30:20Z","abstract_excerpt":"Connection calculi allow for very compact implementations of goal-directed proof search. We give an overview of our work related to connection tableaux calculi: First, we show optimised functional implementations of clausal and nonclausal proof search, including a consistent Skolemisation procedure for machine learning. Then, we show two guidance methods based on machine learning, namely reordering of proof steps with Naive Bayesian probablities, and expansion of a proof search tree with Monte Carlo Tree Search. Finally, we give a translation of connection proofs to LK, enabling proof certific"},"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":"1805.03107","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2018-05-08T15:30:20Z","cross_cats_sorted":[],"title_canon_sha256":"b00d0f71336bd33b7aadce57f6299208fb7da32ae1cc708bae6ea774f02a1b0a","abstract_canon_sha256":"2eaf9b197590ccd5dd73afca70bec625c12b2d8e4a821bcb6defa9c7702d138f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:02.660709Z","signature_b64":"4oK+gTTedlcBlxiFGz9ZhNaatXqPum1YwHPyrbBw+HVnExk2H9CFXOpRPiq6XQP0UiJm7OH+ob4pWzWKZrC2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12e85e13106c12858b8ab4d91a05e38b0ef304ecffdfd2e213b1742b5ad9c40f","last_reissued_at":"2026-05-18T00:16:02.660158Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:02.660158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Machine Learning Guidance and Proof Certification for Connection Tableaux","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Cezary Kaliszyk, Josef Urban, Michael F\\\"arber","submitted_at":"2018-05-08T15:30:20Z","abstract_excerpt":"Connection calculi allow for very compact implementations of goal-directed proof search. We give an overview of our work related to connection tableaux calculi: First, we show optimised functional implementations of clausal and nonclausal proof search, including a consistent Skolemisation procedure for machine learning. Then, we show two guidance methods based on machine learning, namely reordering of proof steps with Naive Bayesian probablities, and expansion of a proof search tree with Monte Carlo Tree Search. Finally, we give a translation of connection proofs to LK, enabling proof certific"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03107","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":""},"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":"1805.03107","created_at":"2026-05-18T00:16:02.660242+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.03107v3","created_at":"2026-05-18T00:16:02.660242+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03107","created_at":"2026-05-18T00:16:02.660242+00:00"},{"alias_kind":"pith_short_12","alias_value":"CLUF4EYQNQJI","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CLUF4EYQNQJILC4K","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CLUF4EYQ","created_at":"2026-05-18T12:32:16.446611+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/CLUF4EYQNQJILC4KWTMRUBPDRM","json":"https://pith.science/pith/CLUF4EYQNQJILC4KWTMRUBPDRM.json","graph_json":"https://pith.science/api/pith-number/CLUF4EYQNQJILC4KWTMRUBPDRM/graph.json","events_json":"https://pith.science/api/pith-number/CLUF4EYQNQJILC4KWTMRUBPDRM/events.json","paper":"https://pith.science/paper/CLUF4EYQ"},"agent_actions":{"view_html":"https://pith.science/pith/CLUF4EYQNQJILC4KWTMRUBPDRM","download_json":"https://pith.science/pith/CLUF4EYQNQJILC4KWTMRUBPDRM.json","view_paper":"https://pith.science/paper/CLUF4EYQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.03107&json=true","fetch_graph":"https://pith.science/api/pith-number/CLUF4EYQNQJILC4KWTMRUBPDRM/graph.json","fetch_events":"https://pith.science/api/pith-number/CLUF4EYQNQJILC4KWTMRUBPDRM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CLUF4EYQNQJILC4KWTMRUBPDRM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CLUF4EYQNQJILC4KWTMRUBPDRM/action/storage_attestation","attest_author":"https://pith.science/pith/CLUF4EYQNQJILC4KWTMRUBPDRM/action/author_attestation","sign_citation":"https://pith.science/pith/CLUF4EYQNQJILC4KWTMRUBPDRM/action/citation_signature","submit_replication":"https://pith.science/pith/CLUF4EYQNQJILC4KWTMRUBPDRM/action/replication_record"}},"created_at":"2026-05-18T00:16:02.660242+00:00","updated_at":"2026-05-18T00:16:02.660242+00:00"}