{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NGXIEZULAKZQHUQLHZWMHIPHT4","short_pith_number":"pith:NGXIEZUL","canonical_record":{"source":{"id":"1511.07361","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-23T18:52:21Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"42266fa7d058867b626c85338a743c633f558953abe46127bfc19bf186f4ae3f","abstract_canon_sha256":"e0e998216f46d7629b420355c1daaa33a1eefc7f51a78366464643aaf7b37cb2"},"schema_version":"1.0"},"canonical_sha256":"69ae82668b02b303d20b3e6cc3a1e79f085cce5e6fa41ef013c7f1183544b659","source":{"kind":"arxiv","id":"1511.07361","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07361","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07361v1","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07361","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"NGXIEZULAKZQ","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NGXIEZULAKZQHUQL","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NGXIEZUL","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NGXIEZULAKZQHUQLHZWMHIPHT4","target":"record","payload":{"canonical_record":{"source":{"id":"1511.07361","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-23T18:52:21Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"42266fa7d058867b626c85338a743c633f558953abe46127bfc19bf186f4ae3f","abstract_canon_sha256":"e0e998216f46d7629b420355c1daaa33a1eefc7f51a78366464643aaf7b37cb2"},"schema_version":"1.0"},"canonical_sha256":"69ae82668b02b303d20b3e6cc3a1e79f085cce5e6fa41ef013c7f1183544b659","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:11.550018Z","signature_b64":"kxhXY0fVNptEesTdsWUc5xQd1j7N8Rg3d+lL1bplktvfORT7f5KAneEAmcoNgXTg7DF3fTHOlejNHXRl7dQ9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69ae82668b02b303d20b3e6cc3a1e79f085cce5e6fa41ef013c7f1183544b659","last_reissued_at":"2026-05-18T01:26:11.549381Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:11.549381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.07361","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-18T01:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ajlMQ3evXN4ENbEnsu6CM44kVYUjkI5eU0NbWx3ZofckXy4we7+gbg9ANm3pP3dgvAWvPm9/lkQu3/wCsxdwDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:19:05.924280Z"},"content_sha256":"94e6110b0cbf0f7f252d0b9c0178cd8bf7293532daf8e91c9b76d46bf97779ff","schema_version":"1.0","event_id":"sha256:94e6110b0cbf0f7f252d0b9c0178cd8bf7293532daf8e91c9b76d46bf97779ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NGXIEZULAKZQHUQLHZWMHIPHT4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interpretable Two-level Boolean Rule Learning for Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Dennis Wei, Dmitry M. Malioutov, Guolong Su, Kush R. Varshney","submitted_at":"2015-11-23T18:52:21Z","abstract_excerpt":"This paper proposes algorithms for learning two-level Boolean rules in Conjunctive Normal Form (CNF, i.e. AND-of-ORs) or Disjunctive Normal Form (DNF, i.e. OR-of-ANDs) as a type of human-interpretable classification model, aiming for a favorable trade-off between the classification accuracy and the simplicity of the rule. Two formulations are proposed. The first is an integer program whose objective function is a combination of the total number of errors and the total number of features used in the rule. We generalize a previously proposed linear programming (LP) relaxation from one-level to t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07361","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-18T01:26:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"szHNWWqDPdgVx+A7etjnsVK/fQ6ALRMh9IEooYngk7SzEZJXSgknMnJDHBCsRztky2LBKEmkAICqUlH4CeUjCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:19:05.924724Z"},"content_sha256":"12ecfa023dc120f194ceb06d8d8bc4a195fa1648b8be1e53644a7f79453ce4e9","schema_version":"1.0","event_id":"sha256:12ecfa023dc120f194ceb06d8d8bc4a195fa1648b8be1e53644a7f79453ce4e9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NGXIEZULAKZQHUQLHZWMHIPHT4/bundle.json","state_url":"https://pith.science/pith/NGXIEZULAKZQHUQLHZWMHIPHT4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NGXIEZULAKZQHUQLHZWMHIPHT4/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-07T14:19:05Z","links":{"resolver":"https://pith.science/pith/NGXIEZULAKZQHUQLHZWMHIPHT4","bundle":"https://pith.science/pith/NGXIEZULAKZQHUQLHZWMHIPHT4/bundle.json","state":"https://pith.science/pith/NGXIEZULAKZQHUQLHZWMHIPHT4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NGXIEZULAKZQHUQLHZWMHIPHT4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NGXIEZULAKZQHUQLHZWMHIPHT4","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":"e0e998216f46d7629b420355c1daaa33a1eefc7f51a78366464643aaf7b37cb2","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-23T18:52:21Z","title_canon_sha256":"42266fa7d058867b626c85338a743c633f558953abe46127bfc19bf186f4ae3f"},"schema_version":"1.0","source":{"id":"1511.07361","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.07361","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"1511.07361v1","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07361","created_at":"2026-05-18T01:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"NGXIEZULAKZQ","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NGXIEZULAKZQHUQL","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NGXIEZUL","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:12ecfa023dc120f194ceb06d8d8bc4a195fa1648b8be1e53644a7f79453ce4e9","target":"graph","created_at":"2026-05-18T01:26:11Z","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":"This paper proposes algorithms for learning two-level Boolean rules in Conjunctive Normal Form (CNF, i.e. AND-of-ORs) or Disjunctive Normal Form (DNF, i.e. OR-of-ANDs) as a type of human-interpretable classification model, aiming for a favorable trade-off between the classification accuracy and the simplicity of the rule. Two formulations are proposed. The first is an integer program whose objective function is a combination of the total number of errors and the total number of features used in the rule. We generalize a previously proposed linear programming (LP) relaxation from one-level to t","authors_text":"Dennis Wei, Dmitry M. Malioutov, Guolong Su, Kush R. Varshney","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-23T18:52:21Z","title":"Interpretable Two-level Boolean Rule Learning for Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.07361","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:94e6110b0cbf0f7f252d0b9c0178cd8bf7293532daf8e91c9b76d46bf97779ff","target":"record","created_at":"2026-05-18T01:26:11Z","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":"e0e998216f46d7629b420355c1daaa33a1eefc7f51a78366464643aaf7b37cb2","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-23T18:52:21Z","title_canon_sha256":"42266fa7d058867b626c85338a743c633f558953abe46127bfc19bf186f4ae3f"},"schema_version":"1.0","source":{"id":"1511.07361","kind":"arxiv","version":1}},"canonical_sha256":"69ae82668b02b303d20b3e6cc3a1e79f085cce5e6fa41ef013c7f1183544b659","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69ae82668b02b303d20b3e6cc3a1e79f085cce5e6fa41ef013c7f1183544b659","first_computed_at":"2026-05-18T01:26:11.549381Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:11.549381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kxhXY0fVNptEesTdsWUc5xQd1j7N8Rg3d+lL1bplktvfORT7f5KAneEAmcoNgXTg7DF3fTHOlejNHXRl7dQ9BA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:11.550018Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.07361","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94e6110b0cbf0f7f252d0b9c0178cd8bf7293532daf8e91c9b76d46bf97779ff","sha256:12ecfa023dc120f194ceb06d8d8bc4a195fa1648b8be1e53644a7f79453ce4e9"],"state_sha256":"36cb58db1c48f9a5c7363003402d6b878be26fdcd5e054a0a7c9d9e14e890883"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M75IDsaTNjz+Ojom7P3KMj+TBe9cxr2f1Ho5o0jnYV8V+TqJuEg8j0VN5x7wKYS/z5OT2eVlIcFFsT0rFujFBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:19:05.927824Z","bundle_sha256":"06c05329fae49b7f0ddb0cedb222ddefbb5d770daa4a6b27844549b3a4365011"}}