{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:5O2TJH32OBK7STU76REWVGBNVP","short_pith_number":"pith:5O2TJH32","schema_version":"1.0","canonical_sha256":"ebb5349f7a7055f94e9ff4496a982dabc59ed094f90071b706c2b5cf92eecd3b","source":{"kind":"arxiv","id":"2112.00798","version":7},"attestation_state":"computed","paper":{"title":"Fast Sparse Decision Tree Optimization via Reference Ensembles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chudi Zhong, Cynthia Rudin, Hayden McTavish, Ilias Karimalis, Jacques Chen, Margo Seltzer, Reto Achermann","submitted_at":"2021-12-01T19:39:28Z","abstract_excerpt":"Sparse decision tree optimization has been one of the most fundamental problems in AI since its inception and is a challenge at the core of interpretable machine learning. Sparse decision tree optimization is computationally hard, and despite steady effort since the 1960's, breakthroughs have only been made on the problem within the past few years, primarily on the problem of finding optimal sparse decision trees. However, current state-of-the-art algorithms often require impractical amounts of computation time and memory to find optimal or near-optimal trees for some real-world datasets, part"},"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":"2112.00798","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-12-01T19:39:28Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"8eb477de39dc234ceabc663f2a63d68d35a57b0fb2a3a4107e51966fd944b9bc","abstract_canon_sha256":"7ad897f8e0b03b86d97fc3cec231451a64e5b9cf95d8223128400001bffcd044"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:37:56.669024Z","signature_b64":"PScjKGHAqUKJFtGQ8X25ecVI+MR7k6nlqmA4G988tdkLMLEIaW5X5+ah8YBlYwrFsga/xvFO2jsnXUT1qL80AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebb5349f7a7055f94e9ff4496a982dabc59ed094f90071b706c2b5cf92eecd3b","last_reissued_at":"2026-07-05T04:37:56.668424Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:37:56.668424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Sparse Decision Tree Optimization via Reference Ensembles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chudi Zhong, Cynthia Rudin, Hayden McTavish, Ilias Karimalis, Jacques Chen, Margo Seltzer, Reto Achermann","submitted_at":"2021-12-01T19:39:28Z","abstract_excerpt":"Sparse decision tree optimization has been one of the most fundamental problems in AI since its inception and is a challenge at the core of interpretable machine learning. Sparse decision tree optimization is computationally hard, and despite steady effort since the 1960's, breakthroughs have only been made on the problem within the past few years, primarily on the problem of finding optimal sparse decision trees. However, current state-of-the-art algorithms often require impractical amounts of computation time and memory to find optimal or near-optimal trees for some real-world datasets, part"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.00798","kind":"arxiv","version":7},"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/2112.00798/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":"2112.00798","created_at":"2026-07-05T04:37:56.668502+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.00798v7","created_at":"2026-07-05T04:37:56.668502+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.00798","created_at":"2026-07-05T04:37:56.668502+00:00"},{"alias_kind":"pith_short_12","alias_value":"5O2TJH32OBK7","created_at":"2026-07-05T04:37:56.668502+00:00"},{"alias_kind":"pith_short_16","alias_value":"5O2TJH32OBK7STU7","created_at":"2026-07-05T04:37:56.668502+00:00"},{"alias_kind":"pith_short_8","alias_value":"5O2TJH32","created_at":"2026-07-05T04:37:56.668502+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/5O2TJH32OBK7STU76REWVGBNVP","json":"https://pith.science/pith/5O2TJH32OBK7STU76REWVGBNVP.json","graph_json":"https://pith.science/api/pith-number/5O2TJH32OBK7STU76REWVGBNVP/graph.json","events_json":"https://pith.science/api/pith-number/5O2TJH32OBK7STU76REWVGBNVP/events.json","paper":"https://pith.science/paper/5O2TJH32"},"agent_actions":{"view_html":"https://pith.science/pith/5O2TJH32OBK7STU76REWVGBNVP","download_json":"https://pith.science/pith/5O2TJH32OBK7STU76REWVGBNVP.json","view_paper":"https://pith.science/paper/5O2TJH32","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.00798&json=true","fetch_graph":"https://pith.science/api/pith-number/5O2TJH32OBK7STU76REWVGBNVP/graph.json","fetch_events":"https://pith.science/api/pith-number/5O2TJH32OBK7STU76REWVGBNVP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5O2TJH32OBK7STU76REWVGBNVP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5O2TJH32OBK7STU76REWVGBNVP/action/storage_attestation","attest_author":"https://pith.science/pith/5O2TJH32OBK7STU76REWVGBNVP/action/author_attestation","sign_citation":"https://pith.science/pith/5O2TJH32OBK7STU76REWVGBNVP/action/citation_signature","submit_replication":"https://pith.science/pith/5O2TJH32OBK7STU76REWVGBNVP/action/replication_record"}},"created_at":"2026-07-05T04:37:56.668502+00:00","updated_at":"2026-07-05T04:37:56.668502+00:00"}