{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VXX6E4QHHJNME2WIXZTVC63CEO","short_pith_number":"pith:VXX6E4QH","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"},"canonical_sha256":"adefe272073a5ac26ac8be67517b6223b7a066717fb487131d93a93e9a5f1814","source":{"kind":"arxiv","id":"1809.04559","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04559","created_at":"2026-05-17T23:56:09Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04559v3","created_at":"2026-05-17T23:56:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04559","created_at":"2026-05-17T23:56:09Z"},{"alias_kind":"pith_short_12","alias_value":"VXX6E4QHHJNM","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VXX6E4QHHJNME2WI","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VXX6E4QH","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VXX6E4QHHJNME2WIXZTVC63CEO","target":"record","payload":{"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"},"canonical_sha256":"adefe272073a5ac26ac8be67517b6223b7a066717fb487131d93a93e9a5f1814","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"},"source_kind":"arxiv","source_id":"1809.04559","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:56:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HzhPVk+jB570QsfmI+TgXKjiAWI2BQQkaSE5TfodNbTd7E3QWbwi65rhzVxVcswk/a4GTw4MxULsWj4KmDfdAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:19:04.887737Z"},"content_sha256":"f31ed91bc27222e2692da23b7edfd6e6ad0dac22447344450f34661766f9d82b","schema_version":"1.0","event_id":"sha256:f31ed91bc27222e2692da23b7edfd6e6ad0dac22447344450f34661766f9d82b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VXX6E4QHHJNME2WIXZTVC63CEO","target":"graph","payload":{"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"},"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:56:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8BiO0mQ3J9zIuH33kGGdBWR9ua82hK55W0UWV0nLzUAMV9/nVm5siMD7G2Uhp2zOtPSBG9e5Arge7W/u8Y/MCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:19:04.888083Z"},"content_sha256":"aed0fdb504a7b4e60c6c96392868aa05901bef6ece23a9c71dcb740a36d35276","schema_version":"1.0","event_id":"sha256:aed0fdb504a7b4e60c6c96392868aa05901bef6ece23a9c71dcb740a36d35276"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VXX6E4QHHJNME2WIXZTVC63CEO/bundle.json","state_url":"https://pith.science/pith/VXX6E4QHHJNME2WIXZTVC63CEO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VXX6E4QHHJNME2WIXZTVC63CEO/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-06-20T05:19:04Z","links":{"resolver":"https://pith.science/pith/VXX6E4QHHJNME2WIXZTVC63CEO","bundle":"https://pith.science/pith/VXX6E4QHHJNME2WIXZTVC63CEO/bundle.json","state":"https://pith.science/pith/VXX6E4QHHJNME2WIXZTVC63CEO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VXX6E4QHHJNME2WIXZTVC63CEO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VXX6E4QHHJNME2WIXZTVC63CEO","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":"b40af02ff2a6b3303f38c3ac286df5fa82d7f497d0202e5ebe7bda4367e45e73","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-12T16:51:18Z","title_canon_sha256":"6af8212a27c5e48a0713f27709e3e08a49836ba7ffd3d53078edf96d388245f0"},"schema_version":"1.0","source":{"id":"1809.04559","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.04559","created_at":"2026-05-17T23:56:09Z"},{"alias_kind":"arxiv_version","alias_value":"1809.04559v3","created_at":"2026-05-17T23:56:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.04559","created_at":"2026-05-17T23:56:09Z"},{"alias_kind":"pith_short_12","alias_value":"VXX6E4QHHJNM","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"VXX6E4QHHJNME2WI","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"VXX6E4QH","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:aed0fdb504a7b4e60c6c96392868aa05901bef6ece23a9c71dcb740a36d35276","target":"graph","created_at":"2026-05-17T23:56:09Z","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 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","authors_text":"Alessandro De Palma, Andreea Anghel, Haralampos Pozidis, Nikolaos Papandreou, Thomas Parnell","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-12T16:51:18Z","title":"Benchmarking and Optimization of Gradient Boosting Decision Tree Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.04559","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:f31ed91bc27222e2692da23b7edfd6e6ad0dac22447344450f34661766f9d82b","target":"record","created_at":"2026-05-17T23:56:09Z","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":"b40af02ff2a6b3303f38c3ac286df5fa82d7f497d0202e5ebe7bda4367e45e73","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-09-12T16:51:18Z","title_canon_sha256":"6af8212a27c5e48a0713f27709e3e08a49836ba7ffd3d53078edf96d388245f0"},"schema_version":"1.0","source":{"id":"1809.04559","kind":"arxiv","version":3}},"canonical_sha256":"adefe272073a5ac26ac8be67517b6223b7a066717fb487131d93a93e9a5f1814","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"adefe272073a5ac26ac8be67517b6223b7a066717fb487131d93a93e9a5f1814","first_computed_at":"2026-05-17T23:56:09.612571Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:09.612571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y5m0++Y6B1srU8Q5raF1qq5c3tAPBn3AKn/2uHZU+v8GhL8tE8qmD7XrQS1WQYinkgR5koqXVxGplu/6zKzwDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:09.613258Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.04559","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f31ed91bc27222e2692da23b7edfd6e6ad0dac22447344450f34661766f9d82b","sha256:aed0fdb504a7b4e60c6c96392868aa05901bef6ece23a9c71dcb740a36d35276"],"state_sha256":"44954c2d17760d893c1cfa4a89e32908de8ef3d8409ddf78395f89fb34ca32f1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PM4BpydfoKVfXrMAkEwYTFQNiZGpzfBMD1C+zrzxxMTl9EgU++9v9g1S8pVBwnBonz9q9MVz/L4wEad+5b/NDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T05:19:04.890047Z","bundle_sha256":"aecbd86c470a5fc7853dd50e27f7faf251a184be62d12b1b769b5b8a12447644"}}