Pith Number
pith:MTMCYVSO
pith:2019:MTMCYVSOWC3G3BDTDANBGLNBWK
not attested
not anchored
not stored
refs pending
On the computational complexity of the probabilistic label tree algorithms
arxiv:1906.00294 v1 · 2019-06-01 · cs.LG · cs.CC · stat.ML
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{MTMCYVSOWC3G3BDTDANBGLNBWK}
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-17T23:44:27.544265Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
64d82c564eb0b66d8473181a132da1b29846ca9e4d49606acf2f2d32b0b13206
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/MTMCYVSOWC3G3BDTDANBGLNBWK \
| 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: 64d82c564eb0b66d8473181a132da1b29846ca9e4d49606acf2f2d32b0b13206
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "a2a56c0a0a04f747fc744ae0613e966d50fe4440391606779620252d35c15e6c",
"cross_cats_sorted": [
"cs.CC",
"stat.ML"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.LG",
"submitted_at": "2019-06-01T21:27:36Z",
"title_canon_sha256": "8a681362d8ad3a348ebc94a297fdd3e785248353fd12e7114004d67612cf5877"
},
"schema_version": "1.0",
"source": {
"id": "1906.00294",
"kind": "arxiv",
"version": 1
}
}