{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:F3ZXNWQOC7YZU3OLNZKGBXXADG","short_pith_number":"pith:F3ZXNWQO","schema_version":"1.0","canonical_sha256":"2ef376da0e17f19a6dcb6e5460dee0198aa74c606b25ef7f0b594bba8b0db4a5","source":{"kind":"arxiv","id":"2206.01382","version":3},"attestation_state":"computed","paper":{"title":"Falconn++: A Locality-sensitive Filtering Approach for Approximate Nearest Neighbor Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.DS","authors_text":"Ninh Pham, Tao Liu","submitted_at":"2022-06-03T04:02:02Z","abstract_excerpt":"We present Falconn++, a novel locality-sensitive filtering approach for approximate nearest neighbor search on angular distance. Falconn++ can filter out potential far away points in any hash bucket \\textit{before} querying, which results in higher quality candidates compared to other hashing-based solutions. Theoretically, Falconn++ asymptotically achieves lower query time complexity than Falconn, an optimal locality-sensitive hashing scheme on angular distance. Empirically, Falconn++ achieves higher recall-speed tradeoffs than Falconn on many real-world data sets. Falconn++ is also competiti"},"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":"2206.01382","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-06-03T04:02:02Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"0a5997e19e1cddcd36b90c99c6b413b414e3553f534b981063d28ae7b7d26977","abstract_canon_sha256":"f2f351020a6a5654a6f2aeda93fe90fa11fb20e018afa55dae0e343c4ad0980e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:09:19.054511Z","signature_b64":"8d4irxGSKlJ+rJf6ZFy1pM01PCOld4CO1XNMuoQPfWVr+Md7n8RU3jn4O4crMT7y5rXDjZkpf6nw1ZImIY4KBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ef376da0e17f19a6dcb6e5460dee0198aa74c606b25ef7f0b594bba8b0db4a5","last_reissued_at":"2026-07-05T05:09:19.054007Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:09:19.054007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Falconn++: A Locality-sensitive Filtering Approach for Approximate Nearest Neighbor Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.DS","authors_text":"Ninh Pham, Tao Liu","submitted_at":"2022-06-03T04:02:02Z","abstract_excerpt":"We present Falconn++, a novel locality-sensitive filtering approach for approximate nearest neighbor search on angular distance. Falconn++ can filter out potential far away points in any hash bucket \\textit{before} querying, which results in higher quality candidates compared to other hashing-based solutions. Theoretically, Falconn++ asymptotically achieves lower query time complexity than Falconn, an optimal locality-sensitive hashing scheme on angular distance. Empirically, Falconn++ achieves higher recall-speed tradeoffs than Falconn on many real-world data sets. Falconn++ is also competiti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.01382","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2206.01382/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":"2206.01382","created_at":"2026-07-05T05:09:19.054066+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.01382v3","created_at":"2026-07-05T05:09:19.054066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.01382","created_at":"2026-07-05T05:09:19.054066+00:00"},{"alias_kind":"pith_short_12","alias_value":"F3ZXNWQOC7YZ","created_at":"2026-07-05T05:09:19.054066+00:00"},{"alias_kind":"pith_short_16","alias_value":"F3ZXNWQOC7YZU3OL","created_at":"2026-07-05T05:09:19.054066+00:00"},{"alias_kind":"pith_short_8","alias_value":"F3ZXNWQO","created_at":"2026-07-05T05:09:19.054066+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.17582","citing_title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","ref_index":47,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F3ZXNWQOC7YZU3OLNZKGBXXADG","json":"https://pith.science/pith/F3ZXNWQOC7YZU3OLNZKGBXXADG.json","graph_json":"https://pith.science/api/pith-number/F3ZXNWQOC7YZU3OLNZKGBXXADG/graph.json","events_json":"https://pith.science/api/pith-number/F3ZXNWQOC7YZU3OLNZKGBXXADG/events.json","paper":"https://pith.science/paper/F3ZXNWQO"},"agent_actions":{"view_html":"https://pith.science/pith/F3ZXNWQOC7YZU3OLNZKGBXXADG","download_json":"https://pith.science/pith/F3ZXNWQOC7YZU3OLNZKGBXXADG.json","view_paper":"https://pith.science/paper/F3ZXNWQO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.01382&json=true","fetch_graph":"https://pith.science/api/pith-number/F3ZXNWQOC7YZU3OLNZKGBXXADG/graph.json","fetch_events":"https://pith.science/api/pith-number/F3ZXNWQOC7YZU3OLNZKGBXXADG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F3ZXNWQOC7YZU3OLNZKGBXXADG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F3ZXNWQOC7YZU3OLNZKGBXXADG/action/storage_attestation","attest_author":"https://pith.science/pith/F3ZXNWQOC7YZU3OLNZKGBXXADG/action/author_attestation","sign_citation":"https://pith.science/pith/F3ZXNWQOC7YZU3OLNZKGBXXADG/action/citation_signature","submit_replication":"https://pith.science/pith/F3ZXNWQOC7YZU3OLNZKGBXXADG/action/replication_record"}},"created_at":"2026-07-05T05:09:19.054066+00:00","updated_at":"2026-07-05T05:09:19.054066+00:00"}