{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YDJD7DLNPJOM5SXXKXEEJOV6KP","short_pith_number":"pith:YDJD7DLN","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"},"canonical_sha256":"c0d23f8d6d7a5ccecaf755c844babe53dd8162f327714ec6b0528236f4ffd053","source":{"kind":"arxiv","id":"1802.05640","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05640","created_at":"2026-05-17T23:42:15Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05640v3","created_at":"2026-05-17T23:42:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05640","created_at":"2026-05-17T23:42:15Z"},{"alias_kind":"pith_short_12","alias_value":"YDJD7DLNPJOM","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YDJD7DLNPJOM5SXX","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YDJD7DLN","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YDJD7DLNPJOM5SXXKXEEJOV6KP","target":"record","payload":{"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"},"canonical_sha256":"c0d23f8d6d7a5ccecaf755c844babe53dd8162f327714ec6b0528236f4ffd053","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"},"source_kind":"arxiv","source_id":"1802.05640","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aVyrRyYwGzznmgFuB2dBKn+owwjZOtsSbf5BWeBUCTSTszvpP+oNRQOfLWtYhk2Eay/2Z4KWB/N1dS2zxqLZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:34:48.665103Z"},"content_sha256":"edc376255918047f5c894fee020ff68438398712fe41ff16e7295e176cedf3a2","schema_version":"1.0","event_id":"sha256:edc376255918047f5c894fee020ff68438398712fe41ff16e7295e176cedf3a2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YDJD7DLNPJOM5SXXKXEEJOV6KP","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:42:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qcQnse8pVeT/VVbLVDhhnLBWAX76tbZHzc7BVV5V+4SsO+36FB52xcbsVmnH6e7yYVrwkUb/oUJGZPMRFjwgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T09:34:48.665779Z"},"content_sha256":"b31c83b42da3f29e9e1b1f298e9017dbe758fdb52b012178a299195fd0187c97","schema_version":"1.0","event_id":"sha256:b31c83b42da3f29e9e1b1f298e9017dbe758fdb52b012178a299195fd0187c97"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YDJD7DLNPJOM5SXXKXEEJOV6KP/bundle.json","state_url":"https://pith.science/pith/YDJD7DLNPJOM5SXXKXEEJOV6KP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YDJD7DLNPJOM5SXXKXEEJOV6KP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T09:34:48Z","links":{"resolver":"https://pith.science/pith/YDJD7DLNPJOM5SXXKXEEJOV6KP","bundle":"https://pith.science/pith/YDJD7DLNPJOM5SXXKXEEJOV6KP/bundle.json","state":"https://pith.science/pith/YDJD7DLNPJOM5SXXKXEEJOV6KP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YDJD7DLNPJOM5SXXKXEEJOV6KP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YDJD7DLNPJOM5SXXKXEEJOV6KP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fe373cfb3d483836f5aaa72cce6b9d8833c4f8d6797720d1a635044999db9b34","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-15T16:26:35Z","title_canon_sha256":"d88aa9c9aa2fc6589a8dd87d13921051f2174482ccf18d2ab638c05debf7b0f8"},"schema_version":"1.0","source":{"id":"1802.05640","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05640","created_at":"2026-05-17T23:42:15Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05640v3","created_at":"2026-05-17T23:42:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05640","created_at":"2026-05-17T23:42:15Z"},{"alias_kind":"pith_short_12","alias_value":"YDJD7DLNPJOM","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YDJD7DLNPJOM5SXX","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YDJD7DLN","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:b31c83b42da3f29e9e1b1f298e9017dbe758fdb52b012178a299195fd0187c97","target":"graph","created_at":"2026-05-17T23:42:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Jian Li, Yu Shi, Zhize Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-15T16:26:35Z","title":"Gradient Boosting With Piece-Wise Linear Regression Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05640","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:edc376255918047f5c894fee020ff68438398712fe41ff16e7295e176cedf3a2","target":"record","created_at":"2026-05-17T23:42:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fe373cfb3d483836f5aaa72cce6b9d8833c4f8d6797720d1a635044999db9b34","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-15T16:26:35Z","title_canon_sha256":"d88aa9c9aa2fc6589a8dd87d13921051f2174482ccf18d2ab638c05debf7b0f8"},"schema_version":"1.0","source":{"id":"1802.05640","kind":"arxiv","version":3}},"canonical_sha256":"c0d23f8d6d7a5ccecaf755c844babe53dd8162f327714ec6b0528236f4ffd053","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0d23f8d6d7a5ccecaf755c844babe53dd8162f327714ec6b0528236f4ffd053","first_computed_at":"2026-05-17T23:42:15.475358Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:15.475358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dt7mngOvkxv0Vk9WuTV/RTQckWST95BYX4E70D69Mu9zIM2Brmls2KABTYQpcoYYwi1e+8dsi4Gvxx1S71MACA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:15.476074Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.05640","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:edc376255918047f5c894fee020ff68438398712fe41ff16e7295e176cedf3a2","sha256:b31c83b42da3f29e9e1b1f298e9017dbe758fdb52b012178a299195fd0187c97"],"state_sha256":"f7c07ea13a12ea830b159e409a7b8918bc2198a159e942c600a57968630651c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ptqazL+aUtTWMxKZlkwB4J/KxwIB2sFMUJARRYDlyiCPeaUQBMaV6zpxZehEtjxjaFe8Ep1zEAT7pUi1sRbGDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T09:34:48.671099Z","bundle_sha256":"30bd586ff80a71f5eed2de01bf8871daa045ada4a525db1fe049906aa06a7526"}}