{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MQKPX2LEEKVWYGLIB2FKU4EPVT","short_pith_number":"pith:MQKPX2LE","schema_version":"1.0","canonical_sha256":"6414fbe96422ab6c19680e8aaa708facd3a3f8f61b2d0ecac02210c1c45e1280","source":{"kind":"arxiv","id":"1807.09977","version":1},"attestation_state":"computed","paper":{"title":"Colored range closest-pair problem under general distance functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Jie Xue","submitted_at":"2018-07-26T07:01:13Z","abstract_excerpt":"The range closest-pair (RCP) problem is the range-search version of the classical closest-pair problem, which aims to store a given dataset of points in some data structure such that when a query range $X$ is specified, the closest pair of points contained in $X$ can be reported efficiently. A natural generalization of the RCP problem is the {colored range closest-pair} (CRCP) problem in which the given data points are colored and the goal is to find the closest {bichromatic} pair contained in the query range. All the previous work on the RCP problem was restricted to the uncolored version and"},"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.09977","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-07-26T07:01:13Z","cross_cats_sorted":[],"title_canon_sha256":"5f0db6fc52ea5c14cac995cd7a3cffac18cd42ad5346e0cb47bb2ea0e0b4cdde","abstract_canon_sha256":"b99264315d03596ded53b6ac45df525dd8ee7b169b55911e9a495df6514c2202"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:45.841464Z","signature_b64":"Y06117bZnCZJ8wIj4lTFyOpa80Ernm7kNpY2uBxPcvkanWFM24XN0200ZMKBxEvBZmTQHTD8apul+Cs4oB7pDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6414fbe96422ab6c19680e8aaa708facd3a3f8f61b2d0ecac02210c1c45e1280","last_reissued_at":"2026-05-18T00:09:45.840679Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:45.840679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Colored range closest-pair problem under general distance functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Jie Xue","submitted_at":"2018-07-26T07:01:13Z","abstract_excerpt":"The range closest-pair (RCP) problem is the range-search version of the classical closest-pair problem, which aims to store a given dataset of points in some data structure such that when a query range $X$ is specified, the closest pair of points contained in $X$ can be reported efficiently. A natural generalization of the RCP problem is the {colored range closest-pair} (CRCP) problem in which the given data points are colored and the goal is to find the closest {bichromatic} pair contained in the query range. All the previous work on the RCP problem was restricted to the uncolored version and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09977","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":"1807.09977","created_at":"2026-05-18T00:09:45.840820+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.09977v1","created_at":"2026-05-18T00:09:45.840820+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09977","created_at":"2026-05-18T00:09:45.840820+00:00"},{"alias_kind":"pith_short_12","alias_value":"MQKPX2LEEKVW","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"MQKPX2LEEKVWYGLI","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"MQKPX2LE","created_at":"2026-05-18T12:32:40.477152+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/MQKPX2LEEKVWYGLIB2FKU4EPVT","json":"https://pith.science/pith/MQKPX2LEEKVWYGLIB2FKU4EPVT.json","graph_json":"https://pith.science/api/pith-number/MQKPX2LEEKVWYGLIB2FKU4EPVT/graph.json","events_json":"https://pith.science/api/pith-number/MQKPX2LEEKVWYGLIB2FKU4EPVT/events.json","paper":"https://pith.science/paper/MQKPX2LE"},"agent_actions":{"view_html":"https://pith.science/pith/MQKPX2LEEKVWYGLIB2FKU4EPVT","download_json":"https://pith.science/pith/MQKPX2LEEKVWYGLIB2FKU4EPVT.json","view_paper":"https://pith.science/paper/MQKPX2LE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.09977&json=true","fetch_graph":"https://pith.science/api/pith-number/MQKPX2LEEKVWYGLIB2FKU4EPVT/graph.json","fetch_events":"https://pith.science/api/pith-number/MQKPX2LEEKVWYGLIB2FKU4EPVT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MQKPX2LEEKVWYGLIB2FKU4EPVT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MQKPX2LEEKVWYGLIB2FKU4EPVT/action/storage_attestation","attest_author":"https://pith.science/pith/MQKPX2LEEKVWYGLIB2FKU4EPVT/action/author_attestation","sign_citation":"https://pith.science/pith/MQKPX2LEEKVWYGLIB2FKU4EPVT/action/citation_signature","submit_replication":"https://pith.science/pith/MQKPX2LEEKVWYGLIB2FKU4EPVT/action/replication_record"}},"created_at":"2026-05-18T00:09:45.840820+00:00","updated_at":"2026-05-18T00:09:45.840820+00:00"}