{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:MV2766UCOHCYV2IJYXFTZ5N5SU","short_pith_number":"pith:MV2766UC","canonical_record":{"source":{"id":"0806.3286","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2008-06-19T21:00:03Z","cross_cats_sorted":["stat.AP","stat.ML"],"title_canon_sha256":"c334e4d0f0e89ab6a022aece64e00a5da4ca7f90063641c907040e5b48dfb575","abstract_canon_sha256":"07ce125a10c4728409f79e1e6830b253b19c3f8f213d64f01862b1fc32798a50"},"schema_version":"1.0"},"canonical_sha256":"6575ff7a8271c58ae909c5cb3cf5bd9508dce770db95c95bc14587a25b4be768","source":{"kind":"arxiv","id":"0806.3286","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0806.3286","created_at":"2026-05-18T04:39:49Z"},{"alias_kind":"arxiv_version","alias_value":"0806.3286v2","created_at":"2026-05-18T04:39:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0806.3286","created_at":"2026-05-18T04:39:49Z"},{"alias_kind":"pith_short_12","alias_value":"MV2766UCOHCY","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"MV2766UCOHCYV2IJ","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"MV2766UC","created_at":"2026-05-18T12:25:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:MV2766UCOHCYV2IJYXFTZ5N5SU","target":"record","payload":{"canonical_record":{"source":{"id":"0806.3286","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2008-06-19T21:00:03Z","cross_cats_sorted":["stat.AP","stat.ML"],"title_canon_sha256":"c334e4d0f0e89ab6a022aece64e00a5da4ca7f90063641c907040e5b48dfb575","abstract_canon_sha256":"07ce125a10c4728409f79e1e6830b253b19c3f8f213d64f01862b1fc32798a50"},"schema_version":"1.0"},"canonical_sha256":"6575ff7a8271c58ae909c5cb3cf5bd9508dce770db95c95bc14587a25b4be768","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:49.470844Z","signature_b64":"7VTsPniBWexwgbti7S62SrDfQ9rZcAAmkilQKehKCf5SKLw1EWD0OVfU3fhCgmmVaX6W+cohtcYujJvpWqoACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6575ff7a8271c58ae909c5cb3cf5bd9508dce770db95c95bc14587a25b4be768","last_reissued_at":"2026-05-18T04:39:49.470101Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:49.470101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0806.3286","source_version":2,"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-18T04:39:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1y31634Aw3LgpL1FEa/83oEz+by881k3Xb/oizB2jbl1ZtAfRUyhIBbZGOvA4zYPvs/27qwc/RsBF2ja5ZqqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:11:42.698897Z"},"content_sha256":"9918fa8552c192741c7d0ddd0d2a286b8d898d9a59ad6277d9534235ce063d90","schema_version":"1.0","event_id":"sha256:9918fa8552c192741c7d0ddd0d2a286b8d898d9a59ad6277d9534235ce063d90"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:MV2766UCOHCYV2IJYXFTZ5N5SU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"BART: Bayesian additive regression trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP","stat.ML"],"primary_cat":"stat.ME","authors_text":"Edward I. George, Hugh A. Chipman, Robert E. McCulloch","submitted_at":"2008-06-19T21:00:03Z","abstract_excerpt":"We develop a Bayesian \"sum-of-trees\" model where each tree is constrained by a regularization prior to be a weak learner, and fitting and inference are accomplished via an iterative Bayesian backfitting MCMC algorithm that generates samples from a posterior. Effectively, BART is a nonparametric Bayesian regression approach which uses dimensionally adaptive random basis elements. Motivated by ensemble methods in general, and boosting algorithms in particular, BART is defined by a statistical model: a prior and a likelihood. This approach enables full posterior inference including point and inte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0806.3286","kind":"arxiv","version":2},"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-18T04:39:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ahxmM0C+SPy4xdnObjF4XcC3HNqbuYgBber9mjZnIJFIh/bWmQh/T9QpwEi6WbofCXDgmS4aC5m2l3y/4Zw8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:11:42.699237Z"},"content_sha256":"85761d27c7596d415100f30bd4f2893b07a810e65b63458857e6b8cdbcd75ed4","schema_version":"1.0","event_id":"sha256:85761d27c7596d415100f30bd4f2893b07a810e65b63458857e6b8cdbcd75ed4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MV2766UCOHCYV2IJYXFTZ5N5SU/bundle.json","state_url":"https://pith.science/pith/MV2766UCOHCYV2IJYXFTZ5N5SU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MV2766UCOHCYV2IJYXFTZ5N5SU/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-01T17:11:42Z","links":{"resolver":"https://pith.science/pith/MV2766UCOHCYV2IJYXFTZ5N5SU","bundle":"https://pith.science/pith/MV2766UCOHCYV2IJYXFTZ5N5SU/bundle.json","state":"https://pith.science/pith/MV2766UCOHCYV2IJYXFTZ5N5SU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MV2766UCOHCYV2IJYXFTZ5N5SU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:MV2766UCOHCYV2IJYXFTZ5N5SU","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":"07ce125a10c4728409f79e1e6830b253b19c3f8f213d64f01862b1fc32798a50","cross_cats_sorted":["stat.AP","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2008-06-19T21:00:03Z","title_canon_sha256":"c334e4d0f0e89ab6a022aece64e00a5da4ca7f90063641c907040e5b48dfb575"},"schema_version":"1.0","source":{"id":"0806.3286","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0806.3286","created_at":"2026-05-18T04:39:49Z"},{"alias_kind":"arxiv_version","alias_value":"0806.3286v2","created_at":"2026-05-18T04:39:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0806.3286","created_at":"2026-05-18T04:39:49Z"},{"alias_kind":"pith_short_12","alias_value":"MV2766UCOHCY","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_16","alias_value":"MV2766UCOHCYV2IJ","created_at":"2026-05-18T12:25:57Z"},{"alias_kind":"pith_short_8","alias_value":"MV2766UC","created_at":"2026-05-18T12:25:57Z"}],"graph_snapshots":[{"event_id":"sha256:85761d27c7596d415100f30bd4f2893b07a810e65b63458857e6b8cdbcd75ed4","target":"graph","created_at":"2026-05-18T04:39:49Z","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":"We develop a Bayesian \"sum-of-trees\" model where each tree is constrained by a regularization prior to be a weak learner, and fitting and inference are accomplished via an iterative Bayesian backfitting MCMC algorithm that generates samples from a posterior. Effectively, BART is a nonparametric Bayesian regression approach which uses dimensionally adaptive random basis elements. Motivated by ensemble methods in general, and boosting algorithms in particular, BART is defined by a statistical model: a prior and a likelihood. This approach enables full posterior inference including point and inte","authors_text":"Edward I. George, Hugh A. Chipman, Robert E. McCulloch","cross_cats":["stat.AP","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2008-06-19T21:00:03Z","title":"BART: Bayesian additive regression trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0806.3286","kind":"arxiv","version":2},"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:9918fa8552c192741c7d0ddd0d2a286b8d898d9a59ad6277d9534235ce063d90","target":"record","created_at":"2026-05-18T04:39:49Z","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":"07ce125a10c4728409f79e1e6830b253b19c3f8f213d64f01862b1fc32798a50","cross_cats_sorted":["stat.AP","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2008-06-19T21:00:03Z","title_canon_sha256":"c334e4d0f0e89ab6a022aece64e00a5da4ca7f90063641c907040e5b48dfb575"},"schema_version":"1.0","source":{"id":"0806.3286","kind":"arxiv","version":2}},"canonical_sha256":"6575ff7a8271c58ae909c5cb3cf5bd9508dce770db95c95bc14587a25b4be768","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6575ff7a8271c58ae909c5cb3cf5bd9508dce770db95c95bc14587a25b4be768","first_computed_at":"2026-05-18T04:39:49.470101Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:49.470101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7VTsPniBWexwgbti7S62SrDfQ9rZcAAmkilQKehKCf5SKLw1EWD0OVfU3fhCgmmVaX6W+cohtcYujJvpWqoACw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:49.470844Z","signed_message":"canonical_sha256_bytes"},"source_id":"0806.3286","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9918fa8552c192741c7d0ddd0d2a286b8d898d9a59ad6277d9534235ce063d90","sha256:85761d27c7596d415100f30bd4f2893b07a810e65b63458857e6b8cdbcd75ed4"],"state_sha256":"be477dd59f29123c845b2dd5c4adf256c7ae6b5bd330e7dba9df8f6b2bba5e36"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MoI3scyB5UNLaGOU9GWQYAH+adUSKx+RaY7D3VmPkZXYcBwBQw3xERis3Dgc8bkoYjT8CINO6Of0R17slsV7CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:11:42.701172Z","bundle_sha256":"b549d70b5672e7b38099094c9de370ac4436fc6c6b4eccd69457d9abbce1a8df"}}