Pith Number
pith:6VBI2BZ4
pith:2025:6VBI2BZ47ZFBCPDHMBZHHEMUT5
not attested
not anchored
not stored
refs pending
Efficient Trie-based Biasing using K-step Prediction for Rare Word Recognition
arxiv:2509.09196 v1 · 2025-09-11 · cs.CL · cs.AI
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{6VBI2BZ47ZFBCPDHMBZHHEMUT5}
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-07-05T12:09:31.432136Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
f5428d073cfe4a113c6760727391949f4b640ad71f01897e7bb0389922f0f30f
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/6VBI2BZ47ZFBCPDHMBZHHEMUT5 \
| 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: f5428d073cfe4a113c6760727391949f4b640ad71f01897e7bb0389922f0f30f
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "b3a5ab5939896113450f7771eaefbbfc696d72075b97203f862ecbd1a0d65424",
"cross_cats_sorted": [
"cs.AI"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"primary_cat": "cs.CL",
"submitted_at": "2025-09-11T07:11:46Z",
"title_canon_sha256": "1aa18e6d1672ccc49b3897072cef4fc7108728cda4374494c91a07ca17f14e89"
},
"schema_version": "1.0",
"source": {
"id": "2509.09196",
"kind": "arxiv",
"version": 1
}
}