{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:GBQHITQ4CF5I3BDLPYZH2UFYX3","short_pith_number":"pith:GBQHITQ4","canonical_record":{"source":{"id":"2206.03619","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"stat.CO","submitted_at":"2022-06-08T00:06:48Z","cross_cats_sorted":[],"title_canon_sha256":"15c7ffc4be104f52022440823c96a02984e9411b9656e1bd502ef778b3320386","abstract_canon_sha256":"2d74555eb291e83f349eb715770c87cac26fb7a04fe3e309327e487e37e59db4"},"schema_version":"1.0"},"canonical_sha256":"3060744e1c117a8d846b7e327d50b8bedb4ffdd880b4fdaeb4f816936829c04a","source":{"kind":"arxiv","id":"2206.03619","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.03619","created_at":"2026-07-05T06:41:02Z"},{"alias_kind":"arxiv_version","alias_value":"2206.03619v4","created_at":"2026-07-05T06:41:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.03619","created_at":"2026-07-05T06:41:02Z"},{"alias_kind":"pith_short_12","alias_value":"GBQHITQ4CF5I","created_at":"2026-07-05T06:41:02Z"},{"alias_kind":"pith_short_16","alias_value":"GBQHITQ4CF5I3BDL","created_at":"2026-07-05T06:41:02Z"},{"alias_kind":"pith_short_8","alias_value":"GBQHITQ4","created_at":"2026-07-05T06:41:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:GBQHITQ4CF5I3BDLPYZH2UFYX3","target":"record","payload":{"canonical_record":{"source":{"id":"2206.03619","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"stat.CO","submitted_at":"2022-06-08T00:06:48Z","cross_cats_sorted":[],"title_canon_sha256":"15c7ffc4be104f52022440823c96a02984e9411b9656e1bd502ef778b3320386","abstract_canon_sha256":"2d74555eb291e83f349eb715770c87cac26fb7a04fe3e309327e487e37e59db4"},"schema_version":"1.0"},"canonical_sha256":"3060744e1c117a8d846b7e327d50b8bedb4ffdd880b4fdaeb4f816936829c04a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:41:02.185898Z","signature_b64":"PPCnsqUfEucwDbjI3B+xZqEj22iBnfC5BC8z7OBtBKdymxBIVnb4Xw40eculWUM2mfSbxS23BQmiDBblMF9GDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3060744e1c117a8d846b7e327d50b8bedb4ffdd880b4fdaeb4f816936829c04a","last_reissued_at":"2026-07-05T06:41:02.185490Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:41:02.185490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2206.03619","source_version":4,"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-07-05T06:41:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ms8WzyuUmpMOoPBFUL9vzrW3XuimZrUfJdNhqj2cJbQ9Ck2+ZEUHUE6Ct0xrhPedZSTC1epINil8i41TUtOdCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T02:48:05.314195Z"},"content_sha256":"a91ea9c8822007bf8766659a6edc5ab79c976c8f0791522f7fae8f55db41b9d0","schema_version":"1.0","event_id":"sha256:a91ea9c8822007bf8766659a6edc5ab79c976c8f0791522f7fae8f55db41b9d0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:GBQHITQ4CF5I3BDLPYZH2UFYX3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayesian additive regression trees for probabilistic programming","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Juan M. Alonso, Juan Martin Loyola, Miriana Quiroga, Osvaldo A Martin, Pablo G Garay","submitted_at":"2022-06-08T00:06:48Z","abstract_excerpt":"Bayesian additive regression trees (BART) is a non-parametric method to approximate functions. It is a black-box method based on the sum of many trees where priors are used to regularize inference, mainly by restricting trees' learning capacity so that no individual tree is able to explain the data, but rather the sum of trees. We discuss BART in the context of probabilistic programming languages (PPL), i.e., we present BART as a primitive that can be used as a component of a probabilistic model rather than as a standalone model. Specifically, we introduce the Python library PyMC-BART, which w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.03619","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2206.03619/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T06:41:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rRcmr7ZQV8H+6LCxF4LSw397qV5g+8GxKhLqmeWuDsn5wOK5SaihkAf9iCFdnc6h4z415DylCALHL2oRMV2qBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T02:48:05.314704Z"},"content_sha256":"3b9231dfdbc5a9b4609f37eb5a55651783dc89e12de5846dff99e85c837d6acf","schema_version":"1.0","event_id":"sha256:3b9231dfdbc5a9b4609f37eb5a55651783dc89e12de5846dff99e85c837d6acf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GBQHITQ4CF5I3BDLPYZH2UFYX3/bundle.json","state_url":"https://pith.science/pith/GBQHITQ4CF5I3BDLPYZH2UFYX3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GBQHITQ4CF5I3BDLPYZH2UFYX3/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-08-18T02:48:05Z","links":{"resolver":"https://pith.science/pith/GBQHITQ4CF5I3BDLPYZH2UFYX3","bundle":"https://pith.science/pith/GBQHITQ4CF5I3BDLPYZH2UFYX3/bundle.json","state":"https://pith.science/pith/GBQHITQ4CF5I3BDLPYZH2UFYX3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GBQHITQ4CF5I3BDLPYZH2UFYX3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:GBQHITQ4CF5I3BDLPYZH2UFYX3","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":"2d74555eb291e83f349eb715770c87cac26fb7a04fe3e309327e487e37e59db4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"stat.CO","submitted_at":"2022-06-08T00:06:48Z","title_canon_sha256":"15c7ffc4be104f52022440823c96a02984e9411b9656e1bd502ef778b3320386"},"schema_version":"1.0","source":{"id":"2206.03619","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.03619","created_at":"2026-07-05T06:41:02Z"},{"alias_kind":"arxiv_version","alias_value":"2206.03619v4","created_at":"2026-07-05T06:41:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.03619","created_at":"2026-07-05T06:41:02Z"},{"alias_kind":"pith_short_12","alias_value":"GBQHITQ4CF5I","created_at":"2026-07-05T06:41:02Z"},{"alias_kind":"pith_short_16","alias_value":"GBQHITQ4CF5I3BDL","created_at":"2026-07-05T06:41:02Z"},{"alias_kind":"pith_short_8","alias_value":"GBQHITQ4","created_at":"2026-07-05T06:41:02Z"}],"graph_snapshots":[{"event_id":"sha256:3b9231dfdbc5a9b4609f37eb5a55651783dc89e12de5846dff99e85c837d6acf","target":"graph","created_at":"2026-07-05T06:41:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2206.03619/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Bayesian additive regression trees (BART) is a non-parametric method to approximate functions. It is a black-box method based on the sum of many trees where priors are used to regularize inference, mainly by restricting trees' learning capacity so that no individual tree is able to explain the data, but rather the sum of trees. We discuss BART in the context of probabilistic programming languages (PPL), i.e., we present BART as a primitive that can be used as a component of a probabilistic model rather than as a standalone model. Specifically, we introduce the Python library PyMC-BART, which w","authors_text":"Juan M. Alonso, Juan Martin Loyola, Miriana Quiroga, Osvaldo A Martin, Pablo G Garay","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"stat.CO","submitted_at":"2022-06-08T00:06:48Z","title":"Bayesian additive regression trees for probabilistic programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.03619","kind":"arxiv","version":4},"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:a91ea9c8822007bf8766659a6edc5ab79c976c8f0791522f7fae8f55db41b9d0","target":"record","created_at":"2026-07-05T06:41:02Z","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":"2d74555eb291e83f349eb715770c87cac26fb7a04fe3e309327e487e37e59db4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"stat.CO","submitted_at":"2022-06-08T00:06:48Z","title_canon_sha256":"15c7ffc4be104f52022440823c96a02984e9411b9656e1bd502ef778b3320386"},"schema_version":"1.0","source":{"id":"2206.03619","kind":"arxiv","version":4}},"canonical_sha256":"3060744e1c117a8d846b7e327d50b8bedb4ffdd880b4fdaeb4f816936829c04a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3060744e1c117a8d846b7e327d50b8bedb4ffdd880b4fdaeb4f816936829c04a","first_computed_at":"2026-07-05T06:41:02.185490Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:41:02.185490Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PPCnsqUfEucwDbjI3B+xZqEj22iBnfC5BC8z7OBtBKdymxBIVnb4Xw40eculWUM2mfSbxS23BQmiDBblMF9GDA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:41:02.185898Z","signed_message":"canonical_sha256_bytes"},"source_id":"2206.03619","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a91ea9c8822007bf8766659a6edc5ab79c976c8f0791522f7fae8f55db41b9d0","sha256:3b9231dfdbc5a9b4609f37eb5a55651783dc89e12de5846dff99e85c837d6acf"],"state_sha256":"df359c04fcd1ffff2cb8f5074603f4ac6228693bf6509f7fdfbb11c91f74f886"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vX8NrQ1bX8cJoe5j89DTxQyi5e0Br8T/+sLzePOuo7BgUHNvrhGDdzZMlzQj0v8rSLfYssM1eyYcgeQBiH21Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T02:48:05.330198Z","bundle_sha256":"c8d8efdeabef960bd5d0ccdbe527ba4c293f5517dbe084610d78f32509d9ca0e"}}