Pith Number
pith:EAXIMRTR
pith:2012:EAXIMRTRUQ7NCZSEA5A3TRGX7W
not attested
not anchored
not stored
refs pending
Solving the minimum labelling spanning tree problem using intelligent optimization
arxiv:1201.2320 v4 · 2012-01-11 · math.OC · cs.DM · math.CO
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{EAXIMRTRUQ7NCZSEA5A3TRGX7W}
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-18T02:57:24.382879Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
202e864671a43ed166440741b9c4d7fda309eef5a12865c465c002aca1e7162f
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/EAXIMRTRUQ7NCZSEA5A3TRGX7W \
| 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: 202e864671a43ed166440741b9c4d7fda309eef5a12865c465c002aca1e7162f
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "d028fa4b7b2e12f43ea35e93b2b0f0f0415a398513c470d09afe90150129f4ce",
"cross_cats_sorted": [
"cs.DM",
"math.CO"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "math.OC",
"submitted_at": "2012-01-11T15:00:36Z",
"title_canon_sha256": "e5e92ee239012a9cb4d37abf1c8e663748bb08f2f511fb9fb53419c1d8bc7c31"
},
"schema_version": "1.0",
"source": {
"id": "1201.2320",
"kind": "arxiv",
"version": 4
}
}