Pith Number
pith:4BBASTGJ
pith:2014:4BBASTGJUOGMF4D2YXGDRQK3LP
not attested
not anchored
not stored
refs pending
Election vs. Selection: Two Ways of Finding the Largest Node in a Graph
arxiv:1411.1319 v1 · 2014-11-05 · cs.DC · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{4BBASTGJUOGMF4D2YXGDRQK3LP}
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:38:30.322588Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
e042094cc9a38cc2f07ac5cc38c15b5bca8c7281fc2d28eb92f553cc617a83e9
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/4BBASTGJUOGMF4D2YXGDRQK3LP \
| 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: e042094cc9a38cc2f07ac5cc38c15b5bca8c7281fc2d28eb92f553cc617a83e9
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "aee57a27c09a878a1d853c426842f133a0a8ff32afeeeec1286af0e64d9e4ccd",
"cross_cats_sorted": [
"cs.DS"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DC",
"submitted_at": "2014-11-05T16:48:34Z",
"title_canon_sha256": "11c9c8f56ccea75ad6e8c8be91af6b42e94d53cc5d23470e236bf6dd0abf487b"
},
"schema_version": "1.0",
"source": {
"id": "1411.1319",
"kind": "arxiv",
"version": 1
}
}