{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:QRQTW22UYZHEIUCDDNWNJVFDLG","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":"eaf3a6afb4fad1a147141edf77e718f80c1965c9cef6095ac40a29e71dafa7d7","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-04-21T20:31:28Z","title_canon_sha256":"242ef6bdeb7eed054c4c46436b72105bb5cae124ddeac4afb2e294bf88dd5b31"},"schema_version":"1.0","source":{"id":"2104.10751","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2104.10751","created_at":"2026-07-05T10:10:20Z"},{"alias_kind":"arxiv_version","alias_value":"2104.10751v5","created_at":"2026-07-05T10:10:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.10751","created_at":"2026-07-05T10:10:20Z"},{"alias_kind":"pith_short_12","alias_value":"QRQTW22UYZHE","created_at":"2026-07-05T10:10:20Z"},{"alias_kind":"pith_short_16","alias_value":"QRQTW22UYZHEIUCD","created_at":"2026-07-05T10:10:20Z"},{"alias_kind":"pith_short_8","alias_value":"QRQTW22U","created_at":"2026-07-05T10:10:20Z"}],"graph_snapshots":[{"event_id":"sha256:94fda14acde53b8fd05b3f29160ad468107ff17e4183bdf1f619c89f2c0595e9","target":"graph","created_at":"2026-07-05T10:10:20Z","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/2104.10751/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We introduce a new rule-based optimization method for classification with constraints. The proposed method leverages column generation for linear programming, and hence, is scalable to large datasets. The resulting pricing subproblem is shown to be NP-Hard. We recourse to a decision tree-based heuristic and solve a proxy pricing subproblem for acceleration. The method returns a set of rules along with their optimal weights indicating the importance of each rule for learning. We address interpretability and fairness by assigning cost coefficients to the rules and introducing additional constrai","authors_text":"Adia C. Lumadjeng, \\c{S}. \\.Ilker Birbil, M. Hakan Aky\\\"uz, Tabea E. R\\\"ober","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-04-21T20:31:28Z","title":"Rule Generation for Classification: Scalability, Interpretability, and Fairness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.10751","kind":"arxiv","version":5},"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:a5b5723508bc1a44780f0c4c23cba6e5c08bbe6278a7bdcbc04bd1b7f3183352","target":"record","created_at":"2026-07-05T10:10:20Z","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":"eaf3a6afb4fad1a147141edf77e718f80c1965c9cef6095ac40a29e71dafa7d7","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-04-21T20:31:28Z","title_canon_sha256":"242ef6bdeb7eed054c4c46436b72105bb5cae124ddeac4afb2e294bf88dd5b31"},"schema_version":"1.0","source":{"id":"2104.10751","kind":"arxiv","version":5}},"canonical_sha256":"84613b6b54c64e4450431b6cd4d4a35982adc3dce0a43fb4f20a1ae8f327622b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84613b6b54c64e4450431b6cd4d4a35982adc3dce0a43fb4f20a1ae8f327622b","first_computed_at":"2026-07-05T10:10:20.887080Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:10:20.887080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nMcnpgwIyIWPlPgHGlVYRTf9jlvxGrdinnWEXHN72Ky7wWFHFB9/1gnTwod/wAVpD8GCY++wky9GX6oYy0xJDw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:10:20.887509Z","signed_message":"canonical_sha256_bytes"},"source_id":"2104.10751","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5b5723508bc1a44780f0c4c23cba6e5c08bbe6278a7bdcbc04bd1b7f3183352","sha256:94fda14acde53b8fd05b3f29160ad468107ff17e4183bdf1f619c89f2c0595e9"],"state_sha256":"d4e0575b8ea2ea2c7fbb040a79f47992a19a393f731b86613fc3b06e6487b2ac"}