{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:O2EEGGYE5YGSPVICL4G5H7KJWZ","short_pith_number":"pith:O2EEGGYE","schema_version":"1.0","canonical_sha256":"7688431b04ee0d27d5025f0dd3fd49b67ef3a822b43909468550c357be0347b3","source":{"kind":"arxiv","id":"1808.04176","version":2},"attestation_state":"computed","paper":{"title":"Predicate Specialization for Definitional Higher-order Logic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Angelos Charalambidis, Antonis Troumpoukis","submitted_at":"2018-08-13T12:38:48Z","abstract_excerpt":"Higher-order logic programming is an interesting extension of traditional logic programming that allows predicates to appear as arguments and variables to be used where predicates typically occur. Higher-order characteristics are indeed desirable but on the other hand they are also usually more expensive to support. In this paper we propose a program specialization technique based on partial evaluation that can be applied to a modest but useful class of higher-order logic programs and can transform them into first-order programs without introducing additional data structures. The resulting fir"},"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":"1808.04176","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-08-13T12:38:48Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"e18645d602ba3ce90c2626872dd3f6de64d134b1033c3714e17ac7282ccd8830","abstract_canon_sha256":"eae5a3219b414cf885c44cd784e0b28c2d3fa5c00c12059b692c43f31c918551"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:22.427171Z","signature_b64":"PIxhAQPfwmorGICjZTLgowNJcRWVuoMrDhTlkYmxabAOh4QY2F7HsobpEC9tveWeCk55queHvvLFymYM8M7GAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7688431b04ee0d27d5025f0dd3fd49b67ef3a822b43909468550c357be0347b3","last_reissued_at":"2026-05-17T23:59:22.426725Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:22.426725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Predicate Specialization for Definitional Higher-order Logic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.PL","authors_text":"Angelos Charalambidis, Antonis Troumpoukis","submitted_at":"2018-08-13T12:38:48Z","abstract_excerpt":"Higher-order logic programming is an interesting extension of traditional logic programming that allows predicates to appear as arguments and variables to be used where predicates typically occur. Higher-order characteristics are indeed desirable but on the other hand they are also usually more expensive to support. In this paper we propose a program specialization technique based on partial evaluation that can be applied to a modest but useful class of higher-order logic programs and can transform them into first-order programs without introducing additional data structures. The resulting fir"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04176","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.04176","created_at":"2026-05-17T23:59:22.426790+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.04176v2","created_at":"2026-05-17T23:59:22.426790+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04176","created_at":"2026-05-17T23:59:22.426790+00:00"},{"alias_kind":"pith_short_12","alias_value":"O2EEGGYE5YGS","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"O2EEGGYE5YGSPVIC","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"O2EEGGYE","created_at":"2026-05-18T12:32:40.477152+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/O2EEGGYE5YGSPVICL4G5H7KJWZ","json":"https://pith.science/pith/O2EEGGYE5YGSPVICL4G5H7KJWZ.json","graph_json":"https://pith.science/api/pith-number/O2EEGGYE5YGSPVICL4G5H7KJWZ/graph.json","events_json":"https://pith.science/api/pith-number/O2EEGGYE5YGSPVICL4G5H7KJWZ/events.json","paper":"https://pith.science/paper/O2EEGGYE"},"agent_actions":{"view_html":"https://pith.science/pith/O2EEGGYE5YGSPVICL4G5H7KJWZ","download_json":"https://pith.science/pith/O2EEGGYE5YGSPVICL4G5H7KJWZ.json","view_paper":"https://pith.science/paper/O2EEGGYE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.04176&json=true","fetch_graph":"https://pith.science/api/pith-number/O2EEGGYE5YGSPVICL4G5H7KJWZ/graph.json","fetch_events":"https://pith.science/api/pith-number/O2EEGGYE5YGSPVICL4G5H7KJWZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O2EEGGYE5YGSPVICL4G5H7KJWZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O2EEGGYE5YGSPVICL4G5H7KJWZ/action/storage_attestation","attest_author":"https://pith.science/pith/O2EEGGYE5YGSPVICL4G5H7KJWZ/action/author_attestation","sign_citation":"https://pith.science/pith/O2EEGGYE5YGSPVICL4G5H7KJWZ/action/citation_signature","submit_replication":"https://pith.science/pith/O2EEGGYE5YGSPVICL4G5H7KJWZ/action/replication_record"}},"created_at":"2026-05-17T23:59:22.426790+00:00","updated_at":"2026-05-17T23:59:22.426790+00:00"}