{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:ZQ2CGPBVLMCE3PKPSVJ7EW7FBS","short_pith_number":"pith:ZQ2CGPBV","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"},"canonical_sha256":"cc34233c355b044dbd4f9553f25be50c8db0a1e4415b97e6fb11a84aa320d4e5","source":{"kind":"arxiv","id":"2410.18926","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.18926","created_at":"2026-07-05T09:25:22Z"},{"alias_kind":"arxiv_version","alias_value":"2410.18926v1","created_at":"2026-07-05T09:25:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.18926","created_at":"2026-07-05T09:25:22Z"},{"alias_kind":"pith_short_12","alias_value":"ZQ2CGPBVLMCE","created_at":"2026-07-05T09:25:22Z"},{"alias_kind":"pith_short_16","alias_value":"ZQ2CGPBVLMCE3PKP","created_at":"2026-07-05T09:25:22Z"},{"alias_kind":"pith_short_8","alias_value":"ZQ2CGPBV","created_at":"2026-07-05T09:25:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:ZQ2CGPBVLMCE3PKPSVJ7EW7FBS","target":"record","payload":{"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"},"canonical_sha256":"cc34233c355b044dbd4f9553f25be50c8db0a1e4415b97e6fb11a84aa320d4e5","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"},"source_kind":"arxiv","source_id":"2410.18926","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:25:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r5rY4st7Qzjo0g80e3yB4iSZBu8Hn97R7Pr5unqv5fwha7LsZv6KkPOecjxg5otuiybusnmFkzIflIO6dQWpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T03:06:52.572629Z"},"content_sha256":"6c8b960a23e13b831adb69c6d575940d3ebf6875ac42177572e3918208fa856c","schema_version":"1.0","event_id":"sha256:6c8b960a23e13b831adb69c6d575940d3ebf6875ac42177572e3918208fa856c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:ZQ2CGPBVLMCE3PKPSVJ7EW7FBS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:25:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MypHN9nlZimH6vaeD6cFCaVGVz/c1Cx5AwWPoRenxC/eVN5DjybkSlqJR3ByFdg0Iewd5tjqkksYA3Nc1kTYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T03:06:52.573594Z"},"content_sha256":"0dad68168d2d1caecdd3d9a040a808e9afb3a5702f6993485c1db5c6b6fe9c9f","schema_version":"1.0","event_id":"sha256:0dad68168d2d1caecdd3d9a040a808e9afb3a5702f6993485c1db5c6b6fe9c9f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZQ2CGPBVLMCE3PKPSVJ7EW7FBS/bundle.json","state_url":"https://pith.science/pith/ZQ2CGPBVLMCE3PKPSVJ7EW7FBS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZQ2CGPBVLMCE3PKPSVJ7EW7FBS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-04T03:06:52Z","links":{"resolver":"https://pith.science/pith/ZQ2CGPBVLMCE3PKPSVJ7EW7FBS","bundle":"https://pith.science/pith/ZQ2CGPBVLMCE3PKPSVJ7EW7FBS/bundle.json","state":"https://pith.science/pith/ZQ2CGPBVLMCE3PKPSVJ7EW7FBS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZQ2CGPBVLMCE3PKPSVJ7EW7FBS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:ZQ2CGPBVLMCE3PKPSVJ7EW7FBS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8877e9c24ffe85ca8b2dcb82a72ffa5a7a083d50f17a6b09d0b9cc2607571315","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-24T17:13:39Z","title_canon_sha256":"1eaff33909b5d8955d2bcbf6a97c3bb605cb2dd5480bd327d60d294dac7fcc4f"},"schema_version":"1.0","source":{"id":"2410.18926","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.18926","created_at":"2026-07-05T09:25:22Z"},{"alias_kind":"arxiv_version","alias_value":"2410.18926v1","created_at":"2026-07-05T09:25:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.18926","created_at":"2026-07-05T09:25:22Z"},{"alias_kind":"pith_short_12","alias_value":"ZQ2CGPBVLMCE","created_at":"2026-07-05T09:25:22Z"},{"alias_kind":"pith_short_16","alias_value":"ZQ2CGPBVLMCE3PKP","created_at":"2026-07-05T09:25:22Z"},{"alias_kind":"pith_short_8","alias_value":"ZQ2CGPBV","created_at":"2026-07-05T09:25:22Z"}],"graph_snapshots":[{"event_id":"sha256:0dad68168d2d1caecdd3d9a040a808e9afb3a5702f6993485c1db5c6b6fe9c9f","target":"graph","created_at":"2026-07-05T09:25:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2410.18926/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Elias J\\\"a\\\"asaari, Teemu Roos, Ville Hyv\\\"onen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-24T17:13:39Z","title":"LoRANN: Low-Rank Matrix Factorization for Approximate Nearest Neighbor Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.18926","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6c8b960a23e13b831adb69c6d575940d3ebf6875ac42177572e3918208fa856c","target":"record","created_at":"2026-07-05T09:25:22Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8877e9c24ffe85ca8b2dcb82a72ffa5a7a083d50f17a6b09d0b9cc2607571315","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-10-24T17:13:39Z","title_canon_sha256":"1eaff33909b5d8955d2bcbf6a97c3bb605cb2dd5480bd327d60d294dac7fcc4f"},"schema_version":"1.0","source":{"id":"2410.18926","kind":"arxiv","version":1}},"canonical_sha256":"cc34233c355b044dbd4f9553f25be50c8db0a1e4415b97e6fb11a84aa320d4e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc34233c355b044dbd4f9553f25be50c8db0a1e4415b97e6fb11a84aa320d4e5","first_computed_at":"2026-07-05T09:25:22.071063Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:25:22.071063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JaUADXZtBH/zAF+S75NJQ4wiWUWWQZP7MrAIXHg8E1zKCj2w9pqzgUM6JiSBArpdOxuWK4PAq2GhSgn5dumWBw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:25:22.071701Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.18926","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c8b960a23e13b831adb69c6d575940d3ebf6875ac42177572e3918208fa856c","sha256:0dad68168d2d1caecdd3d9a040a808e9afb3a5702f6993485c1db5c6b6fe9c9f"],"state_sha256":"b9c2c0bfd8ad643f661cea15db2c6c6c5ccfdd1f4b97585468235f19ff1e82a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gBT3UYX9zUpwGYw16FAWXGgMSvG9v6O0hAWFs5HsZXCW2/ymlilZn7wTfpVmarBcSReBL/nFi6ICottzJHjXBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T03:06:52.587904Z","bundle_sha256":"4c884ab2a3275e98426ad1cfb256b52f60403f6cb5579c91fc0e1086b37fe5a8"}}