{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SEIBEU5GQ7CINAOILO5SV47LMQ","short_pith_number":"pith:SEIBEU5G","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"},"canonical_sha256":"91101253a687c48681c85bbb2af3eb64027ae9832dd5cf5c49dfe556c44e6095","source":{"kind":"arxiv","id":"1507.00181","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00181","created_at":"2026-05-18T01:37:10Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00181v2","created_at":"2026-05-18T01:37:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00181","created_at":"2026-05-18T01:37:10Z"},{"alias_kind":"pith_short_12","alias_value":"SEIBEU5GQ7CI","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"SEIBEU5GQ7CINAOI","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"SEIBEU5G","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SEIBEU5GQ7CINAOILO5SV47LMQ","target":"record","payload":{"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"},"canonical_sha256":"91101253a687c48681c85bbb2af3eb64027ae9832dd5cf5c49dfe556c44e6095","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"},"source_kind":"arxiv","source_id":"1507.00181","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-18T01:37:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g34mgfaPqzlE1PZk1ALBMmNjC47K5lKulTPOTGBXmcZ36xehM/HR8jZX/GB5wNzNDFb/z2sAsaFXFRzXpM+/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:54:19.832126Z"},"content_sha256":"b9343d95365d1638f2ccfc34323ce8478b3195593a1df98969945d0555ce74db","schema_version":"1.0","event_id":"sha256:b9343d95365d1638f2ccfc34323ce8478b3195593a1df98969945d0555ce74db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SEIBEU5GQ7CINAOILO5SV47LMQ","target":"graph","payload":{"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"},"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-18T01:37:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hm1cvlLl+E+/ddTIjwKVBpVvbdck33OSz7mGRVUU5ht6GXMTBGbeUJ3GKq/MtYpsYHNDIcCGMSXMy/mbOOgEAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:54:19.832497Z"},"content_sha256":"099dd41ecf29de0d105cc84cf3254e96bca64237342e77e1bc08553dcea7ab52","schema_version":"1.0","event_id":"sha256:099dd41ecf29de0d105cc84cf3254e96bca64237342e77e1bc08553dcea7ab52"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SEIBEU5GQ7CINAOILO5SV47LMQ/bundle.json","state_url":"https://pith.science/pith/SEIBEU5GQ7CINAOILO5SV47LMQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SEIBEU5GQ7CINAOILO5SV47LMQ/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-08T12:54:19Z","links":{"resolver":"https://pith.science/pith/SEIBEU5GQ7CINAOILO5SV47LMQ","bundle":"https://pith.science/pith/SEIBEU5GQ7CINAOILO5SV47LMQ/bundle.json","state":"https://pith.science/pith/SEIBEU5GQ7CINAOILO5SV47LMQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SEIBEU5GQ7CINAOILO5SV47LMQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SEIBEU5GQ7CINAOILO5SV47LMQ","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":"337cb18124718f22f7248cabb56d26e31768e046c6df07c29842470b9b2c4b45","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-07-01T10:58:46Z","title_canon_sha256":"1da8d82bfaee8cdd19ca15e950c38c83a2684ab61f18bdad91493cf809a5c039"},"schema_version":"1.0","source":{"id":"1507.00181","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.00181","created_at":"2026-05-18T01:37:10Z"},{"alias_kind":"arxiv_version","alias_value":"1507.00181v2","created_at":"2026-05-18T01:37:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00181","created_at":"2026-05-18T01:37:10Z"},{"alias_kind":"pith_short_12","alias_value":"SEIBEU5GQ7CI","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"SEIBEU5GQ7CINAOI","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"SEIBEU5G","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:099dd41ecf29de0d105cc84cf3254e96bca64237342e77e1bc08553dcea7ab52","target":"graph","created_at":"2026-05-18T01:37:10Z","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":"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","authors_text":"Adrian E. Raftery, Andrew C. Parnell, Belinda Hern\\'andez, Stephen R. Pennington","cross_cats":["stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-07-01T10:58:46Z","title":"Bayesian Additive Regression Trees using Bayesian Model Averaging"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00181","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:b9343d95365d1638f2ccfc34323ce8478b3195593a1df98969945d0555ce74db","target":"record","created_at":"2026-05-18T01:37:10Z","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":"337cb18124718f22f7248cabb56d26e31768e046c6df07c29842470b9b2c4b45","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-07-01T10:58:46Z","title_canon_sha256":"1da8d82bfaee8cdd19ca15e950c38c83a2684ab61f18bdad91493cf809a5c039"},"schema_version":"1.0","source":{"id":"1507.00181","kind":"arxiv","version":2}},"canonical_sha256":"91101253a687c48681c85bbb2af3eb64027ae9832dd5cf5c49dfe556c44e6095","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91101253a687c48681c85bbb2af3eb64027ae9832dd5cf5c49dfe556c44e6095","first_computed_at":"2026-05-18T01:37:10.698223Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:10.698223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"noeMJj4mqiQGpxkqwda/pmquC0/8Pw6C3Qfxu/kEbQEe0Y7rHdUYJyQXGIw5i1WA6tPp8XcEH1DRxduFOczeCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:10.698682Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.00181","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9343d95365d1638f2ccfc34323ce8478b3195593a1df98969945d0555ce74db","sha256:099dd41ecf29de0d105cc84cf3254e96bca64237342e77e1bc08553dcea7ab52"],"state_sha256":"99f2128eccb97c45519eab2a39f63c5ba10b4abff42e94d35cf2b8e055fa608c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MPXcI4acjiLAkP4OvEWqjdHq0d4ZdM0QsiZUyXjs8mvwRVhXB+ZuJ6QIHMV+U/AHyvvk4dApDpaMkWpAY6J8Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T12:54:19.834598Z","bundle_sha256":"6ab3531c3e80ae06c052e14310864c38467cef868b6ca83d0cad5172e645cea5"}}