{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SEIBEU5GQ7CINAOILO5SV47LMQ","short_pith_number":"pith:SEIBEU5G","schema_version":"1.0","canonical_sha256":"91101253a687c48681c85bbb2af3eb64027ae9832dd5cf5c49dfe556c44e6095","source":{"kind":"arxiv","id":"1507.00181","version":2},"attestation_state":"computed","paper":{"title":"Bayesian Additive Regression Trees using Bayesian Model Averaging","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"Adrian E. Raftery, Andrew C. Parnell, Belinda Hern\\'andez, Stephen R. Pennington","submitted_at":"2015-07-01T10:58:46Z","abstract_excerpt":"Bayesian Additive Regression Trees (BART) is a statistical sum of trees model. It can be considered a Bayesian version of machine learning tree ensemble methods where the individual trees are the base learners. However for data sets where the number of variables $p$ is large (e.g. $p>5,000$) the algorithm can become prohibitively expensive, computationally.\n  Another method which is popular for high dimensional data is random forests, a machine learning algorithm which grows trees using a greedy search for the best split points. However, as it is not a statistical model, it cannot produce prob"},"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":"1507.00181","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-07-01T10:58:46Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"1da8d82bfaee8cdd19ca15e950c38c83a2684ab61f18bdad91493cf809a5c039","abstract_canon_sha256":"337cb18124718f22f7248cabb56d26e31768e046c6df07c29842470b9b2c4b45"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:10.698682Z","signature_b64":"noeMJj4mqiQGpxkqwda/pmquC0/8Pw6C3Qfxu/kEbQEe0Y7rHdUYJyQXGIw5i1WA6tPp8XcEH1DRxduFOczeCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91101253a687c48681c85bbb2af3eb64027ae9832dd5cf5c49dfe556c44e6095","last_reissued_at":"2026-05-18T01:37:10.698223Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:10.698223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bayesian Additive Regression Trees using Bayesian Model Averaging","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"Adrian E. Raftery, Andrew C. Parnell, Belinda Hern\\'andez, Stephen R. Pennington","submitted_at":"2015-07-01T10:58:46Z","abstract_excerpt":"Bayesian Additive Regression Trees (BART) is a statistical sum of trees model. It can be considered a Bayesian version of machine learning tree ensemble methods where the individual trees are the base learners. However for data sets where the number of variables $p$ is large (e.g. $p>5,000$) the algorithm can become prohibitively expensive, computationally.\n  Another method which is popular for high dimensional data is random forests, a machine learning algorithm which grows trees using a greedy search for the best split points. However, as it is not a statistical model, it cannot produce prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00181","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":"1507.00181","created_at":"2026-05-18T01:37:10.698287+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.00181v2","created_at":"2026-05-18T01:37:10.698287+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00181","created_at":"2026-05-18T01:37:10.698287+00:00"},{"alias_kind":"pith_short_12","alias_value":"SEIBEU5GQ7CI","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"SEIBEU5GQ7CINAOI","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"SEIBEU5G","created_at":"2026-05-18T12:29:39.896362+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/SEIBEU5GQ7CINAOILO5SV47LMQ","json":"https://pith.science/pith/SEIBEU5GQ7CINAOILO5SV47LMQ.json","graph_json":"https://pith.science/api/pith-number/SEIBEU5GQ7CINAOILO5SV47LMQ/graph.json","events_json":"https://pith.science/api/pith-number/SEIBEU5GQ7CINAOILO5SV47LMQ/events.json","paper":"https://pith.science/paper/SEIBEU5G"},"agent_actions":{"view_html":"https://pith.science/pith/SEIBEU5GQ7CINAOILO5SV47LMQ","download_json":"https://pith.science/pith/SEIBEU5GQ7CINAOILO5SV47LMQ.json","view_paper":"https://pith.science/paper/SEIBEU5G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.00181&json=true","fetch_graph":"https://pith.science/api/pith-number/SEIBEU5GQ7CINAOILO5SV47LMQ/graph.json","fetch_events":"https://pith.science/api/pith-number/SEIBEU5GQ7CINAOILO5SV47LMQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SEIBEU5GQ7CINAOILO5SV47LMQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SEIBEU5GQ7CINAOILO5SV47LMQ/action/storage_attestation","attest_author":"https://pith.science/pith/SEIBEU5GQ7CINAOILO5SV47LMQ/action/author_attestation","sign_citation":"https://pith.science/pith/SEIBEU5GQ7CINAOILO5SV47LMQ/action/citation_signature","submit_replication":"https://pith.science/pith/SEIBEU5GQ7CINAOILO5SV47LMQ/action/replication_record"}},"created_at":"2026-05-18T01:37:10.698287+00:00","updated_at":"2026-05-18T01:37:10.698287+00:00"}