{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:MCBQGD2M4R7VWB6ZVY2ASV5RDC","short_pith_number":"pith:MCBQGD2M","schema_version":"1.0","canonical_sha256":"6083030f4ce47f5b07d9ae340957b1188dbe25b957b6d148e762e2eb443e9f73","source":{"kind":"arxiv","id":"2211.12653","version":4},"attestation_state":"computed","paper":{"title":"Consistency of Oblique Decision Tree and its Boosting and Random Forest","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Haoran Zhan, Yingcun Xia, Yu Liu","submitted_at":"2022-11-23T01:16:57Z","abstract_excerpt":"Classification and Regression Tree (CART), Random Forest (RF) and Gradient Boosting Tree (GBT) are probably the most popular set of statistical learning methods. However, their statistical consistency can only be proved under very restrictive assumptions on the underlying regression function. As an extension to standard CART, the oblique decision tree (ODT), which uses linear combinations of predictors as partitioning variables, has received much attention. ODT tends to perform numerically better than CART and requires fewer partitions. In this paper, we show that ODT is consistent for very ge"},"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":"2211.12653","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2022-11-23T01:16:57Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"0c5d88e74b33c4b70694a6dbd745c94a3dabf27b47d93fc7dfda0cc615b124f6","abstract_canon_sha256":"60cb4d42c887bfa2f54074c71097a5b96b92e409d395b34c27994cbc1eb98939"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:14:00.904481Z","signature_b64":"X5N1hHOn8NMaRoq1n+K1l4SyMoGPDnj762Qfrib0pVb/2N8lJDJJDxR98vIANsloLYf9caO60QnY9UyhrOsTBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6083030f4ce47f5b07d9ae340957b1188dbe25b957b6d148e762e2eb443e9f73","last_reissued_at":"2026-07-05T10:14:00.903975Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:14:00.903975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Consistency of Oblique Decision Tree and its Boosting and Random Forest","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Haoran Zhan, Yingcun Xia, Yu Liu","submitted_at":"2022-11-23T01:16:57Z","abstract_excerpt":"Classification and Regression Tree (CART), Random Forest (RF) and Gradient Boosting Tree (GBT) are probably the most popular set of statistical learning methods. However, their statistical consistency can only be proved under very restrictive assumptions on the underlying regression function. As an extension to standard CART, the oblique decision tree (ODT), which uses linear combinations of predictors as partitioning variables, has received much attention. ODT tends to perform numerically better than CART and requires fewer partitions. In this paper, we show that ODT is consistent for very ge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.12653","kind":"arxiv","version":4},"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/2211.12653/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":"2211.12653","created_at":"2026-07-05T10:14:00.904045+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.12653v4","created_at":"2026-07-05T10:14:00.904045+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.12653","created_at":"2026-07-05T10:14:00.904045+00:00"},{"alias_kind":"pith_short_12","alias_value":"MCBQGD2M4R7V","created_at":"2026-07-05T10:14:00.904045+00:00"},{"alias_kind":"pith_short_16","alias_value":"MCBQGD2M4R7VWB6Z","created_at":"2026-07-05T10:14:00.904045+00:00"},{"alias_kind":"pith_short_8","alias_value":"MCBQGD2M","created_at":"2026-07-05T10:14:00.904045+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.13376","citing_title":"ODTE -- An ensemble of multi-class SVM-based oblique decision trees","ref_index":51,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MCBQGD2M4R7VWB6ZVY2ASV5RDC","json":"https://pith.science/pith/MCBQGD2M4R7VWB6ZVY2ASV5RDC.json","graph_json":"https://pith.science/api/pith-number/MCBQGD2M4R7VWB6ZVY2ASV5RDC/graph.json","events_json":"https://pith.science/api/pith-number/MCBQGD2M4R7VWB6ZVY2ASV5RDC/events.json","paper":"https://pith.science/paper/MCBQGD2M"},"agent_actions":{"view_html":"https://pith.science/pith/MCBQGD2M4R7VWB6ZVY2ASV5RDC","download_json":"https://pith.science/pith/MCBQGD2M4R7VWB6ZVY2ASV5RDC.json","view_paper":"https://pith.science/paper/MCBQGD2M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.12653&json=true","fetch_graph":"https://pith.science/api/pith-number/MCBQGD2M4R7VWB6ZVY2ASV5RDC/graph.json","fetch_events":"https://pith.science/api/pith-number/MCBQGD2M4R7VWB6ZVY2ASV5RDC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MCBQGD2M4R7VWB6ZVY2ASV5RDC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MCBQGD2M4R7VWB6ZVY2ASV5RDC/action/storage_attestation","attest_author":"https://pith.science/pith/MCBQGD2M4R7VWB6ZVY2ASV5RDC/action/author_attestation","sign_citation":"https://pith.science/pith/MCBQGD2M4R7VWB6ZVY2ASV5RDC/action/citation_signature","submit_replication":"https://pith.science/pith/MCBQGD2M4R7VWB6ZVY2ASV5RDC/action/replication_record"}},"created_at":"2026-07-05T10:14:00.904045+00:00","updated_at":"2026-07-05T10:14:00.904045+00:00"}