Pith Number
pith:NAPBNICD
pith:2026:NAPBNICDEBZNDUJWARM56LRU6D
not attested
not anchored
not stored
refs pending
Randomized Algorithms for Learning Partitions with Near Optimal Query Complexity in Constant Rounds
arxiv:2608.02176 v1 · 2026-08-03 · cs.DS · cs.LG
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{NAPBNICDEBZNDUJWARM56LRU6D}
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-08-04T02:11:15.072566Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
681e16a0432072d1d1360459df2e34f0f6882aac2529246912d5ed0d7e78433c
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/NAPBNICDEBZNDUJWARM56LRU6D \
| 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: 681e16a0432072d1d1360459df2e34f0f6882aac2529246912d5ed0d7e78433c
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "72557b208d8dc4cc4f066e8d48b1d064e3979572a80958d2a1be34dc16c40496",
"cross_cats_sorted": [
"cs.LG"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2026-08-03T12:56:19Z",
"title_canon_sha256": "c838a8cafad7fa13b4a7c7de824eb012a06bd29ab1f75ccfa0c01f94d90c15fc"
},
"schema_version": "1.0",
"source": {
"id": "2608.02176",
"kind": "arxiv",
"version": 1
}
}