{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WNQCJ2JTZU7IOQPUMJNCKBZLAS","short_pith_number":"pith:WNQCJ2JT","canonical_record":{"source":{"id":"1809.04772","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-09-13T04:49:05Z","cross_cats_sorted":[],"title_canon_sha256":"46d97af07b6a1ec91af66820d8981862f12ba751c7495a93ee86ae47dbb6e2bd","abstract_canon_sha256":"c7be100de0b72074f7bbf5b6004f158e6eebbf06000d9e8a9167918bdd01f1a6"},"schema_version":"1.0"},"canonical_sha256":"b36024e933cd3e8741f4625a25072b0486a1c729096d115d6366e8e3181050fd","source":{"kind":"arxiv","id":"1809.04772","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04772","created_at":"2026-05-18T00:05:49Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04772v1","created_at":"2026-05-18T00:05:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04772","created_at":"2026-05-18T00:05:49Z"},{"alias_kind":"pith_short_12","alias_value":"WNQCJ2JTZU7I","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WNQCJ2JTZU7IOQPU","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WNQCJ2JT","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WNQCJ2JTZU7IOQPUMJNCKBZLAS","target":"record","payload":{"canonical_record":{"source":{"id":"1809.04772","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-09-13T04:49:05Z","cross_cats_sorted":[],"title_canon_sha256":"46d97af07b6a1ec91af66820d8981862f12ba751c7495a93ee86ae47dbb6e2bd","abstract_canon_sha256":"c7be100de0b72074f7bbf5b6004f158e6eebbf06000d9e8a9167918bdd01f1a6"},"schema_version":"1.0"},"canonical_sha256":"b36024e933cd3e8741f4625a25072b0486a1c729096d115d6366e8e3181050fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:49.669533Z","signature_b64":"3EVAxUhSqPV1kscrE74ksbqv+SF0sYzKwvtUpJj36Uodsauw/Pq1CeSKAIYBChim+5nkR8jQ5EByOhauVckeBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b36024e933cd3e8741f4625a25072b0486a1c729096d115d6366e8e3181050fd","last_reissued_at":"2026-05-18T00:05:49.668860Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:49.668860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1809.04772","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-05-18T00:05:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d9mKvS/RQ5pzoqBGd4RtkXMh6Mln3Kk181RnnbDiskWALKIkN0fNyiYuhrQTkOLULM1+GduVPOHoJKkTVPIlAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:28:30.388602Z"},"content_sha256":"746396a5cc8d8fec9a1c461a75cfc717bd04f2665024b6f8e6f0d615f14c3a11","schema_version":"1.0","event_id":"sha256:746396a5cc8d8fec9a1c461a75cfc717bd04f2665024b6f8e6f0d615f14c3a11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WNQCJ2JTZU7IOQPUMJNCKBZLAS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Simple Functional Presentation and an Inductive Correctness Proof of the Horn Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Ant\\'onio Ravara (NOVA LINCS, Dep of Informatics, FCT, NOVA University of Lisbon)","submitted_at":"2018-09-13T04:49:05Z","abstract_excerpt":"We present a recursive formulation of the Horn algorithm for deciding the satisfiability of propositional clauses. The usual presentations in imperative pseudo-code are informal and not suitable for simple proofs of its main properties.  By defining the algorithm as a recursive function (computing a least fixed-point), we achieve: 1) a concise, yet rigorous, formalisation; 2) a clear form of visualising executions of the algorithm, step-by-step; 3) precise results, simple to state and with clean inductive proofs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04772","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"},"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:05:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RM+jT+b1543NRP2yKrVeOYIC2ZtjItkjLMbNTWLhtBkfj6rwBvmvks5dAOdeKxTVLRBxp6vX/qJyZFENqLvhBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:28:30.389329Z"},"content_sha256":"ce59a6aab9ce1e8ff66dae3f241c1d029b3e7d53735595b57c8f03b26eb18351","schema_version":"1.0","event_id":"sha256:ce59a6aab9ce1e8ff66dae3f241c1d029b3e7d53735595b57c8f03b26eb18351"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WNQCJ2JTZU7IOQPUMJNCKBZLAS/bundle.json","state_url":"https://pith.science/pith/WNQCJ2JTZU7IOQPUMJNCKBZLAS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WNQCJ2JTZU7IOQPUMJNCKBZLAS/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-30T09:28:30Z","links":{"resolver":"https://pith.science/pith/WNQCJ2JTZU7IOQPUMJNCKBZLAS","bundle":"https://pith.science/pith/WNQCJ2JTZU7IOQPUMJNCKBZLAS/bundle.json","state":"https://pith.science/pith/WNQCJ2JTZU7IOQPUMJNCKBZLAS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WNQCJ2JTZU7IOQPUMJNCKBZLAS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WNQCJ2JTZU7IOQPUMJNCKBZLAS","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":"c7be100de0b72074f7bbf5b6004f158e6eebbf06000d9e8a9167918bdd01f1a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-09-13T04:49:05Z","title_canon_sha256":"46d97af07b6a1ec91af66820d8981862f12ba751c7495a93ee86ae47dbb6e2bd"},"schema_version":"1.0","source":{"id":"1809.04772","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04772","created_at":"2026-05-18T00:05:49Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04772v1","created_at":"2026-05-18T00:05:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04772","created_at":"2026-05-18T00:05:49Z"},{"alias_kind":"pith_short_12","alias_value":"WNQCJ2JTZU7I","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WNQCJ2JTZU7IOQPU","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WNQCJ2JT","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:ce59a6aab9ce1e8ff66dae3f241c1d029b3e7d53735595b57c8f03b26eb18351","target":"graph","created_at":"2026-05-18T00:05:49Z","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":"We present a recursive formulation of the Horn algorithm for deciding the satisfiability of propositional clauses. The usual presentations in imperative pseudo-code are informal and not suitable for simple proofs of its main properties.  By defining the algorithm as a recursive function (computing a least fixed-point), we achieve: 1) a concise, yet rigorous, formalisation; 2) a clear form of visualising executions of the algorithm, step-by-step; 3) precise results, simple to state and with clean inductive proofs.","authors_text":"Ant\\'onio Ravara (NOVA LINCS, Dep of Informatics, FCT, NOVA University of Lisbon)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-09-13T04:49:05Z","title":"A Simple Functional Presentation and an Inductive Correctness Proof of the Horn Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04772","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:746396a5cc8d8fec9a1c461a75cfc717bd04f2665024b6f8e6f0d615f14c3a11","target":"record","created_at":"2026-05-18T00:05:49Z","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":"c7be100de0b72074f7bbf5b6004f158e6eebbf06000d9e8a9167918bdd01f1a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-09-13T04:49:05Z","title_canon_sha256":"46d97af07b6a1ec91af66820d8981862f12ba751c7495a93ee86ae47dbb6e2bd"},"schema_version":"1.0","source":{"id":"1809.04772","kind":"arxiv","version":1}},"canonical_sha256":"b36024e933cd3e8741f4625a25072b0486a1c729096d115d6366e8e3181050fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b36024e933cd3e8741f4625a25072b0486a1c729096d115d6366e8e3181050fd","first_computed_at":"2026-05-18T00:05:49.668860Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:49.668860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3EVAxUhSqPV1kscrE74ksbqv+SF0sYzKwvtUpJj36Uodsauw/Pq1CeSKAIYBChim+5nkR8jQ5EByOhauVckeBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:49.669533Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.04772","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:746396a5cc8d8fec9a1c461a75cfc717bd04f2665024b6f8e6f0d615f14c3a11","sha256:ce59a6aab9ce1e8ff66dae3f241c1d029b3e7d53735595b57c8f03b26eb18351"],"state_sha256":"3de3fd64ebe1cd83dbf707165ec054c7ee5201ba2a3734540d75c4c4242b5589"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"agg+Ungorc92mO4unXceIpZ9bR4Y6Y6MpGX0AZmJSJ6wJf+puN0PdRF86FPt6vYm8DYWqehJT8S77/QmmEptDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:28:30.393402Z","bundle_sha256":"a1214ce6d1a7da32801687c8aa8db4190cca69e7b7dd1ec48bff8e5108945860"}}