{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MQKPX2LEEKVWYGLIB2FKU4EPVT","short_pith_number":"pith:MQKPX2LE","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"},"canonical_sha256":"6414fbe96422ab6c19680e8aaa708facd3a3f8f61b2d0ecac02210c1c45e1280","source":{"kind":"arxiv","id":"1807.09977","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09977","created_at":"2026-05-18T00:09:45Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09977v1","created_at":"2026-05-18T00:09:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09977","created_at":"2026-05-18T00:09:45Z"},{"alias_kind":"pith_short_12","alias_value":"MQKPX2LEEKVW","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MQKPX2LEEKVWYGLI","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MQKPX2LE","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MQKPX2LEEKVWYGLIB2FKU4EPVT","target":"record","payload":{"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"},"canonical_sha256":"6414fbe96422ab6c19680e8aaa708facd3a3f8f61b2d0ecac02210c1c45e1280","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"},"source_kind":"arxiv","source_id":"1807.09977","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:09:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ckANw1ln/f66L/eoHidz+hTOJVqHg/W2t1hsZ2E+jp8eJoHgFBJ0t6QedjduLCyctdpfN/N4QauPzGBJ8IyaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:42:58.368808Z"},"content_sha256":"cc9f045b6d39a7b875f02bcfebaac4302455da7674dcc571a3344f446aa9d10e","schema_version":"1.0","event_id":"sha256:cc9f045b6d39a7b875f02bcfebaac4302455da7674dcc571a3344f446aa9d10e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MQKPX2LEEKVWYGLIB2FKU4EPVT","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:09:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NValjJBmHEgNHA54kg+SjnseUiNavQrxgQ5F2wYoKkFuFpcnxngYdoF3ChXIHww7josQWHT7YkhxEJiGZubJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:42:58.369150Z"},"content_sha256":"44ea1f789d00e8812a80dc6a991c52234b9cf2f066df8e7ff43312594d89375a","schema_version":"1.0","event_id":"sha256:44ea1f789d00e8812a80dc6a991c52234b9cf2f066df8e7ff43312594d89375a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MQKPX2LEEKVWYGLIB2FKU4EPVT/bundle.json","state_url":"https://pith.science/pith/MQKPX2LEEKVWYGLIB2FKU4EPVT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MQKPX2LEEKVWYGLIB2FKU4EPVT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-20T06:42:58Z","links":{"resolver":"https://pith.science/pith/MQKPX2LEEKVWYGLIB2FKU4EPVT","bundle":"https://pith.science/pith/MQKPX2LEEKVWYGLIB2FKU4EPVT/bundle.json","state":"https://pith.science/pith/MQKPX2LEEKVWYGLIB2FKU4EPVT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MQKPX2LEEKVWYGLIB2FKU4EPVT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MQKPX2LEEKVWYGLIB2FKU4EPVT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b99264315d03596ded53b6ac45df525dd8ee7b169b55911e9a495df6514c2202","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-07-26T07:01:13Z","title_canon_sha256":"5f0db6fc52ea5c14cac995cd7a3cffac18cd42ad5346e0cb47bb2ea0e0b4cdde"},"schema_version":"1.0","source":{"id":"1807.09977","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.09977","created_at":"2026-05-18T00:09:45Z"},{"alias_kind":"arxiv_version","alias_value":"1807.09977v1","created_at":"2026-05-18T00:09:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09977","created_at":"2026-05-18T00:09:45Z"},{"alias_kind":"pith_short_12","alias_value":"MQKPX2LEEKVW","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MQKPX2LEEKVWYGLI","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MQKPX2LE","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:44ea1f789d00e8812a80dc6a991c52234b9cf2f066df8e7ff43312594d89375a","target":"graph","created_at":"2026-05-18T00:09:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Jie Xue","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-07-26T07:01:13Z","title":"Colored range closest-pair problem under general distance functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09977","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cc9f045b6d39a7b875f02bcfebaac4302455da7674dcc571a3344f446aa9d10e","target":"record","created_at":"2026-05-18T00:09:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b99264315d03596ded53b6ac45df525dd8ee7b169b55911e9a495df6514c2202","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-07-26T07:01:13Z","title_canon_sha256":"5f0db6fc52ea5c14cac995cd7a3cffac18cd42ad5346e0cb47bb2ea0e0b4cdde"},"schema_version":"1.0","source":{"id":"1807.09977","kind":"arxiv","version":1}},"canonical_sha256":"6414fbe96422ab6c19680e8aaa708facd3a3f8f61b2d0ecac02210c1c45e1280","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6414fbe96422ab6c19680e8aaa708facd3a3f8f61b2d0ecac02210c1c45e1280","first_computed_at":"2026-05-18T00:09:45.840679Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:45.840679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y06117bZnCZJ8wIj4lTFyOpa80Ernm7kNpY2uBxPcvkanWFM24XN0200ZMKBxEvBZmTQHTD8apul+Cs4oB7pDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:45.841464Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.09977","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc9f045b6d39a7b875f02bcfebaac4302455da7674dcc571a3344f446aa9d10e","sha256:44ea1f789d00e8812a80dc6a991c52234b9cf2f066df8e7ff43312594d89375a"],"state_sha256":"c416e4096919b817dfe11eef001906f0a192df71df608931beada67529d5b52e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EZISY/F2i+yc2dy6PdtrwylbsC1pDYcNErNj27x1Sl3+X6suJDB1Xo24dzPjhkpuPcT+r5oVij3jvdGOWBVACA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T06:42:58.371545Z","bundle_sha256":"22529ecf1bd916d99880ae45e340ee4a994487910ec1700211aebd334e83bd42"}}