{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:X3ZIJMNTOIQK2MZR73T3X45P2K","short_pith_number":"pith:X3ZIJMNT","canonical_record":{"source":{"id":"1606.05798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-18T19:37:26Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"42266fa7d058867b626c85338a743c633f558953abe46127bfc19bf186f4ae3f","abstract_canon_sha256":"5485c12dfefb2af7e65a1598138dc86ed88ef0d727ff83c2b578f312aa717c6a"},"schema_version":"1.0"},"canonical_sha256":"bef284b1b37220ad3331fee7bbf3afd2a26606709e93ac9b394d515821a8b658","source":{"kind":"arxiv","id":"1606.05798","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05798","created_at":"2026-05-18T01:12:16Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05798v1","created_at":"2026-05-18T01:12:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05798","created_at":"2026-05-18T01:12:16Z"},{"alias_kind":"pith_short_12","alias_value":"X3ZIJMNTOIQK","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"X3ZIJMNTOIQK2MZR","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"X3ZIJMNT","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:X3ZIJMNTOIQK2MZR73T3X45P2K","target":"record","payload":{"canonical_record":{"source":{"id":"1606.05798","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-18T19:37:26Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"42266fa7d058867b626c85338a743c633f558953abe46127bfc19bf186f4ae3f","abstract_canon_sha256":"5485c12dfefb2af7e65a1598138dc86ed88ef0d727ff83c2b578f312aa717c6a"},"schema_version":"1.0"},"canonical_sha256":"bef284b1b37220ad3331fee7bbf3afd2a26606709e93ac9b394d515821a8b658","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:16.019403Z","signature_b64":"yyGrEht2+YJ1BhBHu+03pyIhxJWYIAWFi/umX7aG8rUpsvLwzTFzaRZqKwoexiPEzgcRCLLhc01k2FroYND2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bef284b1b37220ad3331fee7bbf3afd2a26606709e93ac9b394d515821a8b658","last_reissued_at":"2026-05-18T01:12:16.018973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:16.018973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.05798","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:12:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mrsm7DBnLmM8vAj3yHyf2kV+fuLY153TmIGehtDwMUUAfakLOPQWRjwyqZkEuxhh5Ee+QfOiMZbkoRon7yOCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T02:51:14.407126Z"},"content_sha256":"3c28979e12552bf3fa22fe5b7eefb58135c7d6a177334f22df756d43a1c090da","schema_version":"1.0","event_id":"sha256:3c28979e12552bf3fa22fe5b7eefb58135c7d6a177334f22df756d43a1c090da"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:X3ZIJMNTOIQK2MZR73T3X45P2K","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.LG"],"primary_cat":"stat.ML","authors_text":"Dennis Wei, Dmitry M. Malioutov, Guolong Su, Kush R. Varshney","submitted_at":"2016-06-18T19:37:26Z","abstract_excerpt":"As a contribution to interpretable machine learning research, we develop a novel optimization framework for learning accurate and sparse two-level Boolean rules. We consider rules in both conjunctive normal form (AND-of-ORs) and disjunctive normal form (OR-of-ANDs). A principled objective function is proposed to trade classification accuracy and interpretability, where we use Hamming loss to characterize accuracy and sparsity to characterize interpretability. We propose efficient procedures to optimize these objectives based on linear programming (LP) relaxation, block coordinate descent, and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05798","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:12:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zfb57gbDvL0zZ29rgTrYLa8z67w8HgaSeCtm98EfJecEmRdRThm+OBDi2q2Uv8mIMguCIE3vJrHibypYFuioBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T02:51:14.407789Z"},"content_sha256":"cbca3f4ece7446bfb85d3489a8cf4f384fa79fabb6abd1a7b6e49c2121450a8a","schema_version":"1.0","event_id":"sha256:cbca3f4ece7446bfb85d3489a8cf4f384fa79fabb6abd1a7b6e49c2121450a8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X3ZIJMNTOIQK2MZR73T3X45P2K/bundle.json","state_url":"https://pith.science/pith/X3ZIJMNTOIQK2MZR73T3X45P2K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X3ZIJMNTOIQK2MZR73T3X45P2K/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-19T02:51:14Z","links":{"resolver":"https://pith.science/pith/X3ZIJMNTOIQK2MZR73T3X45P2K","bundle":"https://pith.science/pith/X3ZIJMNTOIQK2MZR73T3X45P2K/bundle.json","state":"https://pith.science/pith/X3ZIJMNTOIQK2MZR73T3X45P2K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X3ZIJMNTOIQK2MZR73T3X45P2K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:X3ZIJMNTOIQK2MZR73T3X45P2K","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":"5485c12dfefb2af7e65a1598138dc86ed88ef0d727ff83c2b578f312aa717c6a","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-18T19:37:26Z","title_canon_sha256":"42266fa7d058867b626c85338a743c633f558953abe46127bfc19bf186f4ae3f"},"schema_version":"1.0","source":{"id":"1606.05798","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.05798","created_at":"2026-05-18T01:12:16Z"},{"alias_kind":"arxiv_version","alias_value":"1606.05798v1","created_at":"2026-05-18T01:12:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.05798","created_at":"2026-05-18T01:12:16Z"},{"alias_kind":"pith_short_12","alias_value":"X3ZIJMNTOIQK","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"X3ZIJMNTOIQK2MZR","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"X3ZIJMNT","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:cbca3f4ece7446bfb85d3489a8cf4f384fa79fabb6abd1a7b6e49c2121450a8a","target":"graph","created_at":"2026-05-18T01:12:16Z","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":"As a contribution to interpretable machine learning research, we develop a novel optimization framework for learning accurate and sparse two-level Boolean rules. We consider rules in both conjunctive normal form (AND-of-ORs) and disjunctive normal form (OR-of-ANDs). A principled objective function is proposed to trade classification accuracy and interpretability, where we use Hamming loss to characterize accuracy and sparsity to characterize interpretability. We propose efficient procedures to optimize these objectives based on linear programming (LP) relaxation, block coordinate descent, and ","authors_text":"Dennis Wei, Dmitry M. Malioutov, Guolong Su, Kush R. Varshney","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-18T19:37:26Z","title":"Interpretable Two-level Boolean Rule Learning for Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.05798","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:3c28979e12552bf3fa22fe5b7eefb58135c7d6a177334f22df756d43a1c090da","target":"record","created_at":"2026-05-18T01:12:16Z","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":"5485c12dfefb2af7e65a1598138dc86ed88ef0d727ff83c2b578f312aa717c6a","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-18T19:37:26Z","title_canon_sha256":"42266fa7d058867b626c85338a743c633f558953abe46127bfc19bf186f4ae3f"},"schema_version":"1.0","source":{"id":"1606.05798","kind":"arxiv","version":1}},"canonical_sha256":"bef284b1b37220ad3331fee7bbf3afd2a26606709e93ac9b394d515821a8b658","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bef284b1b37220ad3331fee7bbf3afd2a26606709e93ac9b394d515821a8b658","first_computed_at":"2026-05-18T01:12:16.018973Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:16.018973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yyGrEht2+YJ1BhBHu+03pyIhxJWYIAWFi/umX7aG8rUpsvLwzTFzaRZqKwoexiPEzgcRCLLhc01k2FroYND2AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:16.019403Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.05798","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c28979e12552bf3fa22fe5b7eefb58135c7d6a177334f22df756d43a1c090da","sha256:cbca3f4ece7446bfb85d3489a8cf4f384fa79fabb6abd1a7b6e49c2121450a8a"],"state_sha256":"33f7f0f676b01e15670003213c89009d0eb5b028c7df2e50188a49879be764f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qHOn8cu9RXXQgl8aUqRe6e3793Wir5ULYjUZ0R7PtgXAEPNX4+Ng4wG8qku7RL3qwcarNzfkA6d/UHorqtxTAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T02:51:14.409943Z","bundle_sha256":"054c67b0e9cb3133083d26d4ee8adf37f0649609b6ba2173601f1b8fcb28de70"}}