{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:G64J5WM6DM3S66YQDZMVMR3RUA","short_pith_number":"pith:G64J5WM6","schema_version":"1.0","canonical_sha256":"37b89ed99e1b372f7b101e59564771a00117691bf5ccf1d3fe464cf07e8c450f","source":{"kind":"arxiv","id":"2406.02891","version":1},"attestation_state":"computed","paper":{"title":"A Bi-metric Framework for Fast Similarity Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.IR","authors_text":"Haike Xu, Piotr Indyk, Sandeep Silwal","submitted_at":"2024-06-05T03:17:48Z","abstract_excerpt":"We propose a new \"bi-metric\" framework for designing nearest neighbor data structures. Our framework assumes two dissimilarity functions: a ground-truth metric that is accurate but expensive to compute, and a proxy metric that is cheaper but less accurate. In both theory and practice, we show how to construct data structures using only the proxy metric such that the query procedure achieves the accuracy of the expensive metric, while only using a limited number of calls to both metrics. Our theoretical results instantiate this framework for two popular nearest neighbor search algorithms: DiskA"},"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":"2406.02891","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-06-05T03:17:48Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"e044736af6762d33b46857b45d974764ae7a617fefcb270b1e90217cffd86a70","abstract_canon_sha256":"8965ee9f7dd4d3f974aab48d2ba30ee7279d10927bb9901ac8d00b22bb192e08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:27:32.057975Z","signature_b64":"S6VkHiLt992cDv8kI8Sh1H4Ln2Uyhnc1Fzv/uTYUA7fU7iWl5PZIqR/vxmSc3/M3BazV2ddvf5LZRs5tbnqVCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37b89ed99e1b372f7b101e59564771a00117691bf5ccf1d3fe464cf07e8c450f","last_reissued_at":"2026-07-05T08:27:32.057497Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:27:32.057497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Bi-metric Framework for Fast Similarity Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.IR","authors_text":"Haike Xu, Piotr Indyk, Sandeep Silwal","submitted_at":"2024-06-05T03:17:48Z","abstract_excerpt":"We propose a new \"bi-metric\" framework for designing nearest neighbor data structures. Our framework assumes two dissimilarity functions: a ground-truth metric that is accurate but expensive to compute, and a proxy metric that is cheaper but less accurate. In both theory and practice, we show how to construct data structures using only the proxy metric such that the query procedure achieves the accuracy of the expensive metric, while only using a limited number of calls to both metrics. Our theoretical results instantiate this framework for two popular nearest neighbor search algorithms: DiskA"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.02891","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/2406.02891/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":"2406.02891","created_at":"2026-07-05T08:27:32.057553+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.02891v1","created_at":"2026-07-05T08:27:32.057553+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.02891","created_at":"2026-07-05T08:27:32.057553+00:00"},{"alias_kind":"pith_short_12","alias_value":"G64J5WM6DM3S","created_at":"2026-07-05T08:27:32.057553+00:00"},{"alias_kind":"pith_short_16","alias_value":"G64J5WM6DM3S66YQ","created_at":"2026-07-05T08:27:32.057553+00:00"},{"alias_kind":"pith_short_8","alias_value":"G64J5WM6","created_at":"2026-07-05T08:27:32.057553+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.07163","citing_title":"Beyond Sequential Reranking: Reranker-Guided Search Improves Reasoning Intensive Retrieval","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G64J5WM6DM3S66YQDZMVMR3RUA","json":"https://pith.science/pith/G64J5WM6DM3S66YQDZMVMR3RUA.json","graph_json":"https://pith.science/api/pith-number/G64J5WM6DM3S66YQDZMVMR3RUA/graph.json","events_json":"https://pith.science/api/pith-number/G64J5WM6DM3S66YQDZMVMR3RUA/events.json","paper":"https://pith.science/paper/G64J5WM6"},"agent_actions":{"view_html":"https://pith.science/pith/G64J5WM6DM3S66YQDZMVMR3RUA","download_json":"https://pith.science/pith/G64J5WM6DM3S66YQDZMVMR3RUA.json","view_paper":"https://pith.science/paper/G64J5WM6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.02891&json=true","fetch_graph":"https://pith.science/api/pith-number/G64J5WM6DM3S66YQDZMVMR3RUA/graph.json","fetch_events":"https://pith.science/api/pith-number/G64J5WM6DM3S66YQDZMVMR3RUA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G64J5WM6DM3S66YQDZMVMR3RUA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G64J5WM6DM3S66YQDZMVMR3RUA/action/storage_attestation","attest_author":"https://pith.science/pith/G64J5WM6DM3S66YQDZMVMR3RUA/action/author_attestation","sign_citation":"https://pith.science/pith/G64J5WM6DM3S66YQDZMVMR3RUA/action/citation_signature","submit_replication":"https://pith.science/pith/G64J5WM6DM3S66YQDZMVMR3RUA/action/replication_record"}},"created_at":"2026-07-05T08:27:32.057553+00:00","updated_at":"2026-07-05T08:27:32.057553+00:00"}