{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JTEBYEGIJEZCU4CEK7M2R2PEAI","short_pith_number":"pith:JTEBYEGI","schema_version":"1.0","canonical_sha256":"4cc81c10c849322a704457d9a8e9e4020e497ba2280651a05a7b2214cb274c0e","source":{"kind":"arxiv","id":"1607.01590","version":1},"attestation_state":"computed","paper":{"title":"Indexing dif/2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Stefan Kral, Ulrich Neumerkel","submitted_at":"2016-07-06T12:27:45Z","abstract_excerpt":"Many Prolog programs are unnecessarily impure because of inadequate means to express syntactic inequality. While the frequently provided built-in `dif/2` is able to correctly describe expected answers, its direct use in programs often leads to overly complex and inefficient definitions --- mainly due to the lack of adequate indexing mechanisms. We propose to overcome these problems by using a new predicate that subsumes both equality and inequality via reification. Code complexity is reduced with a monotonic, higher-order if-then-else construct based on `call/N`. For comparable correct uses of"},"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":"1607.01590","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-07-06T12:27:45Z","cross_cats_sorted":[],"title_canon_sha256":"162663b5f14f30ad928ed713033970844f1c04ea5ba9fbb1e2e46de9f32eae88","abstract_canon_sha256":"74714ae5b956940dd65a3159437c8a2c956d0ecc95f2d346212eeb4d87563ff7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:26.024085Z","signature_b64":"l5fNqr+sdddkKWYuhHItvzDnGu0u7kFP93IFtcNj0HdlcHBTdIEN34OXnXnzHGv99ACufnuqETau9JhiiE4GBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cc81c10c849322a704457d9a8e9e4020e497ba2280651a05a7b2214cb274c0e","last_reissued_at":"2026-05-18T01:11:26.023605Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:26.023605Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Indexing dif/2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Stefan Kral, Ulrich Neumerkel","submitted_at":"2016-07-06T12:27:45Z","abstract_excerpt":"Many Prolog programs are unnecessarily impure because of inadequate means to express syntactic inequality. While the frequently provided built-in `dif/2` is able to correctly describe expected answers, its direct use in programs often leads to overly complex and inefficient definitions --- mainly due to the lack of adequate indexing mechanisms. We propose to overcome these problems by using a new predicate that subsumes both equality and inequality via reification. Code complexity is reduced with a monotonic, higher-order if-then-else construct based on `call/N`. For comparable correct uses of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.01590","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":"1607.01590","created_at":"2026-05-18T01:11:26.023671+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.01590v1","created_at":"2026-05-18T01:11:26.023671+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.01590","created_at":"2026-05-18T01:11:26.023671+00:00"},{"alias_kind":"pith_short_12","alias_value":"JTEBYEGIJEZC","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JTEBYEGIJEZCU4CE","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JTEBYEGI","created_at":"2026-05-18T12:30:25.849896+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/JTEBYEGIJEZCU4CEK7M2R2PEAI","json":"https://pith.science/pith/JTEBYEGIJEZCU4CEK7M2R2PEAI.json","graph_json":"https://pith.science/api/pith-number/JTEBYEGIJEZCU4CEK7M2R2PEAI/graph.json","events_json":"https://pith.science/api/pith-number/JTEBYEGIJEZCU4CEK7M2R2PEAI/events.json","paper":"https://pith.science/paper/JTEBYEGI"},"agent_actions":{"view_html":"https://pith.science/pith/JTEBYEGIJEZCU4CEK7M2R2PEAI","download_json":"https://pith.science/pith/JTEBYEGIJEZCU4CEK7M2R2PEAI.json","view_paper":"https://pith.science/paper/JTEBYEGI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.01590&json=true","fetch_graph":"https://pith.science/api/pith-number/JTEBYEGIJEZCU4CEK7M2R2PEAI/graph.json","fetch_events":"https://pith.science/api/pith-number/JTEBYEGIJEZCU4CEK7M2R2PEAI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JTEBYEGIJEZCU4CEK7M2R2PEAI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JTEBYEGIJEZCU4CEK7M2R2PEAI/action/storage_attestation","attest_author":"https://pith.science/pith/JTEBYEGIJEZCU4CEK7M2R2PEAI/action/author_attestation","sign_citation":"https://pith.science/pith/JTEBYEGIJEZCU4CEK7M2R2PEAI/action/citation_signature","submit_replication":"https://pith.science/pith/JTEBYEGIJEZCU4CEK7M2R2PEAI/action/replication_record"}},"created_at":"2026-05-18T01:11:26.023671+00:00","updated_at":"2026-05-18T01:11:26.023671+00:00"}