{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:A4WRBHWHKYIXKWIELEYNWCBSNK","short_pith_number":"pith:A4WRBHWH","schema_version":"1.0","canonical_sha256":"072d109ec756117559045930db08326aa8682bd3e24c8d273a1dd39a4689f046","source":{"kind":"arxiv","id":"2103.15965","version":3},"attestation_state":"computed","paper":{"title":"Strong Optimal Classification Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"cs.LG","authors_text":"Andr\\'es G\\'omez, Phebe Vayanos, Sina Aghaei","submitted_at":"2021-03-29T21:40:58Z","abstract_excerpt":"Decision trees are among the most popular machine learning models and are used routinely in applications ranging from revenue management and medicine to bioinformatics. In this paper, we consider the problem of learning optimal binary classification trees with univariate splits. Literature on the topic has burgeoned in recent years, motivated both by the empirical suboptimality of heuristic approaches and the tremendous improvements in mixed-integer optimization (MIO) technology. Yet, existing MIO-based approaches from the literature do not leverage the power of MIO to its full extent: they re"},"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":"2103.15965","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-03-29T21:40:58Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"f446f2d2477b1031ac1a0d555aedeeccc797db65bf6b8cd3241dd48af7c5d80f","abstract_canon_sha256":"ded51b8c40c911ddd76fb264a39f1836aec816f841314b2d1ecbf0edc0458077"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:32:31.229761Z","signature_b64":"LC2wj1ufFXlHCAZtFmxixvDdswNeZdIv/DGFWx/AVpRoNLbShOiczWljDFbMOCAqwWEFNn6sGpItI9XJPjaJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"072d109ec756117559045930db08326aa8682bd3e24c8d273a1dd39a4689f046","last_reissued_at":"2026-07-05T06:32:31.229241Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:32:31.229241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong Optimal Classification Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"cs.LG","authors_text":"Andr\\'es G\\'omez, Phebe Vayanos, Sina Aghaei","submitted_at":"2021-03-29T21:40:58Z","abstract_excerpt":"Decision trees are among the most popular machine learning models and are used routinely in applications ranging from revenue management and medicine to bioinformatics. In this paper, we consider the problem of learning optimal binary classification trees with univariate splits. Literature on the topic has burgeoned in recent years, motivated both by the empirical suboptimality of heuristic approaches and the tremendous improvements in mixed-integer optimization (MIO) technology. Yet, existing MIO-based approaches from the literature do not leverage the power of MIO to its full extent: they re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.15965","kind":"arxiv","version":3},"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/2103.15965/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":"2103.15965","created_at":"2026-07-05T06:32:31.229300+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.15965v3","created_at":"2026-07-05T06:32:31.229300+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.15965","created_at":"2026-07-05T06:32:31.229300+00:00"},{"alias_kind":"pith_short_12","alias_value":"A4WRBHWHKYIX","created_at":"2026-07-05T06:32:31.229300+00:00"},{"alias_kind":"pith_short_16","alias_value":"A4WRBHWHKYIXKWIE","created_at":"2026-07-05T06:32:31.229300+00:00"},{"alias_kind":"pith_short_8","alias_value":"A4WRBHWH","created_at":"2026-07-05T06:32:31.229300+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.07598","citing_title":"Optimal Recourse Summaries via Bi-Objective Decision Tree Learning","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07598","citing_title":"Optimal Recourse Summaries via Bi-Objective Decision Tree Learning","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A4WRBHWHKYIXKWIELEYNWCBSNK","json":"https://pith.science/pith/A4WRBHWHKYIXKWIELEYNWCBSNK.json","graph_json":"https://pith.science/api/pith-number/A4WRBHWHKYIXKWIELEYNWCBSNK/graph.json","events_json":"https://pith.science/api/pith-number/A4WRBHWHKYIXKWIELEYNWCBSNK/events.json","paper":"https://pith.science/paper/A4WRBHWH"},"agent_actions":{"view_html":"https://pith.science/pith/A4WRBHWHKYIXKWIELEYNWCBSNK","download_json":"https://pith.science/pith/A4WRBHWHKYIXKWIELEYNWCBSNK.json","view_paper":"https://pith.science/paper/A4WRBHWH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.15965&json=true","fetch_graph":"https://pith.science/api/pith-number/A4WRBHWHKYIXKWIELEYNWCBSNK/graph.json","fetch_events":"https://pith.science/api/pith-number/A4WRBHWHKYIXKWIELEYNWCBSNK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A4WRBHWHKYIXKWIELEYNWCBSNK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A4WRBHWHKYIXKWIELEYNWCBSNK/action/storage_attestation","attest_author":"https://pith.science/pith/A4WRBHWHKYIXKWIELEYNWCBSNK/action/author_attestation","sign_citation":"https://pith.science/pith/A4WRBHWHKYIXKWIELEYNWCBSNK/action/citation_signature","submit_replication":"https://pith.science/pith/A4WRBHWHKYIXKWIELEYNWCBSNK/action/replication_record"}},"created_at":"2026-07-05T06:32:31.229300+00:00","updated_at":"2026-07-05T06:32:31.229300+00:00"}