Pith Number
pith:OL5YVV5G
pith:2016:OL5YVV5GSN4W7QJGNZF3QDRCFF
not attested
not anchored
not stored
refs pending
The robust recoverable spanning tree problem with interval costs is polynomially solvable
arxiv:1602.07422 v2 · 2016-02-24 · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{OL5YVV5GSN4W7QJGNZF3QDRCFF}
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-18T01:19:33.708720Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
72fb8ad7a693796fc1266e4bb80e222943dbb2a8a0a9235deef1f4aae4a3ab94
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/OL5YVV5GSN4W7QJGNZF3QDRCFF \
| 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: 72fb8ad7a693796fc1266e4bb80e222943dbb2a8a0a9235deef1f4aae4a3ab94
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "57f9b7c9d7a356d7391cca06e727419b49669abac6587ed09e59c585557f3e24",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2016-02-24T07:29:06Z",
"title_canon_sha256": "27ec9749d4dd9f101c9af69997fa00e196a8ef6a7a9575f6eb505c9650ee8736"
},
"schema_version": "1.0",
"source": {
"id": "1602.07422",
"kind": "arxiv",
"version": 2
}
}