{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:Z657HAFYUFPTXLUMQBYLS7W5QN","short_pith_number":"pith:Z657HAFY","canonical_record":{"source":{"id":"2101.00058","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-12-31T20:24:28Z","cross_cats_sorted":[],"title_canon_sha256":"92a5631aa06949c6700983ce0200567bd70f1706ae0123b6127852198c2ac266","abstract_canon_sha256":"b0b1a69f3aa01fe6a0c1fbd1142e828fd7faf7c07db8512da6432768605a70d0"},"schema_version":"1.0"},"canonical_sha256":"cfbbf380b8a15f3bae8c8070b97edd8352d64789442411556029aee705710918","source":{"kind":"arxiv","id":"2101.00058","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.00058","created_at":"2026-07-05T03:48:38Z"},{"alias_kind":"arxiv_version","alias_value":"2101.00058v3","created_at":"2026-07-05T03:48:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.00058","created_at":"2026-07-05T03:48:38Z"},{"alias_kind":"pith_short_12","alias_value":"Z657HAFYUFPT","created_at":"2026-07-05T03:48:38Z"},{"alias_kind":"pith_short_16","alias_value":"Z657HAFYUFPTXLUM","created_at":"2026-07-05T03:48:38Z"},{"alias_kind":"pith_short_8","alias_value":"Z657HAFY","created_at":"2026-07-05T03:48:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:Z657HAFYUFPTXLUMQBYLS7W5QN","target":"record","payload":{"canonical_record":{"source":{"id":"2101.00058","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-12-31T20:24:28Z","cross_cats_sorted":[],"title_canon_sha256":"92a5631aa06949c6700983ce0200567bd70f1706ae0123b6127852198c2ac266","abstract_canon_sha256":"b0b1a69f3aa01fe6a0c1fbd1142e828fd7faf7c07db8512da6432768605a70d0"},"schema_version":"1.0"},"canonical_sha256":"cfbbf380b8a15f3bae8c8070b97edd8352d64789442411556029aee705710918","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:48:38.972631Z","signature_b64":"mg2OwGmjN+q4DkvoSc9jB8a2SNyUAQ5biBaQFp2AdNR/E0ouqcXUe70sUrlmlPYSi/jDu0S7+q3UG9VUTQLLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cfbbf380b8a15f3bae8c8070b97edd8352d64789442411556029aee705710918","last_reissued_at":"2026-07-05T03:48:38.972211Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:48:38.972211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2101.00058","source_version":3,"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-07-05T03:48:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qfappTXalmpT7DuUgI4shGyZvG+dP8RTHbnSj0bXpXP7z3KoVgDflSnunUG8msWMvMUgK5385/YJgnzlmMwyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T14:21:15.696310Z"},"content_sha256":"fd6d95067a61725b68e4c7d0395216600d29a30488470461c5aa9a83ca91ac95","schema_version":"1.0","event_id":"sha256:fd6d95067a61725b68e4c7d0395216600d29a30488470461c5aa9a83ca91ac95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:Z657HAFYUFPTXLUMQBYLS7W5QN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Conflict-driven Inductive Logic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Mark Law","submitted_at":"2020-12-31T20:24:28Z","abstract_excerpt":"The goal of Inductive Logic Programming (ILP) is to learn a program that explains a set of examples. Until recently, most research on ILP targeted learning Prolog programs. The ILASP system instead learns Answer Set Programs (ASP). Learning such expressive programs widens the applicability of ILP considerably; for example, enabling preference learning, learning common-sense knowledge, including defaults and exceptions, and learning non-deterministic theories.\n  Early versions of ILASP can be considered meta-level ILP approaches, which encode a learning task as a logic program and delegate the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.00058","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2101.00058/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:48:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+5BYooAK4wX2pkWxS/ePtZPmB53omf1tzzxnZsh3YW8s2WiMHieSbCFWgj5S1lV7BZaAeX+wu1fuHJvAw3ODBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T14:21:15.697310Z"},"content_sha256":"ca76a2d9c14c01d6728b4ab141c3201a586686705f92cbaac4c5ddb41130e868","schema_version":"1.0","event_id":"sha256:ca76a2d9c14c01d6728b4ab141c3201a586686705f92cbaac4c5ddb41130e868"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z657HAFYUFPTXLUMQBYLS7W5QN/bundle.json","state_url":"https://pith.science/pith/Z657HAFYUFPTXLUMQBYLS7W5QN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z657HAFYUFPTXLUMQBYLS7W5QN/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-08-12T14:21:15Z","links":{"resolver":"https://pith.science/pith/Z657HAFYUFPTXLUMQBYLS7W5QN","bundle":"https://pith.science/pith/Z657HAFYUFPTXLUMQBYLS7W5QN/bundle.json","state":"https://pith.science/pith/Z657HAFYUFPTXLUMQBYLS7W5QN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z657HAFYUFPTXLUMQBYLS7W5QN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:Z657HAFYUFPTXLUMQBYLS7W5QN","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":"b0b1a69f3aa01fe6a0c1fbd1142e828fd7faf7c07db8512da6432768605a70d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-12-31T20:24:28Z","title_canon_sha256":"92a5631aa06949c6700983ce0200567bd70f1706ae0123b6127852198c2ac266"},"schema_version":"1.0","source":{"id":"2101.00058","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2101.00058","created_at":"2026-07-05T03:48:38Z"},{"alias_kind":"arxiv_version","alias_value":"2101.00058v3","created_at":"2026-07-05T03:48:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.00058","created_at":"2026-07-05T03:48:38Z"},{"alias_kind":"pith_short_12","alias_value":"Z657HAFYUFPT","created_at":"2026-07-05T03:48:38Z"},{"alias_kind":"pith_short_16","alias_value":"Z657HAFYUFPTXLUM","created_at":"2026-07-05T03:48:38Z"},{"alias_kind":"pith_short_8","alias_value":"Z657HAFY","created_at":"2026-07-05T03:48:38Z"}],"graph_snapshots":[{"event_id":"sha256:ca76a2d9c14c01d6728b4ab141c3201a586686705f92cbaac4c5ddb41130e868","target":"graph","created_at":"2026-07-05T03:48:38Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2101.00058/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The goal of Inductive Logic Programming (ILP) is to learn a program that explains a set of examples. Until recently, most research on ILP targeted learning Prolog programs. The ILASP system instead learns Answer Set Programs (ASP). Learning such expressive programs widens the applicability of ILP considerably; for example, enabling preference learning, learning common-sense knowledge, including defaults and exceptions, and learning non-deterministic theories.\n  Early versions of ILASP can be considered meta-level ILP approaches, which encode a learning task as a logic program and delegate the ","authors_text":"Mark Law","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-12-31T20:24:28Z","title":"Conflict-driven Inductive Logic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.00058","kind":"arxiv","version":3},"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:fd6d95067a61725b68e4c7d0395216600d29a30488470461c5aa9a83ca91ac95","target":"record","created_at":"2026-07-05T03:48:38Z","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":"b0b1a69f3aa01fe6a0c1fbd1142e828fd7faf7c07db8512da6432768605a70d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-12-31T20:24:28Z","title_canon_sha256":"92a5631aa06949c6700983ce0200567bd70f1706ae0123b6127852198c2ac266"},"schema_version":"1.0","source":{"id":"2101.00058","kind":"arxiv","version":3}},"canonical_sha256":"cfbbf380b8a15f3bae8c8070b97edd8352d64789442411556029aee705710918","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cfbbf380b8a15f3bae8c8070b97edd8352d64789442411556029aee705710918","first_computed_at":"2026-07-05T03:48:38.972211Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:48:38.972211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mg2OwGmjN+q4DkvoSc9jB8a2SNyUAQ5biBaQFp2AdNR/E0ouqcXUe70sUrlmlPYSi/jDu0S7+q3UG9VUTQLLDA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:48:38.972631Z","signed_message":"canonical_sha256_bytes"},"source_id":"2101.00058","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd6d95067a61725b68e4c7d0395216600d29a30488470461c5aa9a83ca91ac95","sha256:ca76a2d9c14c01d6728b4ab141c3201a586686705f92cbaac4c5ddb41130e868"],"state_sha256":"b4f9003f93978761b20cd48ccc09f115b33c43eeac70510f29c258ce3e4c1606"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EJq4E4c5AUzfkQoXy2ynoueDTRxaOcZZscpjG7ICLIoPIkecHaLCn9BwfBruJ/2VWoRNo9W+DnE1BCIJLgdQAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T14:21:15.703146Z","bundle_sha256":"77247f9662f5b6e531777635ace81a40dd992c86ccdb6a119ff3b9aa7184184d"}}