Pith Number
pith:GVYTPYMI
pith:2026:GVYTPYMITRVJ6S7M22RU5YC3KQ
not attested
not anchored
not stored
refs pending
Co-Designing Graph-based Approximate Nearest Neighbor Search at Billion Scale for Processing-in-Memory
arxiv:2605.25522 v1 · 2026-05-25 · cs.AR
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{GVYTPYMITRVJ6S7M22RU5YC3KQ}
Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge
Record completeness
1
Bitcoin timestamp
2
Internet Archive
3
Author claim
· sign in to
claim
4
Citations
5
Replications
✓
Portable graph bundle live · download bundle · merged
state
The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same
current state with the deterministic merge algorithm.
Receipt and verification
| First computed | 2026-05-26T02:04:40.776432Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
357137e1889c6a9f4becd6a34ee05b542b1dd4744febf5419249de16689e7328
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/GVYTPYMITRVJ6S7M22RU5YC3KQ \
| jq -c '.canonical_record' \
| python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: 357137e1889c6a9f4becd6a34ee05b542b1dd4744febf5419249de16689e7328
Canonical record JSON
{
"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
}
}