{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KHQNO264GV5BGSHVWGY5UL5PYG","short_pith_number":"pith:KHQNO264","schema_version":"1.0","canonical_sha256":"51e0d76bdc357a1348f5b1b1da2fafc19a0dbff2006008efd3fbc165c4a65653","source":{"kind":"arxiv","id":"1412.1398","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1412.1398","created_at":"2026-05-18T02:32:12.610224+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.1398v1","created_at":"2026-05-18T02:32:12.610224+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.1398","created_at":"2026-05-18T02:32:12.610224+00:00"},{"alias_kind":"pith_short_12","alias_value":"KHQNO264GV5B","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KHQNO264GV5BGSHV","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KHQNO264","created_at":"2026-05-18T12:28:35.611951+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/KHQNO264GV5BGSHVWGY5UL5PYG","json":"https://pith.science/pith/KHQNO264GV5BGSHVWGY5UL5PYG.json","graph_json":"https://pith.science/api/pith-number/KHQNO264GV5BGSHVWGY5UL5PYG/graph.json","events_json":"https://pith.science/api/pith-number/KHQNO264GV5BGSHVWGY5UL5PYG/events.json","paper":"https://pith.science/paper/KHQNO264"},"agent_actions":{"view_html":"https://pith.science/pith/KHQNO264GV5BGSHVWGY5UL5PYG","download_json":"https://pith.science/pith/KHQNO264GV5BGSHVWGY5UL5PYG.json","view_paper":"https://pith.science/paper/KHQNO264","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.1398&json=true","fetch_graph":"https://pith.science/api/pith-number/KHQNO264GV5BGSHVWGY5UL5PYG/graph.json","fetch_events":"https://pith.science/api/pith-number/KHQNO264GV5BGSHVWGY5UL5PYG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KHQNO264GV5BGSHVWGY5UL5PYG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KHQNO264GV5BGSHVWGY5UL5PYG/action/storage_attestation","attest_author":"https://pith.science/pith/KHQNO264GV5BGSHVWGY5UL5PYG/action/author_attestation","sign_citation":"https://pith.science/pith/KHQNO264GV5BGSHVWGY5UL5PYG/action/citation_signature","submit_replication":"https://pith.science/pith/KHQNO264GV5BGSHVWGY5UL5PYG/action/replication_record"}},"created_at":"2026-05-18T02:32:12.610224+00:00","updated_at":"2026-05-18T02:32:12.610224+00:00"}