{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4EYLQFSRMW2CPG2E7L5UU6R4ZE","short_pith_number":"pith:4EYLQFSR","canonical_record":{"source":{"id":"1706.08359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-26T13:27:29Z","cross_cats_sorted":["cs.DC","cs.LG"],"title_canon_sha256":"4bff25cfe59c3f6d6d2de80c08dd1e5927f5eeea3a01bf2e7da6c480892267b9","abstract_canon_sha256":"7f02f32dd8926debe30a28c3e2bc412a614ef45da5ed669625a9a4ec04744557"},"schema_version":"1.0"},"canonical_sha256":"e130b8165165b4279b44fafb4a7a3cc92d51ddb987d700cbd99b71acdc58672f","source":{"kind":"arxiv","id":"1706.08359","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08359","created_at":"2026-05-18T00:41:42Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08359v1","created_at":"2026-05-18T00:41:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08359","created_at":"2026-05-18T00:41:42Z"},{"alias_kind":"pith_short_12","alias_value":"4EYLQFSRMW2C","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4EYLQFSRMW2CPG2E","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4EYLQFSR","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4EYLQFSRMW2CPG2E7L5UU6R4ZE","target":"record","payload":{"canonical_record":{"source":{"id":"1706.08359","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-26T13:27:29Z","cross_cats_sorted":["cs.DC","cs.LG"],"title_canon_sha256":"4bff25cfe59c3f6d6d2de80c08dd1e5927f5eeea3a01bf2e7da6c480892267b9","abstract_canon_sha256":"7f02f32dd8926debe30a28c3e2bc412a614ef45da5ed669625a9a4ec04744557"},"schema_version":"1.0"},"canonical_sha256":"e130b8165165b4279b44fafb4a7a3cc92d51ddb987d700cbd99b71acdc58672f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:42.790295Z","signature_b64":"qaKnNxzLkDQpM8wYpKdWoBTrLoYxZfXBVcGI0gxxDIetO+YC79QtblnR5ouXrX7pDwB8XzQw9g5gnHCbbCWjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e130b8165165b4279b44fafb4a7a3cc92d51ddb987d700cbd99b71acdc58672f","last_reissued_at":"2026-05-18T00:41:42.789637Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:42.789637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.08359","source_version":1,"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-18T00:41:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ivet6rV/hGKCMYXTTFp0W1gQNPyMoKWZMAvSDvdtMHJiaS5gzATQ3gAfS+BYeFWWfddlGbT5J9WHA8PAbrmeCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T20:34:30.536594Z"},"content_sha256":"198d960e9900e5fc1d93c955075fe649b0c44cccf8521e6f5ff571a3ddd7eff0","schema_version":"1.0","event_id":"sha256:198d960e9900e5fc1d93c955075fe649b0c44cccf8521e6f5ff571a3ddd7eff0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4EYLQFSRMW2CPG2E7L5UU6R4ZE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GPU-acceleration for Large-scale Tree Boosting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG"],"primary_cat":"stat.ML","authors_text":"Cho-Jui Hsieh, Huan Zhang, Si Si","submitted_at":"2017-06-26T13:27:29Z","abstract_excerpt":"In this paper, we present a novel massively parallel algorithm for accelerating the decision tree building procedure on GPUs (Graphics Processing Units), which is a crucial step in Gradient Boosted Decision Tree (GBDT) and random forests training. Previous GPU based tree building algorithms are based on parallel multi-scan or radix sort to find the exact tree split, and thus suffer from scalability and performance issues. We show that using a histogram based algorithm to approximately find the best split is more efficient and scalable on GPU. By identifying the difference between classical GPU"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08359","kind":"arxiv","version":1},"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-18T00:41:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sx7v4qGBz4i5baTyLFRoB9r6i765kDzJXu0sV4EmsLcsVSSC08+t1MlxLEN5vy4bZIOF7Zc229ZBEyTJqK8fDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T20:34:30.536935Z"},"content_sha256":"26a5e47d98ded349ae9835afa515be2ea15f66f6277d26c9682ce74d04912d64","schema_version":"1.0","event_id":"sha256:26a5e47d98ded349ae9835afa515be2ea15f66f6277d26c9682ce74d04912d64"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4EYLQFSRMW2CPG2E7L5UU6R4ZE/bundle.json","state_url":"https://pith.science/pith/4EYLQFSRMW2CPG2E7L5UU6R4ZE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4EYLQFSRMW2CPG2E7L5UU6R4ZE/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-19T20:34:30Z","links":{"resolver":"https://pith.science/pith/4EYLQFSRMW2CPG2E7L5UU6R4ZE","bundle":"https://pith.science/pith/4EYLQFSRMW2CPG2E7L5UU6R4ZE/bundle.json","state":"https://pith.science/pith/4EYLQFSRMW2CPG2E7L5UU6R4ZE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4EYLQFSRMW2CPG2E7L5UU6R4ZE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4EYLQFSRMW2CPG2E7L5UU6R4ZE","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":"7f02f32dd8926debe30a28c3e2bc412a614ef45da5ed669625a9a4ec04744557","cross_cats_sorted":["cs.DC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-26T13:27:29Z","title_canon_sha256":"4bff25cfe59c3f6d6d2de80c08dd1e5927f5eeea3a01bf2e7da6c480892267b9"},"schema_version":"1.0","source":{"id":"1706.08359","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.08359","created_at":"2026-05-18T00:41:42Z"},{"alias_kind":"arxiv_version","alias_value":"1706.08359v1","created_at":"2026-05-18T00:41:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.08359","created_at":"2026-05-18T00:41:42Z"},{"alias_kind":"pith_short_12","alias_value":"4EYLQFSRMW2C","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4EYLQFSRMW2CPG2E","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4EYLQFSR","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:26a5e47d98ded349ae9835afa515be2ea15f66f6277d26c9682ce74d04912d64","target":"graph","created_at":"2026-05-18T00:41:42Z","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":"In this paper, we present a novel massively parallel algorithm for accelerating the decision tree building procedure on GPUs (Graphics Processing Units), which is a crucial step in Gradient Boosted Decision Tree (GBDT) and random forests training. Previous GPU based tree building algorithms are based on parallel multi-scan or radix sort to find the exact tree split, and thus suffer from scalability and performance issues. We show that using a histogram based algorithm to approximately find the best split is more efficient and scalable on GPU. By identifying the difference between classical GPU","authors_text":"Cho-Jui Hsieh, Huan Zhang, Si Si","cross_cats":["cs.DC","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-26T13:27:29Z","title":"GPU-acceleration for Large-scale Tree Boosting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.08359","kind":"arxiv","version":1},"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:198d960e9900e5fc1d93c955075fe649b0c44cccf8521e6f5ff571a3ddd7eff0","target":"record","created_at":"2026-05-18T00:41:42Z","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":"7f02f32dd8926debe30a28c3e2bc412a614ef45da5ed669625a9a4ec04744557","cross_cats_sorted":["cs.DC","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-06-26T13:27:29Z","title_canon_sha256":"4bff25cfe59c3f6d6d2de80c08dd1e5927f5eeea3a01bf2e7da6c480892267b9"},"schema_version":"1.0","source":{"id":"1706.08359","kind":"arxiv","version":1}},"canonical_sha256":"e130b8165165b4279b44fafb4a7a3cc92d51ddb987d700cbd99b71acdc58672f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e130b8165165b4279b44fafb4a7a3cc92d51ddb987d700cbd99b71acdc58672f","first_computed_at":"2026-05-18T00:41:42.789637Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:42.789637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qaKnNxzLkDQpM8wYpKdWoBTrLoYxZfXBVcGI0gxxDIetO+YC79QtblnR5ouXrX7pDwB8XzQw9g5gnHCbbCWjBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:42.790295Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.08359","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:198d960e9900e5fc1d93c955075fe649b0c44cccf8521e6f5ff571a3ddd7eff0","sha256:26a5e47d98ded349ae9835afa515be2ea15f66f6277d26c9682ce74d04912d64"],"state_sha256":"e819161c702b2d536a68f663bd9cf0f42fd19b1f918ed988ddfa59f06ed16c8a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QPNcz8gW+PCIG0UL9w3o0NikDICRQ55ratOoBvNrf0oAf+/yDlG9hJfAeJe31wlmVLlxHUccUq4q6t7jKJ5fDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T20:34:30.538843Z","bundle_sha256":"75820e492ddf6891f54968b13daff9d0f53bbac3e41757cf6b94f5432fc0978b"}}