{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:W34BF6N2ZSGK3H55Y2DS3UWRD5","short_pith_number":"pith:W34BF6N2","canonical_record":{"source":{"id":"1312.6305","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-21T21:25:05Z","cross_cats_sorted":[],"title_canon_sha256":"9c5dc34e2bfcbbedc4c1ca20f39e70a907ca9f5b61924a2e7aca942a029f85a6","abstract_canon_sha256":"fb2a26219665f7d3a72c64b38abb947e9151e3fbbafa8392bea57079cd15377f"},"schema_version":"1.0"},"canonical_sha256":"b6f812f9bacc8cad9fbdc6872dd2d11f7d8b6fccca63b7462bdadaa3aadc4c41","source":{"kind":"arxiv","id":"1312.6305","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.6305","created_at":"2026-05-18T03:04:05Z"},{"alias_kind":"arxiv_version","alias_value":"1312.6305v1","created_at":"2026-05-18T03:04:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6305","created_at":"2026-05-18T03:04:05Z"},{"alias_kind":"pith_short_12","alias_value":"W34BF6N2ZSGK","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"W34BF6N2ZSGK3H55","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"W34BF6N2","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:W34BF6N2ZSGK3H55Y2DS3UWRD5","target":"record","payload":{"canonical_record":{"source":{"id":"1312.6305","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-21T21:25:05Z","cross_cats_sorted":[],"title_canon_sha256":"9c5dc34e2bfcbbedc4c1ca20f39e70a907ca9f5b61924a2e7aca942a029f85a6","abstract_canon_sha256":"fb2a26219665f7d3a72c64b38abb947e9151e3fbbafa8392bea57079cd15377f"},"schema_version":"1.0"},"canonical_sha256":"b6f812f9bacc8cad9fbdc6872dd2d11f7d8b6fccca63b7462bdadaa3aadc4c41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:05.596166Z","signature_b64":"A0BJfJB84DXpxTkto4OVx6TWFZ+R4InFCkqfyhUI0oVB/VUlp92uhuWztE5ZOtZFizblb8ZUxK2e8/fm6JwZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6f812f9bacc8cad9fbdc6872dd2d11f7d8b6fccca63b7462bdadaa3aadc4c41","last_reissued_at":"2026-05-18T03:04:05.595627Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:05.595627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.6305","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-18T03:04:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dAmLITzmzmMwXzNMzhCtezfwZVAvrNUrKu3HDwbgrwaN4bfgCxF/P2p24SwHuu1DQJv2aWCIDKL0Eiz9Ju11Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:29:34.127035Z"},"content_sha256":"83dd75e563f2b1bdba4e543d76661f36c46df59f03cf7830301c5d69bf2be880","schema_version":"1.0","event_id":"sha256:83dd75e563f2b1bdba4e543d76661f36c46df59f03cf7830301c5d69bf2be880"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:W34BF6N2ZSGK3H55Y2DS3UWRD5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Output-Sensitive Tools for Range Searching in Higher Dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Micha Sharir, Shai Zaban","submitted_at":"2013-12-21T21:25:05Z","abstract_excerpt":"Let $P$ be a set of $n$ points in ${\\mathbb R}^{d}$. A point $p \\in P$ is $k$\\emph{-shallow} if it lies in a halfspace which contains at most $k$ points of $P$ (including $p$). We show that if all points of $P$ are $k$-shallow, then $P$ can be partitioned into $\\Theta(n/k)$ subsets, so that any hyperplane crosses at most $O((n/k)^{1-1/(d-1)} \\log^{2/(d-1)}(n/k))$ subsets. Given such a partition, we can apply the standard construction of a spanning tree with small crossing number within each subset, to obtain a spanning tree for the point set $P$, with crossing number $O(n^{1-1/(d-1)}k^{1/d(d-1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6305","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-18T03:04:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K4RZWrefnc0j+TJG53LvFnXyfxISgos+Vxv1pV8gqIVo8z25upGXv9eqp+dXqrzHp0PSXjGNdDofnxsJkuuLCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:29:34.127401Z"},"content_sha256":"bc72aa110f927f388ed9e5f098be3dda3ad1dbe20b0343748f4be728c3709fc5","schema_version":"1.0","event_id":"sha256:bc72aa110f927f388ed9e5f098be3dda3ad1dbe20b0343748f4be728c3709fc5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W34BF6N2ZSGK3H55Y2DS3UWRD5/bundle.json","state_url":"https://pith.science/pith/W34BF6N2ZSGK3H55Y2DS3UWRD5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W34BF6N2ZSGK3H55Y2DS3UWRD5/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-05-29T15:29:34Z","links":{"resolver":"https://pith.science/pith/W34BF6N2ZSGK3H55Y2DS3UWRD5","bundle":"https://pith.science/pith/W34BF6N2ZSGK3H55Y2DS3UWRD5/bundle.json","state":"https://pith.science/pith/W34BF6N2ZSGK3H55Y2DS3UWRD5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W34BF6N2ZSGK3H55Y2DS3UWRD5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:W34BF6N2ZSGK3H55Y2DS3UWRD5","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":"fb2a26219665f7d3a72c64b38abb947e9151e3fbbafa8392bea57079cd15377f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-21T21:25:05Z","title_canon_sha256":"9c5dc34e2bfcbbedc4c1ca20f39e70a907ca9f5b61924a2e7aca942a029f85a6"},"schema_version":"1.0","source":{"id":"1312.6305","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.6305","created_at":"2026-05-18T03:04:05Z"},{"alias_kind":"arxiv_version","alias_value":"1312.6305v1","created_at":"2026-05-18T03:04:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.6305","created_at":"2026-05-18T03:04:05Z"},{"alias_kind":"pith_short_12","alias_value":"W34BF6N2ZSGK","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"W34BF6N2ZSGK3H55","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"W34BF6N2","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:bc72aa110f927f388ed9e5f098be3dda3ad1dbe20b0343748f4be728c3709fc5","target":"graph","created_at":"2026-05-18T03:04:05Z","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":"Let $P$ be a set of $n$ points in ${\\mathbb R}^{d}$. A point $p \\in P$ is $k$\\emph{-shallow} if it lies in a halfspace which contains at most $k$ points of $P$ (including $p$). We show that if all points of $P$ are $k$-shallow, then $P$ can be partitioned into $\\Theta(n/k)$ subsets, so that any hyperplane crosses at most $O((n/k)^{1-1/(d-1)} \\log^{2/(d-1)}(n/k))$ subsets. Given such a partition, we can apply the standard construction of a spanning tree with small crossing number within each subset, to obtain a spanning tree for the point set $P$, with crossing number $O(n^{1-1/(d-1)}k^{1/d(d-1","authors_text":"Micha Sharir, Shai Zaban","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-21T21:25:05Z","title":"Output-Sensitive Tools for Range Searching in Higher Dimensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.6305","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:83dd75e563f2b1bdba4e543d76661f36c46df59f03cf7830301c5d69bf2be880","target":"record","created_at":"2026-05-18T03:04:05Z","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":"fb2a26219665f7d3a72c64b38abb947e9151e3fbbafa8392bea57079cd15377f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-21T21:25:05Z","title_canon_sha256":"9c5dc34e2bfcbbedc4c1ca20f39e70a907ca9f5b61924a2e7aca942a029f85a6"},"schema_version":"1.0","source":{"id":"1312.6305","kind":"arxiv","version":1}},"canonical_sha256":"b6f812f9bacc8cad9fbdc6872dd2d11f7d8b6fccca63b7462bdadaa3aadc4c41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6f812f9bacc8cad9fbdc6872dd2d11f7d8b6fccca63b7462bdadaa3aadc4c41","first_computed_at":"2026-05-18T03:04:05.595627Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:04:05.595627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A0BJfJB84DXpxTkto4OVx6TWFZ+R4InFCkqfyhUI0oVB/VUlp92uhuWztE5ZOtZFizblb8ZUxK2e8/fm6JwZBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:04:05.596166Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.6305","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83dd75e563f2b1bdba4e543d76661f36c46df59f03cf7830301c5d69bf2be880","sha256:bc72aa110f927f388ed9e5f098be3dda3ad1dbe20b0343748f4be728c3709fc5"],"state_sha256":"7433f3975e93a6dee09eb0bfc6cddee692b46c48e4a60377cb5c775df4f4868a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EJmV9gXxrcQNFESznA2HeCkEWFC5g4twIOZ3U8IzscgNAxvfavq00FpPur1iUh4MKX8H8v1EC5zOHPrxrh96Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:29:34.130581Z","bundle_sha256":"599b2e07ee92c27ce025db4337fe420534aa2caa66330c1ea369bcfad55ed48f"}}