{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VT3J7H3A4BRJFO37BNFENQFWOI","short_pith_number":"pith:VT3J7H3A","canonical_record":{"source":{"id":"1905.11226","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-24T06:05:10Z","cross_cats_sorted":["cs.LO","stat.ML"],"title_canon_sha256":"4dec41d672622252a188742319031e6c461c5a4aa14c64475ed48da8dbaf1ccd","abstract_canon_sha256":"e58acc2781552cea4aabb86c082e85292d7fef875bac7dcfb5fb03e9f1a54ffd"},"schema_version":"1.0"},"canonical_sha256":"acf69f9f60e06292bb7f0b4a46c0b67211a2045f47077bfc6a2c44d7b64dda83","source":{"kind":"arxiv","id":"1905.11226","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11226","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11226v2","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11226","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"pith_short_12","alias_value":"VT3J7H3A4BRJ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VT3J7H3A4BRJFO37","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VT3J7H3A","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VT3J7H3A4BRJFO37BNFENQFWOI","target":"record","payload":{"canonical_record":{"source":{"id":"1905.11226","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-24T06:05:10Z","cross_cats_sorted":["cs.LO","stat.ML"],"title_canon_sha256":"4dec41d672622252a188742319031e6c461c5a4aa14c64475ed48da8dbaf1ccd","abstract_canon_sha256":"e58acc2781552cea4aabb86c082e85292d7fef875bac7dcfb5fb03e9f1a54ffd"},"schema_version":"1.0"},"canonical_sha256":"acf69f9f60e06292bb7f0b4a46c0b67211a2045f47077bfc6a2c44d7b64dda83","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:47.113699Z","signature_b64":"jRiz16WxdL3/aYQMRjKSjrCWKEvrFqo3sHkYrfi1LHSAdZpuhnW6ef9xGvc/qSwRXyvnQ2Br51bQOJelWZMqDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acf69f9f60e06292bb7f0b4a46c0b67211a2045f47077bfc6a2c44d7b64dda83","last_reissued_at":"2026-05-17T23:44:47.113205Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:47.113205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.11226","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:44:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yM0YGGRnmU7oKum0Fg8L0tFU2UXgCwpRltbdreVXkIUw37y2aZujwxJZW8ezyWhnAbsGq+z6WhuAvl/7EItBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:02:16.050593Z"},"content_sha256":"7dcb302c00fc9ae8ce3c8e4b389142122c027e4514570da86cdc3c1f642eb644","schema_version":"1.0","event_id":"sha256:7dcb302c00fc9ae8ce3c8e4b389142122c027e4514570da86cdc3c1f642eb644"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VT3J7H3A4BRJFO37BNFENQFWOI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Induction of Non-Monotonic Rules From Statistical Learning Models Using High-Utility Itemset Mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Farhad Shakerin, Gopal Gupta","submitted_at":"2019-05-24T06:05:10Z","abstract_excerpt":"We present a fast and scalable algorithm to induce non-monotonic logic programs from statistical learning models. We reduce the problem of search for best clauses to instances of the High-Utility Itemset Mining (HUIM) problem. In the HUIM problem, feature values and their importance are treated as transactions and utilities respectively. We make use of TreeExplainer, a fast and scalable implementation of the Explainable AI tool SHAP, to extract locally important features and their weights from ensemble tree models. Our experiments with UCI standard benchmarks suggest a significant improvement "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11226","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:44:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ekDN6R58SW2TEIhpGFIaMOTyh3f9O3b+EHi9iUi34BOVNmgJOM6mDIby6NBDYFZsYy0FsBCoj9qw6ar9OogWDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T02:02:16.050942Z"},"content_sha256":"7fb6020010ee3ff27dc8f7b9ce568e73e3d06285f33aaf69520d5d1f33d8209d","schema_version":"1.0","event_id":"sha256:7fb6020010ee3ff27dc8f7b9ce568e73e3d06285f33aaf69520d5d1f33d8209d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VT3J7H3A4BRJFO37BNFENQFWOI/bundle.json","state_url":"https://pith.science/pith/VT3J7H3A4BRJFO37BNFENQFWOI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VT3J7H3A4BRJFO37BNFENQFWOI/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-05-28T02:02:16Z","links":{"resolver":"https://pith.science/pith/VT3J7H3A4BRJFO37BNFENQFWOI","bundle":"https://pith.science/pith/VT3J7H3A4BRJFO37BNFENQFWOI/bundle.json","state":"https://pith.science/pith/VT3J7H3A4BRJFO37BNFENQFWOI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VT3J7H3A4BRJFO37BNFENQFWOI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VT3J7H3A4BRJFO37BNFENQFWOI","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":"e58acc2781552cea4aabb86c082e85292d7fef875bac7dcfb5fb03e9f1a54ffd","cross_cats_sorted":["cs.LO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-24T06:05:10Z","title_canon_sha256":"4dec41d672622252a188742319031e6c461c5a4aa14c64475ed48da8dbaf1ccd"},"schema_version":"1.0","source":{"id":"1905.11226","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11226","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11226v2","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11226","created_at":"2026-05-17T23:44:47Z"},{"alias_kind":"pith_short_12","alias_value":"VT3J7H3A4BRJ","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VT3J7H3A4BRJFO37","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VT3J7H3A","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:7fb6020010ee3ff27dc8f7b9ce568e73e3d06285f33aaf69520d5d1f33d8209d","target":"graph","created_at":"2026-05-17T23:44:47Z","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":"We present a fast and scalable algorithm to induce non-monotonic logic programs from statistical learning models. We reduce the problem of search for best clauses to instances of the High-Utility Itemset Mining (HUIM) problem. In the HUIM problem, feature values and their importance are treated as transactions and utilities respectively. We make use of TreeExplainer, a fast and scalable implementation of the Explainable AI tool SHAP, to extract locally important features and their weights from ensemble tree models. Our experiments with UCI standard benchmarks suggest a significant improvement ","authors_text":"Farhad Shakerin, Gopal Gupta","cross_cats":["cs.LO","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-24T06:05:10Z","title":"Induction of Non-Monotonic Rules From Statistical Learning Models Using High-Utility Itemset Mining"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11226","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:7dcb302c00fc9ae8ce3c8e4b389142122c027e4514570da86cdc3c1f642eb644","target":"record","created_at":"2026-05-17T23:44:47Z","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":"e58acc2781552cea4aabb86c082e85292d7fef875bac7dcfb5fb03e9f1a54ffd","cross_cats_sorted":["cs.LO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-24T06:05:10Z","title_canon_sha256":"4dec41d672622252a188742319031e6c461c5a4aa14c64475ed48da8dbaf1ccd"},"schema_version":"1.0","source":{"id":"1905.11226","kind":"arxiv","version":2}},"canonical_sha256":"acf69f9f60e06292bb7f0b4a46c0b67211a2045f47077bfc6a2c44d7b64dda83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"acf69f9f60e06292bb7f0b4a46c0b67211a2045f47077bfc6a2c44d7b64dda83","first_computed_at":"2026-05-17T23:44:47.113205Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:47.113205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jRiz16WxdL3/aYQMRjKSjrCWKEvrFqo3sHkYrfi1LHSAdZpuhnW6ef9xGvc/qSwRXyvnQ2Br51bQOJelWZMqDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:47.113699Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.11226","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7dcb302c00fc9ae8ce3c8e4b389142122c027e4514570da86cdc3c1f642eb644","sha256:7fb6020010ee3ff27dc8f7b9ce568e73e3d06285f33aaf69520d5d1f33d8209d"],"state_sha256":"91aadf4b835149e653ccb4906f517172849e99c89048ec0de6888447b67b4f6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WOdRFzl84iXpH8BS1xqC/1Ju0GanTlEkSUn2KNq+hXFj+6622YmpbMSUCnKhq32ut/fFRyQPNbgpV/TwN24pCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T02:02:16.052955Z","bundle_sha256":"35415e14dc53cc7305a3c92552ebbdb55ec9de5bc7b0aadd9c22e262b4d5e23c"}}