Pith Number
pith:UNHL5AMX
pith:2013:UNHL5AMXPH7JYL6RH7PI6XGII5
not attested
not anchored
not stored
refs pending
A Fast Algorithm for Well-Spaced Points and Approximate Delaunay Graphs
arxiv:1304.0524 v1 · 2013-04-02 · cs.CG
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{UNHL5AMXPH7JYL6RH7PI6XGII5}
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:29:15.169483Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
a34ebe819779fe9c2fd13fde8f5cc847561fe0d05346285d29a0a646ae2137a0
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/UNHL5AMXPH7JYL6RH7PI6XGII5 \
| 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: a34ebe819779fe9c2fd13fde8f5cc847561fe0d05346285d29a0a646ae2137a0
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "e7c53cbbf4ed15d17576d9676070f22d6f9f95febe2967f9b392cd6391189a4e",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.CG",
"submitted_at": "2013-04-02T03:53:46Z",
"title_canon_sha256": "b79e1dcc0ef296691780b975b7e6145c462168b821abb18115cce99d36982c85"
},
"schema_version": "1.0",
"source": {
"id": "1304.0524",
"kind": "arxiv",
"version": 1
}
}