{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NGXIEZULAKZQHUQLHZWMHIPHT4","short_pith_number":"pith:NGXIEZUL","schema_version":"1.0","canonical_sha256":"69ae82668b02b303d20b3e6cc3a1e79f085cce5e6fa41ef013c7f1183544b659","source":{"kind":"arxiv","id":"1511.07361","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.07361","created_at":"2026-05-18T01:26:11.549483+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.07361v1","created_at":"2026-05-18T01:26:11.549483+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.07361","created_at":"2026-05-18T01:26:11.549483+00:00"},{"alias_kind":"pith_short_12","alias_value":"NGXIEZULAKZQ","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NGXIEZULAKZQHUQL","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NGXIEZUL","created_at":"2026-05-18T12:29:32.376354+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NGXIEZULAKZQHUQLHZWMHIPHT4","json":"https://pith.science/pith/NGXIEZULAKZQHUQLHZWMHIPHT4.json","graph_json":"https://pith.science/api/pith-number/NGXIEZULAKZQHUQLHZWMHIPHT4/graph.json","events_json":"https://pith.science/api/pith-number/NGXIEZULAKZQHUQLHZWMHIPHT4/events.json","paper":"https://pith.science/paper/NGXIEZUL"},"agent_actions":{"view_html":"https://pith.science/pith/NGXIEZULAKZQHUQLHZWMHIPHT4","download_json":"https://pith.science/pith/NGXIEZULAKZQHUQLHZWMHIPHT4.json","view_paper":"https://pith.science/paper/NGXIEZUL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.07361&json=true","fetch_graph":"https://pith.science/api/pith-number/NGXIEZULAKZQHUQLHZWMHIPHT4/graph.json","fetch_events":"https://pith.science/api/pith-number/NGXIEZULAKZQHUQLHZWMHIPHT4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NGXIEZULAKZQHUQLHZWMHIPHT4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NGXIEZULAKZQHUQLHZWMHIPHT4/action/storage_attestation","attest_author":"https://pith.science/pith/NGXIEZULAKZQHUQLHZWMHIPHT4/action/author_attestation","sign_citation":"https://pith.science/pith/NGXIEZULAKZQHUQLHZWMHIPHT4/action/citation_signature","submit_replication":"https://pith.science/pith/NGXIEZULAKZQHUQLHZWMHIPHT4/action/replication_record"}},"created_at":"2026-05-18T01:26:11.549483+00:00","updated_at":"2026-05-18T01:26:11.549483+00:00"}