{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:TWTP427ZCBZNCFVQ2P5VXC5AJ6","short_pith_number":"pith:TWTP427Z","schema_version":"1.0","canonical_sha256":"9da6fe6bf91072d116b0d3fb5b8ba04fb470e4de0625ca0a0f7bfe5515b85f2b","source":{"kind":"arxiv","id":"1402.5397","version":1},"attestation_state":"computed","paper":{"title":"Bayesian Additive Regression Trees With Parametric Models of Heteroskedasticity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Adam Kapelner, Justin Bleich","submitted_at":"2014-02-21T19:58:59Z","abstract_excerpt":"We incorporate heteroskedasticity into Bayesian Additive Regression Trees (BART) by modeling the log of the error variance parameter as a linear function of prespecified covariates. Under this scheme, the Gibbs sampling procedure for the original sum-of- trees model is easily modified, and the parameters for the variance model are updated via a Metropolis-Hastings step. We demonstrate the promise of our approach by providing more appropriate posterior predictive intervals than homoskedastic BART in heteroskedastic settings and demonstrating the model's resistance to overfitting. Our implementa"},"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":"1402.5397","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2014-02-21T19:58:59Z","cross_cats_sorted":[],"title_canon_sha256":"58968f7c6e59dd42048b263640759b4765dd99911854e6d58a864319f4b9728d","abstract_canon_sha256":"6ce80597fb5c9c7989d5d4600dbda741ef188c64680bac353c45cc1968071812"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:22.387613Z","signature_b64":"G7/f4uwvdch2gzp06gTi9qhAoXwcwoLO3zjchMc7z3uBCWZ3dqzsmUk3puCvTt2XZbdnIW6nYF0mCqo1D+NTAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9da6fe6bf91072d116b0d3fb5b8ba04fb470e4de0625ca0a0f7bfe5515b85f2b","last_reissued_at":"2026-05-18T02:58:22.387032Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:22.387032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bayesian Additive Regression Trees With Parametric Models of Heteroskedasticity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Adam Kapelner, Justin Bleich","submitted_at":"2014-02-21T19:58:59Z","abstract_excerpt":"We incorporate heteroskedasticity into Bayesian Additive Regression Trees (BART) by modeling the log of the error variance parameter as a linear function of prespecified covariates. Under this scheme, the Gibbs sampling procedure for the original sum-of- trees model is easily modified, and the parameters for the variance model are updated via a Metropolis-Hastings step. We demonstrate the promise of our approach by providing more appropriate posterior predictive intervals than homoskedastic BART in heteroskedastic settings and demonstrating the model's resistance to overfitting. Our implementa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.5397","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1402.5397","created_at":"2026-05-18T02:58:22.387100+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.5397v1","created_at":"2026-05-18T02:58:22.387100+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.5397","created_at":"2026-05-18T02:58:22.387100+00:00"},{"alias_kind":"pith_short_12","alias_value":"TWTP427ZCBZN","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"TWTP427ZCBZNCFVQ","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"TWTP427Z","created_at":"2026-05-18T12:28:52.271510+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.09900","citing_title":"SBAMDT: Bayesian Additive Decision Trees with Adaptive Soft Semi-multivariate Split Rules","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TWTP427ZCBZNCFVQ2P5VXC5AJ6","json":"https://pith.science/pith/TWTP427ZCBZNCFVQ2P5VXC5AJ6.json","graph_json":"https://pith.science/api/pith-number/TWTP427ZCBZNCFVQ2P5VXC5AJ6/graph.json","events_json":"https://pith.science/api/pith-number/TWTP427ZCBZNCFVQ2P5VXC5AJ6/events.json","paper":"https://pith.science/paper/TWTP427Z"},"agent_actions":{"view_html":"https://pith.science/pith/TWTP427ZCBZNCFVQ2P5VXC5AJ6","download_json":"https://pith.science/pith/TWTP427ZCBZNCFVQ2P5VXC5AJ6.json","view_paper":"https://pith.science/paper/TWTP427Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.5397&json=true","fetch_graph":"https://pith.science/api/pith-number/TWTP427ZCBZNCFVQ2P5VXC5AJ6/graph.json","fetch_events":"https://pith.science/api/pith-number/TWTP427ZCBZNCFVQ2P5VXC5AJ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TWTP427ZCBZNCFVQ2P5VXC5AJ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TWTP427ZCBZNCFVQ2P5VXC5AJ6/action/storage_attestation","attest_author":"https://pith.science/pith/TWTP427ZCBZNCFVQ2P5VXC5AJ6/action/author_attestation","sign_citation":"https://pith.science/pith/TWTP427ZCBZNCFVQ2P5VXC5AJ6/action/citation_signature","submit_replication":"https://pith.science/pith/TWTP427ZCBZNCFVQ2P5VXC5AJ6/action/replication_record"}},"created_at":"2026-05-18T02:58:22.387100+00:00","updated_at":"2026-05-18T02:58:22.387100+00:00"}