{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZGGBIXPEQ3MYTGFQOPQT5E7YU5","short_pith_number":"pith:ZGGBIXPE","schema_version":"1.0","canonical_sha256":"c98c145de486d98998b073e13e93f8a7617c99706c34d115cadaa9dfb3cf09b1","source":{"kind":"arxiv","id":"1106.0461","version":1},"attestation_state":"computed","paper":{"title":"Random hyperplane search trees in high dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.PR"],"primary_cat":"cs.CG","authors_text":"James King, Luc Devroye","submitted_at":"2011-06-02T16:16:35Z","abstract_excerpt":"Given a set S of n \\geq d points in general position in R^d, a random hyperplane split is obtained by sampling d points uniformly at random without replacement from S and splitting based on their affine hull. A random hyperplane search tree is a binary space partition tree obtained by recursive application of random hyperplane splits. We investigate the structural distributions of such random trees with a particular focus on the growth with d. A blessing of dimensionality arises--as d increases, random hyperplane splits more closely resemble perfectly balanced splits; in turn, random hyperplan"},"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":"1106.0461","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-06-02T16:16:35Z","cross_cats_sorted":["cs.DS","math.PR"],"title_canon_sha256":"ccdbca7356d92b1cce23b2d332d04b23a0cb4eac4eb6e1a1edeaddc06f3e19f1","abstract_canon_sha256":"45410b8e562f5b4076e936be62b4f995ba994bd5584a62ea2929ba53156f8a1b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:20:50.324774Z","signature_b64":"VCVoc/wDHGGjAhj6CrgtZfcjqeAmoP8t09iX/vpfrnR0ddfcASm3i8Y2ksipOl7ABGM/3alTLydwLSwm86v6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c98c145de486d98998b073e13e93f8a7617c99706c34d115cadaa9dfb3cf09b1","last_reissued_at":"2026-05-18T04:20:50.323979Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:20:50.323979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random hyperplane search trees in high dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.PR"],"primary_cat":"cs.CG","authors_text":"James King, Luc Devroye","submitted_at":"2011-06-02T16:16:35Z","abstract_excerpt":"Given a set S of n \\geq d points in general position in R^d, a random hyperplane split is obtained by sampling d points uniformly at random without replacement from S and splitting based on their affine hull. A random hyperplane search tree is a binary space partition tree obtained by recursive application of random hyperplane splits. We investigate the structural distributions of such random trees with a particular focus on the growth with d. A blessing of dimensionality arises--as d increases, random hyperplane splits more closely resemble perfectly balanced splits; in turn, random hyperplan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0461","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":"1106.0461","created_at":"2026-05-18T04:20:50.324112+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.0461v1","created_at":"2026-05-18T04:20:50.324112+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0461","created_at":"2026-05-18T04:20:50.324112+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZGGBIXPEQ3MY","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZGGBIXPEQ3MYTGFQ","created_at":"2026-05-18T12:26:47.523578+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZGGBIXPE","created_at":"2026-05-18T12:26:47.523578+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/ZGGBIXPEQ3MYTGFQOPQT5E7YU5","json":"https://pith.science/pith/ZGGBIXPEQ3MYTGFQOPQT5E7YU5.json","graph_json":"https://pith.science/api/pith-number/ZGGBIXPEQ3MYTGFQOPQT5E7YU5/graph.json","events_json":"https://pith.science/api/pith-number/ZGGBIXPEQ3MYTGFQOPQT5E7YU5/events.json","paper":"https://pith.science/paper/ZGGBIXPE"},"agent_actions":{"view_html":"https://pith.science/pith/ZGGBIXPEQ3MYTGFQOPQT5E7YU5","download_json":"https://pith.science/pith/ZGGBIXPEQ3MYTGFQOPQT5E7YU5.json","view_paper":"https://pith.science/paper/ZGGBIXPE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.0461&json=true","fetch_graph":"https://pith.science/api/pith-number/ZGGBIXPEQ3MYTGFQOPQT5E7YU5/graph.json","fetch_events":"https://pith.science/api/pith-number/ZGGBIXPEQ3MYTGFQOPQT5E7YU5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZGGBIXPEQ3MYTGFQOPQT5E7YU5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZGGBIXPEQ3MYTGFQOPQT5E7YU5/action/storage_attestation","attest_author":"https://pith.science/pith/ZGGBIXPEQ3MYTGFQOPQT5E7YU5/action/author_attestation","sign_citation":"https://pith.science/pith/ZGGBIXPEQ3MYTGFQOPQT5E7YU5/action/citation_signature","submit_replication":"https://pith.science/pith/ZGGBIXPEQ3MYTGFQOPQT5E7YU5/action/replication_record"}},"created_at":"2026-05-18T04:20:50.324112+00:00","updated_at":"2026-05-18T04:20:50.324112+00:00"}