{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:HGNLKMWAPJMNBDELFI6JUOXP6U","short_pith_number":"pith:HGNLKMWA","canonical_record":{"source":{"id":"1907.10953","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-25T10:36:01Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"976835df6361f845f37b4db24ded7a2af2b64e6cc635a5cbbfa88b8725e47280","abstract_canon_sha256":"ff28ff960132420e0934f291e743f4786d34383ad3c1779859907d0ae922d082"},"schema_version":"1.0"},"canonical_sha256":"399ab532c07a58d08c8b2a3c9a3aeff53d5d8da3d5e62b020430c7a82546ae62","source":{"kind":"arxiv","id":"1907.10953","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.10953","created_at":"2026-05-17T23:39:33Z"},{"alias_kind":"arxiv_version","alias_value":"1907.10953v1","created_at":"2026-05-17T23:39:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10953","created_at":"2026-05-17T23:39:33Z"},{"alias_kind":"pith_short_12","alias_value":"HGNLKMWAPJMN","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HGNLKMWAPJMNBDEL","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HGNLKMWA","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:HGNLKMWAPJMNBDELFI6JUOXP6U","target":"record","payload":{"canonical_record":{"source":{"id":"1907.10953","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-25T10:36:01Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"976835df6361f845f37b4db24ded7a2af2b64e6cc635a5cbbfa88b8725e47280","abstract_canon_sha256":"ff28ff960132420e0934f291e743f4786d34383ad3c1779859907d0ae922d082"},"schema_version":"1.0"},"canonical_sha256":"399ab532c07a58d08c8b2a3c9a3aeff53d5d8da3d5e62b020430c7a82546ae62","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:33.918587Z","signature_b64":"n405xWn44/2yiFOlTN/fsxFC1PloqrHs9nrA5NiQZ2uvIabo9M51N/sv+VIERLABNpfE3DyVHcycWA2XTRXgBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"399ab532c07a58d08c8b2a3c9a3aeff53d5d8da3d5e62b020430c7a82546ae62","last_reissued_at":"2026-05-17T23:39:33.917926Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:33.917926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.10953","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-17T23:39:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eXFzcfmURaVEAYuX2Wwmhf64I/XM7X0fJuDDO/XkWJANqJKGayJcw78EF9bLtO14k9qd1D/gh3uKd2YNCf1lDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:01:33.871695Z"},"content_sha256":"3cb28db47c188299ae548c4ff134cb6bd017684a6c6887bd22a4dba79c073cf9","schema_version":"1.0","event_id":"sha256:3cb28db47c188299ae548c4ff134cb6bd017684a6c6887bd22a4dba79c073cf9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:HGNLKMWAPJMNBDELFI6JUOXP6U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning higher-order logic programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrew Cropper, Rolf Morel, Stephen H. Muggleton","submitted_at":"2019-07-25T10:36:01Z","abstract_excerpt":"A key feature of inductive logic programming (ILP) is its ability to learn first-order programs, which are intrinsically more expressive than propositional programs. In this paper, we introduce techniques to learn higher-order programs. Specifically, we extend meta-interpretive learning (MIL) to support learning higher-order programs by allowing for \\emph{higher-order definitions} to be used as background knowledge. Our theoretical results show that learning higher-order programs, rather than first-order programs, can reduce the textual complexity required to express programs which in turn red"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10953","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-17T23:39:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9UCGv5fwir0Pu9PMW8RsNfo82N6aGAkdT5wAbSxZMkiXpdAm0wnLw291pdx563dEPSJsmPi3VSNcfFwTMhsDAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:01:33.872081Z"},"content_sha256":"41c6f8cace457183a620819c03276299e1f4c1938758e3426d5b3679fa303ff4","schema_version":"1.0","event_id":"sha256:41c6f8cace457183a620819c03276299e1f4c1938758e3426d5b3679fa303ff4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HGNLKMWAPJMNBDELFI6JUOXP6U/bundle.json","state_url":"https://pith.science/pith/HGNLKMWAPJMNBDELFI6JUOXP6U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HGNLKMWAPJMNBDELFI6JUOXP6U/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-01T13:01:33Z","links":{"resolver":"https://pith.science/pith/HGNLKMWAPJMNBDELFI6JUOXP6U","bundle":"https://pith.science/pith/HGNLKMWAPJMNBDELFI6JUOXP6U/bundle.json","state":"https://pith.science/pith/HGNLKMWAPJMNBDELFI6JUOXP6U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HGNLKMWAPJMNBDELFI6JUOXP6U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:HGNLKMWAPJMNBDELFI6JUOXP6U","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":"ff28ff960132420e0934f291e743f4786d34383ad3c1779859907d0ae922d082","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-25T10:36:01Z","title_canon_sha256":"976835df6361f845f37b4db24ded7a2af2b64e6cc635a5cbbfa88b8725e47280"},"schema_version":"1.0","source":{"id":"1907.10953","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.10953","created_at":"2026-05-17T23:39:33Z"},{"alias_kind":"arxiv_version","alias_value":"1907.10953v1","created_at":"2026-05-17T23:39:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10953","created_at":"2026-05-17T23:39:33Z"},{"alias_kind":"pith_short_12","alias_value":"HGNLKMWAPJMN","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"HGNLKMWAPJMNBDEL","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"HGNLKMWA","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:41c6f8cace457183a620819c03276299e1f4c1938758e3426d5b3679fa303ff4","target":"graph","created_at":"2026-05-17T23:39:33Z","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":"A key feature of inductive logic programming (ILP) is its ability to learn first-order programs, which are intrinsically more expressive than propositional programs. In this paper, we introduce techniques to learn higher-order programs. Specifically, we extend meta-interpretive learning (MIL) to support learning higher-order programs by allowing for \\emph{higher-order definitions} to be used as background knowledge. Our theoretical results show that learning higher-order programs, rather than first-order programs, can reduce the textual complexity required to express programs which in turn red","authors_text":"Andrew Cropper, Rolf Morel, Stephen H. Muggleton","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-25T10:36:01Z","title":"Learning higher-order logic programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10953","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:3cb28db47c188299ae548c4ff134cb6bd017684a6c6887bd22a4dba79c073cf9","target":"record","created_at":"2026-05-17T23:39:33Z","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":"ff28ff960132420e0934f291e743f4786d34383ad3c1779859907d0ae922d082","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-07-25T10:36:01Z","title_canon_sha256":"976835df6361f845f37b4db24ded7a2af2b64e6cc635a5cbbfa88b8725e47280"},"schema_version":"1.0","source":{"id":"1907.10953","kind":"arxiv","version":1}},"canonical_sha256":"399ab532c07a58d08c8b2a3c9a3aeff53d5d8da3d5e62b020430c7a82546ae62","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"399ab532c07a58d08c8b2a3c9a3aeff53d5d8da3d5e62b020430c7a82546ae62","first_computed_at":"2026-05-17T23:39:33.917926Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:33.917926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n405xWn44/2yiFOlTN/fsxFC1PloqrHs9nrA5NiQZ2uvIabo9M51N/sv+VIERLABNpfE3DyVHcycWA2XTRXgBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:33.918587Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.10953","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3cb28db47c188299ae548c4ff134cb6bd017684a6c6887bd22a4dba79c073cf9","sha256:41c6f8cace457183a620819c03276299e1f4c1938758e3426d5b3679fa303ff4"],"state_sha256":"25307e75e80f9421bf45a52c5615ee2e1e042fbfa5fd336bfa08d701b9ce29b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UTaV799+gAmiR1F24kNvKd87DAnThU6I0FzcZ2gf87/rMkWCy5ghysVN+MFu44SjvdxNqWObuFM7UnExUH7MCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T13:01:33.874702Z","bundle_sha256":"7f8db6881ffb53aa03fae32a904be2f854cf07d9eb027311963efe7718df2f6f"}}