{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:K64FYBXHBNYCY5NNEQFLLJO53Y","short_pith_number":"pith:K64FYBXH","canonical_record":{"source":{"id":"2209.12592","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2022-09-26T11:23:17Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3049940e33177964c62bfb7789da41e6b757c08887f6ac0ed77d9ba3c42ae9db","abstract_canon_sha256":"cb41680c996dd15bc12ebe029f9f2445fbd21a28efcd182ecfb258673b78aac9"},"schema_version":"1.0"},"canonical_sha256":"57b85c06e70b702c75ad240ab5a5ddde26f04900cc56c2a6903432f4fe8c24cf","source":{"kind":"arxiv","id":"2209.12592","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.12592","created_at":"2026-07-05T05:00:53Z"},{"alias_kind":"arxiv_version","alias_value":"2209.12592v1","created_at":"2026-07-05T05:00:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.12592","created_at":"2026-07-05T05:00:53Z"},{"alias_kind":"pith_short_12","alias_value":"K64FYBXHBNYC","created_at":"2026-07-05T05:00:53Z"},{"alias_kind":"pith_short_16","alias_value":"K64FYBXHBNYCY5NN","created_at":"2026-07-05T05:00:53Z"},{"alias_kind":"pith_short_8","alias_value":"K64FYBXH","created_at":"2026-07-05T05:00:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:K64FYBXHBNYCY5NNEQFLLJO53Y","target":"record","payload":{"canonical_record":{"source":{"id":"2209.12592","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2022-09-26T11:23:17Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3049940e33177964c62bfb7789da41e6b757c08887f6ac0ed77d9ba3c42ae9db","abstract_canon_sha256":"cb41680c996dd15bc12ebe029f9f2445fbd21a28efcd182ecfb258673b78aac9"},"schema_version":"1.0"},"canonical_sha256":"57b85c06e70b702c75ad240ab5a5ddde26f04900cc56c2a6903432f4fe8c24cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:00:53.948129Z","signature_b64":"fzN51/y/SjhJjL+za9hMY1K03zBgMRawarpV3qb0jprKg/XqPy5K0/TvFDDlxZBHpDcBRdKWrpRU7T1ZknWaBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57b85c06e70b702c75ad240ab5a5ddde26f04900cc56c2a6903432f4fe8c24cf","last_reissued_at":"2026-07-05T05:00:53.947796Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:00:53.947796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2209.12592","source_version":1,"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-07-05T05:00:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+gn+dI2IeEd3oQBJTRPXjrCO/IpbUUWiCzeeuZnvc5y3Bp69oYuvetsvwbHFeOKnZtF4lXByYQEp0Q9qh77gCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T14:54:39.018596Z"},"content_sha256":"aab6c8e788d297c10f72dd5a1c36be5df1f50cec055c1218e5feabbc52a2bd50","schema_version":"1.0","event_id":"sha256:aab6c8e788d297c10f72dd5a1c36be5df1f50cec055c1218e5feabbc52a2bd50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:K64FYBXHBNYCY5NNEQFLLJO53Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generating Compressed Combinatory Proof Structures -- An Approach to Automated First-Order Theorem Proving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Christoph Wernhard","submitted_at":"2022-09-26T11:23:17Z","abstract_excerpt":"Representing a proof tree by a combinator term that reduces to the tree lets subtle forms of duplication within the tree materialize as duplicated subterms of the combinator term. In a DAG representation of the combinator term these straightforwardly factor into shared subgraphs. To search for proofs, combinator terms can be enumerated, like clausal tableaux, interwoven with unification of formulas that are associated with nodes of the enumerated structures. To restrict the search space, the enumeration can be based on proof schemas defined as parameterized combinator terms. We introduce here "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.12592","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/2209.12592/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"},"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-07-05T05:00:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CMmt1+Ybf74pblMT8j1vi/TZ62LeUefKv2VazMv0sHpEvK9zm/UtQP9wT54Pwt2+SZPF6EaH6mLPTPv70eU+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T14:54:39.019690Z"},"content_sha256":"863b5e7780358e2b676ccc387c3e00b0f60a651178d7c2397d382d5c4b1d24ff","schema_version":"1.0","event_id":"sha256:863b5e7780358e2b676ccc387c3e00b0f60a651178d7c2397d382d5c4b1d24ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K64FYBXHBNYCY5NNEQFLLJO53Y/bundle.json","state_url":"https://pith.science/pith/K64FYBXHBNYCY5NNEQFLLJO53Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K64FYBXHBNYCY5NNEQFLLJO53Y/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-08-13T14:54:39Z","links":{"resolver":"https://pith.science/pith/K64FYBXHBNYCY5NNEQFLLJO53Y","bundle":"https://pith.science/pith/K64FYBXHBNYCY5NNEQFLLJO53Y/bundle.json","state":"https://pith.science/pith/K64FYBXHBNYCY5NNEQFLLJO53Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K64FYBXHBNYCY5NNEQFLLJO53Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:K64FYBXHBNYCY5NNEQFLLJO53Y","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":"cb41680c996dd15bc12ebe029f9f2445fbd21a28efcd182ecfb258673b78aac9","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2022-09-26T11:23:17Z","title_canon_sha256":"3049940e33177964c62bfb7789da41e6b757c08887f6ac0ed77d9ba3c42ae9db"},"schema_version":"1.0","source":{"id":"2209.12592","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2209.12592","created_at":"2026-07-05T05:00:53Z"},{"alias_kind":"arxiv_version","alias_value":"2209.12592v1","created_at":"2026-07-05T05:00:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.12592","created_at":"2026-07-05T05:00:53Z"},{"alias_kind":"pith_short_12","alias_value":"K64FYBXHBNYC","created_at":"2026-07-05T05:00:53Z"},{"alias_kind":"pith_short_16","alias_value":"K64FYBXHBNYCY5NN","created_at":"2026-07-05T05:00:53Z"},{"alias_kind":"pith_short_8","alias_value":"K64FYBXH","created_at":"2026-07-05T05:00:53Z"}],"graph_snapshots":[{"event_id":"sha256:863b5e7780358e2b676ccc387c3e00b0f60a651178d7c2397d382d5c4b1d24ff","target":"graph","created_at":"2026-07-05T05:00:53Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2209.12592/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Representing a proof tree by a combinator term that reduces to the tree lets subtle forms of duplication within the tree materialize as duplicated subterms of the combinator term. In a DAG representation of the combinator term these straightforwardly factor into shared subgraphs. To search for proofs, combinator terms can be enumerated, like clausal tableaux, interwoven with unification of formulas that are associated with nodes of the enumerated structures. To restrict the search space, the enumeration can be based on proof schemas defined as parameterized combinator terms. We introduce here ","authors_text":"Christoph Wernhard","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2022-09-26T11:23:17Z","title":"Generating Compressed Combinatory Proof Structures -- An Approach to Automated First-Order Theorem Proving"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.12592","kind":"arxiv","version":1},"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:aab6c8e788d297c10f72dd5a1c36be5df1f50cec055c1218e5feabbc52a2bd50","target":"record","created_at":"2026-07-05T05:00:53Z","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":"cb41680c996dd15bc12ebe029f9f2445fbd21a28efcd182ecfb258673b78aac9","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2022-09-26T11:23:17Z","title_canon_sha256":"3049940e33177964c62bfb7789da41e6b757c08887f6ac0ed77d9ba3c42ae9db"},"schema_version":"1.0","source":{"id":"2209.12592","kind":"arxiv","version":1}},"canonical_sha256":"57b85c06e70b702c75ad240ab5a5ddde26f04900cc56c2a6903432f4fe8c24cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57b85c06e70b702c75ad240ab5a5ddde26f04900cc56c2a6903432f4fe8c24cf","first_computed_at":"2026-07-05T05:00:53.947796Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:00:53.947796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fzN51/y/SjhJjL+za9hMY1K03zBgMRawarpV3qb0jprKg/XqPy5K0/TvFDDlxZBHpDcBRdKWrpRU7T1ZknWaBA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:00:53.948129Z","signed_message":"canonical_sha256_bytes"},"source_id":"2209.12592","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aab6c8e788d297c10f72dd5a1c36be5df1f50cec055c1218e5feabbc52a2bd50","sha256:863b5e7780358e2b676ccc387c3e00b0f60a651178d7c2397d382d5c4b1d24ff"],"state_sha256":"23a65e392ae010e3ef53500c2ebdd00f22014b8e1c0d918433da2829ca9cdb51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lbbANP9a1XzzGF4jrbxCVahb/MjJO4qeUYjE6vnR8PGD5K87/07pSsP0a1Gdt2EOWK1yVvDQs1UQ+t1C8dMtCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T14:54:39.031617Z","bundle_sha256":"d8eaeb140def8045b46baab313cc45a967eba22eac0fdbf7dfb3027eddc4e5b3"}}