{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GCWTDJ3IKX3IO7T5NDVB5JOVTW","short_pith_number":"pith:GCWTDJ3I","canonical_record":{"source":{"id":"1511.07865","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-11-24T20:53:04Z","cross_cats_sorted":[],"title_canon_sha256":"1847db2bf2f1e99b09d639b1c7c8c04345abdabc5ffe0ddf744bc9403a68aa52","abstract_canon_sha256":"b5adf8ae235a69c38d5ce94af76a8f92d68a43817009a4a276abc9369fd1f4bb"},"schema_version":"1.0"},"canonical_sha256":"30ad31a76855f6877e7d68ea1ea5d59d9b390b2d3b9278b30a90a70b857ba644","source":{"kind":"arxiv","id":"1511.07865","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07865","created_at":"2026-05-18T00:45:02Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07865v2","created_at":"2026-05-18T00:45:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07865","created_at":"2026-05-18T00:45:02Z"},{"alias_kind":"pith_short_12","alias_value":"GCWTDJ3IKX3I","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GCWTDJ3IKX3IO7T5","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GCWTDJ3I","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GCWTDJ3IKX3IO7T5NDVB5JOVTW","target":"record","payload":{"canonical_record":{"source":{"id":"1511.07865","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-11-24T20:53:04Z","cross_cats_sorted":[],"title_canon_sha256":"1847db2bf2f1e99b09d639b1c7c8c04345abdabc5ffe0ddf744bc9403a68aa52","abstract_canon_sha256":"b5adf8ae235a69c38d5ce94af76a8f92d68a43817009a4a276abc9369fd1f4bb"},"schema_version":"1.0"},"canonical_sha256":"30ad31a76855f6877e7d68ea1ea5d59d9b390b2d3b9278b30a90a70b857ba644","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:02.750173Z","signature_b64":"kTVn7/o5DJ6JI7JKxc2Q/y/WYxNQHwlthWcRKzee1NBq87nzD3EYnW2D0HXKqZf2FP9bhs47KWe84HHn6MIrDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30ad31a76855f6877e7d68ea1ea5d59d9b390b2d3b9278b30a90a70b857ba644","last_reissued_at":"2026-05-18T00:45:02.749702Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:02.749702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.07865","source_version":2,"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:45:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y1BaVHJGP0E2c6HA6T8nr8xVad3m+trpDBID1d5HzH72OQRKXaku4RmCh4aqQ0hIGlo0gXvQoOjKihBghdROCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:37:25.829764Z"},"content_sha256":"4f5a7e4f3b14c423a3cc336205500e302fac8d3c2dd7d8f62dd23de1ce0c40a1","schema_version":"1.0","event_id":"sha256:4f5a7e4f3b14c423a3cc336205500e302fac8d3c2dd7d8f62dd23de1ce0c40a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GCWTDJ3IKX3IO7T5NDVB5JOVTW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Structural Resolution: a Framework for Coinductive Proof Search and Proof Construction in Horn Clause Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ekaterina Komendantskaya, Martin Schmidt, Patricia Johann","submitted_at":"2015-11-24T20:53:04Z","abstract_excerpt":"Logic programming (LP) is a programming language based on first-order Horn clause logic that uses SLD-resolution as a semi-decision procedure. Finite SLD-computations are inductively sound and complete with respect to least Herbrand models of logic programs. Dually, the corecursive approach to SLD-resolution views infinite SLD-computations as successively approximating infinite terms contained in programs' greatest complete Herbrand models. State-of-the-art algorithms implementing corecursion in LP are based on loop detection. However, such algorithms support inference of logical entailment on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07865","kind":"arxiv","version":2},"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:45:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kpHM/STqzjhwDYHKGTx6cm9vnJKdgCiIaDUdFIJSVi+rk9IP3hrQUjqIvnfXV6NVC/hHSTyt4+nGsPCWM8+VDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:37:25.830110Z"},"content_sha256":"dc179bf72ae30c9036ee82de1eb3d9c803bcd7fd25d463829d68bc4726f5e75e","schema_version":"1.0","event_id":"sha256:dc179bf72ae30c9036ee82de1eb3d9c803bcd7fd25d463829d68bc4726f5e75e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GCWTDJ3IKX3IO7T5NDVB5JOVTW/bundle.json","state_url":"https://pith.science/pith/GCWTDJ3IKX3IO7T5NDVB5JOVTW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GCWTDJ3IKX3IO7T5NDVB5JOVTW/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-06-03T06:37:25Z","links":{"resolver":"https://pith.science/pith/GCWTDJ3IKX3IO7T5NDVB5JOVTW","bundle":"https://pith.science/pith/GCWTDJ3IKX3IO7T5NDVB5JOVTW/bundle.json","state":"https://pith.science/pith/GCWTDJ3IKX3IO7T5NDVB5JOVTW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GCWTDJ3IKX3IO7T5NDVB5JOVTW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GCWTDJ3IKX3IO7T5NDVB5JOVTW","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":"b5adf8ae235a69c38d5ce94af76a8f92d68a43817009a4a276abc9369fd1f4bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-11-24T20:53:04Z","title_canon_sha256":"1847db2bf2f1e99b09d639b1c7c8c04345abdabc5ffe0ddf744bc9403a68aa52"},"schema_version":"1.0","source":{"id":"1511.07865","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07865","created_at":"2026-05-18T00:45:02Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07865v2","created_at":"2026-05-18T00:45:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07865","created_at":"2026-05-18T00:45:02Z"},{"alias_kind":"pith_short_12","alias_value":"GCWTDJ3IKX3I","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GCWTDJ3IKX3IO7T5","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GCWTDJ3I","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:dc179bf72ae30c9036ee82de1eb3d9c803bcd7fd25d463829d68bc4726f5e75e","target":"graph","created_at":"2026-05-18T00:45: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":"Logic programming (LP) is a programming language based on first-order Horn clause logic that uses SLD-resolution as a semi-decision procedure. Finite SLD-computations are inductively sound and complete with respect to least Herbrand models of logic programs. Dually, the corecursive approach to SLD-resolution views infinite SLD-computations as successively approximating infinite terms contained in programs' greatest complete Herbrand models. State-of-the-art algorithms implementing corecursion in LP are based on loop detection. However, such algorithms support inference of logical entailment on","authors_text":"Ekaterina Komendantskaya, Martin Schmidt, Patricia Johann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-11-24T20:53:04Z","title":"Structural Resolution: a Framework for Coinductive Proof Search and Proof Construction in Horn Clause Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07865","kind":"arxiv","version":2},"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:4f5a7e4f3b14c423a3cc336205500e302fac8d3c2dd7d8f62dd23de1ce0c40a1","target":"record","created_at":"2026-05-18T00:45: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":"b5adf8ae235a69c38d5ce94af76a8f92d68a43817009a4a276abc9369fd1f4bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-11-24T20:53:04Z","title_canon_sha256":"1847db2bf2f1e99b09d639b1c7c8c04345abdabc5ffe0ddf744bc9403a68aa52"},"schema_version":"1.0","source":{"id":"1511.07865","kind":"arxiv","version":2}},"canonical_sha256":"30ad31a76855f6877e7d68ea1ea5d59d9b390b2d3b9278b30a90a70b857ba644","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30ad31a76855f6877e7d68ea1ea5d59d9b390b2d3b9278b30a90a70b857ba644","first_computed_at":"2026-05-18T00:45:02.749702Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:02.749702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kTVn7/o5DJ6JI7JKxc2Q/y/WYxNQHwlthWcRKzee1NBq87nzD3EYnW2D0HXKqZf2FP9bhs47KWe84HHn6MIrDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:02.750173Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.07865","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f5a7e4f3b14c423a3cc336205500e302fac8d3c2dd7d8f62dd23de1ce0c40a1","sha256:dc179bf72ae30c9036ee82de1eb3d9c803bcd7fd25d463829d68bc4726f5e75e"],"state_sha256":"e500340a61da17d5f04cddadc31bb63674336440579dbb311e8bc0900df87154"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tk8tzx0nDceGnigobETAQp5kmlWpW2XGrZXsSJ+HC7IYWFOxBae/qUSHJhXTFGIFwc1yBUOCv6E8rLTGAJ/0Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:37:25.832181Z","bundle_sha256":"9a28dfd2e3b0aba73c2c1a5fe9eeadded3aecf787e9d3f857b2bb3c3735f1687"}}