{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QP2ZIOTYBBUHVA5GCIVAUBIJYP","short_pith_number":"pith:QP2ZIOTY","canonical_record":{"source":{"id":"1910.02481","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-10-06T17:20:31Z","cross_cats_sorted":[],"title_canon_sha256":"3ce8ca37ea5b6ca196ebadb8ed369a9cc5abc89caf8a1d6e0a615990a26733ef","abstract_canon_sha256":"517c6a7159e22e7cfbd984cf60ec05de02d5be8a499a942600a9c7b190966691"},"schema_version":"1.0"},"canonical_sha256":"83f5943a7808687a83a6122a0a0509c3c95a7ccac05ec432d03e6bd8a12c7514","source":{"kind":"arxiv","id":"1910.02481","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.02481","created_at":"2026-07-05T00:42:20Z"},{"alias_kind":"arxiv_version","alias_value":"1910.02481v3","created_at":"2026-07-05T00:42:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.02481","created_at":"2026-07-05T00:42:20Z"},{"alias_kind":"pith_short_12","alias_value":"QP2ZIOTYBBUH","created_at":"2026-07-05T00:42:20Z"},{"alias_kind":"pith_short_16","alias_value":"QP2ZIOTYBBUHVA5G","created_at":"2026-07-05T00:42:20Z"},{"alias_kind":"pith_short_8","alias_value":"QP2ZIOTY","created_at":"2026-07-05T00:42:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QP2ZIOTYBBUHVA5GCIVAUBIJYP","target":"record","payload":{"canonical_record":{"source":{"id":"1910.02481","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-10-06T17:20:31Z","cross_cats_sorted":[],"title_canon_sha256":"3ce8ca37ea5b6ca196ebadb8ed369a9cc5abc89caf8a1d6e0a615990a26733ef","abstract_canon_sha256":"517c6a7159e22e7cfbd984cf60ec05de02d5be8a499a942600a9c7b190966691"},"schema_version":"1.0"},"canonical_sha256":"83f5943a7808687a83a6122a0a0509c3c95a7ccac05ec432d03e6bd8a12c7514","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:42:20.625638Z","signature_b64":"Yf5Pb/+POYSM2NnjoRugU3wdT3ccMHzW6ZEqL4wcTDZpphrfHYvB7klwA5N5Q6az09tkhBPqaRnzSsgr3zhIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83f5943a7808687a83a6122a0a0509c3c95a7ccac05ec432d03e6bd8a12c7514","last_reissued_at":"2026-07-05T00:42:20.625207Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:42:20.625207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1910.02481","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-05T00:42:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ncr6szklYZ1q6hpnsOp4IDeXQv+aysknldi8J8jAabGUJVwKHgH+GuIzqlzgx+Mu1uKMUxgyTwbBO2Y5JdCBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T06:29:39.430154Z"},"content_sha256":"1425c78a9f17ba545366da70b040be9d5f8ed27d4842c2051ab36c96db4c6503","schema_version":"1.0","event_id":"sha256:1425c78a9f17ba545366da70b040be9d5f8ed27d4842c2051ab36c96db4c6503"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QP2ZIOTYBBUHVA5GCIVAUBIJYP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learn to Explain Efficiently via Neural Logic Inductive Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Le Song, Yuan Yang","submitted_at":"2019-10-06T17:20:31Z","abstract_excerpt":"The capability of making interpretable and self-explanatory decisions is essential for developing responsible machine learning systems. In this work, we study the learning to explain problem in the scope of inductive logic programming (ILP). We propose Neural Logic Inductive Learning (NLIL), an efficient differentiable ILP framework that learns first-order logic rules that can explain the patterns in the data. In experiments, compared with the state-of-the-art methods, we find NLIL can search for rules that are x10 times longer while remaining x3 times faster. We also show that NLIL can scale "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.02481","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/1910.02481/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-05T00:42:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B5p+sLOXXxxt4D8wCzVsXymGvX7BYRt9S3T1NZCRLjr+dCh8gMwKVLN6QnvFfkMqpgsXNBXfCRD7ghk9FlzOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T06:29:39.430648Z"},"content_sha256":"303b2f0b0283f897374be7282a252a61b178a52d0b48ce95013ec4f337e7ff7b","schema_version":"1.0","event_id":"sha256:303b2f0b0283f897374be7282a252a61b178a52d0b48ce95013ec4f337e7ff7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QP2ZIOTYBBUHVA5GCIVAUBIJYP/bundle.json","state_url":"https://pith.science/pith/QP2ZIOTYBBUHVA5GCIVAUBIJYP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QP2ZIOTYBBUHVA5GCIVAUBIJYP/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-12T06:29:39Z","links":{"resolver":"https://pith.science/pith/QP2ZIOTYBBUHVA5GCIVAUBIJYP","bundle":"https://pith.science/pith/QP2ZIOTYBBUHVA5GCIVAUBIJYP/bundle.json","state":"https://pith.science/pith/QP2ZIOTYBBUHVA5GCIVAUBIJYP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QP2ZIOTYBBUHVA5GCIVAUBIJYP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QP2ZIOTYBBUHVA5GCIVAUBIJYP","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":"517c6a7159e22e7cfbd984cf60ec05de02d5be8a499a942600a9c7b190966691","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-10-06T17:20:31Z","title_canon_sha256":"3ce8ca37ea5b6ca196ebadb8ed369a9cc5abc89caf8a1d6e0a615990a26733ef"},"schema_version":"1.0","source":{"id":"1910.02481","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1910.02481","created_at":"2026-07-05T00:42:20Z"},{"alias_kind":"arxiv_version","alias_value":"1910.02481v3","created_at":"2026-07-05T00:42:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.02481","created_at":"2026-07-05T00:42:20Z"},{"alias_kind":"pith_short_12","alias_value":"QP2ZIOTYBBUH","created_at":"2026-07-05T00:42:20Z"},{"alias_kind":"pith_short_16","alias_value":"QP2ZIOTYBBUHVA5G","created_at":"2026-07-05T00:42:20Z"},{"alias_kind":"pith_short_8","alias_value":"QP2ZIOTY","created_at":"2026-07-05T00:42:20Z"}],"graph_snapshots":[{"event_id":"sha256:303b2f0b0283f897374be7282a252a61b178a52d0b48ce95013ec4f337e7ff7b","target":"graph","created_at":"2026-07-05T00:42:20Z","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/1910.02481/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The capability of making interpretable and self-explanatory decisions is essential for developing responsible machine learning systems. In this work, we study the learning to explain problem in the scope of inductive logic programming (ILP). We propose Neural Logic Inductive Learning (NLIL), an efficient differentiable ILP framework that learns first-order logic rules that can explain the patterns in the data. In experiments, compared with the state-of-the-art methods, we find NLIL can search for rules that are x10 times longer while remaining x3 times faster. We also show that NLIL can scale ","authors_text":"Le Song, Yuan Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-10-06T17:20:31Z","title":"Learn to Explain Efficiently via Neural Logic Inductive Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.02481","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:1425c78a9f17ba545366da70b040be9d5f8ed27d4842c2051ab36c96db4c6503","target":"record","created_at":"2026-07-05T00:42:20Z","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":"517c6a7159e22e7cfbd984cf60ec05de02d5be8a499a942600a9c7b190966691","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2019-10-06T17:20:31Z","title_canon_sha256":"3ce8ca37ea5b6ca196ebadb8ed369a9cc5abc89caf8a1d6e0a615990a26733ef"},"schema_version":"1.0","source":{"id":"1910.02481","kind":"arxiv","version":3}},"canonical_sha256":"83f5943a7808687a83a6122a0a0509c3c95a7ccac05ec432d03e6bd8a12c7514","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83f5943a7808687a83a6122a0a0509c3c95a7ccac05ec432d03e6bd8a12c7514","first_computed_at":"2026-07-05T00:42:20.625207Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:42:20.625207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Yf5Pb/+POYSM2NnjoRugU3wdT3ccMHzW6ZEqL4wcTDZpphrfHYvB7klwA5N5Q6az09tkhBPqaRnzSsgr3zhIBA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:42:20.625638Z","signed_message":"canonical_sha256_bytes"},"source_id":"1910.02481","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1425c78a9f17ba545366da70b040be9d5f8ed27d4842c2051ab36c96db4c6503","sha256:303b2f0b0283f897374be7282a252a61b178a52d0b48ce95013ec4f337e7ff7b"],"state_sha256":"868e8fb76d6c82191c26e47cf0da7279bcca7aa6e63353db419b698746a01edd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QoMgPR9LP+5gwOAw2csCFSB+HNbaHHCY/DthpR5NjFPPlsNZwT8JdXyNZkA1KFwTE4QYQUf7NWHTLpBgLBClBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T06:29:39.434506Z","bundle_sha256":"ee6b43cb5447e28014c5f8cd03309eb6ebe3677d31b3cc6a54d33bbe9eb03009"}}