{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3ZKUQWWXTSJZEAZO42V6QJQWFS","short_pith_number":"pith:3ZKUQWWX","canonical_record":{"source":{"id":"1805.09901","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-24T21:12:26Z","cross_cats_sorted":[],"title_canon_sha256":"75d18727efb9e18954d38882cfbef850c6b9072b00f4489e52b59db058b3441a","abstract_canon_sha256":"569ef5dc92d9c78f729194a8774e39a5d371d2cd85ef0b307a8bd380259860e6"},"schema_version":"1.0"},"canonical_sha256":"de55485ad79c9392032ee6abe826162c8f972e27b18e75dbe80e241c25398f6e","source":{"kind":"arxiv","id":"1805.09901","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09901","created_at":"2026-07-05T01:25:01Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09901v2","created_at":"2026-07-05T01:25:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09901","created_at":"2026-07-05T01:25:01Z"},{"alias_kind":"pith_short_12","alias_value":"3ZKUQWWXTSJZ","created_at":"2026-07-05T01:25:01Z"},{"alias_kind":"pith_short_16","alias_value":"3ZKUQWWXTSJZEAZO","created_at":"2026-07-05T01:25:01Z"},{"alias_kind":"pith_short_8","alias_value":"3ZKUQWWX","created_at":"2026-07-05T01:25:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3ZKUQWWXTSJZEAZO42V6QJQWFS","target":"record","payload":{"canonical_record":{"source":{"id":"1805.09901","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-24T21:12:26Z","cross_cats_sorted":[],"title_canon_sha256":"75d18727efb9e18954d38882cfbef850c6b9072b00f4489e52b59db058b3441a","abstract_canon_sha256":"569ef5dc92d9c78f729194a8774e39a5d371d2cd85ef0b307a8bd380259860e6"},"schema_version":"1.0"},"canonical_sha256":"de55485ad79c9392032ee6abe826162c8f972e27b18e75dbe80e241c25398f6e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:25:01.090182Z","signature_b64":"NraJQzd2A1nauG2ac2XS3HKhXxvEOuBkNlHaE6UoMDSFu8qOrzzpNlnV3EfbFe1m++8WqWG+ZG5XOxDyp8cxBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de55485ad79c9392032ee6abe826162c8f972e27b18e75dbe80e241c25398f6e","last_reissued_at":"2026-07-05T01:25:01.089761Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:25:01.089761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.09901","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-07-05T01:25:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"44AOyyZl4TXKgPIBg6whjd5TviYwHemeTVmYQI7/mKfprI4UZqKyWf2v1CratZPNXRj5+AhT7ngfFSJcdr8nDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T12:19:59.693507Z"},"content_sha256":"49ad3c3906c5913b3430564c69972cc2ce10a4c391f6e769cb696cd53aaad733","schema_version":"1.0","event_id":"sha256:49ad3c3906c5913b3430564c69972cc2ce10a4c391f6e769cb696cd53aaad733"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3ZKUQWWXTSJZEAZO42V6QJQWFS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Boolean Decision Rules via Column Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Dennis Wei, Oktay G\\\"unl\\\"uk, Sanjeeb Dash","submitted_at":"2018-05-24T21:12:26Z","abstract_excerpt":"This paper considers the learning of Boolean rules in either disjunctive normal form (DNF, OR-of-ANDs, equivalent to decision rule sets) or conjunctive normal form (CNF, AND-of-ORs) as an interpretable model for classification. An integer program is formulated to optimally trade classification accuracy for rule simplicity. Column generation (CG) is used to efficiently search over an exponential number of candidate clauses (conjunctions or disjunctions) without the need for heuristic rule mining. This approach also bounds the gap between the selected rule set and the best possible rule set on t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09901","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1805.09901/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-05T01:25:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F9CTn2ReOR4PUqkOlsSzvlZQTBuNuxO2Y8EOKb9J7fQgS/U668pYVKRpbkDy0I7jR6h+LG0YNtj+4O0+zGfnBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T12:19:59.693875Z"},"content_sha256":"922a5682695ad8f3ddbd1620ddda4a9f33efd47a462231abab8c16cb92982709","schema_version":"1.0","event_id":"sha256:922a5682695ad8f3ddbd1620ddda4a9f33efd47a462231abab8c16cb92982709"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3ZKUQWWXTSJZEAZO42V6QJQWFS/bundle.json","state_url":"https://pith.science/pith/3ZKUQWWXTSJZEAZO42V6QJQWFS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3ZKUQWWXTSJZEAZO42V6QJQWFS/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-07-05T12:19:59Z","links":{"resolver":"https://pith.science/pith/3ZKUQWWXTSJZEAZO42V6QJQWFS","bundle":"https://pith.science/pith/3ZKUQWWXTSJZEAZO42V6QJQWFS/bundle.json","state":"https://pith.science/pith/3ZKUQWWXTSJZEAZO42V6QJQWFS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3ZKUQWWXTSJZEAZO42V6QJQWFS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3ZKUQWWXTSJZEAZO42V6QJQWFS","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":"569ef5dc92d9c78f729194a8774e39a5d371d2cd85ef0b307a8bd380259860e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-24T21:12:26Z","title_canon_sha256":"75d18727efb9e18954d38882cfbef850c6b9072b00f4489e52b59db058b3441a"},"schema_version":"1.0","source":{"id":"1805.09901","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.09901","created_at":"2026-07-05T01:25:01Z"},{"alias_kind":"arxiv_version","alias_value":"1805.09901v2","created_at":"2026-07-05T01:25:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09901","created_at":"2026-07-05T01:25:01Z"},{"alias_kind":"pith_short_12","alias_value":"3ZKUQWWXTSJZ","created_at":"2026-07-05T01:25:01Z"},{"alias_kind":"pith_short_16","alias_value":"3ZKUQWWXTSJZEAZO","created_at":"2026-07-05T01:25:01Z"},{"alias_kind":"pith_short_8","alias_value":"3ZKUQWWX","created_at":"2026-07-05T01:25:01Z"}],"graph_snapshots":[{"event_id":"sha256:922a5682695ad8f3ddbd1620ddda4a9f33efd47a462231abab8c16cb92982709","target":"graph","created_at":"2026-07-05T01:25:01Z","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/1805.09901/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper considers the learning of Boolean rules in either disjunctive normal form (DNF, OR-of-ANDs, equivalent to decision rule sets) or conjunctive normal form (CNF, AND-of-ORs) as an interpretable model for classification. An integer program is formulated to optimally trade classification accuracy for rule simplicity. Column generation (CG) is used to efficiently search over an exponential number of candidate clauses (conjunctions or disjunctions) without the need for heuristic rule mining. This approach also bounds the gap between the selected rule set and the best possible rule set on t","authors_text":"Dennis Wei, Oktay G\\\"unl\\\"uk, Sanjeeb Dash","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-24T21:12:26Z","title":"Boolean Decision Rules via Column Generation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09901","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:49ad3c3906c5913b3430564c69972cc2ce10a4c391f6e769cb696cd53aaad733","target":"record","created_at":"2026-07-05T01:25:01Z","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":"569ef5dc92d9c78f729194a8774e39a5d371d2cd85ef0b307a8bd380259860e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-05-24T21:12:26Z","title_canon_sha256":"75d18727efb9e18954d38882cfbef850c6b9072b00f4489e52b59db058b3441a"},"schema_version":"1.0","source":{"id":"1805.09901","kind":"arxiv","version":2}},"canonical_sha256":"de55485ad79c9392032ee6abe826162c8f972e27b18e75dbe80e241c25398f6e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de55485ad79c9392032ee6abe826162c8f972e27b18e75dbe80e241c25398f6e","first_computed_at":"2026-07-05T01:25:01.089761Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:25:01.089761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NraJQzd2A1nauG2ac2XS3HKhXxvEOuBkNlHaE6UoMDSFu8qOrzzpNlnV3EfbFe1m++8WqWG+ZG5XOxDyp8cxBg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:25:01.090182Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.09901","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49ad3c3906c5913b3430564c69972cc2ce10a4c391f6e769cb696cd53aaad733","sha256:922a5682695ad8f3ddbd1620ddda4a9f33efd47a462231abab8c16cb92982709"],"state_sha256":"4a795bfd642106b72a3175c236c07672bd5ad050b5d47c8c491c4d975923c614"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3CkH75869E/lsyjCDfisCyKncndp/9tfc5ykQZ+z7VTcV2AsO97KBBe9QifWv84uvlYaC+LOSQ6Fq34TG5/WDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T12:19:59.695925Z","bundle_sha256":"c86c3d51313f13c26c8957f0b053485c9e03c95fcd0ee30771c58015f0b8d84f"}}