{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SBSZW5C6INYBFATRIY57QESSRP","short_pith_number":"pith:SBSZW5C6","schema_version":"1.0","canonical_sha256":"90659b745e4370128271463bf812528bd7d2d3f1a67c96732e7ed7b3ad8cf89f","source":{"kind":"arxiv","id":"1807.09498","version":2},"attestation_state":"computed","paper":{"title":"Searching for the closest-pair in a query translate","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":"2018-07-25T09:29:41Z","abstract_excerpt":"We consider a range-search variant of the closest-pair problem. Let $\\varGamma$ be a fixed shape in the plane. We are interested in storing a given set of $n$ points in the plane in some data structure such that for any specified translate of $\\varGamma$, the closest pair of points contained in the translate can be reported efficiently. We present results on this problem for two important settings: when $\\varGamma$ is a polygon (possibly with holes) and when $\\varGamma$ is a general convex body whose boundary is smooth. When $\\varGamma$ is a polygon, we present a data structure using $O(n)$ sp"},"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":"1807.09498","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-07-25T09:29:41Z","cross_cats_sorted":[],"title_canon_sha256":"4088215ee1765d165123e5b297ecd20fd0d6acc1cd2d7abbfea6a9ff05929cf0","abstract_canon_sha256":"885519425dda2fc83fc13f42050b703e8199c7ef2baf240fc3351f0a6b6efb6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:42.651329Z","signature_b64":"vySZbCQIPdo54qG/Vsy4jvYPPXbjcDVpNkzaxnhrLg0eTd6qyUfPydsODQsjp17ZVqDBOG1rueWpD9V6LQ5DBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90659b745e4370128271463bf812528bd7d2d3f1a67c96732e7ed7b3ad8cf89f","last_reissued_at":"2026-05-17T23:50:42.650967Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:42.650967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Searching for the closest-pair in a query translate","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":"2018-07-25T09:29:41Z","abstract_excerpt":"We consider a range-search variant of the closest-pair problem. Let $\\varGamma$ be a fixed shape in the plane. We are interested in storing a given set of $n$ points in the plane in some data structure such that for any specified translate of $\\varGamma$, the closest pair of points contained in the translate can be reported efficiently. We present results on this problem for two important settings: when $\\varGamma$ is a polygon (possibly with holes) and when $\\varGamma$ is a general convex body whose boundary is smooth. When $\\varGamma$ is a polygon, we present a data structure using $O(n)$ sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09498","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":"1807.09498","created_at":"2026-05-17T23:50:42.651020+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.09498v2","created_at":"2026-05-17T23:50:42.651020+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09498","created_at":"2026-05-17T23:50:42.651020+00:00"},{"alias_kind":"pith_short_12","alias_value":"SBSZW5C6INYB","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"SBSZW5C6INYBFATR","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"SBSZW5C6","created_at":"2026-05-18T12:32:50.500415+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/SBSZW5C6INYBFATRIY57QESSRP","json":"https://pith.science/pith/SBSZW5C6INYBFATRIY57QESSRP.json","graph_json":"https://pith.science/api/pith-number/SBSZW5C6INYBFATRIY57QESSRP/graph.json","events_json":"https://pith.science/api/pith-number/SBSZW5C6INYBFATRIY57QESSRP/events.json","paper":"https://pith.science/paper/SBSZW5C6"},"agent_actions":{"view_html":"https://pith.science/pith/SBSZW5C6INYBFATRIY57QESSRP","download_json":"https://pith.science/pith/SBSZW5C6INYBFATRIY57QESSRP.json","view_paper":"https://pith.science/paper/SBSZW5C6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.09498&json=true","fetch_graph":"https://pith.science/api/pith-number/SBSZW5C6INYBFATRIY57QESSRP/graph.json","fetch_events":"https://pith.science/api/pith-number/SBSZW5C6INYBFATRIY57QESSRP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SBSZW5C6INYBFATRIY57QESSRP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SBSZW5C6INYBFATRIY57QESSRP/action/storage_attestation","attest_author":"https://pith.science/pith/SBSZW5C6INYBFATRIY57QESSRP/action/author_attestation","sign_citation":"https://pith.science/pith/SBSZW5C6INYBFATRIY57QESSRP/action/citation_signature","submit_replication":"https://pith.science/pith/SBSZW5C6INYBFATRIY57QESSRP/action/replication_record"}},"created_at":"2026-05-17T23:50:42.651020+00:00","updated_at":"2026-05-17T23:50:42.651020+00:00"}