{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:OW753XMMEDM6UITNYS242LQBIC","short_pith_number":"pith:OW753XMM","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"},"canonical_sha256":"75bfdddd8c20d9ea226dc4b5cd2e01409011870c2a7a786eba940f909728783a","source":{"kind":"arxiv","id":"1712.09749","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09749","created_at":"2026-05-18T00:19:41Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09749v4","created_at":"2026-05-18T00:19:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09749","created_at":"2026-05-18T00:19:41Z"},{"alias_kind":"pith_short_12","alias_value":"OW753XMMEDM6","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OW753XMMEDM6UITN","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OW753XMM","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:OW753XMMEDM6UITNYS242LQBIC","target":"record","payload":{"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"},"canonical_sha256":"75bfdddd8c20d9ea226dc4b5cd2e01409011870c2a7a786eba940f909728783a","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"},"source_kind":"arxiv","source_id":"1712.09749","source_version":4,"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:19:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WmnarCHzpXQH+N7PxeYWDqOYy+DayhItf6F0G8My5l5aE7uMPiS0trDHo0vZQRvGU5yQ+lZ5p+8FWBI1hcqMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:48:54.454186Z"},"content_sha256":"9bcb044e76c77d3372dda3de7be048289049d6b04d875d94f0badc13dc53501b","schema_version":"1.0","event_id":"sha256:9bcb044e76c77d3372dda3de7be048289049d6b04d875d94f0badc13dc53501b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:OW753XMMEDM6UITNYS242LQBIC","target":"graph","payload":{"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"},"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:19:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O62dtJJMbj76L5xKbENYdSoCyIVrsmz80yjhlz3UxL27Fsz0u9wAep1mAFQNveKgSBw5pNfkacn3eaZ+hUInAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:48:54.455106Z"},"content_sha256":"7ce57e22f36905646e45655854608da3f3a4445a379c223517257a89dab032bc","schema_version":"1.0","event_id":"sha256:7ce57e22f36905646e45655854608da3f3a4445a379c223517257a89dab032bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OW753XMMEDM6UITNYS242LQBIC/bundle.json","state_url":"https://pith.science/pith/OW753XMMEDM6UITNYS242LQBIC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OW753XMMEDM6UITNYS242LQBIC/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-05-31T05:48:54Z","links":{"resolver":"https://pith.science/pith/OW753XMMEDM6UITNYS242LQBIC","bundle":"https://pith.science/pith/OW753XMMEDM6UITNYS242LQBIC/bundle.json","state":"https://pith.science/pith/OW753XMMEDM6UITNYS242LQBIC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OW753XMMEDM6UITNYS242LQBIC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OW753XMMEDM6UITNYS242LQBIC","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":"289793baa13d56b4779a007f4e8c185083328cf2e7550711d21e9cb5fe87e9e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-12-28T04:00:32Z","title_canon_sha256":"99319e2c525ef7c29d2943387aced39c923dd3f5a72951eb3a08ac8f7d7907fa"},"schema_version":"1.0","source":{"id":"1712.09749","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09749","created_at":"2026-05-18T00:19:41Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09749v4","created_at":"2026-05-18T00:19:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09749","created_at":"2026-05-18T00:19:41Z"},{"alias_kind":"pith_short_12","alias_value":"OW753XMMEDM6","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OW753XMMEDM6UITN","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OW753XMM","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:7ce57e22f36905646e45655854608da3f3a4445a379c223517257a89dab032bc","target":"graph","created_at":"2026-05-18T00:19:41Z","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":"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","authors_text":"Jie Xue, Ravi Janardan, Saladi Rahul, Yuan Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-12-28T04:00:32Z","title":"New bounds for range closest-pair problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09749","kind":"arxiv","version":4},"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:9bcb044e76c77d3372dda3de7be048289049d6b04d875d94f0badc13dc53501b","target":"record","created_at":"2026-05-18T00:19:41Z","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":"289793baa13d56b4779a007f4e8c185083328cf2e7550711d21e9cb5fe87e9e0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-12-28T04:00:32Z","title_canon_sha256":"99319e2c525ef7c29d2943387aced39c923dd3f5a72951eb3a08ac8f7d7907fa"},"schema_version":"1.0","source":{"id":"1712.09749","kind":"arxiv","version":4}},"canonical_sha256":"75bfdddd8c20d9ea226dc4b5cd2e01409011870c2a7a786eba940f909728783a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75bfdddd8c20d9ea226dc4b5cd2e01409011870c2a7a786eba940f909728783a","first_computed_at":"2026-05-18T00:19:41.272810Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:41.272810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1UqahP2N6umTlgkzSVte/TvX9agSVaOM2dCY7COOV0VJ7fjf/24JkdG+/ha2C4Eh0NZDQ1fgEYm++76YjP60AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:41.273527Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.09749","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9bcb044e76c77d3372dda3de7be048289049d6b04d875d94f0badc13dc53501b","sha256:7ce57e22f36905646e45655854608da3f3a4445a379c223517257a89dab032bc"],"state_sha256":"f5d95d301217aff67bd25628dd7ecd2b2366880a8bbba621ab0456b60ea3aa53"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kw9d9YNM1vCyE14oL9uo6bt/5dGch/eQRrl66hFev1qgCCdO0cg+HPG5CC4CG1LOGFfIc7xMOoN1RzXAPbUMAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:48:54.460002Z","bundle_sha256":"7ad9fd62c8e9508eb83f6d3bef1c4e7d49859a8e17719175c723b8bd97a1d815"}}