Pith Number
pith:U2KQ7C5G
pith:2011:U2KQ7C5GPN4E4WZRXKNORBMI3Y
not attested
not anchored
not stored
refs pending
RTED: A Robust Algorithm for the Tree Edit Distance
arxiv:1201.0230 v1 · 2011-12-31 · cs.DB
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{U2KQ7C5GPN4E4WZRXKNORBMI3Y}
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-18T04:05:25.759977Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
a6950f8ba67b784e5b31ba9ae88588de37e6b0e85a06b7d78acc40d6bf4b2c5e
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/U2KQ7C5GPN4E4WZRXKNORBMI3Y \
| 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: a6950f8ba67b784e5b31ba9ae88588de37e6b0e85a06b7d78acc40d6bf4b2c5e
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "fe287274937478c22ef4895214adae3c9524aea8d1d5d07ecc36dd120156c7a4",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DB",
"submitted_at": "2011-12-31T05:35:26Z",
"title_canon_sha256": "044749bbd54cda1b6e14c2628163123dc05d49be4778e50f33434585f4562392"
},
"schema_version": "1.0",
"source": {
"id": "1201.0230",
"kind": "arxiv",
"version": 1
}
}