Pith Number
pith:Y3B2RXK2
pith:2017:Y3B2RXK2ZGGPZG3PMBJEWLS6RK
not attested
not anchored
not stored
refs pending
Parameterized complexity of finding a spanning tree with minimum reload cost diameter
arxiv:1703.01686 v2 · 2017-03-05 · cs.DS · cs.CC
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{Y3B2RXK2ZGGPZG3PMBJEWLS6RK}
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-18T00:45:53.876880Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
c6c3a8dd5ac98cfc9b6f60524b2e5e8a93bfa81feecde2d7c5b50a9fc41cd539
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/Y3B2RXK2ZGGPZG3PMBJEWLS6RK \
| 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: c6c3a8dd5ac98cfc9b6f60524b2e5e8a93bfa81feecde2d7c5b50a9fc41cd539
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "320658cea8724499f077a0a764fd46691e6941530237669e0d9ec5f3090c4a2b",
"cross_cats_sorted": [
"cs.CC"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2017-03-05T23:06:03Z",
"title_canon_sha256": "6c942a5089e4d53b8f0e9efa71c0687b2d7324a0d2cb31caf7d4a76be288d912"
},
"schema_version": "1.0",
"source": {
"id": "1703.01686",
"kind": "arxiv",
"version": 2
}
}