Pith Number
pith:JEOQVZX3
pith:2014:JEOQVZX3RC22M7HLJ55TGYWJAP
not attested
not anchored
not stored
refs pending
Approximation for the Path Complexity of Binary Search Tree
arxiv:1404.4692 v1 · 2014-04-18 · cs.CC · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{JEOQVZX3RC22M7HLJ55TGYWJAP}
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-18T02:53:55.390270Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
491d0ae6fb88b5a67ceb4f7b3362c903f0257b1f9be980b04cf2968606a7dc82
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/JEOQVZX3RC22M7HLJ55TGYWJAP \
| 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: 491d0ae6fb88b5a67ceb4f7b3362c903f0257b1f9be980b04cf2968606a7dc82
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "b588d1e7012de7b0eb126c76dc1e8890bf9984cf7703858e77cc67ec2ff4651b",
"cross_cats_sorted": [
"cs.DS"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.CC",
"submitted_at": "2014-04-18T05:41:46Z",
"title_canon_sha256": "62fd4dda640be188b39e214829eed6029f57a15c3232bebb85f271c74b356dd8"
},
"schema_version": "1.0",
"source": {
"id": "1404.4692",
"kind": "arxiv",
"version": 1
}
}