{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:KHQNO264GV5BGSHVWGY5UL5PYG","short_pith_number":"pith:KHQNO264","canonical_record":{"source":{"id":"1412.1398","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-12-03T16:51:03Z","cross_cats_sorted":[],"title_canon_sha256":"1f3104eb7f1263705db120a2b4cc1dc91d096631770b5381242164f641426d95","abstract_canon_sha256":"f82df47406f0f89e4b41c317cea38c629dab1b2afcdd029ecc9c16ca3fb92f91"},"schema_version":"1.0"},"canonical_sha256":"51e0d76bdc357a1348f5b1b1da2fafc19a0dbff2006008efd3fbc165c4a65653","source":{"kind":"arxiv","id":"1412.1398","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1398","created_at":"2026-05-18T02:32:12Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1398v1","created_at":"2026-05-18T02:32:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1398","created_at":"2026-05-18T02:32:12Z"},{"alias_kind":"pith_short_12","alias_value":"KHQNO264GV5B","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KHQNO264GV5BGSHV","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KHQNO264","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:KHQNO264GV5BGSHVWGY5UL5PYG","target":"record","payload":{"canonical_record":{"source":{"id":"1412.1398","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-12-03T16:51:03Z","cross_cats_sorted":[],"title_canon_sha256":"1f3104eb7f1263705db120a2b4cc1dc91d096631770b5381242164f641426d95","abstract_canon_sha256":"f82df47406f0f89e4b41c317cea38c629dab1b2afcdd029ecc9c16ca3fb92f91"},"schema_version":"1.0"},"canonical_sha256":"51e0d76bdc357a1348f5b1b1da2fafc19a0dbff2006008efd3fbc165c4a65653","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:12.610677Z","signature_b64":"dqzImd8VMStoAlbX4nHT9w7X4TmOsgICdrByhBBuLVvKXAi9Slf/xSWWRoohys1/4EL+LXHG+uc6gztoZ3rTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51e0d76bdc357a1348f5b1b1da2fafc19a0dbff2006008efd3fbc165c4a65653","last_reissued_at":"2026-05-18T02:32:12.610138Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:12.610138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.1398","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-18T02:32:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N3CjerfRmdmVq5n4oKZJ/qfaO4dqm5I723lGGwcOuFP3nE4R0bOTT3WeZqtP9zvQkQiKpYXQ2F28m5jifUr+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T17:05:13.936810Z"},"content_sha256":"7bad4db022084204502d6c80a558084785b884961699d3b0a88f6c9a524bea73","schema_version":"1.0","event_id":"sha256:7bad4db022084204502d6c80a558084785b884961699d3b0a88f6c9a524bea73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:KHQNO264GV5BGSHVWGY5UL5PYG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Space Exploration via Proximity Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Benjamin Raichel, David M. Mount, Nirman Kumar, Sariel Har-Peled","submitted_at":"2014-12-03T16:51:03Z","abstract_excerpt":"We investigate what computational tasks can be performed on a point set in $\\Re^d$, if we are only given black-box access to it via nearest-neighbor search. This is a reasonable assumption if the underlying point set is either provided implicitly, or it is stored in a data structure that can answer such queries. In particular, we show the following:\n(A) One can compute an approximate bi-criteria $k$-center clustering of the point set, and more generally compute a greedy permutation of the point set. \n(B) One can decide if a query point is (approximately) inside the convex-hull of the point set"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1398","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-18T02:32:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yHqUcO5LraEqZ/3ZsCPphABd9TUeD3nlZPrjPzFS8n0xT9QCcjFxg38BmeC/ApWlR0oAkk/rpI1OOi+QB/s3Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T17:05:13.937152Z"},"content_sha256":"1bbc589ab13a0bfa778958c15434bbe6dae236ec53a200bd4ca3bfb6c3c58df3","schema_version":"1.0","event_id":"sha256:1bbc589ab13a0bfa778958c15434bbe6dae236ec53a200bd4ca3bfb6c3c58df3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KHQNO264GV5BGSHVWGY5UL5PYG/bundle.json","state_url":"https://pith.science/pith/KHQNO264GV5BGSHVWGY5UL5PYG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KHQNO264GV5BGSHVWGY5UL5PYG/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-22T17:05:13Z","links":{"resolver":"https://pith.science/pith/KHQNO264GV5BGSHVWGY5UL5PYG","bundle":"https://pith.science/pith/KHQNO264GV5BGSHVWGY5UL5PYG/bundle.json","state":"https://pith.science/pith/KHQNO264GV5BGSHVWGY5UL5PYG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KHQNO264GV5BGSHVWGY5UL5PYG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:KHQNO264GV5BGSHVWGY5UL5PYG","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":"f82df47406f0f89e4b41c317cea38c629dab1b2afcdd029ecc9c16ca3fb92f91","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-12-03T16:51:03Z","title_canon_sha256":"1f3104eb7f1263705db120a2b4cc1dc91d096631770b5381242164f641426d95"},"schema_version":"1.0","source":{"id":"1412.1398","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.1398","created_at":"2026-05-18T02:32:12Z"},{"alias_kind":"arxiv_version","alias_value":"1412.1398v1","created_at":"2026-05-18T02:32:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1398","created_at":"2026-05-18T02:32:12Z"},{"alias_kind":"pith_short_12","alias_value":"KHQNO264GV5B","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"KHQNO264GV5BGSHV","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"KHQNO264","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:1bbc589ab13a0bfa778958c15434bbe6dae236ec53a200bd4ca3bfb6c3c58df3","target":"graph","created_at":"2026-05-18T02:32:12Z","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":"We investigate what computational tasks can be performed on a point set in $\\Re^d$, if we are only given black-box access to it via nearest-neighbor search. This is a reasonable assumption if the underlying point set is either provided implicitly, or it is stored in a data structure that can answer such queries. In particular, we show the following:\n(A) One can compute an approximate bi-criteria $k$-center clustering of the point set, and more generally compute a greedy permutation of the point set. \n(B) One can decide if a query point is (approximately) inside the convex-hull of the point set","authors_text":"Benjamin Raichel, David M. Mount, Nirman Kumar, Sariel Har-Peled","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-12-03T16:51:03Z","title":"Space Exploration via Proximity Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.1398","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:7bad4db022084204502d6c80a558084785b884961699d3b0a88f6c9a524bea73","target":"record","created_at":"2026-05-18T02:32:12Z","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":"f82df47406f0f89e4b41c317cea38c629dab1b2afcdd029ecc9c16ca3fb92f91","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-12-03T16:51:03Z","title_canon_sha256":"1f3104eb7f1263705db120a2b4cc1dc91d096631770b5381242164f641426d95"},"schema_version":"1.0","source":{"id":"1412.1398","kind":"arxiv","version":1}},"canonical_sha256":"51e0d76bdc357a1348f5b1b1da2fafc19a0dbff2006008efd3fbc165c4a65653","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51e0d76bdc357a1348f5b1b1da2fafc19a0dbff2006008efd3fbc165c4a65653","first_computed_at":"2026-05-18T02:32:12.610138Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:12.610138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dqzImd8VMStoAlbX4nHT9w7X4TmOsgICdrByhBBuLVvKXAi9Slf/xSWWRoohys1/4EL+LXHG+uc6gztoZ3rTAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:12.610677Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.1398","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bad4db022084204502d6c80a558084785b884961699d3b0a88f6c9a524bea73","sha256:1bbc589ab13a0bfa778958c15434bbe6dae236ec53a200bd4ca3bfb6c3c58df3"],"state_sha256":"824a59ee8fab9fe80f1deae892b0ef55bf70f7916e2044e8cbfc1acd4a58be31"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mSZfQuFo1zXj5pqSH1XHOPw7yeShVDBVssqM8wibdTTJqApvat6A3sZHmJTI5EEFyT3qadsLAVP9mD8/55+0BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T17:05:13.939038Z","bundle_sha256":"804131d6e31bf956baf5be29aa1c6dea71c8f285b73080e53e1b19a0cf566d98"}}