{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7ZWCDYNKRKBZ4P425YEH7GCXTM","short_pith_number":"pith:7ZWCDYNK","schema_version":"1.0","canonical_sha256":"fe6c21e1aa8a839e3f9aee087f98579b338bdec4fd0a6a705bcdb68f10a8f572","source":{"kind":"arxiv","id":"1903.09343","version":1},"attestation_state":"computed","paper":{"title":"The Binary Space Partitioning-Tree Process","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:38:00Z","abstract_excerpt":"The Mondrian process represents an elegant and powerful approach for space partition modelling. However, as it restricts the partitions to be axis-aligned, its modelling flexibility is limited. In this work, we propose a self-consistent Binary Space Partitioning (BSP)-Tree process to generalize the Mondrian process. The BSP-Tree process is an almost surely right continuous Markov jump process that allows uniformly distributed oblique cuts in a two-dimensional convex polygon. The BSP-Tree process can also be extended using a non-uniform probability measure to generate direction differentiated c"},"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.09343","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-03-22T03:38:00Z","cross_cats_sorted":["cs.AI","cs.LG","math.PR"],"title_canon_sha256":"e70d88b3ab9c9822c7d9238f7ccf80da23bd7d480c092c47ffd95e3d4ec4ac7e","abstract_canon_sha256":"d13068fde48bb87adee6aaf3dedbf2a70dd022145058e6016ad474f46b2ba740"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:39.887827Z","signature_b64":"bzhGIMuTapr81YyqzoxvXTQvy7dJ9Rb+ztsSHFSNwGZNDHU6M71T83uuI43lTzKxA+Vq7FsiKtyGLwzQSMxICA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe6c21e1aa8a839e3f9aee087f98579b338bdec4fd0a6a705bcdb68f10a8f572","last_reissued_at":"2026-05-17T23:50:39.887366Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:39.887366Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Binary Space Partitioning-Tree Process","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:38:00Z","abstract_excerpt":"The Mondrian process represents an elegant and powerful approach for space partition modelling. However, as it restricts the partitions to be axis-aligned, its modelling flexibility is limited. In this work, we propose a self-consistent Binary Space Partitioning (BSP)-Tree process to generalize the Mondrian process. The BSP-Tree process is an almost surely right continuous Markov jump process that allows uniformly distributed oblique cuts in a two-dimensional convex polygon. The BSP-Tree process can also be extended using a non-uniform probability measure to generate direction differentiated c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09343","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.09343","created_at":"2026-05-17T23:50:39.887437+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.09343v1","created_at":"2026-05-17T23:50:39.887437+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09343","created_at":"2026-05-17T23:50:39.887437+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ZWCDYNKRKBZ","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ZWCDYNKRKBZ4P42","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ZWCDYNK","created_at":"2026-05-18T12:33:12.712433+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/7ZWCDYNKRKBZ4P425YEH7GCXTM","json":"https://pith.science/pith/7ZWCDYNKRKBZ4P425YEH7GCXTM.json","graph_json":"https://pith.science/api/pith-number/7ZWCDYNKRKBZ4P425YEH7GCXTM/graph.json","events_json":"https://pith.science/api/pith-number/7ZWCDYNKRKBZ4P425YEH7GCXTM/events.json","paper":"https://pith.science/paper/7ZWCDYNK"},"agent_actions":{"view_html":"https://pith.science/pith/7ZWCDYNKRKBZ4P425YEH7GCXTM","download_json":"https://pith.science/pith/7ZWCDYNKRKBZ4P425YEH7GCXTM.json","view_paper":"https://pith.science/paper/7ZWCDYNK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.09343&json=true","fetch_graph":"https://pith.science/api/pith-number/7ZWCDYNKRKBZ4P425YEH7GCXTM/graph.json","fetch_events":"https://pith.science/api/pith-number/7ZWCDYNKRKBZ4P425YEH7GCXTM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ZWCDYNKRKBZ4P425YEH7GCXTM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ZWCDYNKRKBZ4P425YEH7GCXTM/action/storage_attestation","attest_author":"https://pith.science/pith/7ZWCDYNKRKBZ4P425YEH7GCXTM/action/author_attestation","sign_citation":"https://pith.science/pith/7ZWCDYNKRKBZ4P425YEH7GCXTM/action/citation_signature","submit_replication":"https://pith.science/pith/7ZWCDYNKRKBZ4P425YEH7GCXTM/action/replication_record"}},"created_at":"2026-05-17T23:50:39.887437+00:00","updated_at":"2026-05-17T23:50:39.887437+00:00"}