{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZQ2CGPBVLMCE3PKPSVJ7EW7FBS","short_pith_number":"pith:ZQ2CGPBV","schema_version":"1.0","canonical_sha256":"cc34233c355b044dbd4f9553f25be50c8db0a1e4415b97e6fb11a84aa320d4e5","source":{"kind":"arxiv","id":"2410.18926","version":1},"attestation_state":"computed","paper":{"title":"LoRANN: Low-Rank Matrix Factorization for Approximate Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Elias J\\\"a\\\"asaari, Teemu Roos, Ville Hyv\\\"onen","submitted_at":"2024-10-24T17:13:39Z","abstract_excerpt":"Approximate nearest neighbor (ANN) search is a key component in many modern machine learning pipelines; recent use cases include retrieval-augmented generation (RAG) and vector databases. Clustering-based ANN algorithms, that use score computation methods based on product quantization (PQ), are often used in industrial-scale applications due to their scalability and suitability for distributed and disk-based implementations. However, they have slower query times than the leading graph-based ANN algorithms. In this work, we propose a new supervised score computation method based on the observat"},"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":"2410.18926","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-24T17:13:39Z","cross_cats_sorted":[],"title_canon_sha256":"1eaff33909b5d8955d2bcbf6a97c3bb605cb2dd5480bd327d60d294dac7fcc4f","abstract_canon_sha256":"8877e9c24ffe85ca8b2dcb82a72ffa5a7a083d50f17a6b09d0b9cc2607571315"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:25:22.071701Z","signature_b64":"JaUADXZtBH/zAF+S75NJQ4wiWUWWQZP7MrAIXHg8E1zKCj2w9pqzgUM6JiSBArpdOxuWK4PAq2GhSgn5dumWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc34233c355b044dbd4f9553f25be50c8db0a1e4415b97e6fb11a84aa320d4e5","last_reissued_at":"2026-07-05T09:25:22.071063Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:25:22.071063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LoRANN: Low-Rank Matrix Factorization for Approximate Nearest Neighbor Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Elias J\\\"a\\\"asaari, Teemu Roos, Ville Hyv\\\"onen","submitted_at":"2024-10-24T17:13:39Z","abstract_excerpt":"Approximate nearest neighbor (ANN) search is a key component in many modern machine learning pipelines; recent use cases include retrieval-augmented generation (RAG) and vector databases. Clustering-based ANN algorithms, that use score computation methods based on product quantization (PQ), are often used in industrial-scale applications due to their scalability and suitability for distributed and disk-based implementations. However, they have slower query times than the leading graph-based ANN algorithms. In this work, we propose a new supervised score computation method based on the observat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.18926","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/2410.18926/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":"2410.18926","created_at":"2026-07-05T09:25:22.071121+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.18926v1","created_at":"2026-07-05T09:25:22.071121+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.18926","created_at":"2026-07-05T09:25:22.071121+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZQ2CGPBVLMCE","created_at":"2026-07-05T09:25:22.071121+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZQ2CGPBVLMCE3PKP","created_at":"2026-07-05T09:25:22.071121+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZQ2CGPBV","created_at":"2026-07-05T09:25:22.071121+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/ZQ2CGPBVLMCE3PKPSVJ7EW7FBS","json":"https://pith.science/pith/ZQ2CGPBVLMCE3PKPSVJ7EW7FBS.json","graph_json":"https://pith.science/api/pith-number/ZQ2CGPBVLMCE3PKPSVJ7EW7FBS/graph.json","events_json":"https://pith.science/api/pith-number/ZQ2CGPBVLMCE3PKPSVJ7EW7FBS/events.json","paper":"https://pith.science/paper/ZQ2CGPBV"},"agent_actions":{"view_html":"https://pith.science/pith/ZQ2CGPBVLMCE3PKPSVJ7EW7FBS","download_json":"https://pith.science/pith/ZQ2CGPBVLMCE3PKPSVJ7EW7FBS.json","view_paper":"https://pith.science/paper/ZQ2CGPBV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.18926&json=true","fetch_graph":"https://pith.science/api/pith-number/ZQ2CGPBVLMCE3PKPSVJ7EW7FBS/graph.json","fetch_events":"https://pith.science/api/pith-number/ZQ2CGPBVLMCE3PKPSVJ7EW7FBS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZQ2CGPBVLMCE3PKPSVJ7EW7FBS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZQ2CGPBVLMCE3PKPSVJ7EW7FBS/action/storage_attestation","attest_author":"https://pith.science/pith/ZQ2CGPBVLMCE3PKPSVJ7EW7FBS/action/author_attestation","sign_citation":"https://pith.science/pith/ZQ2CGPBVLMCE3PKPSVJ7EW7FBS/action/citation_signature","submit_replication":"https://pith.science/pith/ZQ2CGPBVLMCE3PKPSVJ7EW7FBS/action/replication_record"}},"created_at":"2026-07-05T09:25:22.071121+00:00","updated_at":"2026-07-05T09:25:22.071121+00:00"}