Pith Number
pith:EKPC4E7H
pith:2018:EKPC4E7HH5CPK2JYVY4JKKX4E3
not attested
not anchored
not stored
refs pending
On The Equivalence of Tries and Dendrograms - Efficient Hierarchical Clustering of Traffic Data
arxiv:1810.05357 v1 · 2018-10-12 · cs.DB · cs.AI
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{EKPC4E7HH5CPK2JYVY4JKKX4E3}
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-18T00:03:30.852892Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
229e2e13e73f44f56938ae38952afc26e0e4da1e0e920c2f1cfb6500a9f1000d
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/EKPC4E7HH5CPK2JYVY4JKKX4E3 \
| 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: 229e2e13e73f44f56938ae38952afc26e0e4da1e0e920c2f1cfb6500a9f1000d
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "142e1d006c14225c9957c2342832a088959d8cfbfe4d543c8dd6fa5335740370",
"cross_cats_sorted": [
"cs.AI"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DB",
"submitted_at": "2018-10-12T05:02:29Z",
"title_canon_sha256": "b4679fac360828752ad3b96b928e208a6f0574a720733829cd4f032987cccc42"
},
"schema_version": "1.0",
"source": {
"id": "1810.05357",
"kind": "arxiv",
"version": 1
}
}