{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HFDC32CYMBQPQSK6WYTO6WR6PJ","short_pith_number":"pith:HFDC32CY","canonical_record":{"source":{"id":"1603.02754","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-09T01:11:51Z","cross_cats_sorted":[],"title_canon_sha256":"f9cbc13a4291faaaa2196482a52a766dac154fdeb699fc281fe2eedddef6524a","abstract_canon_sha256":"2820ded071a737dcf6dcac1ede35ae14df0e2313ab2270f830665f1736cee980"},"schema_version":"1.0"},"canonical_sha256":"39462de8586060f8495eb626ef5a3e7a5c5e64aef70d4a2bcdfb0f3f30e38efd","source":{"kind":"arxiv","id":"1603.02754","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02754","created_at":"2026-05-18T01:12:34Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02754v3","created_at":"2026-05-18T01:12:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02754","created_at":"2026-05-18T01:12:34Z"},{"alias_kind":"pith_short_12","alias_value":"HFDC32CYMBQP","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HFDC32CYMBQPQSK6","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HFDC32CY","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HFDC32CYMBQPQSK6WYTO6WR6PJ","target":"record","payload":{"canonical_record":{"source":{"id":"1603.02754","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-09T01:11:51Z","cross_cats_sorted":[],"title_canon_sha256":"f9cbc13a4291faaaa2196482a52a766dac154fdeb699fc281fe2eedddef6524a","abstract_canon_sha256":"2820ded071a737dcf6dcac1ede35ae14df0e2313ab2270f830665f1736cee980"},"schema_version":"1.0"},"canonical_sha256":"39462de8586060f8495eb626ef5a3e7a5c5e64aef70d4a2bcdfb0f3f30e38efd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:34.408388Z","signature_b64":"cvYq8usfXY9gg5cw+PtcF5X0cnFN2tk8yfPM8tsO5kSpqgUlfulvGKMnRYZW7xnAuNGtgc6VFAocaxJqwyAhAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"39462de8586060f8495eb626ef5a3e7a5c5e64aef70d4a2bcdfb0f3f30e38efd","last_reissued_at":"2026-05-18T01:12:34.407775Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:34.407775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.02754","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-18T01:12:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P2C186+j0RIxlrh2xBqn2AtbqXxne43B1GRoghns5Yqr8SFlb6qIjjZtD9YkrHuSz5ELBY2ugX1LAyhcCzUyAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:13:37.467028Z"},"content_sha256":"e32e4547393097b57ec93e34e713e02688d78752cc764f24f53dd6fcf84a236d","schema_version":"1.0","event_id":"sha256:e32e4547393097b57ec93e34e713e02688d78752cc764f24f53dd6fcf84a236d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HFDC32CYMBQPQSK6WYTO6WR6PJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"XGBoost: A Scalable Tree Boosting System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Carlos Guestrin, Tianqi Chen","submitted_at":"2016-03-09T01:11:51Z","abstract_excerpt":"Tree boosting is a highly effective and widely used machine learning method. In this paper, we describe a scalable end-to-end tree boosting system called XGBoost, which is used widely by data scientists to achieve state-of-the-art results on many machine learning challenges. We propose a novel sparsity-aware algorithm for sparse data and weighted quantile sketch for approximate tree learning. More importantly, we provide insights on cache access patterns, data compression and sharding to build a scalable tree boosting system. By combining these insights, XGBoost scales beyond billions of examp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02754","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-18T01:12:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c5KV9+GUdYY4ZoeIL/2q64+yUkRcnGZUXoiaGggyLGAEpBmWQsg8dIP+ZAUDZEUQd75VqsT37Nxw6HksSzanDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:13:37.467681Z"},"content_sha256":"e99f68394a6813d403b5510ee13b7067f4b1b5fb4a4230a2a6fc5fabe23921c4","schema_version":"1.0","event_id":"sha256:e99f68394a6813d403b5510ee13b7067f4b1b5fb4a4230a2a6fc5fabe23921c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HFDC32CYMBQPQSK6WYTO6WR6PJ/bundle.json","state_url":"https://pith.science/pith/HFDC32CYMBQPQSK6WYTO6WR6PJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HFDC32CYMBQPQSK6WYTO6WR6PJ/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-09T06:13:37Z","links":{"resolver":"https://pith.science/pith/HFDC32CYMBQPQSK6WYTO6WR6PJ","bundle":"https://pith.science/pith/HFDC32CYMBQPQSK6WYTO6WR6PJ/bundle.json","state":"https://pith.science/pith/HFDC32CYMBQPQSK6WYTO6WR6PJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HFDC32CYMBQPQSK6WYTO6WR6PJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HFDC32CYMBQPQSK6WYTO6WR6PJ","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":"2820ded071a737dcf6dcac1ede35ae14df0e2313ab2270f830665f1736cee980","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-09T01:11:51Z","title_canon_sha256":"f9cbc13a4291faaaa2196482a52a766dac154fdeb699fc281fe2eedddef6524a"},"schema_version":"1.0","source":{"id":"1603.02754","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.02754","created_at":"2026-05-18T01:12:34Z"},{"alias_kind":"arxiv_version","alias_value":"1603.02754v3","created_at":"2026-05-18T01:12:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.02754","created_at":"2026-05-18T01:12:34Z"},{"alias_kind":"pith_short_12","alias_value":"HFDC32CYMBQP","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HFDC32CYMBQPQSK6","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HFDC32CY","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:e99f68394a6813d403b5510ee13b7067f4b1b5fb4a4230a2a6fc5fabe23921c4","target":"graph","created_at":"2026-05-18T01:12:34Z","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":"Tree boosting is a highly effective and widely used machine learning method. In this paper, we describe a scalable end-to-end tree boosting system called XGBoost, which is used widely by data scientists to achieve state-of-the-art results on many machine learning challenges. We propose a novel sparsity-aware algorithm for sparse data and weighted quantile sketch for approximate tree learning. More importantly, we provide insights on cache access patterns, data compression and sharding to build a scalable tree boosting system. By combining these insights, XGBoost scales beyond billions of examp","authors_text":"Carlos Guestrin, Tianqi Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-09T01:11:51Z","title":"XGBoost: A Scalable Tree Boosting System"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.02754","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:e32e4547393097b57ec93e34e713e02688d78752cc764f24f53dd6fcf84a236d","target":"record","created_at":"2026-05-18T01:12:34Z","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":"2820ded071a737dcf6dcac1ede35ae14df0e2313ab2270f830665f1736cee980","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-09T01:11:51Z","title_canon_sha256":"f9cbc13a4291faaaa2196482a52a766dac154fdeb699fc281fe2eedddef6524a"},"schema_version":"1.0","source":{"id":"1603.02754","kind":"arxiv","version":3}},"canonical_sha256":"39462de8586060f8495eb626ef5a3e7a5c5e64aef70d4a2bcdfb0f3f30e38efd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"39462de8586060f8495eb626ef5a3e7a5c5e64aef70d4a2bcdfb0f3f30e38efd","first_computed_at":"2026-05-18T01:12:34.407775Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:34.407775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cvYq8usfXY9gg5cw+PtcF5X0cnFN2tk8yfPM8tsO5kSpqgUlfulvGKMnRYZW7xnAuNGtgc6VFAocaxJqwyAhAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:34.408388Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.02754","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e32e4547393097b57ec93e34e713e02688d78752cc764f24f53dd6fcf84a236d","sha256:e99f68394a6813d403b5510ee13b7067f4b1b5fb4a4230a2a6fc5fabe23921c4"],"state_sha256":"e7b98a6cc0db157a01a2d0f7e895a7211fa39213b0f1f6cc3ae4116d9a3ca899"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jhCR8v+Oxl/Y1eKwRJ0UYQAZe3XyTcYAQbfuTBaUxLIJ8cQK2mXSznL/vNSJJbeN3lUZecYdGMiExY837YEmCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:13:37.471373Z","bundle_sha256":"db3fefbf6aa2de6ccf76f5a4461c5dcb8a9ffe26cf22a0a750887cc9d8703b3e"}}