{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GVYTPYMITRVJ6S7M22RU5YC3KQ","short_pith_number":"pith:GVYTPYMI","schema_version":"1.0","canonical_sha256":"357137e1889c6a9f4becd6a34ee05b542b1dd4744febf5419249de16689e7328","source":{"kind":"arxiv","id":"2605.25522","version":1},"attestation_state":"computed","paper":{"title":"Co-Designing Graph-based Approximate Nearest Neighbor Search at Billion Scale for Processing-in-Memory","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Amelie Chi Zhou, Jintao Meng, Minwen Deng, Sitian Chen, Yao Chen, Yusen Li","submitted_at":"2026-05-25T07:22:13Z","abstract_excerpt":"Approximate Nearest Neighbor Search (ANNS) is a core primitive in modern AI systems, and graph-based methods currently offer the best accuracy-efficiency trade-off at scale. The workload is fundamentally memory-bound: graph traversal produces frequent, irregular memory accesses that cap CPU throughput at main-memory bandwidth, while GPUs lack the high-bandwidth memory capacity to host billion-scale indexes. Processing-in-Memory (PIM) is a natural candidate, as placing computation next to data unlocks the abundant internal bandwidth that such bandwidth-starved workloads demand. Porting graph-ba"},"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":"2605.25522","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2026-05-25T07:22:13Z","cross_cats_sorted":[],"title_canon_sha256":"fab1a46930d0a2b51b41599a40e3f094e2f32243316fdcd3c078085f7f1a97d0","abstract_canon_sha256":"14ec8a0e3872a110ed3a11eb40b64616e9cf5eccbbf051146845f78369a6bccd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T02:04:40.777212Z","signature_b64":"n2ApEZxPDVovHNcDg4VDxfVLQ3Fya4e+RzyD7PoBi8E044VdVT/2rPJ+UNg1i1p5+KGenVXtn4vX6I6za4S/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"357137e1889c6a9f4becd6a34ee05b542b1dd4744febf5419249de16689e7328","last_reissued_at":"2026-05-26T02:04:40.776432Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T02:04:40.776432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Co-Designing Graph-based Approximate Nearest Neighbor Search at Billion Scale for Processing-in-Memory","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Amelie Chi Zhou, Jintao Meng, Minwen Deng, Sitian Chen, Yao Chen, Yusen Li","submitted_at":"2026-05-25T07:22:13Z","abstract_excerpt":"Approximate Nearest Neighbor Search (ANNS) is a core primitive in modern AI systems, and graph-based methods currently offer the best accuracy-efficiency trade-off at scale. The workload is fundamentally memory-bound: graph traversal produces frequent, irregular memory accesses that cap CPU throughput at main-memory bandwidth, while GPUs lack the high-bandwidth memory capacity to host billion-scale indexes. Processing-in-Memory (PIM) is a natural candidate, as placing computation next to data unlocks the abundant internal bandwidth that such bandwidth-starved workloads demand. Porting graph-ba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.25522","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/2605.25522/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":"2605.25522","created_at":"2026-05-26T02:04:40.776565+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.25522v1","created_at":"2026-05-26T02:04:40.776565+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25522","created_at":"2026-05-26T02:04:40.776565+00:00"},{"alias_kind":"pith_short_12","alias_value":"GVYTPYMITRVJ","created_at":"2026-05-26T02:04:40.776565+00:00"},{"alias_kind":"pith_short_16","alias_value":"GVYTPYMITRVJ6S7M","created_at":"2026-05-26T02:04:40.776565+00:00"},{"alias_kind":"pith_short_8","alias_value":"GVYTPYMI","created_at":"2026-05-26T02:04:40.776565+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/GVYTPYMITRVJ6S7M22RU5YC3KQ","json":"https://pith.science/pith/GVYTPYMITRVJ6S7M22RU5YC3KQ.json","graph_json":"https://pith.science/api/pith-number/GVYTPYMITRVJ6S7M22RU5YC3KQ/graph.json","events_json":"https://pith.science/api/pith-number/GVYTPYMITRVJ6S7M22RU5YC3KQ/events.json","paper":"https://pith.science/paper/GVYTPYMI"},"agent_actions":{"view_html":"https://pith.science/pith/GVYTPYMITRVJ6S7M22RU5YC3KQ","download_json":"https://pith.science/pith/GVYTPYMITRVJ6S7M22RU5YC3KQ.json","view_paper":"https://pith.science/paper/GVYTPYMI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.25522&json=true","fetch_graph":"https://pith.science/api/pith-number/GVYTPYMITRVJ6S7M22RU5YC3KQ/graph.json","fetch_events":"https://pith.science/api/pith-number/GVYTPYMITRVJ6S7M22RU5YC3KQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GVYTPYMITRVJ6S7M22RU5YC3KQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GVYTPYMITRVJ6S7M22RU5YC3KQ/action/storage_attestation","attest_author":"https://pith.science/pith/GVYTPYMITRVJ6S7M22RU5YC3KQ/action/author_attestation","sign_citation":"https://pith.science/pith/GVYTPYMITRVJ6S7M22RU5YC3KQ/action/citation_signature","submit_replication":"https://pith.science/pith/GVYTPYMITRVJ6S7M22RU5YC3KQ/action/replication_record"}},"created_at":"2026-05-26T02:04:40.776565+00:00","updated_at":"2026-05-26T02:04:40.776565+00:00"}