{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:O2EEGGYE5YGSPVICL4G5H7KJWZ","short_pith_number":"pith:O2EEGGYE","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"},"canonical_sha256":"7688431b04ee0d27d5025f0dd3fd49b67ef3a822b43909468550c357be0347b3","source":{"kind":"arxiv","id":"1808.04176","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04176","created_at":"2026-05-17T23:59:22Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04176v2","created_at":"2026-05-17T23:59:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04176","created_at":"2026-05-17T23:59:22Z"},{"alias_kind":"pith_short_12","alias_value":"O2EEGGYE5YGS","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"O2EEGGYE5YGSPVIC","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"O2EEGGYE","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:O2EEGGYE5YGSPVICL4G5H7KJWZ","target":"record","payload":{"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"},"canonical_sha256":"7688431b04ee0d27d5025f0dd3fd49b67ef3a822b43909468550c357be0347b3","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"},"source_kind":"arxiv","source_id":"1808.04176","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-17T23:59:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"saxt3GgXC4USZs8tGYfYIMiGPn8Zc3vZ8//d5MF7GemH3VBnKDWgx3Kl+LExxOXvAF+WLl7FOBcNcPVtanTXBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T11:49:10.753885Z"},"content_sha256":"de0bacf9fb57114e1422c2487c349e9835243aba5af01cdad0fc16968110fea4","schema_version":"1.0","event_id":"sha256:de0bacf9fb57114e1422c2487c349e9835243aba5af01cdad0fc16968110fea4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:O2EEGGYE5YGSPVICL4G5H7KJWZ","target":"graph","payload":{"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"},"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-17T23:59:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dXx9peJsUjzJHYSsCbDmOHrQmKziW7wvk16tWe+3kvQSG0DnJqDrFnf93HyiBR8pMSShGL/UBr+2VwAYQxkKBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T11:49:10.754226Z"},"content_sha256":"c9c1d5eb85c376baebd62feed2a2d2910bee1c03238316481b5502dbd23a1f86","schema_version":"1.0","event_id":"sha256:c9c1d5eb85c376baebd62feed2a2d2910bee1c03238316481b5502dbd23a1f86"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O2EEGGYE5YGSPVICL4G5H7KJWZ/bundle.json","state_url":"https://pith.science/pith/O2EEGGYE5YGSPVICL4G5H7KJWZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O2EEGGYE5YGSPVICL4G5H7KJWZ/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-23T11:49:10Z","links":{"resolver":"https://pith.science/pith/O2EEGGYE5YGSPVICL4G5H7KJWZ","bundle":"https://pith.science/pith/O2EEGGYE5YGSPVICL4G5H7KJWZ/bundle.json","state":"https://pith.science/pith/O2EEGGYE5YGSPVICL4G5H7KJWZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O2EEGGYE5YGSPVICL4G5H7KJWZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:O2EEGGYE5YGSPVICL4G5H7KJWZ","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":"eae5a3219b414cf885c44cd784e0b28c2d3fa5c00c12059b692c43f31c918551","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-08-13T12:38:48Z","title_canon_sha256":"e18645d602ba3ce90c2626872dd3f6de64d134b1033c3714e17ac7282ccd8830"},"schema_version":"1.0","source":{"id":"1808.04176","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.04176","created_at":"2026-05-17T23:59:22Z"},{"alias_kind":"arxiv_version","alias_value":"1808.04176v2","created_at":"2026-05-17T23:59:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.04176","created_at":"2026-05-17T23:59:22Z"},{"alias_kind":"pith_short_12","alias_value":"O2EEGGYE5YGS","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"O2EEGGYE5YGSPVIC","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"O2EEGGYE","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:c9c1d5eb85c376baebd62feed2a2d2910bee1c03238316481b5502dbd23a1f86","target":"graph","created_at":"2026-05-17T23:59:22Z","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":"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","authors_text":"Angelos Charalambidis, Antonis Troumpoukis","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-08-13T12:38:48Z","title":"Predicate Specialization for Definitional Higher-order Logic Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.04176","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:de0bacf9fb57114e1422c2487c349e9835243aba5af01cdad0fc16968110fea4","target":"record","created_at":"2026-05-17T23:59:22Z","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":"eae5a3219b414cf885c44cd784e0b28c2d3fa5c00c12059b692c43f31c918551","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-08-13T12:38:48Z","title_canon_sha256":"e18645d602ba3ce90c2626872dd3f6de64d134b1033c3714e17ac7282ccd8830"},"schema_version":"1.0","source":{"id":"1808.04176","kind":"arxiv","version":2}},"canonical_sha256":"7688431b04ee0d27d5025f0dd3fd49b67ef3a822b43909468550c357be0347b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7688431b04ee0d27d5025f0dd3fd49b67ef3a822b43909468550c357be0347b3","first_computed_at":"2026-05-17T23:59:22.426725Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:22.426725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PIxhAQPfwmorGICjZTLgowNJcRWVuoMrDhTlkYmxabAOh4QY2F7HsobpEC9tveWeCk55queHvvLFymYM8M7GAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:22.427171Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.04176","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de0bacf9fb57114e1422c2487c349e9835243aba5af01cdad0fc16968110fea4","sha256:c9c1d5eb85c376baebd62feed2a2d2910bee1c03238316481b5502dbd23a1f86"],"state_sha256":"6313f804942a69f694d8b48a3937cc135d286d9123a4ff8bb85eda8d512912dc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K1A6nm+Hnfn0p8VNgc1F8OI3j8HYzFkw99bOuBBpjqWJiBfnETWftsCejp8UIFQQVfmfPG7EffkgSq/eCtWuAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T11:49:10.756180Z","bundle_sha256":"31ea9a3ad75fa59240deb5e8d63866190a23252e327d4fb23fbd23343eb99886"}}