Pith Number
pith:HOB5URA7
pith:2013:HOB5URA7ZAINQ2QL2CMVXPFQLR
not attested
not anchored
not stored
refs pending
Improved bounds for the randomized decision tree complexity of recursive majority
arxiv:1309.7565 v1 · 2013-09-29 · cs.DS · cs.CC
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{HOB5URA7ZAINQ2QL2CMVXPFQLR}
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-18T03:11:56.553917Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
3b83da441fc810d86a0bd0995bbcb05c42e05f0daa2bf8a1cf34599c11438c26
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/HOB5URA7ZAINQ2QL2CMVXPFQLR \
| 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: 3b83da441fc810d86a0bd0995bbcb05c42e05f0daa2bf8a1cf34599c11438c26
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "a9611fae1daf9742b11fa6f3f48ee0701e2bbd049b0e5f9c47da71690c455a01",
"cross_cats_sorted": [
"cs.CC"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2013-09-29T10:00:34Z",
"title_canon_sha256": "e3ff5d8da5bd85207c42935a0ef68e08e99b809714484b3fa90db64c3e78e132"
},
"schema_version": "1.0",
"source": {
"id": "1309.7565",
"kind": "arxiv",
"version": 1
}
}