{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WAD5YH36QCBZXNTYXWFKBX6JXL","short_pith_number":"pith:WAD5YH36","schema_version":"1.0","canonical_sha256":"b007dc1f7e80839bb678bd8aa0dfc9bac08b1091a6ed1d328231eaef7044a0b5","source":{"kind":"arxiv","id":"2311.06952","version":1},"attestation_state":"computed","paper":{"title":"A GPU-Accelerated Moving-Horizon Algorithm for Training Deep Classification Trees on Large Datasets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Chaojie Ji, Jiayang Ren, Kaixun Hua, Liang Cao, Morimasa Okamoto, Qiangqiang Mao, Valent\\'in Osuna-Enciso, Yankai Cao","submitted_at":"2023-11-12T20:34:00Z","abstract_excerpt":"Decision trees are essential yet NP-complete to train, prompting the widespread use of heuristic methods such as CART, which suffers from sub-optimal performance due to its greedy nature. Recently, breakthroughs in finding optimal decision trees have emerged; however, these methods still face significant computational costs and struggle with continuous features in large-scale datasets and deep trees. To address these limitations, we introduce a moving-horizon differential evolution algorithm for classification trees with continuous features (MH-DEOCT). Our approach consists of a discrete tree "},"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":"2311.06952","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-11-12T20:34:00Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"e7cf1e22086e3a45be36b2b48dcea6a63dc26d123a51a0a54592b97027140730","abstract_canon_sha256":"7ed31a00681923ffa7dbc8c429d745ab7857d7a7df1a28a545a4bdbc0ad2e516"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:12:05.998310Z","signature_b64":"3IbsYX39NDCh6Oa6j2c+8SySRBzgA2/pvvH/9ACL0MO6tpT+o0JTcY/4vHK1Ipelh+lPQ+/bBzEsDoKIftZeAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b007dc1f7e80839bb678bd8aa0dfc9bac08b1091a6ed1d328231eaef7044a0b5","last_reissued_at":"2026-07-05T07:12:05.997796Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:12:05.997796Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A GPU-Accelerated Moving-Horizon Algorithm for Training Deep Classification Trees on Large Datasets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Chaojie Ji, Jiayang Ren, Kaixun Hua, Liang Cao, Morimasa Okamoto, Qiangqiang Mao, Valent\\'in Osuna-Enciso, Yankai Cao","submitted_at":"2023-11-12T20:34:00Z","abstract_excerpt":"Decision trees are essential yet NP-complete to train, prompting the widespread use of heuristic methods such as CART, which suffers from sub-optimal performance due to its greedy nature. Recently, breakthroughs in finding optimal decision trees have emerged; however, these methods still face significant computational costs and struggle with continuous features in large-scale datasets and deep trees. To address these limitations, we introduce a moving-horizon differential evolution algorithm for classification trees with continuous features (MH-DEOCT). Our approach consists of a discrete tree "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.06952","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/2311.06952/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":"2311.06952","created_at":"2026-07-05T07:12:05.997858+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.06952v1","created_at":"2026-07-05T07:12:05.997858+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.06952","created_at":"2026-07-05T07:12:05.997858+00:00"},{"alias_kind":"pith_short_12","alias_value":"WAD5YH36QCBZ","created_at":"2026-07-05T07:12:05.997858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WAD5YH36QCBZXNTY","created_at":"2026-07-05T07:12:05.997858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WAD5YH36","created_at":"2026-07-05T07:12:05.997858+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/WAD5YH36QCBZXNTYXWFKBX6JXL","json":"https://pith.science/pith/WAD5YH36QCBZXNTYXWFKBX6JXL.json","graph_json":"https://pith.science/api/pith-number/WAD5YH36QCBZXNTYXWFKBX6JXL/graph.json","events_json":"https://pith.science/api/pith-number/WAD5YH36QCBZXNTYXWFKBX6JXL/events.json","paper":"https://pith.science/paper/WAD5YH36"},"agent_actions":{"view_html":"https://pith.science/pith/WAD5YH36QCBZXNTYXWFKBX6JXL","download_json":"https://pith.science/pith/WAD5YH36QCBZXNTYXWFKBX6JXL.json","view_paper":"https://pith.science/paper/WAD5YH36","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.06952&json=true","fetch_graph":"https://pith.science/api/pith-number/WAD5YH36QCBZXNTYXWFKBX6JXL/graph.json","fetch_events":"https://pith.science/api/pith-number/WAD5YH36QCBZXNTYXWFKBX6JXL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WAD5YH36QCBZXNTYXWFKBX6JXL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WAD5YH36QCBZXNTYXWFKBX6JXL/action/storage_attestation","attest_author":"https://pith.science/pith/WAD5YH36QCBZXNTYXWFKBX6JXL/action/author_attestation","sign_citation":"https://pith.science/pith/WAD5YH36QCBZXNTYXWFKBX6JXL/action/citation_signature","submit_replication":"https://pith.science/pith/WAD5YH36QCBZXNTYXWFKBX6JXL/action/replication_record"}},"created_at":"2026-07-05T07:12:05.997858+00:00","updated_at":"2026-07-05T07:12:05.997858+00:00"}