{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:BGKT73YURLR24YDYOYE6OIX4GH","short_pith_number":"pith:BGKT73YU","schema_version":"1.0","canonical_sha256":"09953fef148ae3ae60787609e722fc31d9355286887b023f9f99ef5ffc87e0cf","source":{"kind":"arxiv","id":"1007.3296","version":3},"attestation_state":"computed","paper":{"title":"Approximate Nearest Neighbor Search for Low Dimensional Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Nirman Kumar, Sariel Har-Peled","submitted_at":"2010-07-19T22:09:52Z","abstract_excerpt":"We study the Approximate Nearest Neighbor problem for metric spaces where the query points are constrained to lie on a subspace of low doubling dimension, while the data is high-dimensional. We show that this problem can be solved efficiently despite the high dimensionality of the data."},"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":"1007.3296","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-07-19T22:09:52Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"0e1b155c6803e2f75a9829f18ad20a17fd9eb272e7cc4b73daa73709489a3d3a","abstract_canon_sha256":"fe3b235384d81a6b12cf92a0d8a1aa16616b2892fe779fde6b14f4ae9c7c66a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:23.423099Z","signature_b64":"ntzNzFej5jd9gliv89TCFYMupldRn12kSovIjNBOxjN0E1A3k1xwbhhIzA//0oqMBhZfKI/+HfBuupFq5xxRCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09953fef148ae3ae60787609e722fc31d9355286887b023f9f99ef5ffc87e0cf","last_reissued_at":"2026-05-18T03:45:23.422386Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:23.422386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Nearest Neighbor Search for Low Dimensional Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Nirman Kumar, Sariel Har-Peled","submitted_at":"2010-07-19T22:09:52Z","abstract_excerpt":"We study the Approximate Nearest Neighbor problem for metric spaces where the query points are constrained to lie on a subspace of low doubling dimension, while the data is high-dimensional. We show that this problem can be solved efficiently despite the high dimensionality of the data."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.3296","kind":"arxiv","version":3},"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":"1007.3296","created_at":"2026-05-18T03:45:23.422485+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.3296v3","created_at":"2026-05-18T03:45:23.422485+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.3296","created_at":"2026-05-18T03:45:23.422485+00:00"},{"alias_kind":"pith_short_12","alias_value":"BGKT73YURLR2","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"BGKT73YURLR24YDY","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"BGKT73YU","created_at":"2026-05-18T12:26:05.355336+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/BGKT73YURLR24YDYOYE6OIX4GH","json":"https://pith.science/pith/BGKT73YURLR24YDYOYE6OIX4GH.json","graph_json":"https://pith.science/api/pith-number/BGKT73YURLR24YDYOYE6OIX4GH/graph.json","events_json":"https://pith.science/api/pith-number/BGKT73YURLR24YDYOYE6OIX4GH/events.json","paper":"https://pith.science/paper/BGKT73YU"},"agent_actions":{"view_html":"https://pith.science/pith/BGKT73YURLR24YDYOYE6OIX4GH","download_json":"https://pith.science/pith/BGKT73YURLR24YDYOYE6OIX4GH.json","view_paper":"https://pith.science/paper/BGKT73YU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.3296&json=true","fetch_graph":"https://pith.science/api/pith-number/BGKT73YURLR24YDYOYE6OIX4GH/graph.json","fetch_events":"https://pith.science/api/pith-number/BGKT73YURLR24YDYOYE6OIX4GH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BGKT73YURLR24YDYOYE6OIX4GH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BGKT73YURLR24YDYOYE6OIX4GH/action/storage_attestation","attest_author":"https://pith.science/pith/BGKT73YURLR24YDYOYE6OIX4GH/action/author_attestation","sign_citation":"https://pith.science/pith/BGKT73YURLR24YDYOYE6OIX4GH/action/citation_signature","submit_replication":"https://pith.science/pith/BGKT73YURLR24YDYOYE6OIX4GH/action/replication_record"}},"created_at":"2026-05-18T03:45:23.422485+00:00","updated_at":"2026-05-18T03:45:23.422485+00:00"}