{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VXX6E4QHHJNME2WIXZTVC63CEO","short_pith_number":"pith:VXX6E4QH","schema_version":"1.0","canonical_sha256":"adefe272073a5ac26ac8be67517b6223b7a066717fb487131d93a93e9a5f1814","source":{"kind":"arxiv","id":"1809.04559","version":3},"attestation_state":"computed","paper":{"title":"Benchmarking and Optimization of Gradient Boosting Decision Tree Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alessandro De Palma, Andreea Anghel, Haralampos Pozidis, Nikolaos Papandreou, Thomas Parnell","submitted_at":"2018-09-12T16:51:18Z","abstract_excerpt":"Gradient boosting decision trees (GBDTs) have seen widespread adoption in academia, industry and competitive data science due to their state-of-the-art performance in many machine learning tasks. One relative downside to these models is the large number of hyper-parameters that they expose to the end-user. To maximize the predictive power of GBDT models, one must either manually tune the hyper-parameters, or utilize automated techniques such as those based on Bayesian optimization. Both of these approaches are time-consuming since they involve repeatably training the model for different sets o"},"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":"1809.04559","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-12T16:51:18Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6af8212a27c5e48a0713f27709e3e08a49836ba7ffd3d53078edf96d388245f0","abstract_canon_sha256":"b40af02ff2a6b3303f38c3ac286df5fa82d7f497d0202e5ebe7bda4367e45e73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:09.613258Z","signature_b64":"Y5m0++Y6B1srU8Q5raF1qq5c3tAPBn3AKn/2uHZU+v8GhL8tE8qmD7XrQS1WQYinkgR5koqXVxGplu/6zKzwDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adefe272073a5ac26ac8be67517b6223b7a066717fb487131d93a93e9a5f1814","last_reissued_at":"2026-05-17T23:56:09.612571Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:09.612571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Benchmarking and Optimization of Gradient Boosting Decision Tree Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alessandro De Palma, Andreea Anghel, Haralampos Pozidis, Nikolaos Papandreou, Thomas Parnell","submitted_at":"2018-09-12T16:51:18Z","abstract_excerpt":"Gradient boosting decision trees (GBDTs) have seen widespread adoption in academia, industry and competitive data science due to their state-of-the-art performance in many machine learning tasks. One relative downside to these models is the large number of hyper-parameters that they expose to the end-user. To maximize the predictive power of GBDT models, one must either manually tune the hyper-parameters, or utilize automated techniques such as those based on Bayesian optimization. Both of these approaches are time-consuming since they involve repeatably training the model for different sets o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04559","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":"1809.04559","created_at":"2026-05-17T23:56:09.612679+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.04559v3","created_at":"2026-05-17T23:56:09.612679+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04559","created_at":"2026-05-17T23:56:09.612679+00:00"},{"alias_kind":"pith_short_12","alias_value":"VXX6E4QHHJNM","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VXX6E4QHHJNME2WI","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VXX6E4QH","created_at":"2026-05-18T12:32:59.047623+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/VXX6E4QHHJNME2WIXZTVC63CEO","json":"https://pith.science/pith/VXX6E4QHHJNME2WIXZTVC63CEO.json","graph_json":"https://pith.science/api/pith-number/VXX6E4QHHJNME2WIXZTVC63CEO/graph.json","events_json":"https://pith.science/api/pith-number/VXX6E4QHHJNME2WIXZTVC63CEO/events.json","paper":"https://pith.science/paper/VXX6E4QH"},"agent_actions":{"view_html":"https://pith.science/pith/VXX6E4QHHJNME2WIXZTVC63CEO","download_json":"https://pith.science/pith/VXX6E4QHHJNME2WIXZTVC63CEO.json","view_paper":"https://pith.science/paper/VXX6E4QH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.04559&json=true","fetch_graph":"https://pith.science/api/pith-number/VXX6E4QHHJNME2WIXZTVC63CEO/graph.json","fetch_events":"https://pith.science/api/pith-number/VXX6E4QHHJNME2WIXZTVC63CEO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VXX6E4QHHJNME2WIXZTVC63CEO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VXX6E4QHHJNME2WIXZTVC63CEO/action/storage_attestation","attest_author":"https://pith.science/pith/VXX6E4QHHJNME2WIXZTVC63CEO/action/author_attestation","sign_citation":"https://pith.science/pith/VXX6E4QHHJNME2WIXZTVC63CEO/action/citation_signature","submit_replication":"https://pith.science/pith/VXX6E4QHHJNME2WIXZTVC63CEO/action/replication_record"}},"created_at":"2026-05-17T23:56:09.612679+00:00","updated_at":"2026-05-17T23:56:09.612679+00:00"}