{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JEL4AHLL5BLAM3IC666HNJ2NNF","short_pith_number":"pith:JEL4AHLL","schema_version":"1.0","canonical_sha256":"4917c01d6be856066d02f7bc76a74d6979a2b7ce32afc8dbde8c2dfa0cff9422","source":{"kind":"arxiv","id":"1309.1906","version":1},"attestation_state":"computed","paper":{"title":"Parallel Bayesian Additive Regression Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"David M. Higdon, Hugh A. Chipman, James R. Gattiker, Matthew T. Pratola, Robert McCulloch, William N. Rust","submitted_at":"2013-09-07T21:02:01Z","abstract_excerpt":"Bayesian Additive Regression Trees (BART) is a Bayesian approach to flexible non-linear regression which has been shown to be competitive with the best modern predictive methods such as those based on bagging and boosting. BART offers some advantages. For example, the stochastic search Markov Chain Monte Carlo (MCMC) algorithm can provide a more complete search of the model space and variation across MCMC draws can capture the level of uncertainty in the usual Bayesian way. The BART prior is robust in that reasonable results are typically obtained with a default prior specification. However, t"},"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":"1309.1906","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2013-09-07T21:02:01Z","cross_cats_sorted":[],"title_canon_sha256":"7a71f6b7b3a0a9df421be8fe4617c8626acc2cc7f63a3f008065a990d8a28490","abstract_canon_sha256":"aa5af9afef8cc05309ec4e8281621df13fbf80463d15ac127559c5d2d525faa5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:57.112306Z","signature_b64":"/XAbg/V6fPEEk/yjvtshnaq8ZonP0ZwU9vcFzzbgvq8lJSiUYiswNsFBzkWXrecD21eUb4GNrntT5nfijYl5Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4917c01d6be856066d02f7bc76a74d6979a2b7ce32afc8dbde8c2dfa0cff9422","last_reissued_at":"2026-05-18T03:13:57.111532Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:57.111532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Bayesian Additive Regression Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"David M. Higdon, Hugh A. Chipman, James R. Gattiker, Matthew T. Pratola, Robert McCulloch, William N. Rust","submitted_at":"2013-09-07T21:02:01Z","abstract_excerpt":"Bayesian Additive Regression Trees (BART) is a Bayesian approach to flexible non-linear regression which has been shown to be competitive with the best modern predictive methods such as those based on bagging and boosting. BART offers some advantages. For example, the stochastic search Markov Chain Monte Carlo (MCMC) algorithm can provide a more complete search of the model space and variation across MCMC draws can capture the level of uncertainty in the usual Bayesian way. The BART prior is robust in that reasonable results are typically obtained with a default prior specification. However, t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1906","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":"1309.1906","created_at":"2026-05-18T03:13:57.111674+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.1906v1","created_at":"2026-05-18T03:13:57.111674+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1906","created_at":"2026-05-18T03:13:57.111674+00:00"},{"alias_kind":"pith_short_12","alias_value":"JEL4AHLL5BLA","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JEL4AHLL5BLAM3IC","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JEL4AHLL","created_at":"2026-05-18T12:27:49.015174+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/JEL4AHLL5BLAM3IC666HNJ2NNF","json":"https://pith.science/pith/JEL4AHLL5BLAM3IC666HNJ2NNF.json","graph_json":"https://pith.science/api/pith-number/JEL4AHLL5BLAM3IC666HNJ2NNF/graph.json","events_json":"https://pith.science/api/pith-number/JEL4AHLL5BLAM3IC666HNJ2NNF/events.json","paper":"https://pith.science/paper/JEL4AHLL"},"agent_actions":{"view_html":"https://pith.science/pith/JEL4AHLL5BLAM3IC666HNJ2NNF","download_json":"https://pith.science/pith/JEL4AHLL5BLAM3IC666HNJ2NNF.json","view_paper":"https://pith.science/paper/JEL4AHLL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.1906&json=true","fetch_graph":"https://pith.science/api/pith-number/JEL4AHLL5BLAM3IC666HNJ2NNF/graph.json","fetch_events":"https://pith.science/api/pith-number/JEL4AHLL5BLAM3IC666HNJ2NNF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JEL4AHLL5BLAM3IC666HNJ2NNF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JEL4AHLL5BLAM3IC666HNJ2NNF/action/storage_attestation","attest_author":"https://pith.science/pith/JEL4AHLL5BLAM3IC666HNJ2NNF/action/author_attestation","sign_citation":"https://pith.science/pith/JEL4AHLL5BLAM3IC666HNJ2NNF/action/citation_signature","submit_replication":"https://pith.science/pith/JEL4AHLL5BLAM3IC666HNJ2NNF/action/replication_record"}},"created_at":"2026-05-18T03:13:57.111674+00:00","updated_at":"2026-05-18T03:13:57.111674+00:00"}