{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YDJD7DLNPJOM5SXXKXEEJOV6KP","short_pith_number":"pith:YDJD7DLN","schema_version":"1.0","canonical_sha256":"c0d23f8d6d7a5ccecaf755c844babe53dd8162f327714ec6b0528236f4ffd053","source":{"kind":"arxiv","id":"1802.05640","version":3},"attestation_state":"computed","paper":{"title":"Gradient Boosting With Piece-Wise Linear Regression Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jian Li, Yu Shi, Zhize Li","submitted_at":"2018-02-15T16:26:35Z","abstract_excerpt":"Gradient Boosted Decision Trees (GBDT) is a very successful ensemble learning algorithm widely used across a variety of applications. Recently, several variants of GBDT training algorithms and implementations have been designed and heavily optimized in some very popular open sourced toolkits including XGBoost, LightGBM and CatBoost. In this paper, we show that both the accuracy and efficiency of GBDT can be further enhanced by using more complex base learners. Specifically, we extend gradient boosting to use piecewise linear regression trees (PL Trees), instead of piecewise constant regression"},"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":"1802.05640","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-15T16:26:35Z","cross_cats_sorted":[],"title_canon_sha256":"d88aa9c9aa2fc6589a8dd87d13921051f2174482ccf18d2ab638c05debf7b0f8","abstract_canon_sha256":"fe373cfb3d483836f5aaa72cce6b9d8833c4f8d6797720d1a635044999db9b34"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:15.476074Z","signature_b64":"dt7mngOvkxv0Vk9WuTV/RTQckWST95BYX4E70D69Mu9zIM2Brmls2KABTYQpcoYYwi1e+8dsi4Gvxx1S71MACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0d23f8d6d7a5ccecaf755c844babe53dd8162f327714ec6b0528236f4ffd053","last_reissued_at":"2026-05-17T23:42:15.475358Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:15.475358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gradient Boosting With Piece-Wise Linear Regression Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jian Li, Yu Shi, Zhize Li","submitted_at":"2018-02-15T16:26:35Z","abstract_excerpt":"Gradient Boosted Decision Trees (GBDT) is a very successful ensemble learning algorithm widely used across a variety of applications. Recently, several variants of GBDT training algorithms and implementations have been designed and heavily optimized in some very popular open sourced toolkits including XGBoost, LightGBM and CatBoost. In this paper, we show that both the accuracy and efficiency of GBDT can be further enhanced by using more complex base learners. Specifically, we extend gradient boosting to use piecewise linear regression trees (PL Trees), instead of piecewise constant regression"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05640","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":""},"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":"1802.05640","created_at":"2026-05-17T23:42:15.475476+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.05640v3","created_at":"2026-05-17T23:42:15.475476+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05640","created_at":"2026-05-17T23:42:15.475476+00:00"},{"alias_kind":"pith_short_12","alias_value":"YDJD7DLNPJOM","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YDJD7DLNPJOM5SXX","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YDJD7DLN","created_at":"2026-05-18T12:33:04.347982+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/YDJD7DLNPJOM5SXXKXEEJOV6KP","json":"https://pith.science/pith/YDJD7DLNPJOM5SXXKXEEJOV6KP.json","graph_json":"https://pith.science/api/pith-number/YDJD7DLNPJOM5SXXKXEEJOV6KP/graph.json","events_json":"https://pith.science/api/pith-number/YDJD7DLNPJOM5SXXKXEEJOV6KP/events.json","paper":"https://pith.science/paper/YDJD7DLN"},"agent_actions":{"view_html":"https://pith.science/pith/YDJD7DLNPJOM5SXXKXEEJOV6KP","download_json":"https://pith.science/pith/YDJD7DLNPJOM5SXXKXEEJOV6KP.json","view_paper":"https://pith.science/paper/YDJD7DLN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.05640&json=true","fetch_graph":"https://pith.science/api/pith-number/YDJD7DLNPJOM5SXXKXEEJOV6KP/graph.json","fetch_events":"https://pith.science/api/pith-number/YDJD7DLNPJOM5SXXKXEEJOV6KP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YDJD7DLNPJOM5SXXKXEEJOV6KP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YDJD7DLNPJOM5SXXKXEEJOV6KP/action/storage_attestation","attest_author":"https://pith.science/pith/YDJD7DLNPJOM5SXXKXEEJOV6KP/action/author_attestation","sign_citation":"https://pith.science/pith/YDJD7DLNPJOM5SXXKXEEJOV6KP/action/citation_signature","submit_replication":"https://pith.science/pith/YDJD7DLNPJOM5SXXKXEEJOV6KP/action/replication_record"}},"created_at":"2026-05-17T23:42:15.475476+00:00","updated_at":"2026-05-17T23:42:15.475476+00:00"}