{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3D7D3ASOZSJYAMVOVM64YUS7ZT","short_pith_number":"pith:3D7D3ASO","canonical_record":{"source":{"id":"1905.01029","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-05-03T03:54:43Z","cross_cats_sorted":[],"title_canon_sha256":"6ff661a184f01bfc43aa78d1297bbea16c8a440db20c71cd66ee7a287324b73d","abstract_canon_sha256":"c4afc9e1c1179c41fc8fcdc8556a643fdaf83a3219fd2cf8f419f1ebffc53440"},"schema_version":"1.0"},"canonical_sha256":"d8fe3d824ecc938032aeab3dcc525fccca31cea1844dda27dd2215061f2d0a3a","source":{"kind":"arxiv","id":"1905.01029","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.01029","created_at":"2026-05-17T23:47:07Z"},{"alias_kind":"arxiv_version","alias_value":"1905.01029v1","created_at":"2026-05-17T23:47:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01029","created_at":"2026-05-17T23:47:07Z"},{"alias_kind":"pith_short_12","alias_value":"3D7D3ASOZSJY","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3D7D3ASOZSJYAMVO","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3D7D3ASO","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3D7D3ASOZSJYAMVOVM64YUS7ZT","target":"record","payload":{"canonical_record":{"source":{"id":"1905.01029","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-05-03T03:54:43Z","cross_cats_sorted":[],"title_canon_sha256":"6ff661a184f01bfc43aa78d1297bbea16c8a440db20c71cd66ee7a287324b73d","abstract_canon_sha256":"c4afc9e1c1179c41fc8fcdc8556a643fdaf83a3219fd2cf8f419f1ebffc53440"},"schema_version":"1.0"},"canonical_sha256":"d8fe3d824ecc938032aeab3dcc525fccca31cea1844dda27dd2215061f2d0a3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:07.861849Z","signature_b64":"yKKOdoqcnYS1TeZps7rrWl0hiAT2bwyKXHhUPNPQnH5AO8Lp/1PooC1mcNshNJrmkG3xqCa43olxQHGEK4OMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8fe3d824ecc938032aeab3dcc525fccca31cea1844dda27dd2215061f2d0a3a","last_reissued_at":"2026-05-17T23:47:07.861046Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:07.861046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.01029","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:47:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cshH5VX9FkWJpQ/eWFOs90i8HDVaDAGVpJw3KkJjnkKXgWvMlOh1puwjNYi8AiR4oKZMZ4f/HPV6CBybsAtJDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:50:14.866384Z"},"content_sha256":"2d395373da9366e461630480ca29702ac7b16e137bcf4a330606e2a9f51a4954","schema_version":"1.0","event_id":"sha256:2d395373da9366e461630480ca29702ac7b16e137bcf4a330606e2a9f51a4954"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3D7D3ASOZSJYAMVOVM64YUS7ZT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Range closest-pair search in higher dimensions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Jie Xue, Saladi Rahul, Timothy M. Chan","submitted_at":"2019-05-03T03:54:43Z","abstract_excerpt":"Range closest-pair (RCP) search is a range-search variant of the classical closest-pair problem, which aims to store a given set $S$ of points into some space-efficient data structure such that when a query range $Q$ is specified, the closest pair in $S \\cap Q$ can be reported quickly. RCP search has received attention over years, but the primary focus was only on $\\mathbb{R}^2$. In this paper, we study RCP search in higher dimensions. We give the first nontrivial RCP data structures for orthogonal, simplex, halfspace, and ball queries in $\\mathbb{R}^d$ for any constant $d$. Furthermore, we pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01029","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:47:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j1QGbXIGpcZFNBy2Au3wZ1uaZiovkeTjxoUb1NgJ9ZMT+XDTG2V6X/hgqEO3Ofjwjl9zyaRndXYKu7Z5ATkQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:50:14.866741Z"},"content_sha256":"3f3b80bb605d1dce8b418529b5e685b48b539cc2b94aa848334705a26cb1a28a","schema_version":"1.0","event_id":"sha256:3f3b80bb605d1dce8b418529b5e685b48b539cc2b94aa848334705a26cb1a28a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3D7D3ASOZSJYAMVOVM64YUS7ZT/bundle.json","state_url":"https://pith.science/pith/3D7D3ASOZSJYAMVOVM64YUS7ZT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3D7D3ASOZSJYAMVOVM64YUS7ZT/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-02T23:50:14Z","links":{"resolver":"https://pith.science/pith/3D7D3ASOZSJYAMVOVM64YUS7ZT","bundle":"https://pith.science/pith/3D7D3ASOZSJYAMVOVM64YUS7ZT/bundle.json","state":"https://pith.science/pith/3D7D3ASOZSJYAMVOVM64YUS7ZT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3D7D3ASOZSJYAMVOVM64YUS7ZT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3D7D3ASOZSJYAMVOVM64YUS7ZT","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":"c4afc9e1c1179c41fc8fcdc8556a643fdaf83a3219fd2cf8f419f1ebffc53440","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-05-03T03:54:43Z","title_canon_sha256":"6ff661a184f01bfc43aa78d1297bbea16c8a440db20c71cd66ee7a287324b73d"},"schema_version":"1.0","source":{"id":"1905.01029","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.01029","created_at":"2026-05-17T23:47:07Z"},{"alias_kind":"arxiv_version","alias_value":"1905.01029v1","created_at":"2026-05-17T23:47:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01029","created_at":"2026-05-17T23:47:07Z"},{"alias_kind":"pith_short_12","alias_value":"3D7D3ASOZSJY","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3D7D3ASOZSJYAMVO","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3D7D3ASO","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:3f3b80bb605d1dce8b418529b5e685b48b539cc2b94aa848334705a26cb1a28a","target":"graph","created_at":"2026-05-17T23:47:07Z","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":"Range closest-pair (RCP) search is a range-search variant of the classical closest-pair problem, which aims to store a given set $S$ of points into some space-efficient data structure such that when a query range $Q$ is specified, the closest pair in $S \\cap Q$ can be reported quickly. RCP search has received attention over years, but the primary focus was only on $\\mathbb{R}^2$. In this paper, we study RCP search in higher dimensions. We give the first nontrivial RCP data structures for orthogonal, simplex, halfspace, and ball queries in $\\mathbb{R}^d$ for any constant $d$. Furthermore, we pr","authors_text":"Jie Xue, Saladi Rahul, Timothy M. Chan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-05-03T03:54:43Z","title":"Range closest-pair search in higher dimensions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01029","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:2d395373da9366e461630480ca29702ac7b16e137bcf4a330606e2a9f51a4954","target":"record","created_at":"2026-05-17T23:47:07Z","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":"c4afc9e1c1179c41fc8fcdc8556a643fdaf83a3219fd2cf8f419f1ebffc53440","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-05-03T03:54:43Z","title_canon_sha256":"6ff661a184f01bfc43aa78d1297bbea16c8a440db20c71cd66ee7a287324b73d"},"schema_version":"1.0","source":{"id":"1905.01029","kind":"arxiv","version":1}},"canonical_sha256":"d8fe3d824ecc938032aeab3dcc525fccca31cea1844dda27dd2215061f2d0a3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8fe3d824ecc938032aeab3dcc525fccca31cea1844dda27dd2215061f2d0a3a","first_computed_at":"2026-05-17T23:47:07.861046Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:07.861046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yKKOdoqcnYS1TeZps7rrWl0hiAT2bwyKXHhUPNPQnH5AO8Lp/1PooC1mcNshNJrmkG3xqCa43olxQHGEK4OMDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:07.861849Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.01029","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d395373da9366e461630480ca29702ac7b16e137bcf4a330606e2a9f51a4954","sha256:3f3b80bb605d1dce8b418529b5e685b48b539cc2b94aa848334705a26cb1a28a"],"state_sha256":"8306c31fb10d146cacc1a7c12e1e05651cc09b1c652032e516b02b042c448ca4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"acVGZgC9BJOTs03YAFhLgEkOq32VkLAisNpxbEjN8E4N+j+AFOe2d53M9yc0Rg8HSEu1J99meKdWZKFYjF7UDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:50:14.868687Z","bundle_sha256":"9cf6ea15ad7a9ae4fceb77b6af81640c4bb3295a8a2fc95b00b83adf3998f62d"}}