Pith Number
pith:ZWA22RE6
pith:2019:ZWA22RE6MLHRPRERZEKLMXQSEH
not attested
not anchored
not stored
refs pending
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges
arxiv:1908.03473 v4 · 2019-08-09 · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{ZWA22RE6MLHRPRERZEKLMXQSEH}
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-07-05T05:28:58.226652Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
cd81ad449e62cf17c491c914b65e1221f1b3fdab3021c1eeed07b8a32d2c4f78
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/ZWA22RE6MLHRPRERZEKLMXQSEH \
| 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: cd81ad449e62cf17c491c914b65e1221f1b3fdab3021c1eeed07b8a32d2c4f78
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "69908a8a10eb918eb4d0ab91826773f8ff3bb4c0ec7076547743a78a47d77e9c",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2019-08-09T14:31:09Z",
"title_canon_sha256": "0832137b95bbcefda60c78c7d5a7b93af0a3d8aaa704fc761a59c251a4d07d3a"
},
"schema_version": "1.0",
"source": {
"id": "1908.03473",
"kind": "arxiv",
"version": 4
}
}