{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:R3RIQA3323POHFE4ELHEYYCTLF","short_pith_number":"pith:R3RIQA33","canonical_record":{"source":{"id":"1711.06793","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-18T02:05:44Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2b9f182994d7d22efd2dbc45a0cd5de4edd626a242626888d709c17ff8e422a9","abstract_canon_sha256":"f67039bdbb0b823092ec595904ec74f0715c28d5a24c20ecc017de755ecd26d5"},"schema_version":"1.0"},"canonical_sha256":"8ee288037bd6dee3949c22ce4c6053595b7a0f5eb1d4007884b874839c22627f","source":{"kind":"arxiv","id":"1711.06793","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06793","created_at":"2026-05-18T00:30:11Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06793v1","created_at":"2026-05-18T00:30:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06793","created_at":"2026-05-18T00:30:11Z"},{"alias_kind":"pith_short_12","alias_value":"R3RIQA3323PO","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"R3RIQA3323POHFE4","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"R3RIQA33","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:R3RIQA3323POHFE4ELHEYYCTLF","target":"record","payload":{"canonical_record":{"source":{"id":"1711.06793","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-18T02:05:44Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2b9f182994d7d22efd2dbc45a0cd5de4edd626a242626888d709c17ff8e422a9","abstract_canon_sha256":"f67039bdbb0b823092ec595904ec74f0715c28d5a24c20ecc017de755ecd26d5"},"schema_version":"1.0"},"canonical_sha256":"8ee288037bd6dee3949c22ce4c6053595b7a0f5eb1d4007884b874839c22627f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:11.042562Z","signature_b64":"XJ8zt1htUdeOt4rHV4ipz6FuZUwqQdnfRHVylhk4tGnfHwEz+nb55qmfyri1KpK1xNg2N7WdNbF2unOtlCxLBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ee288037bd6dee3949c22ce4c6053595b7a0f5eb1d4007884b874839c22627f","last_reissued_at":"2026-05-18T00:30:11.041862Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:11.041862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.06793","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:30:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MHVmJRIMaqD1BcfMvbqipDCWbWj13OHied+n/hUyEW/IxhlPnYzbdt8xRFuBSP/YMenoiaPG1NGN7rG65le2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:37:21.748854Z"},"content_sha256":"23cae54c44e25060d7d4314372d7a344ae524497c57a500e1b2a941114b13995","schema_version":"1.0","event_id":"sha256:23cae54c44e25060d7d4314372d7a344ae524497c57a500e1b2a941114b13995"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:R3RIQA3323POHFE4ELHEYYCTLF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tree-Structured Boosting: Connections Between Gradient Boosted Stumps and Full Decision Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Charles B. Simone II, Efstathios D. Gennatas, Eric Diffenderfer, Eric Eaton, Gilmer Valdes, Jos\\'e Marcio Luna, Lyle H. Ungar, Mateo Wirth, Shane T. Jensen, Timothy D. Solberg","submitted_at":"2017-11-18T02:05:44Z","abstract_excerpt":"Additive models, such as produced by gradient boosting, and full interaction models, such as classification and regression trees (CART), are widely used algorithms that have been investigated largely in isolation. We show that these models exist along a spectrum, revealing never-before-known connections between these two approaches. This paper introduces a novel technique called tree-structured boosting for creating a single decision tree, and shows that this method can produce models equivalent to CART or gradient boosted stumps at the extremes by varying a single parameter. Although tree-str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06793","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:30:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mMAGnSfTFoK8nrZr87BRTRIGYQ/LldUemG1E0M4KTDixs2yxVWuiveo+Cl6z6yzOvWkFfy5LhzUzTSsqn+dCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T08:37:21.749519Z"},"content_sha256":"69a1af48dbd9e87519abc829a9ba594d71eba0429bf3aaf54352b5b5146c849d","schema_version":"1.0","event_id":"sha256:69a1af48dbd9e87519abc829a9ba594d71eba0429bf3aaf54352b5b5146c849d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R3RIQA3323POHFE4ELHEYYCTLF/bundle.json","state_url":"https://pith.science/pith/R3RIQA3323POHFE4ELHEYYCTLF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R3RIQA3323POHFE4ELHEYYCTLF/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-31T08:37:21Z","links":{"resolver":"https://pith.science/pith/R3RIQA3323POHFE4ELHEYYCTLF","bundle":"https://pith.science/pith/R3RIQA3323POHFE4ELHEYYCTLF/bundle.json","state":"https://pith.science/pith/R3RIQA3323POHFE4ELHEYYCTLF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R3RIQA3323POHFE4ELHEYYCTLF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:R3RIQA3323POHFE4ELHEYYCTLF","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":"f67039bdbb0b823092ec595904ec74f0715c28d5a24c20ecc017de755ecd26d5","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-18T02:05:44Z","title_canon_sha256":"2b9f182994d7d22efd2dbc45a0cd5de4edd626a242626888d709c17ff8e422a9"},"schema_version":"1.0","source":{"id":"1711.06793","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.06793","created_at":"2026-05-18T00:30:11Z"},{"alias_kind":"arxiv_version","alias_value":"1711.06793v1","created_at":"2026-05-18T00:30:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06793","created_at":"2026-05-18T00:30:11Z"},{"alias_kind":"pith_short_12","alias_value":"R3RIQA3323PO","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"R3RIQA3323POHFE4","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"R3RIQA33","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:69a1af48dbd9e87519abc829a9ba594d71eba0429bf3aaf54352b5b5146c849d","target":"graph","created_at":"2026-05-18T00:30:11Z","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":"Additive models, such as produced by gradient boosting, and full interaction models, such as classification and regression trees (CART), are widely used algorithms that have been investigated largely in isolation. We show that these models exist along a spectrum, revealing never-before-known connections between these two approaches. This paper introduces a novel technique called tree-structured boosting for creating a single decision tree, and shows that this method can produce models equivalent to CART or gradient boosted stumps at the extremes by varying a single parameter. Although tree-str","authors_text":"Charles B. Simone II, Efstathios D. Gennatas, Eric Diffenderfer, Eric Eaton, Gilmer Valdes, Jos\\'e Marcio Luna, Lyle H. Ungar, Mateo Wirth, Shane T. Jensen, Timothy D. Solberg","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-18T02:05:44Z","title":"Tree-Structured Boosting: Connections Between Gradient Boosted Stumps and Full Decision Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06793","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:23cae54c44e25060d7d4314372d7a344ae524497c57a500e1b2a941114b13995","target":"record","created_at":"2026-05-18T00:30:11Z","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":"f67039bdbb0b823092ec595904ec74f0715c28d5a24c20ecc017de755ecd26d5","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-11-18T02:05:44Z","title_canon_sha256":"2b9f182994d7d22efd2dbc45a0cd5de4edd626a242626888d709c17ff8e422a9"},"schema_version":"1.0","source":{"id":"1711.06793","kind":"arxiv","version":1}},"canonical_sha256":"8ee288037bd6dee3949c22ce4c6053595b7a0f5eb1d4007884b874839c22627f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ee288037bd6dee3949c22ce4c6053595b7a0f5eb1d4007884b874839c22627f","first_computed_at":"2026-05-18T00:30:11.041862Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:11.041862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XJ8zt1htUdeOt4rHV4ipz6FuZUwqQdnfRHVylhk4tGnfHwEz+nb55qmfyri1KpK1xNg2N7WdNbF2unOtlCxLBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:11.042562Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.06793","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23cae54c44e25060d7d4314372d7a344ae524497c57a500e1b2a941114b13995","sha256:69a1af48dbd9e87519abc829a9ba594d71eba0429bf3aaf54352b5b5146c849d"],"state_sha256":"3f23c1d99d8ae2ffe7a80adce610d1bf0e61bc4c75adc0b735ee6d42402a47cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"udiHR641p2mv2sap+7KuUwfCVBkNbumxBiTfmAwSIDZ0lInIuTvtfYBSv+Aoz/cuQ74IzyrOksEPA/1mTJ3BBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T08:37:21.752661Z","bundle_sha256":"d50585678a11814019790db587bfe7a9bfe38a2cb56d5387950e9ab13450fff3"}}