{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GTUEYKMHBTSYNTBJ3MW5CFYITW","short_pith_number":"pith:GTUEYKMH","schema_version":"1.0","canonical_sha256":"34e84c29870ce586cc29db2dd117089d93defe682cf267fb9a8fe8922b58ce34","source":{"kind":"arxiv","id":"2403.13491","version":2},"attestation_state":"computed","paper":{"title":"Dimensionality-Reduction Techniques for Approximate Nearest Neighbor Search: A Survey and Evaluation","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Haoran Xiong, Peng Wang, Qitong Wang, Themis Palpanas, Wei Wang, Zeyu Wang, Zhenying He","submitted_at":"2024-03-20T10:48:00Z","abstract_excerpt":"Approximate Nearest Neighbor Search (ANNS) on high-dimensional vectors has become a fundamental and essential component in various machine learning tasks. Recently, with the rapid development of deep learning models and the applications of Large Language Models (LLMs), the dimensionality of the vectors keeps growing in order to accommodate a richer semantic representation. This poses a major challenge to the ANNS solutions since distance calculation cost in ANNS grows linearly with the dimensionality of vectors. To overcome this challenge, dimensionality-reduction techniques can be leveraged t"},"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":"2403.13491","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DB","submitted_at":"2024-03-20T10:48:00Z","cross_cats_sorted":[],"title_canon_sha256":"5889b9978fd16efc281c3a8f3bf767d8173263074b125ca35c917532b3ac5f40","abstract_canon_sha256":"e0207d9c384c635f7138924bcb7c0522f8e65fd32524dc4a23f37884b7275ed7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:17:07.224806Z","signature_b64":"SdwE6HYZoa9aAIEMI2wLZhFiz8NLAJRnqb5iHNBz/83cQSJi+TMA3PS7X/66xDTZ0m4EIh1Uf22GbnpcDagnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34e84c29870ce586cc29db2dd117089d93defe682cf267fb9a8fe8922b58ce34","last_reissued_at":"2026-07-05T10:17:07.224260Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:17:07.224260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dimensionality-Reduction Techniques for Approximate Nearest Neighbor Search: A Survey and Evaluation","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Haoran Xiong, Peng Wang, Qitong Wang, Themis Palpanas, Wei Wang, Zeyu Wang, Zhenying He","submitted_at":"2024-03-20T10:48:00Z","abstract_excerpt":"Approximate Nearest Neighbor Search (ANNS) on high-dimensional vectors has become a fundamental and essential component in various machine learning tasks. Recently, with the rapid development of deep learning models and the applications of Large Language Models (LLMs), the dimensionality of the vectors keeps growing in order to accommodate a richer semantic representation. This poses a major challenge to the ANNS solutions since distance calculation cost in ANNS grows linearly with the dimensionality of vectors. To overcome this challenge, dimensionality-reduction techniques can be leveraged t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.13491","kind":"arxiv","version":2},"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/2403.13491/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":"2403.13491","created_at":"2026-07-05T10:17:07.224328+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.13491v2","created_at":"2026-07-05T10:17:07.224328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.13491","created_at":"2026-07-05T10:17:07.224328+00:00"},{"alias_kind":"pith_short_12","alias_value":"GTUEYKMHBTSY","created_at":"2026-07-05T10:17:07.224328+00:00"},{"alias_kind":"pith_short_16","alias_value":"GTUEYKMHBTSYNTBJ","created_at":"2026-07-05T10:17:07.224328+00:00"},{"alias_kind":"pith_short_8","alias_value":"GTUEYKMH","created_at":"2026-07-05T10:17:07.224328+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.12229","citing_title":"SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search","ref_index":81,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GTUEYKMHBTSYNTBJ3MW5CFYITW","json":"https://pith.science/pith/GTUEYKMHBTSYNTBJ3MW5CFYITW.json","graph_json":"https://pith.science/api/pith-number/GTUEYKMHBTSYNTBJ3MW5CFYITW/graph.json","events_json":"https://pith.science/api/pith-number/GTUEYKMHBTSYNTBJ3MW5CFYITW/events.json","paper":"https://pith.science/paper/GTUEYKMH"},"agent_actions":{"view_html":"https://pith.science/pith/GTUEYKMHBTSYNTBJ3MW5CFYITW","download_json":"https://pith.science/pith/GTUEYKMHBTSYNTBJ3MW5CFYITW.json","view_paper":"https://pith.science/paper/GTUEYKMH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.13491&json=true","fetch_graph":"https://pith.science/api/pith-number/GTUEYKMHBTSYNTBJ3MW5CFYITW/graph.json","fetch_events":"https://pith.science/api/pith-number/GTUEYKMHBTSYNTBJ3MW5CFYITW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GTUEYKMHBTSYNTBJ3MW5CFYITW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GTUEYKMHBTSYNTBJ3MW5CFYITW/action/storage_attestation","attest_author":"https://pith.science/pith/GTUEYKMHBTSYNTBJ3MW5CFYITW/action/author_attestation","sign_citation":"https://pith.science/pith/GTUEYKMHBTSYNTBJ3MW5CFYITW/action/citation_signature","submit_replication":"https://pith.science/pith/GTUEYKMHBTSYNTBJ3MW5CFYITW/action/replication_record"}},"created_at":"2026-07-05T10:17:07.224328+00:00","updated_at":"2026-07-05T10:17:07.224328+00:00"}