{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OL4OM6ZFZKGRZCIYCEZSXZM23Y","short_pith_number":"pith:OL4OM6ZF","schema_version":"1.0","canonical_sha256":"72f8e67b25ca8d1c891811332be59ade289bcde33d22d63d74158eacf277119c","source":{"kind":"arxiv","id":"1512.01775","version":1},"attestation_state":"computed","paper":{"title":"Approximate nearest neighbor search for $\\ell_p$-spaces ($2 < p < \\infty$) via embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Lee-Ad Gottlieb, Yair Bartal","submitted_at":"2015-12-06T11:02:39Z","abstract_excerpt":"While the problem of approximate nearest neighbor search has been well-studied for Euclidean space and $\\ell_1$, few non-trivial algorithms are known for $\\ell_p$ when ($2 < p < \\infty$). In this paper, we revisit this fundamental problem and present approximate nearest-neighbor search algorithms which give the first non-trivial approximation factor guarantees in this setting."},"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":"1512.01775","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-12-06T11:02:39Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7576879c92923ac6f65fbdc78f4a8a71ea97d90eadb88a81a03e1107abb78660","abstract_canon_sha256":"44d5869a0164a7fcfcb8e14cd1d984bf235b86c24006a11b08ee7579997221dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:09.184518Z","signature_b64":"y8Km/8LGmsxYck1JB1IPdp3PLfwhahCVP8IYvfLTGg9etzgEdWqPA/MUw4V7bvKfN50ynrCVaFSKq/JyeFF1DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72f8e67b25ca8d1c891811332be59ade289bcde33d22d63d74158eacf277119c","last_reissued_at":"2026-05-18T01:25:09.183807Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:09.183807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate nearest neighbor search for $\\ell_p$-spaces ($2 < p < \\infty$) via embeddings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Lee-Ad Gottlieb, Yair Bartal","submitted_at":"2015-12-06T11:02:39Z","abstract_excerpt":"While the problem of approximate nearest neighbor search has been well-studied for Euclidean space and $\\ell_1$, few non-trivial algorithms are known for $\\ell_p$ when ($2 < p < \\infty$). In this paper, we revisit this fundamental problem and present approximate nearest-neighbor search algorithms which give the first non-trivial approximation factor guarantees in this setting."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.01775","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":"1512.01775","created_at":"2026-05-18T01:25:09.183905+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.01775v1","created_at":"2026-05-18T01:25:09.183905+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.01775","created_at":"2026-05-18T01:25:09.183905+00:00"},{"alias_kind":"pith_short_12","alias_value":"OL4OM6ZFZKGR","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OL4OM6ZFZKGRZCIY","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OL4OM6ZF","created_at":"2026-05-18T12:29:34.919912+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/OL4OM6ZFZKGRZCIYCEZSXZM23Y","json":"https://pith.science/pith/OL4OM6ZFZKGRZCIYCEZSXZM23Y.json","graph_json":"https://pith.science/api/pith-number/OL4OM6ZFZKGRZCIYCEZSXZM23Y/graph.json","events_json":"https://pith.science/api/pith-number/OL4OM6ZFZKGRZCIYCEZSXZM23Y/events.json","paper":"https://pith.science/paper/OL4OM6ZF"},"agent_actions":{"view_html":"https://pith.science/pith/OL4OM6ZFZKGRZCIYCEZSXZM23Y","download_json":"https://pith.science/pith/OL4OM6ZFZKGRZCIYCEZSXZM23Y.json","view_paper":"https://pith.science/paper/OL4OM6ZF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.01775&json=true","fetch_graph":"https://pith.science/api/pith-number/OL4OM6ZFZKGRZCIYCEZSXZM23Y/graph.json","fetch_events":"https://pith.science/api/pith-number/OL4OM6ZFZKGRZCIYCEZSXZM23Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OL4OM6ZFZKGRZCIYCEZSXZM23Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OL4OM6ZFZKGRZCIYCEZSXZM23Y/action/storage_attestation","attest_author":"https://pith.science/pith/OL4OM6ZFZKGRZCIYCEZSXZM23Y/action/author_attestation","sign_citation":"https://pith.science/pith/OL4OM6ZFZKGRZCIYCEZSXZM23Y/action/citation_signature","submit_replication":"https://pith.science/pith/OL4OM6ZFZKGRZCIYCEZSXZM23Y/action/replication_record"}},"created_at":"2026-05-18T01:25:09.183905+00:00","updated_at":"2026-05-18T01:25:09.183905+00:00"}