{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YCQKTKTHF7NIAKNAQ6AWQFTI74","short_pith_number":"pith:YCQKTKTH","schema_version":"1.0","canonical_sha256":"c0a0a9aa672fda8029a08781681668ff2a8b739136d48811b3b8a6c4bc9bc087","source":{"kind":"arxiv","id":"2411.08849","version":1},"attestation_state":"computed","paper":{"title":"Oblique Bayesian additive regression trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Paul-Hieu V. Nguyen, Ryan Yee, Sameer K. Deshpande","submitted_at":"2024-11-13T18:29:58Z","abstract_excerpt":"Current implementations of Bayesian Additive Regression Trees (BART) are based on axis-aligned decision rules that recursively partition the feature space using a single feature at a time. Several authors have demonstrated that oblique trees, whose decision rules are based on linear combinations of features, can sometimes yield better predictions than axis-aligned trees and exhibit excellent theoretical properties. We develop an oblique version of BART that leverages a data-adaptive decision rule prior that recursively partitions the feature space along random hyperplanes. Using several synthe"},"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":"2411.08849","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-11-13T18:29:58Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"65c40f48615f24f92c3611106f61fc6dd6459e7ff6dca43c955a9a14acf65841","abstract_canon_sha256":"f97095c3189953731073f420edf6aa6b4becbaf2f3aeed33bfad90db61c32980"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:35:03.370616Z","signature_b64":"A2QtaGL6OaMjEEc5sfVEv0MFZkr9sakPqMY32foVyD9wLXotKygjZP1UPTOBwpAzURtSLN41VV8ZLx/lj56PAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0a0a9aa672fda8029a08781681668ff2a8b739136d48811b3b8a6c4bc9bc087","last_reissued_at":"2026-07-05T09:35:03.370235Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:35:03.370235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Oblique Bayesian additive regression trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Paul-Hieu V. Nguyen, Ryan Yee, Sameer K. Deshpande","submitted_at":"2024-11-13T18:29:58Z","abstract_excerpt":"Current implementations of Bayesian Additive Regression Trees (BART) are based on axis-aligned decision rules that recursively partition the feature space using a single feature at a time. Several authors have demonstrated that oblique trees, whose decision rules are based on linear combinations of features, can sometimes yield better predictions than axis-aligned trees and exhibit excellent theoretical properties. We develop an oblique version of BART that leverages a data-adaptive decision rule prior that recursively partitions the feature space along random hyperplanes. Using several synthe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.08849","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.08849/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.08849","created_at":"2026-07-05T09:35:03.370298+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.08849v1","created_at":"2026-07-05T09:35:03.370298+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.08849","created_at":"2026-07-05T09:35:03.370298+00:00"},{"alias_kind":"pith_short_12","alias_value":"YCQKTKTHF7NI","created_at":"2026-07-05T09:35:03.370298+00:00"},{"alias_kind":"pith_short_16","alias_value":"YCQKTKTHF7NIAKNA","created_at":"2026-07-05T09:35:03.370298+00:00"},{"alias_kind":"pith_short_8","alias_value":"YCQKTKTH","created_at":"2026-07-05T09:35:03.370298+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/YCQKTKTHF7NIAKNAQ6AWQFTI74","json":"https://pith.science/pith/YCQKTKTHF7NIAKNAQ6AWQFTI74.json","graph_json":"https://pith.science/api/pith-number/YCQKTKTHF7NIAKNAQ6AWQFTI74/graph.json","events_json":"https://pith.science/api/pith-number/YCQKTKTHF7NIAKNAQ6AWQFTI74/events.json","paper":"https://pith.science/paper/YCQKTKTH"},"agent_actions":{"view_html":"https://pith.science/pith/YCQKTKTHF7NIAKNAQ6AWQFTI74","download_json":"https://pith.science/pith/YCQKTKTHF7NIAKNAQ6AWQFTI74.json","view_paper":"https://pith.science/paper/YCQKTKTH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.08849&json=true","fetch_graph":"https://pith.science/api/pith-number/YCQKTKTHF7NIAKNAQ6AWQFTI74/graph.json","fetch_events":"https://pith.science/api/pith-number/YCQKTKTHF7NIAKNAQ6AWQFTI74/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YCQKTKTHF7NIAKNAQ6AWQFTI74/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YCQKTKTHF7NIAKNAQ6AWQFTI74/action/storage_attestation","attest_author":"https://pith.science/pith/YCQKTKTHF7NIAKNAQ6AWQFTI74/action/author_attestation","sign_citation":"https://pith.science/pith/YCQKTKTHF7NIAKNAQ6AWQFTI74/action/citation_signature","submit_replication":"https://pith.science/pith/YCQKTKTHF7NIAKNAQ6AWQFTI74/action/replication_record"}},"created_at":"2026-07-05T09:35:03.370298+00:00","updated_at":"2026-07-05T09:35:03.370298+00:00"}