{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5CDDOVQZPADVVNXLIBGBQCDU2A","short_pith_number":"pith:5CDDOVQZ","schema_version":"1.0","canonical_sha256":"e88637561978075ab6eb404c180874d011cc97f8ef1270942d124409dad50802","source":{"kind":"arxiv","id":"1401.1472","version":2},"attestation_state":"computed","paper":{"title":"Robust Proximity Search for Balls using Sublinear Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Nirman Kumar, Sariel Har-Peled","submitted_at":"2014-01-07T18:40:49Z","abstract_excerpt":"Given a set of n disjoint balls b1, . . ., bn in IRd, we provide a data structure, of near linear size, that can answer (1 \\pm \\epsilon)-approximate kth-nearest neighbor queries in O(log n + 1/\\epsilon^d) time, where k and \\epsilon are provided at query time. If k and \\epsilon are provided in advance, we provide a data structure to answer such queries, that requires (roughly) O(n/k) space; that is, the data structure has sublinear space requirement if k is sufficiently large."},"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":"1401.1472","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-01-07T18:40:49Z","cross_cats_sorted":[],"title_canon_sha256":"fe92d19f817a0f90507ca9e922fddf10debb39f7532fa530ff8123e94dc7b1be","abstract_canon_sha256":"8f9b8bfe77999fa5f213c58f10bbeabbfe2e3510335ddf3ddd12e23652381968"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:08.986557Z","signature_b64":"oFT9OtPt1ZN8sbs37vrWNNyhG3JO7jyGsmWzejNtEIKHG2O2/OKyd8KyoyM+LH+tEiK+5BaqgWA8eErg4gJZDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e88637561978075ab6eb404c180874d011cc97f8ef1270942d124409dad50802","last_reissued_at":"2026-05-18T02:39:08.985981Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:08.985981Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Proximity Search for Balls using Sublinear Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Nirman Kumar, Sariel Har-Peled","submitted_at":"2014-01-07T18:40:49Z","abstract_excerpt":"Given a set of n disjoint balls b1, . . ., bn in IRd, we provide a data structure, of near linear size, that can answer (1 \\pm \\epsilon)-approximate kth-nearest neighbor queries in O(log n + 1/\\epsilon^d) time, where k and \\epsilon are provided at query time. If k and \\epsilon are provided in advance, we provide a data structure to answer such queries, that requires (roughly) O(n/k) space; that is, the data structure has sublinear space requirement if k is sufficiently large."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.1472","kind":"arxiv","version":2},"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":"1401.1472","created_at":"2026-05-18T02:39:08.986069+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.1472v2","created_at":"2026-05-18T02:39:08.986069+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.1472","created_at":"2026-05-18T02:39:08.986069+00:00"},{"alias_kind":"pith_short_12","alias_value":"5CDDOVQZPADV","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"5CDDOVQZPADVVNXL","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"5CDDOVQZ","created_at":"2026-05-18T12:28:14.216126+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/5CDDOVQZPADVVNXLIBGBQCDU2A","json":"https://pith.science/pith/5CDDOVQZPADVVNXLIBGBQCDU2A.json","graph_json":"https://pith.science/api/pith-number/5CDDOVQZPADVVNXLIBGBQCDU2A/graph.json","events_json":"https://pith.science/api/pith-number/5CDDOVQZPADVVNXLIBGBQCDU2A/events.json","paper":"https://pith.science/paper/5CDDOVQZ"},"agent_actions":{"view_html":"https://pith.science/pith/5CDDOVQZPADVVNXLIBGBQCDU2A","download_json":"https://pith.science/pith/5CDDOVQZPADVVNXLIBGBQCDU2A.json","view_paper":"https://pith.science/paper/5CDDOVQZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.1472&json=true","fetch_graph":"https://pith.science/api/pith-number/5CDDOVQZPADVVNXLIBGBQCDU2A/graph.json","fetch_events":"https://pith.science/api/pith-number/5CDDOVQZPADVVNXLIBGBQCDU2A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5CDDOVQZPADVVNXLIBGBQCDU2A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5CDDOVQZPADVVNXLIBGBQCDU2A/action/storage_attestation","attest_author":"https://pith.science/pith/5CDDOVQZPADVVNXLIBGBQCDU2A/action/author_attestation","sign_citation":"https://pith.science/pith/5CDDOVQZPADVVNXLIBGBQCDU2A/action/citation_signature","submit_replication":"https://pith.science/pith/5CDDOVQZPADVVNXLIBGBQCDU2A/action/replication_record"}},"created_at":"2026-05-18T02:39:08.986069+00:00","updated_at":"2026-05-18T02:39:08.986069+00:00"}