{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3D7D3ASOZSJYAMVOVM64YUS7ZT","short_pith_number":"pith:3D7D3ASO","schema_version":"1.0","canonical_sha256":"d8fe3d824ecc938032aeab3dcc525fccca31cea1844dda27dd2215061f2d0a3a","source":{"kind":"arxiv","id":"1905.01029","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.01029","created_at":"2026-05-17T23:47:07.861175+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.01029v1","created_at":"2026-05-17T23:47:07.861175+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01029","created_at":"2026-05-17T23:47:07.861175+00:00"},{"alias_kind":"pith_short_12","alias_value":"3D7D3ASOZSJY","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"3D7D3ASOZSJYAMVO","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"3D7D3ASO","created_at":"2026-05-18T12:33:07.085635+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/3D7D3ASOZSJYAMVOVM64YUS7ZT","json":"https://pith.science/pith/3D7D3ASOZSJYAMVOVM64YUS7ZT.json","graph_json":"https://pith.science/api/pith-number/3D7D3ASOZSJYAMVOVM64YUS7ZT/graph.json","events_json":"https://pith.science/api/pith-number/3D7D3ASOZSJYAMVOVM64YUS7ZT/events.json","paper":"https://pith.science/paper/3D7D3ASO"},"agent_actions":{"view_html":"https://pith.science/pith/3D7D3ASOZSJYAMVOVM64YUS7ZT","download_json":"https://pith.science/pith/3D7D3ASOZSJYAMVOVM64YUS7ZT.json","view_paper":"https://pith.science/paper/3D7D3ASO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.01029&json=true","fetch_graph":"https://pith.science/api/pith-number/3D7D3ASOZSJYAMVOVM64YUS7ZT/graph.json","fetch_events":"https://pith.science/api/pith-number/3D7D3ASOZSJYAMVOVM64YUS7ZT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3D7D3ASOZSJYAMVOVM64YUS7ZT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3D7D3ASOZSJYAMVOVM64YUS7ZT/action/storage_attestation","attest_author":"https://pith.science/pith/3D7D3ASOZSJYAMVOVM64YUS7ZT/action/author_attestation","sign_citation":"https://pith.science/pith/3D7D3ASOZSJYAMVOVM64YUS7ZT/action/citation_signature","submit_replication":"https://pith.science/pith/3D7D3ASOZSJYAMVOVM64YUS7ZT/action/replication_record"}},"created_at":"2026-05-17T23:47:07.861175+00:00","updated_at":"2026-05-17T23:47:07.861175+00:00"}