{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:MV2766UCOHCYV2IJYXFTZ5N5SU","short_pith_number":"pith:MV2766UC","schema_version":"1.0","canonical_sha256":"6575ff7a8271c58ae909c5cb3cf5bd9508dce770db95c95bc14587a25b4be768","source":{"kind":"arxiv","id":"0806.3286","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0806.3286","created_at":"2026-05-18T04:39:49.470230+00:00"},{"alias_kind":"arxiv_version","alias_value":"0806.3286v2","created_at":"2026-05-18T04:39:49.470230+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0806.3286","created_at":"2026-05-18T04:39:49.470230+00:00"},{"alias_kind":"pith_short_12","alias_value":"MV2766UCOHCY","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"MV2766UCOHCYV2IJ","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"MV2766UC","created_at":"2026-05-18T12:25:57.157939+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MV2766UCOHCYV2IJYXFTZ5N5SU","json":"https://pith.science/pith/MV2766UCOHCYV2IJYXFTZ5N5SU.json","graph_json":"https://pith.science/api/pith-number/MV2766UCOHCYV2IJYXFTZ5N5SU/graph.json","events_json":"https://pith.science/api/pith-number/MV2766UCOHCYV2IJYXFTZ5N5SU/events.json","paper":"https://pith.science/paper/MV2766UC"},"agent_actions":{"view_html":"https://pith.science/pith/MV2766UCOHCYV2IJYXFTZ5N5SU","download_json":"https://pith.science/pith/MV2766UCOHCYV2IJYXFTZ5N5SU.json","view_paper":"https://pith.science/paper/MV2766UC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0806.3286&json=true","fetch_graph":"https://pith.science/api/pith-number/MV2766UCOHCYV2IJYXFTZ5N5SU/graph.json","fetch_events":"https://pith.science/api/pith-number/MV2766UCOHCYV2IJYXFTZ5N5SU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MV2766UCOHCYV2IJYXFTZ5N5SU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MV2766UCOHCYV2IJYXFTZ5N5SU/action/storage_attestation","attest_author":"https://pith.science/pith/MV2766UCOHCYV2IJYXFTZ5N5SU/action/author_attestation","sign_citation":"https://pith.science/pith/MV2766UCOHCYV2IJYXFTZ5N5SU/action/citation_signature","submit_replication":"https://pith.science/pith/MV2766UCOHCYV2IJYXFTZ5N5SU/action/replication_record"}},"created_at":"2026-05-18T04:39:49.470230+00:00","updated_at":"2026-05-18T04:39:49.470230+00:00"}