{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LSMWUB34TLXPDLZXCKIVZPC7QH","short_pith_number":"pith:LSMWUB34","schema_version":"1.0","canonical_sha256":"5c996a077c9aeef1af3712915cbc5f81edcb858013f64c9ddd2a8552e320932e","source":{"kind":"arxiv","id":"1809.10531","version":2},"attestation_state":"computed","paper":{"title":"Closest-Pair Queries in Fat Rectangles","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Michiel Smid, Sang Won Bae","submitted_at":"2018-09-27T14:15:33Z","abstract_excerpt":"In the range closest pair problem, we want to construct a data structure storing a set $S$ of $n$ points in the plane, such that for any axes-parallel query rectangle $R$, the closest pair in the set $R \\cap S$ can be reported. The currently best result for this problem is by Xue et al.~(SoCG 2018). Their data structure has size $O(n \\log^2 n)$ and query time $O(\\log^2 n)$. We show that a data structure of size $O(n \\log n)$ can be constructed in $O(n \\log n)$ time, such that queries can be answered in $O(\\log n + f \\log f)$ time, where $f$ is the aspect ratio of $R$. Thus, for fat query recta"},"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":"1809.10531","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.CG","submitted_at":"2018-09-27T14:15:33Z","cross_cats_sorted":[],"title_canon_sha256":"47dcf2fd81b8f8e065f0c6e098b382dbbfde23edcf85f4614f32a4054709a881","abstract_canon_sha256":"22e6d903f7566fee70549393438717ca109103ea74d04406de66b7eceefcc8da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:22.261485Z","signature_b64":"iy6iRSvqe/pr0LC9buFcweDwBitDH2SeSfbP0fu6TQjuiVHTPuIHmQziHj17wcUIChDhJlPJpm5AC9KZ57/rDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c996a077c9aeef1af3712915cbc5f81edcb858013f64c9ddd2a8552e320932e","last_reissued_at":"2026-05-17T23:49:22.260972Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:22.260972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Closest-Pair Queries in Fat Rectangles","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Michiel Smid, Sang Won Bae","submitted_at":"2018-09-27T14:15:33Z","abstract_excerpt":"In the range closest pair problem, we want to construct a data structure storing a set $S$ of $n$ points in the plane, such that for any axes-parallel query rectangle $R$, the closest pair in the set $R \\cap S$ can be reported. The currently best result for this problem is by Xue et al.~(SoCG 2018). Their data structure has size $O(n \\log^2 n)$ and query time $O(\\log^2 n)$. We show that a data structure of size $O(n \\log n)$ can be constructed in $O(n \\log n)$ time, such that queries can be answered in $O(\\log n + f \\log f)$ time, where $f$ is the aspect ratio of $R$. Thus, for fat query recta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10531","kind":"arxiv","version":2},"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":"1809.10531","created_at":"2026-05-17T23:49:22.261050+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.10531v2","created_at":"2026-05-17T23:49:22.261050+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10531","created_at":"2026-05-17T23:49:22.261050+00:00"},{"alias_kind":"pith_short_12","alias_value":"LSMWUB34TLXP","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LSMWUB34TLXPDLZX","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LSMWUB34","created_at":"2026-05-18T12:32:37.024351+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/LSMWUB34TLXPDLZXCKIVZPC7QH","json":"https://pith.science/pith/LSMWUB34TLXPDLZXCKIVZPC7QH.json","graph_json":"https://pith.science/api/pith-number/LSMWUB34TLXPDLZXCKIVZPC7QH/graph.json","events_json":"https://pith.science/api/pith-number/LSMWUB34TLXPDLZXCKIVZPC7QH/events.json","paper":"https://pith.science/paper/LSMWUB34"},"agent_actions":{"view_html":"https://pith.science/pith/LSMWUB34TLXPDLZXCKIVZPC7QH","download_json":"https://pith.science/pith/LSMWUB34TLXPDLZXCKIVZPC7QH.json","view_paper":"https://pith.science/paper/LSMWUB34","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.10531&json=true","fetch_graph":"https://pith.science/api/pith-number/LSMWUB34TLXPDLZXCKIVZPC7QH/graph.json","fetch_events":"https://pith.science/api/pith-number/LSMWUB34TLXPDLZXCKIVZPC7QH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LSMWUB34TLXPDLZXCKIVZPC7QH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LSMWUB34TLXPDLZXCKIVZPC7QH/action/storage_attestation","attest_author":"https://pith.science/pith/LSMWUB34TLXPDLZXCKIVZPC7QH/action/author_attestation","sign_citation":"https://pith.science/pith/LSMWUB34TLXPDLZXCKIVZPC7QH/action/citation_signature","submit_replication":"https://pith.science/pith/LSMWUB34TLXPDLZXCKIVZPC7QH/action/replication_record"}},"created_at":"2026-05-17T23:49:22.261050+00:00","updated_at":"2026-05-17T23:49:22.261050+00:00"}