{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WTVI7DMDIGSTVMWVC4LDAIQLEJ","short_pith_number":"pith:WTVI7DMD","schema_version":"1.0","canonical_sha256":"b4ea8f8d8341a53ab2d5171630220b227ce4df154e1bfc58f8ed388c1e8e0996","source":{"kind":"arxiv","id":"2410.15621","version":2},"attestation_state":"computed","paper":{"title":"DRIM-ANN: An Approximate Nearest Neighbor Search Engine based on Commercial DRAM-PIMs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Cheng Liu, Huawei Li, Kuai Yu, Lei Dai, Lei Zhang, Mingkai Chen, Shengwen Liang, Tianhua Han, Xiaowei Li, Ying Wang, Ziming Yuan","submitted_at":"2024-10-21T03:51:54Z","abstract_excerpt":"Approximate nearest neighbor search (ANNS) is essential for applications like recommendation systems and retrieval-augmented generation (RAG) but is highly I/O-intensive and memory-demanding. CPUs face I/O bottlenecks, while GPUs are constrained by limited memory. DRAM-based Processing-in-Memory (DRAM-PIM) offers a promising alternative by providing high bandwidth, large memory capacity, and near-data computation. This work introduces DRIM-ANN, the first optimized ANNS engine leveraging UPMEM's DRAM-PIM. While UPMEM scales memory bandwidth and capacity, it suffers from low computing power beca"},"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.15621","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2024-10-21T03:51:54Z","cross_cats_sorted":[],"title_canon_sha256":"cdea356bb813dfee49bb42b5c59b96add6252ba043f60473d81a19850b207e60","abstract_canon_sha256":"15658aa61dc8096a1c23ced3729b5409bf1e966c98429fcb15b58d9946916abf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:59:08.058088Z","signature_b64":"YoL1ZMQ+Ih9ehPVp6XEELqhgsOAQ3UjgKHF9zN2dPbc64J/AuKw80TskuKLPYaXRLmu8M8KhMt+YRxdMSOHuDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4ea8f8d8341a53ab2d5171630220b227ce4df154e1bfc58f8ed388c1e8e0996","last_reissued_at":"2026-07-05T11:59:08.057640Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:59:08.057640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DRIM-ANN: An Approximate Nearest Neighbor Search Engine based on Commercial DRAM-PIMs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Cheng Liu, Huawei Li, Kuai Yu, Lei Dai, Lei Zhang, Mingkai Chen, Shengwen Liang, Tianhua Han, Xiaowei Li, Ying Wang, Ziming Yuan","submitted_at":"2024-10-21T03:51:54Z","abstract_excerpt":"Approximate nearest neighbor search (ANNS) is essential for applications like recommendation systems and retrieval-augmented generation (RAG) but is highly I/O-intensive and memory-demanding. CPUs face I/O bottlenecks, while GPUs are constrained by limited memory. DRAM-based Processing-in-Memory (DRAM-PIM) offers a promising alternative by providing high bandwidth, large memory capacity, and near-data computation. This work introduces DRIM-ANN, the first optimized ANNS engine leveraging UPMEM's DRAM-PIM. While UPMEM scales memory bandwidth and capacity, it suffers from low computing power beca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.15621","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/2410.15621/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.15621","created_at":"2026-07-05T11:59:08.057694+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.15621v2","created_at":"2026-07-05T11:59:08.057694+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.15621","created_at":"2026-07-05T11:59:08.057694+00:00"},{"alias_kind":"pith_short_12","alias_value":"WTVI7DMDIGST","created_at":"2026-07-05T11:59:08.057694+00:00"},{"alias_kind":"pith_short_16","alias_value":"WTVI7DMDIGSTVMWV","created_at":"2026-07-05T11:59:08.057694+00:00"},{"alias_kind":"pith_short_8","alias_value":"WTVI7DMD","created_at":"2026-07-05T11:59:08.057694+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/WTVI7DMDIGSTVMWVC4LDAIQLEJ","json":"https://pith.science/pith/WTVI7DMDIGSTVMWVC4LDAIQLEJ.json","graph_json":"https://pith.science/api/pith-number/WTVI7DMDIGSTVMWVC4LDAIQLEJ/graph.json","events_json":"https://pith.science/api/pith-number/WTVI7DMDIGSTVMWVC4LDAIQLEJ/events.json","paper":"https://pith.science/paper/WTVI7DMD"},"agent_actions":{"view_html":"https://pith.science/pith/WTVI7DMDIGSTVMWVC4LDAIQLEJ","download_json":"https://pith.science/pith/WTVI7DMDIGSTVMWVC4LDAIQLEJ.json","view_paper":"https://pith.science/paper/WTVI7DMD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.15621&json=true","fetch_graph":"https://pith.science/api/pith-number/WTVI7DMDIGSTVMWVC4LDAIQLEJ/graph.json","fetch_events":"https://pith.science/api/pith-number/WTVI7DMDIGSTVMWVC4LDAIQLEJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WTVI7DMDIGSTVMWVC4LDAIQLEJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WTVI7DMDIGSTVMWVC4LDAIQLEJ/action/storage_attestation","attest_author":"https://pith.science/pith/WTVI7DMDIGSTVMWVC4LDAIQLEJ/action/author_attestation","sign_citation":"https://pith.science/pith/WTVI7DMDIGSTVMWVC4LDAIQLEJ/action/citation_signature","submit_replication":"https://pith.science/pith/WTVI7DMDIGSTVMWVC4LDAIQLEJ/action/replication_record"}},"created_at":"2026-07-05T11:59:08.057694+00:00","updated_at":"2026-07-05T11:59:08.057694+00:00"}