{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:U2EJ6CWRJABUYMPTLASEIWJESJ","short_pith_number":"pith:U2EJ6CWR","schema_version":"1.0","canonical_sha256":"a6889f0ad148034c31f35824445924925eafe8a2d7b695eacebeda6583be1e24","source":{"kind":"arxiv","id":"cs/0508004","version":1},"attestation_state":"computed","paper":{"title":"A three-valued semantics for logic programmers","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Lee Naish","submitted_at":"2005-08-01T05:23:44Z","abstract_excerpt":"This paper describes a simpler way for programmers to reason about the correctness of their code. The study of semantics of logic programs has shown strong links between the model theoretic semantics (truth and falsity of atoms in the programmer's interpretation of a program), procedural semantics (for example, SLD resolution) and fixpoint semantics (which is useful for program analysis and alternative execution mechanisms). Most of this work assumes that intended interpretations are two-valued: a ground atom is true (and should succeed according to the procedural semantics) or false (and shou"},"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":"cs/0508004","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2005-08-01T05:23:44Z","cross_cats_sorted":[],"title_canon_sha256":"0e9c86156561ed1d6a169094b3d0b14f603eb06bc1d0a270b2050d71bd87844a","abstract_canon_sha256":"a610860b5ff6dede89f6c192fa3b4e66eb0f44eb923df4bf35318af547fee91c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:36.928538Z","signature_b64":"LIY3jkd3ASIGIK8MpraOELKmN5ao10PhrZuys3vZTlmdBbD3SyaXv3ekGF13OoYg08jTxZ4TBmS41XdudEbUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6889f0ad148034c31f35824445924925eafe8a2d7b695eacebeda6583be1e24","last_reissued_at":"2026-05-18T02:37:36.927913Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:36.927913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A three-valued semantics for logic programmers","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Lee Naish","submitted_at":"2005-08-01T05:23:44Z","abstract_excerpt":"This paper describes a simpler way for programmers to reason about the correctness of their code. The study of semantics of logic programs has shown strong links between the model theoretic semantics (truth and falsity of atoms in the programmer's interpretation of a program), procedural semantics (for example, SLD resolution) and fixpoint semantics (which is useful for program analysis and alternative execution mechanisms). Most of this work assumes that intended interpretations are two-valued: a ground atom is true (and should succeed according to the procedural semantics) or false (and shou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0508004","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"cs/0508004","created_at":"2026-05-18T02:37:36.928018+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0508004v1","created_at":"2026-05-18T02:37:36.928018+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0508004","created_at":"2026-05-18T02:37:36.928018+00:00"},{"alias_kind":"pith_short_12","alias_value":"U2EJ6CWRJABU","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"U2EJ6CWRJABUYMPT","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"U2EJ6CWR","created_at":"2026-05-18T12:25:53.335082+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/U2EJ6CWRJABUYMPTLASEIWJESJ","json":"https://pith.science/pith/U2EJ6CWRJABUYMPTLASEIWJESJ.json","graph_json":"https://pith.science/api/pith-number/U2EJ6CWRJABUYMPTLASEIWJESJ/graph.json","events_json":"https://pith.science/api/pith-number/U2EJ6CWRJABUYMPTLASEIWJESJ/events.json","paper":"https://pith.science/paper/U2EJ6CWR"},"agent_actions":{"view_html":"https://pith.science/pith/U2EJ6CWRJABUYMPTLASEIWJESJ","download_json":"https://pith.science/pith/U2EJ6CWRJABUYMPTLASEIWJESJ.json","view_paper":"https://pith.science/paper/U2EJ6CWR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0508004&json=true","fetch_graph":"https://pith.science/api/pith-number/U2EJ6CWRJABUYMPTLASEIWJESJ/graph.json","fetch_events":"https://pith.science/api/pith-number/U2EJ6CWRJABUYMPTLASEIWJESJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U2EJ6CWRJABUYMPTLASEIWJESJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U2EJ6CWRJABUYMPTLASEIWJESJ/action/storage_attestation","attest_author":"https://pith.science/pith/U2EJ6CWRJABUYMPTLASEIWJESJ/action/author_attestation","sign_citation":"https://pith.science/pith/U2EJ6CWRJABUYMPTLASEIWJESJ/action/citation_signature","submit_replication":"https://pith.science/pith/U2EJ6CWRJABUYMPTLASEIWJESJ/action/replication_record"}},"created_at":"2026-05-18T02:37:36.928018+00:00","updated_at":"2026-05-18T02:37:36.928018+00:00"}