{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ZGGBIXPEQ3MYTGFQOPQT5E7YU5","short_pith_number":"pith:ZGGBIXPE","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"},"canonical_sha256":"c98c145de486d98998b073e13e93f8a7617c99706c34d115cadaa9dfb3cf09b1","source":{"kind":"arxiv","id":"1106.0461","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.0461","created_at":"2026-05-18T04:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"1106.0461v1","created_at":"2026-05-18T04:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0461","created_at":"2026-05-18T04:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"ZGGBIXPEQ3MY","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZGGBIXPEQ3MYTGFQ","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZGGBIXPE","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ZGGBIXPEQ3MYTGFQOPQT5E7YU5","target":"record","payload":{"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"},"canonical_sha256":"c98c145de486d98998b073e13e93f8a7617c99706c34d115cadaa9dfb3cf09b1","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"},"source_kind":"arxiv","source_id":"1106.0461","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-18T04:20:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JDw352EZsEW/Y4I7MtvW6SvCIggzhOe+jdtLgHvl0N8Ihvwt8zeYN4++xbx/pgZqBog14PiCh8n5L4J7FC3OAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:17:16.506480Z"},"content_sha256":"adb2aeef063a7c8635101747af53c282bcadc7bffe21979cdf21c24fc5a6752e","schema_version":"1.0","event_id":"sha256:adb2aeef063a7c8635101747af53c282bcadc7bffe21979cdf21c24fc5a6752e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ZGGBIXPEQ3MYTGFQOPQT5E7YU5","target":"graph","payload":{"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"},"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-18T04:20:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aThG7slxSRevyUpKqZlbkqTPgmh3LNv7/SO1a/hw+DOdp56OrGnER6M0erU144c1J4GsTP7NbslbHraXCcgkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:17:16.506824Z"},"content_sha256":"e48e760dd9ed53c6d4e838e77a33005f0222278f9720689839e82a0838470c70","schema_version":"1.0","event_id":"sha256:e48e760dd9ed53c6d4e838e77a33005f0222278f9720689839e82a0838470c70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZGGBIXPEQ3MYTGFQOPQT5E7YU5/bundle.json","state_url":"https://pith.science/pith/ZGGBIXPEQ3MYTGFQOPQT5E7YU5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZGGBIXPEQ3MYTGFQOPQT5E7YU5/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-08T12:17:16Z","links":{"resolver":"https://pith.science/pith/ZGGBIXPEQ3MYTGFQOPQT5E7YU5","bundle":"https://pith.science/pith/ZGGBIXPEQ3MYTGFQOPQT5E7YU5/bundle.json","state":"https://pith.science/pith/ZGGBIXPEQ3MYTGFQOPQT5E7YU5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZGGBIXPEQ3MYTGFQOPQT5E7YU5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ZGGBIXPEQ3MYTGFQOPQT5E7YU5","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":"45410b8e562f5b4076e936be62b4f995ba994bd5584a62ea2929ba53156f8a1b","cross_cats_sorted":["cs.DS","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-06-02T16:16:35Z","title_canon_sha256":"ccdbca7356d92b1cce23b2d332d04b23a0cb4eac4eb6e1a1edeaddc06f3e19f1"},"schema_version":"1.0","source":{"id":"1106.0461","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.0461","created_at":"2026-05-18T04:20:50Z"},{"alias_kind":"arxiv_version","alias_value":"1106.0461v1","created_at":"2026-05-18T04:20:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.0461","created_at":"2026-05-18T04:20:50Z"},{"alias_kind":"pith_short_12","alias_value":"ZGGBIXPEQ3MY","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZGGBIXPEQ3MYTGFQ","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZGGBIXPE","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:e48e760dd9ed53c6d4e838e77a33005f0222278f9720689839e82a0838470c70","target":"graph","created_at":"2026-05-18T04:20:50Z","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":"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","authors_text":"James King, Luc Devroye","cross_cats":["cs.DS","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-06-02T16:16:35Z","title":"Random hyperplane search trees in high dimensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.0461","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:adb2aeef063a7c8635101747af53c282bcadc7bffe21979cdf21c24fc5a6752e","target":"record","created_at":"2026-05-18T04:20:50Z","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":"45410b8e562f5b4076e936be62b4f995ba994bd5584a62ea2929ba53156f8a1b","cross_cats_sorted":["cs.DS","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2011-06-02T16:16:35Z","title_canon_sha256":"ccdbca7356d92b1cce23b2d332d04b23a0cb4eac4eb6e1a1edeaddc06f3e19f1"},"schema_version":"1.0","source":{"id":"1106.0461","kind":"arxiv","version":1}},"canonical_sha256":"c98c145de486d98998b073e13e93f8a7617c99706c34d115cadaa9dfb3cf09b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c98c145de486d98998b073e13e93f8a7617c99706c34d115cadaa9dfb3cf09b1","first_computed_at":"2026-05-18T04:20:50.323979Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:20:50.323979Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VCVoc/wDHGGjAhj6CrgtZfcjqeAmoP8t09iX/vpfrnR0ddfcASm3i8Y2ksipOl7ABGM/3alTLydwLSwm86v6Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:20:50.324774Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.0461","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:adb2aeef063a7c8635101747af53c282bcadc7bffe21979cdf21c24fc5a6752e","sha256:e48e760dd9ed53c6d4e838e77a33005f0222278f9720689839e82a0838470c70"],"state_sha256":"e00bdea2b54f305e9daf1733199e4347b6d407f10797e3dd9ae1a5062dd77ca9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OSxVgQakNpWNOKfQ54VdsiLaew31CNLVODmteDuQFKukD9NoeDz7M3c2CSjqJ4A4V9wyrllbCdhhlCEy8xhyDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T12:17:16.508693Z","bundle_sha256":"0a585728712e0de568601e3ec390bfe56bdbc2ffd13ceae9aae847c8a5e91dde"}}