{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GVYTPYMITRVJ6S7M22RU5YC3KQ","short_pith_number":"pith:GVYTPYMI","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"},"canonical_sha256":"357137e1889c6a9f4becd6a34ee05b542b1dd4744febf5419249de16689e7328","source":{"kind":"arxiv","id":"2605.25522","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.25522","created_at":"2026-05-26T02:04:40Z"},{"alias_kind":"arxiv_version","alias_value":"2605.25522v1","created_at":"2026-05-26T02:04:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25522","created_at":"2026-05-26T02:04:40Z"},{"alias_kind":"pith_short_12","alias_value":"GVYTPYMITRVJ","created_at":"2026-05-26T02:04:40Z"},{"alias_kind":"pith_short_16","alias_value":"GVYTPYMITRVJ6S7M","created_at":"2026-05-26T02:04:40Z"},{"alias_kind":"pith_short_8","alias_value":"GVYTPYMI","created_at":"2026-05-26T02:04:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GVYTPYMITRVJ6S7M22RU5YC3KQ","target":"record","payload":{"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"},"canonical_sha256":"357137e1889c6a9f4becd6a34ee05b542b1dd4744febf5419249de16689e7328","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"},"source_kind":"arxiv","source_id":"2605.25522","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-05-26T02:04:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MWXThh/40CIIDTtJzt8zHYzFCPcwbS7s3XH0TiALgGJooyK3EYwQWYSMk+1JiAsm/Xk1lAXrfYEXh/GqWw/KCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:43:27.741820Z"},"content_sha256":"7cf32aef39d082f3fd3c9adcfa82ea4717b7e713041f85bbc4cb9845d19e1190","schema_version":"1.0","event_id":"sha256:7cf32aef39d082f3fd3c9adcfa82ea4717b7e713041f85bbc4cb9845d19e1190"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GVYTPYMITRVJ6S7M22RU5YC3KQ","target":"graph","payload":{"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"},"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-05-26T02:04:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZoWOn0MD9ranrNderbUizD2KXTf4EViBJLCSiEId+kvi5G4JAnGb1SXQ/i5/FIqkzRHr8uzTOn4KHokEIIxUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:43:27.742203Z"},"content_sha256":"6281e5d8c789f42960c646a449c8cad873de0ef631af51e9c17040d25620d061","schema_version":"1.0","event_id":"sha256:6281e5d8c789f42960c646a449c8cad873de0ef631af51e9c17040d25620d061"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GVYTPYMITRVJ6S7M22RU5YC3KQ/bundle.json","state_url":"https://pith.science/pith/GVYTPYMITRVJ6S7M22RU5YC3KQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GVYTPYMITRVJ6S7M22RU5YC3KQ/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-06-01T20:43:27Z","links":{"resolver":"https://pith.science/pith/GVYTPYMITRVJ6S7M22RU5YC3KQ","bundle":"https://pith.science/pith/GVYTPYMITRVJ6S7M22RU5YC3KQ/bundle.json","state":"https://pith.science/pith/GVYTPYMITRVJ6S7M22RU5YC3KQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GVYTPYMITRVJ6S7M22RU5YC3KQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GVYTPYMITRVJ6S7M22RU5YC3KQ","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":"14ec8a0e3872a110ed3a11eb40b64616e9cf5eccbbf051146845f78369a6bccd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2026-05-25T07:22:13Z","title_canon_sha256":"fab1a46930d0a2b51b41599a40e3f094e2f32243316fdcd3c078085f7f1a97d0"},"schema_version":"1.0","source":{"id":"2605.25522","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.25522","created_at":"2026-05-26T02:04:40Z"},{"alias_kind":"arxiv_version","alias_value":"2605.25522v1","created_at":"2026-05-26T02:04:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.25522","created_at":"2026-05-26T02:04:40Z"},{"alias_kind":"pith_short_12","alias_value":"GVYTPYMITRVJ","created_at":"2026-05-26T02:04:40Z"},{"alias_kind":"pith_short_16","alias_value":"GVYTPYMITRVJ6S7M","created_at":"2026-05-26T02:04:40Z"},{"alias_kind":"pith_short_8","alias_value":"GVYTPYMI","created_at":"2026-05-26T02:04:40Z"}],"graph_snapshots":[{"event_id":"sha256:6281e5d8c789f42960c646a449c8cad873de0ef631af51e9c17040d25620d061","target":"graph","created_at":"2026-05-26T02:04:40Z","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/2605.25522/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Amelie Chi Zhou, Jintao Meng, Minwen Deng, Sitian Chen, Yao Chen, Yusen Li","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2026-05-25T07:22:13Z","title":"Co-Designing Graph-based Approximate Nearest Neighbor Search at Billion Scale for Processing-in-Memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.25522","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:7cf32aef39d082f3fd3c9adcfa82ea4717b7e713041f85bbc4cb9845d19e1190","target":"record","created_at":"2026-05-26T02:04:40Z","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":"14ec8a0e3872a110ed3a11eb40b64616e9cf5eccbbf051146845f78369a6bccd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2026-05-25T07:22:13Z","title_canon_sha256":"fab1a46930d0a2b51b41599a40e3f094e2f32243316fdcd3c078085f7f1a97d0"},"schema_version":"1.0","source":{"id":"2605.25522","kind":"arxiv","version":1}},"canonical_sha256":"357137e1889c6a9f4becd6a34ee05b542b1dd4744febf5419249de16689e7328","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"357137e1889c6a9f4becd6a34ee05b542b1dd4744febf5419249de16689e7328","first_computed_at":"2026-05-26T02:04:40.776432Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-26T02:04:40.776432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n2ApEZxPDVovHNcDg4VDxfVLQ3Fya4e+RzyD7PoBi8E044VdVT/2rPJ+UNg1i1p5+KGenVXtn4vX6I6za4S/AA==","signature_status":"signed_v1","signed_at":"2026-05-26T02:04:40.777212Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.25522","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7cf32aef39d082f3fd3c9adcfa82ea4717b7e713041f85bbc4cb9845d19e1190","sha256:6281e5d8c789f42960c646a449c8cad873de0ef631af51e9c17040d25620d061"],"state_sha256":"85999e526f0d6e03c667eacb740b78fd2cb5eb496b582d8f5336720393ac2005"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gDyzgveCWdHyQPSDgKd6z8iwGYoQfnl8u1NgOIg5QqBKBygWEKVBgg8804UN4i+Vim0v0nR7NBjn47X9xBviCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:43:27.744333Z","bundle_sha256":"2531f622d7ae46955d15c6dc2faedf1bbeaa14b3477eb37abab4b73480059485"}}