Pith Number
pith:BTG5LN5R
pith:2012:BTG5LN5RTUGMYX7JIIPWZRHUUX
not attested
not anchored
not stored
refs pending
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model
arxiv:1206.1113 v1 · 2012-06-06 · cs.DC · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{BTG5LN5RTUGMYX7JIIPWZRHUUX}
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:54:06.956157Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
0ccdd5b7b19d0ccc5fe9421f6cc4f4a5e90cffbd764e5fde85ace69b098bf509
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/BTG5LN5RTUGMYX7JIIPWZRHUUX \
| 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: 0ccdd5b7b19d0ccc5fe9421f6cc4f4a5e90cffbd764e5fde85ace69b098bf509
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "d14458222460d76ec385abeca41396ede2104d23621b0ac0e23c9b5010dee8bf",
"cross_cats_sorted": [
"cs.DS"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DC",
"submitted_at": "2012-06-06T03:08:41Z",
"title_canon_sha256": "13c5d6866f3abd6382167fc272ea15ad8faf1a138580f39ddb7b79104669b2e3"
},
"schema_version": "1.0",
"source": {
"id": "1206.1113",
"kind": "arxiv",
"version": 1
}
}