{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OYYOWYFRAPE6NIPB27CLOGPE6Z","short_pith_number":"pith:OYYOWYFR","schema_version":"1.0","canonical_sha256":"7630eb60b103c9e6a1e1d7c4b719e4f67c00ad54eaa2a4fce605715e30a7f930","source":{"kind":"arxiv","id":"1903.09348","version":1},"attestation_state":"computed","paper":{"title":"Binary Space Partitioning Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","math.PR"],"primary_cat":"stat.ML","authors_text":"Bin Li, Scott Anthony Sisson, Xuhui Fan","submitted_at":"2019-03-22T03:48:48Z","abstract_excerpt":"The Binary Space Partitioning~(BSP)-Tree process is proposed to produce flexible 2-D partition structures which are originally used as a Bayesian nonparametric prior for relational modelling. It can hardly be applied to other learning tasks such as regression trees because extending the BSP-Tree process to a higher dimensional space is nontrivial. This paper is the first attempt to extend the BSP-Tree process to a d-dimensional (d>2) space. We propose to generate a cutting hyperplane, which is assumed to be parallel to d-2 dimensions, to cut each node in the d-dimensional BSP-tree. By designin"},"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":"1903.09348","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-03-22T03:48:48Z","cross_cats_sorted":["cs.AI","cs.LG","math.PR"],"title_canon_sha256":"c652c2d16d54609978c5e461ea79530eb4c36cbc62c86056f77477615da174fe","abstract_canon_sha256":"4f37035944af114159f781b0d722147243b091535e3594416ae5044044d1950b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:39.875475Z","signature_b64":"pCb95jptmyE9gtg8bHGgkhwgHMaoIFGcs4isVN21qI66fHUdsC7NgMQVt5QNTXC2sSI6AkiZoPFzZCy8L/7fBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7630eb60b103c9e6a1e1d7c4b719e4f67c00ad54eaa2a4fce605715e30a7f930","last_reissued_at":"2026-05-17T23:50:39.874993Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:39.874993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Binary Space Partitioning Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","math.PR"],"primary_cat":"stat.ML","authors_text":"Bin Li, Scott Anthony Sisson, Xuhui Fan","submitted_at":"2019-03-22T03:48:48Z","abstract_excerpt":"The Binary Space Partitioning~(BSP)-Tree process is proposed to produce flexible 2-D partition structures which are originally used as a Bayesian nonparametric prior for relational modelling. It can hardly be applied to other learning tasks such as regression trees because extending the BSP-Tree process to a higher dimensional space is nontrivial. This paper is the first attempt to extend the BSP-Tree process to a d-dimensional (d>2) space. We propose to generate a cutting hyperplane, which is assumed to be parallel to d-2 dimensions, to cut each node in the d-dimensional BSP-tree. By designin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09348","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":"1903.09348","created_at":"2026-05-17T23:50:39.875078+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.09348v1","created_at":"2026-05-17T23:50:39.875078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09348","created_at":"2026-05-17T23:50:39.875078+00:00"},{"alias_kind":"pith_short_12","alias_value":"OYYOWYFRAPE6","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"OYYOWYFRAPE6NIPB","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"OYYOWYFR","created_at":"2026-05-18T12:33:24.271573+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/OYYOWYFRAPE6NIPB27CLOGPE6Z","json":"https://pith.science/pith/OYYOWYFRAPE6NIPB27CLOGPE6Z.json","graph_json":"https://pith.science/api/pith-number/OYYOWYFRAPE6NIPB27CLOGPE6Z/graph.json","events_json":"https://pith.science/api/pith-number/OYYOWYFRAPE6NIPB27CLOGPE6Z/events.json","paper":"https://pith.science/paper/OYYOWYFR"},"agent_actions":{"view_html":"https://pith.science/pith/OYYOWYFRAPE6NIPB27CLOGPE6Z","download_json":"https://pith.science/pith/OYYOWYFRAPE6NIPB27CLOGPE6Z.json","view_paper":"https://pith.science/paper/OYYOWYFR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.09348&json=true","fetch_graph":"https://pith.science/api/pith-number/OYYOWYFRAPE6NIPB27CLOGPE6Z/graph.json","fetch_events":"https://pith.science/api/pith-number/OYYOWYFRAPE6NIPB27CLOGPE6Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OYYOWYFRAPE6NIPB27CLOGPE6Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OYYOWYFRAPE6NIPB27CLOGPE6Z/action/storage_attestation","attest_author":"https://pith.science/pith/OYYOWYFRAPE6NIPB27CLOGPE6Z/action/author_attestation","sign_citation":"https://pith.science/pith/OYYOWYFRAPE6NIPB27CLOGPE6Z/action/citation_signature","submit_replication":"https://pith.science/pith/OYYOWYFRAPE6NIPB27CLOGPE6Z/action/replication_record"}},"created_at":"2026-05-17T23:50:39.875078+00:00","updated_at":"2026-05-17T23:50:39.875078+00:00"}