{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CLUF4EYQNQJILC4KWTMRUBPDRM","short_pith_number":"pith:CLUF4EYQ","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"},"canonical_sha256":"12e85e13106c12858b8ab4d91a05e38b0ef304ecffdfd2e213b1742b5ad9c40f","source":{"kind":"arxiv","id":"1805.03107","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03107","created_at":"2026-05-18T00:16:02Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03107v3","created_at":"2026-05-18T00:16:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03107","created_at":"2026-05-18T00:16:02Z"},{"alias_kind":"pith_short_12","alias_value":"CLUF4EYQNQJI","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CLUF4EYQNQJILC4K","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CLUF4EYQ","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CLUF4EYQNQJILC4KWTMRUBPDRM","target":"record","payload":{"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"},"canonical_sha256":"12e85e13106c12858b8ab4d91a05e38b0ef304ecffdfd2e213b1742b5ad9c40f","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"},"source_kind":"arxiv","source_id":"1805.03107","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:16:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7qtrohGd9iN5oSFfk5zow2j7WR04R6MAUDjg+pwe/EU3a9MS8faPvrTdbDvhFtFSG4yCfzdKyG/bDb65wdovAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:36:31.440424Z"},"content_sha256":"137f66db988d33fad0428a1fee0ebcb21932c2daf3f95c0962d394c84f056750","schema_version":"1.0","event_id":"sha256:137f66db988d33fad0428a1fee0ebcb21932c2daf3f95c0962d394c84f056750"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CLUF4EYQNQJILC4KWTMRUBPDRM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:16:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fXGXK0Ksqb9hveBwseEL5Z9m0vYAYLqydQZ4ilokV/e8Vy/q1KqeZZWAQiNmPohkkNSUcwES//pk9bTcqfJUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T14:36:31.441059Z"},"content_sha256":"1088939eb4ba12524a39b484b422679267cccecc8cb002ac738155e040b74282","schema_version":"1.0","event_id":"sha256:1088939eb4ba12524a39b484b422679267cccecc8cb002ac738155e040b74282"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CLUF4EYQNQJILC4KWTMRUBPDRM/bundle.json","state_url":"https://pith.science/pith/CLUF4EYQNQJILC4KWTMRUBPDRM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CLUF4EYQNQJILC4KWTMRUBPDRM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-29T14:36:31Z","links":{"resolver":"https://pith.science/pith/CLUF4EYQNQJILC4KWTMRUBPDRM","bundle":"https://pith.science/pith/CLUF4EYQNQJILC4KWTMRUBPDRM/bundle.json","state":"https://pith.science/pith/CLUF4EYQNQJILC4KWTMRUBPDRM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CLUF4EYQNQJILC4KWTMRUBPDRM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CLUF4EYQNQJILC4KWTMRUBPDRM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2eaf9b197590ccd5dd73afca70bec625c12b2d8e4a821bcb6defa9c7702d138f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2018-05-08T15:30:20Z","title_canon_sha256":"b00d0f71336bd33b7aadce57f6299208fb7da32ae1cc708bae6ea774f02a1b0a"},"schema_version":"1.0","source":{"id":"1805.03107","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.03107","created_at":"2026-05-18T00:16:02Z"},{"alias_kind":"arxiv_version","alias_value":"1805.03107v3","created_at":"2026-05-18T00:16:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.03107","created_at":"2026-05-18T00:16:02Z"},{"alias_kind":"pith_short_12","alias_value":"CLUF4EYQNQJI","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CLUF4EYQNQJILC4K","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CLUF4EYQ","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:1088939eb4ba12524a39b484b422679267cccecc8cb002ac738155e040b74282","target":"graph","created_at":"2026-05-18T00:16:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Cezary Kaliszyk, Josef Urban, Michael F\\\"arber","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2018-05-08T15:30:20Z","title":"Machine Learning Guidance and Proof Certification for Connection Tableaux"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.03107","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:137f66db988d33fad0428a1fee0ebcb21932c2daf3f95c0962d394c84f056750","target":"record","created_at":"2026-05-18T00:16:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2eaf9b197590ccd5dd73afca70bec625c12b2d8e4a821bcb6defa9c7702d138f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2018-05-08T15:30:20Z","title_canon_sha256":"b00d0f71336bd33b7aadce57f6299208fb7da32ae1cc708bae6ea774f02a1b0a"},"schema_version":"1.0","source":{"id":"1805.03107","kind":"arxiv","version":3}},"canonical_sha256":"12e85e13106c12858b8ab4d91a05e38b0ef304ecffdfd2e213b1742b5ad9c40f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12e85e13106c12858b8ab4d91a05e38b0ef304ecffdfd2e213b1742b5ad9c40f","first_computed_at":"2026-05-18T00:16:02.660158Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:02.660158Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4oK+gTTedlcBlxiFGz9ZhNaatXqPum1YwHPyrbBw+HVnExk2H9CFXOpRPiq6XQP0UiJm7OH+ob4pWzWKZrC2AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:02.660709Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.03107","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:137f66db988d33fad0428a1fee0ebcb21932c2daf3f95c0962d394c84f056750","sha256:1088939eb4ba12524a39b484b422679267cccecc8cb002ac738155e040b74282"],"state_sha256":"84e51a6903f497cd18efe06a9c0cae3ec1fd17f9ec00f932911a3c08388c922a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pmUDmiya4zSN3UQjdAdOssxyKutr7Ez21d4ksVaPNWVk7PaepgQjZ+p9QjJUT5rMo9n/9nTr2P3frKB6FK9oDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T14:36:31.444178Z","bundle_sha256":"48bf126e47532dedfa24f41135850b448a22df2443c249fca88dda751386d3a2"}}