{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OYYOWYFRAPE6NIPB27CLOGPE6Z","short_pith_number":"pith:OYYOWYFR","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"},"canonical_sha256":"7630eb60b103c9e6a1e1d7c4b719e4f67c00ad54eaa2a4fce605715e30a7f930","source":{"kind":"arxiv","id":"1903.09348","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.09348","created_at":"2026-05-17T23:50:39Z"},{"alias_kind":"arxiv_version","alias_value":"1903.09348v1","created_at":"2026-05-17T23:50:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09348","created_at":"2026-05-17T23:50:39Z"},{"alias_kind":"pith_short_12","alias_value":"OYYOWYFRAPE6","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OYYOWYFRAPE6NIPB","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OYYOWYFR","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OYYOWYFRAPE6NIPB27CLOGPE6Z","target":"record","payload":{"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"},"canonical_sha256":"7630eb60b103c9e6a1e1d7c4b719e4f67c00ad54eaa2a4fce605715e30a7f930","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"},"source_kind":"arxiv","source_id":"1903.09348","source_version":1,"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-17T23:50:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6a2nqIqGYibG0sscNvVpzPrpbsmVfeq1ZfHi5UoDXGZSMBE/vs6lSV2YPO0EcBY0AN3CthEWFH0Nhe6oduMRBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T12:14:24.891818Z"},"content_sha256":"7f950f84102f604b1eee43658ef0e06fa3d579192696a9f3563aada313ce0ae4","schema_version":"1.0","event_id":"sha256:7f950f84102f604b1eee43658ef0e06fa3d579192696a9f3563aada313ce0ae4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OYYOWYFRAPE6NIPB27CLOGPE6Z","target":"graph","payload":{"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"},"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-17T23:50:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nv1HQUcDCGxA2FjgN3wOjbXLGRAKWmSNYuApOEbZ9xO4G1cwyJDvtJRsoQl5y5cc/rrBAX7J0XsdEPuYFr4VBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T12:14:24.892161Z"},"content_sha256":"6973d3f4c0e68fbb7051ee68c5c7a58acd19c6e6701aa3dcf8336dd6d8c43eeb","schema_version":"1.0","event_id":"sha256:6973d3f4c0e68fbb7051ee68c5c7a58acd19c6e6701aa3dcf8336dd6d8c43eeb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OYYOWYFRAPE6NIPB27CLOGPE6Z/bundle.json","state_url":"https://pith.science/pith/OYYOWYFRAPE6NIPB27CLOGPE6Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OYYOWYFRAPE6NIPB27CLOGPE6Z/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-20T12:14:24Z","links":{"resolver":"https://pith.science/pith/OYYOWYFRAPE6NIPB27CLOGPE6Z","bundle":"https://pith.science/pith/OYYOWYFRAPE6NIPB27CLOGPE6Z/bundle.json","state":"https://pith.science/pith/OYYOWYFRAPE6NIPB27CLOGPE6Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OYYOWYFRAPE6NIPB27CLOGPE6Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OYYOWYFRAPE6NIPB27CLOGPE6Z","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":"4f37035944af114159f781b0d722147243b091535e3594416ae5044044d1950b","cross_cats_sorted":["cs.AI","cs.LG","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-03-22T03:48:48Z","title_canon_sha256":"c652c2d16d54609978c5e461ea79530eb4c36cbc62c86056f77477615da174fe"},"schema_version":"1.0","source":{"id":"1903.09348","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.09348","created_at":"2026-05-17T23:50:39Z"},{"alias_kind":"arxiv_version","alias_value":"1903.09348v1","created_at":"2026-05-17T23:50:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09348","created_at":"2026-05-17T23:50:39Z"},{"alias_kind":"pith_short_12","alias_value":"OYYOWYFRAPE6","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OYYOWYFRAPE6NIPB","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OYYOWYFR","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:6973d3f4c0e68fbb7051ee68c5c7a58acd19c6e6701aa3dcf8336dd6d8c43eeb","target":"graph","created_at":"2026-05-17T23:50:39Z","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":"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","authors_text":"Bin Li, Scott Anthony Sisson, Xuhui Fan","cross_cats":["cs.AI","cs.LG","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-03-22T03:48:48Z","title":"Binary Space Partitioning Forests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09348","kind":"arxiv","version":1},"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:7f950f84102f604b1eee43658ef0e06fa3d579192696a9f3563aada313ce0ae4","target":"record","created_at":"2026-05-17T23:50:39Z","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":"4f37035944af114159f781b0d722147243b091535e3594416ae5044044d1950b","cross_cats_sorted":["cs.AI","cs.LG","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-03-22T03:48:48Z","title_canon_sha256":"c652c2d16d54609978c5e461ea79530eb4c36cbc62c86056f77477615da174fe"},"schema_version":"1.0","source":{"id":"1903.09348","kind":"arxiv","version":1}},"canonical_sha256":"7630eb60b103c9e6a1e1d7c4b719e4f67c00ad54eaa2a4fce605715e30a7f930","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7630eb60b103c9e6a1e1d7c4b719e4f67c00ad54eaa2a4fce605715e30a7f930","first_computed_at":"2026-05-17T23:50:39.874993Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:39.874993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pCb95jptmyE9gtg8bHGgkhwgHMaoIFGcs4isVN21qI66fHUdsC7NgMQVt5QNTXC2sSI6AkiZoPFzZCy8L/7fBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:39.875475Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.09348","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f950f84102f604b1eee43658ef0e06fa3d579192696a9f3563aada313ce0ae4","sha256:6973d3f4c0e68fbb7051ee68c5c7a58acd19c6e6701aa3dcf8336dd6d8c43eeb"],"state_sha256":"3b04d9b22b4e3ad3803d498dc89069c2ec5f5bbacf003e86d9ea7fb4f2b2c9f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AcLf3mnZMUdhpYpDZ9daXHgo04SJtVKOuadbr649NDTnax5Z0aEgy3D7BfHoKMueHzKwJmv/HJZqAEN9C2fJCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T12:14:24.894110Z","bundle_sha256":"6c7984035a169fc39192558770eeecda3f1f11f9686b699d8032092e5138fdf0"}}