{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5TA2TN3NDVRZCBR6WNAMNZVBMO","short_pith_number":"pith:5TA2TN3N","schema_version":"1.0","canonical_sha256":"ecc1a9b76d1d6391063eb340c6e6a16389ce79416ec6d2e34cdd2614449dbfe2","source":{"kind":"arxiv","id":"2501.07903","version":1},"attestation_state":"computed","paper":{"title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS"],"primary_cat":"cs.LG","authors_text":"Catalin E. Brita, Emir Demirovi\\'c, Jacobus G. M. van der Linden","submitted_at":"2025-01-14T07:46:33Z","abstract_excerpt":"Computing an optimal classification tree that provably maximizes training performance within a given size limit, is NP-hard, and in practice, most state-of-the-art methods do not scale beyond computing optimal trees of depth three. Therefore, most methods rely on a coarse binarization of continuous features to maintain scalability. We propose a novel algorithm that optimizes trees directly on the continuous feature data using dynamic programming with branch-and-bound. We develop new pruning techniques that eliminate many sub-optimal splits in the search when similar to previously computed spli"},"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":"2501.07903","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-01-14T07:46:33Z","cross_cats_sorted":["cs.AI","cs.DS"],"title_canon_sha256":"f86bed2fc53f3793184395a41267fe587d9d0cc48549bbdf4cc5a2ee67ef238b","abstract_canon_sha256":"697267525133da35d7dcd2519608e7eb07312a8cecfeec988289dc4c98fdca71"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:00:52.375594Z","signature_b64":"0IoAqPWK6UGhtseeXb+AV+cL80ITdJqL+nUMCObK8ReCW9+k9heu5er1SWOotYnTM24zGwYo2YPRJcsJofoWDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecc1a9b76d1d6391063eb340c6e6a16389ce79416ec6d2e34cdd2614449dbfe2","last_reissued_at":"2026-07-05T10:00:52.375030Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:00:52.375030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-Bound","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DS"],"primary_cat":"cs.LG","authors_text":"Catalin E. Brita, Emir Demirovi\\'c, Jacobus G. M. van der Linden","submitted_at":"2025-01-14T07:46:33Z","abstract_excerpt":"Computing an optimal classification tree that provably maximizes training performance within a given size limit, is NP-hard, and in practice, most state-of-the-art methods do not scale beyond computing optimal trees of depth three. Therefore, most methods rely on a coarse binarization of continuous features to maintain scalability. We propose a novel algorithm that optimizes trees directly on the continuous feature data using dynamic programming with branch-and-bound. We develop new pruning techniques that eliminate many sub-optimal splits in the search when similar to previously computed spli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.07903","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/2501.07903/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":"2501.07903","created_at":"2026-07-05T10:00:52.375090+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.07903v1","created_at":"2026-07-05T10:00:52.375090+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.07903","created_at":"2026-07-05T10:00:52.375090+00:00"},{"alias_kind":"pith_short_12","alias_value":"5TA2TN3NDVRZ","created_at":"2026-07-05T10:00:52.375090+00:00"},{"alias_kind":"pith_short_16","alias_value":"5TA2TN3NDVRZCBR6","created_at":"2026-07-05T10:00:52.375090+00:00"},{"alias_kind":"pith_short_8","alias_value":"5TA2TN3N","created_at":"2026-07-05T10:00:52.375090+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.23572","citing_title":"A Spectral Theory of Normalized Corrected GNN Propagation","ref_index":53,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5TA2TN3NDVRZCBR6WNAMNZVBMO","json":"https://pith.science/pith/5TA2TN3NDVRZCBR6WNAMNZVBMO.json","graph_json":"https://pith.science/api/pith-number/5TA2TN3NDVRZCBR6WNAMNZVBMO/graph.json","events_json":"https://pith.science/api/pith-number/5TA2TN3NDVRZCBR6WNAMNZVBMO/events.json","paper":"https://pith.science/paper/5TA2TN3N"},"agent_actions":{"view_html":"https://pith.science/pith/5TA2TN3NDVRZCBR6WNAMNZVBMO","download_json":"https://pith.science/pith/5TA2TN3NDVRZCBR6WNAMNZVBMO.json","view_paper":"https://pith.science/paper/5TA2TN3N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.07903&json=true","fetch_graph":"https://pith.science/api/pith-number/5TA2TN3NDVRZCBR6WNAMNZVBMO/graph.json","fetch_events":"https://pith.science/api/pith-number/5TA2TN3NDVRZCBR6WNAMNZVBMO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5TA2TN3NDVRZCBR6WNAMNZVBMO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5TA2TN3NDVRZCBR6WNAMNZVBMO/action/storage_attestation","attest_author":"https://pith.science/pith/5TA2TN3NDVRZCBR6WNAMNZVBMO/action/author_attestation","sign_citation":"https://pith.science/pith/5TA2TN3NDVRZCBR6WNAMNZVBMO/action/citation_signature","submit_replication":"https://pith.science/pith/5TA2TN3NDVRZCBR6WNAMNZVBMO/action/replication_record"}},"created_at":"2026-07-05T10:00:52.375090+00:00","updated_at":"2026-07-05T10:00:52.375090+00:00"}