{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:J3NEABV5BXEIMDRC7NNN7FZ5R4","short_pith_number":"pith:J3NEABV5","schema_version":"1.0","canonical_sha256":"4eda4006bd0dc8860e22fb5adf973d8f34ab982cbfbfea51b22d7b6ef699509d","source":{"kind":"arxiv","id":"2102.01904","version":1},"attestation_state":"computed","paper":{"title":"A Scalable Two Stage Approach to Computing Optimal Decision Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.LO"],"primary_cat":"cs.AI","authors_text":"Alexey Ignatiev, Edward Lam, Joao Marques-Silva, Peter J. Stuckey","submitted_at":"2021-02-03T06:51:49Z","abstract_excerpt":"Machine learning (ML) is ubiquitous in modern life. Since it is being deployed in technologies that affect our privacy and safety, it is often crucial to understand the reasoning behind its decisions, warranting the need for explainable AI. Rule-based models, such as decision trees, decision lists, and decision sets, are conventionally deemed to be the most interpretable. Recent work uses propositional satisfiability (SAT) solving (and its optimization variants) to generate minimum-size decision sets. Motivated by limited practical scalability of these earlier methods, this paper proposes a no"},"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":"2102.01904","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-02-03T06:51:49Z","cross_cats_sorted":["cs.LG","cs.LO"],"title_canon_sha256":"a0f074c4d98a2ac263553544582569e0c7b8d311cf3fd7779908bf487edb7831","abstract_canon_sha256":"07d9873d06b6e1721986ef9598549fa741385d438b957dfe2620935482ca8277"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:12:34.702247Z","signature_b64":"af7dZigr8aziFZZS7IOwCbaf+Vtg+y79oU8aLFA9OT/EW/zlxSapr2LgxJnJF2MO610SrfELtcYiU4zU0uatCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4eda4006bd0dc8860e22fb5adf973d8f34ab982cbfbfea51b22d7b6ef699509d","last_reissued_at":"2026-07-05T02:12:34.701834Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:12:34.701834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Scalable Two Stage Approach to Computing Optimal Decision Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.LO"],"primary_cat":"cs.AI","authors_text":"Alexey Ignatiev, Edward Lam, Joao Marques-Silva, Peter J. Stuckey","submitted_at":"2021-02-03T06:51:49Z","abstract_excerpt":"Machine learning (ML) is ubiquitous in modern life. Since it is being deployed in technologies that affect our privacy and safety, it is often crucial to understand the reasoning behind its decisions, warranting the need for explainable AI. Rule-based models, such as decision trees, decision lists, and decision sets, are conventionally deemed to be the most interpretable. Recent work uses propositional satisfiability (SAT) solving (and its optimization variants) to generate minimum-size decision sets. Motivated by limited practical scalability of these earlier methods, this paper proposes a no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.01904","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2102.01904/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2102.01904","created_at":"2026-07-05T02:12:34.701899+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.01904v1","created_at":"2026-07-05T02:12:34.701899+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.01904","created_at":"2026-07-05T02:12:34.701899+00:00"},{"alias_kind":"pith_short_12","alias_value":"J3NEABV5BXEI","created_at":"2026-07-05T02:12:34.701899+00:00"},{"alias_kind":"pith_short_16","alias_value":"J3NEABV5BXEIMDRC","created_at":"2026-07-05T02:12:34.701899+00:00"},{"alias_kind":"pith_short_8","alias_value":"J3NEABV5","created_at":"2026-07-05T02:12:34.701899+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/J3NEABV5BXEIMDRC7NNN7FZ5R4","json":"https://pith.science/pith/J3NEABV5BXEIMDRC7NNN7FZ5R4.json","graph_json":"https://pith.science/api/pith-number/J3NEABV5BXEIMDRC7NNN7FZ5R4/graph.json","events_json":"https://pith.science/api/pith-number/J3NEABV5BXEIMDRC7NNN7FZ5R4/events.json","paper":"https://pith.science/paper/J3NEABV5"},"agent_actions":{"view_html":"https://pith.science/pith/J3NEABV5BXEIMDRC7NNN7FZ5R4","download_json":"https://pith.science/pith/J3NEABV5BXEIMDRC7NNN7FZ5R4.json","view_paper":"https://pith.science/paper/J3NEABV5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.01904&json=true","fetch_graph":"https://pith.science/api/pith-number/J3NEABV5BXEIMDRC7NNN7FZ5R4/graph.json","fetch_events":"https://pith.science/api/pith-number/J3NEABV5BXEIMDRC7NNN7FZ5R4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J3NEABV5BXEIMDRC7NNN7FZ5R4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J3NEABV5BXEIMDRC7NNN7FZ5R4/action/storage_attestation","attest_author":"https://pith.science/pith/J3NEABV5BXEIMDRC7NNN7FZ5R4/action/author_attestation","sign_citation":"https://pith.science/pith/J3NEABV5BXEIMDRC7NNN7FZ5R4/action/citation_signature","submit_replication":"https://pith.science/pith/J3NEABV5BXEIMDRC7NNN7FZ5R4/action/replication_record"}},"created_at":"2026-07-05T02:12:34.701899+00:00","updated_at":"2026-07-05T02:12:34.701899+00:00"}