{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:Q3F4NBWUTIKYVJORXEW6ULUGXE","short_pith_number":"pith:Q3F4NBWU","schema_version":"1.0","canonical_sha256":"86cbc686d49a158aa5d1b92dea2e86b9115e716be172074722db9931d4d86528","source":{"kind":"arxiv","id":"2306.15621","version":1},"attestation_state":"computed","paper":{"title":"Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ahmed Abdelkader, David M. Mount, Guilherme D. da Fonseca, Sunil Arya","submitted_at":"2023-06-27T17:01:05Z","abstract_excerpt":"We present a new approach to approximate nearest-neighbor queries in fixed dimension under a variety of non-Euclidean distances. We are given a set $S$ of $n$ points in $\\mathbb{R}^d$, an approximation parameter $\\varepsilon > 0$, and a distance function that satisfies certain smoothness and growth-rate assumptions. The objective is to preprocess $S$ into a data structure so that for any query point $q$ in $\\mathbb{R}^d$, it is possible to efficiently report any point of $S$ whose distance from $q$ is within a factor of $1+\\varepsilon$ of the actual closest point.\n  Prior to this work, the mos"},"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":"2306.15621","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2023-06-27T17:01:05Z","cross_cats_sorted":[],"title_canon_sha256":"d0281cdf5fe7f62900f14acbdafe43901aaab3d78214d108eb4194b30a33582a","abstract_canon_sha256":"cd7cde7e344f9384932ea46f7f6595dbeb3809b58324c2444996f281553425a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:25:35.022890Z","signature_b64":"yB7BOptJxVCCVgwkAThAKnP0XNnwVdLp66e3T8FFJqfo4vlTdFWIiEdu95yW0XkYVhNmpBFB2nK6FHz2AMPFDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86cbc686d49a158aa5d1b92dea2e86b9115e716be172074722db9931d4d86528","last_reissued_at":"2026-07-05T06:25:35.022440Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:25:35.022440Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ahmed Abdelkader, David M. Mount, Guilherme D. da Fonseca, Sunil Arya","submitted_at":"2023-06-27T17:01:05Z","abstract_excerpt":"We present a new approach to approximate nearest-neighbor queries in fixed dimension under a variety of non-Euclidean distances. We are given a set $S$ of $n$ points in $\\mathbb{R}^d$, an approximation parameter $\\varepsilon > 0$, and a distance function that satisfies certain smoothness and growth-rate assumptions. The objective is to preprocess $S$ into a data structure so that for any query point $q$ in $\\mathbb{R}^d$, it is possible to efficiently report any point of $S$ whose distance from $q$ is within a factor of $1+\\varepsilon$ of the actual closest point.\n  Prior to this work, the mos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.15621","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2306.15621/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2306.15621","created_at":"2026-07-05T06:25:35.022496+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.15621v1","created_at":"2026-07-05T06:25:35.022496+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.15621","created_at":"2026-07-05T06:25:35.022496+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q3F4NBWUTIKY","created_at":"2026-07-05T06:25:35.022496+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q3F4NBWUTIKYVJOR","created_at":"2026-07-05T06:25:35.022496+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q3F4NBWU","created_at":"2026-07-05T06:25:35.022496+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/Q3F4NBWUTIKYVJORXEW6ULUGXE","json":"https://pith.science/pith/Q3F4NBWUTIKYVJORXEW6ULUGXE.json","graph_json":"https://pith.science/api/pith-number/Q3F4NBWUTIKYVJORXEW6ULUGXE/graph.json","events_json":"https://pith.science/api/pith-number/Q3F4NBWUTIKYVJORXEW6ULUGXE/events.json","paper":"https://pith.science/paper/Q3F4NBWU"},"agent_actions":{"view_html":"https://pith.science/pith/Q3F4NBWUTIKYVJORXEW6ULUGXE","download_json":"https://pith.science/pith/Q3F4NBWUTIKYVJORXEW6ULUGXE.json","view_paper":"https://pith.science/paper/Q3F4NBWU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.15621&json=true","fetch_graph":"https://pith.science/api/pith-number/Q3F4NBWUTIKYVJORXEW6ULUGXE/graph.json","fetch_events":"https://pith.science/api/pith-number/Q3F4NBWUTIKYVJORXEW6ULUGXE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q3F4NBWUTIKYVJORXEW6ULUGXE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q3F4NBWUTIKYVJORXEW6ULUGXE/action/storage_attestation","attest_author":"https://pith.science/pith/Q3F4NBWUTIKYVJORXEW6ULUGXE/action/author_attestation","sign_citation":"https://pith.science/pith/Q3F4NBWUTIKYVJORXEW6ULUGXE/action/citation_signature","submit_replication":"https://pith.science/pith/Q3F4NBWUTIKYVJORXEW6ULUGXE/action/replication_record"}},"created_at":"2026-07-05T06:25:35.022496+00:00","updated_at":"2026-07-05T06:25:35.022496+00:00"}