{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OW753XMMEDM6UITNYS242LQBIC","short_pith_number":"pith:OW753XMM","schema_version":"1.0","canonical_sha256":"75bfdddd8c20d9ea226dc4b5cd2e01409011870c2a7a786eba940f909728783a","source":{"kind":"arxiv","id":"1712.09749","version":4},"attestation_state":"computed","paper":{"title":"New bounds for range closest-pair problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Jie Xue, Ravi Janardan, Saladi Rahul, Yuan Li","submitted_at":"2017-12-28T04:00:32Z","abstract_excerpt":"Given a dataset $S$ of points in $\\mathbb{R}^2$, the range closest-pair (RCP) problem aims to preprocess $S$ into a data structure such that when a query range $X$ is specified, the closest-pair in $S \\cap X$ can be reported efficiently. The RCP problem can be viewed as a range-search version of the classical closest-pair problem, and finds applications in many areas. Due to its non-decomposability, the RCP problem is much more challenging than many traditional range-search problems. This paper revisits the RCP problem, and proposes new data structures for various query types including quadran"},"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":"1712.09749","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-12-28T04:00:32Z","cross_cats_sorted":[],"title_canon_sha256":"99319e2c525ef7c29d2943387aced39c923dd3f5a72951eb3a08ac8f7d7907fa","abstract_canon_sha256":"289793baa13d56b4779a007f4e8c185083328cf2e7550711d21e9cb5fe87e9e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:41.273527Z","signature_b64":"1UqahP2N6umTlgkzSVte/TvX9agSVaOM2dCY7COOV0VJ7fjf/24JkdG+/ha2C4Eh0NZDQ1fgEYm++76YjP60AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75bfdddd8c20d9ea226dc4b5cd2e01409011870c2a7a786eba940f909728783a","last_reissued_at":"2026-05-18T00:19:41.272810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:41.272810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New bounds for range closest-pair problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Jie Xue, Ravi Janardan, Saladi Rahul, Yuan Li","submitted_at":"2017-12-28T04:00:32Z","abstract_excerpt":"Given a dataset $S$ of points in $\\mathbb{R}^2$, the range closest-pair (RCP) problem aims to preprocess $S$ into a data structure such that when a query range $X$ is specified, the closest-pair in $S \\cap X$ can be reported efficiently. The RCP problem can be viewed as a range-search version of the classical closest-pair problem, and finds applications in many areas. Due to its non-decomposability, the RCP problem is much more challenging than many traditional range-search problems. This paper revisits the RCP problem, and proposes new data structures for various query types including quadran"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09749","kind":"arxiv","version":4},"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":"1712.09749","created_at":"2026-05-18T00:19:41.272920+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.09749v4","created_at":"2026-05-18T00:19:41.272920+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09749","created_at":"2026-05-18T00:19:41.272920+00:00"},{"alias_kind":"pith_short_12","alias_value":"OW753XMMEDM6","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OW753XMMEDM6UITN","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OW753XMM","created_at":"2026-05-18T12:31:34.259226+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/OW753XMMEDM6UITNYS242LQBIC","json":"https://pith.science/pith/OW753XMMEDM6UITNYS242LQBIC.json","graph_json":"https://pith.science/api/pith-number/OW753XMMEDM6UITNYS242LQBIC/graph.json","events_json":"https://pith.science/api/pith-number/OW753XMMEDM6UITNYS242LQBIC/events.json","paper":"https://pith.science/paper/OW753XMM"},"agent_actions":{"view_html":"https://pith.science/pith/OW753XMMEDM6UITNYS242LQBIC","download_json":"https://pith.science/pith/OW753XMMEDM6UITNYS242LQBIC.json","view_paper":"https://pith.science/paper/OW753XMM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.09749&json=true","fetch_graph":"https://pith.science/api/pith-number/OW753XMMEDM6UITNYS242LQBIC/graph.json","fetch_events":"https://pith.science/api/pith-number/OW753XMMEDM6UITNYS242LQBIC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OW753XMMEDM6UITNYS242LQBIC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OW753XMMEDM6UITNYS242LQBIC/action/storage_attestation","attest_author":"https://pith.science/pith/OW753XMMEDM6UITNYS242LQBIC/action/author_attestation","sign_citation":"https://pith.science/pith/OW753XMMEDM6UITNYS242LQBIC/action/citation_signature","submit_replication":"https://pith.science/pith/OW753XMMEDM6UITNYS242LQBIC/action/replication_record"}},"created_at":"2026-05-18T00:19:41.272920+00:00","updated_at":"2026-05-18T00:19:41.272920+00:00"}