Pith Number
pith:2OT4MC3A
pith:2017:2OT4MC3AI2SIXOFOES4JUU6HM4
not attested
not anchored
not stored
refs pending
On the Complexity of Sampling Nodes Uniformly from a Graph
arxiv:1710.08815 v1 · 2017-10-24 · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{2OT4MC3AI2SIXOFOES4JUU6HM4}
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:32:03.743468Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
d3a7c60b6046a48bb8ae24b89a53c76728bb3fb7f8b018ea9efe27801750c009
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/2OT4MC3AI2SIXOFOES4JUU6HM4 \
| 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: d3a7c60b6046a48bb8ae24b89a53c76728bb3fb7f8b018ea9efe27801750c009
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "d0e9a3ead7d3c0225b61cdbea46ae702a71927b27f4c96cba2117089e733a7b8",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2017-10-24T14:50:08Z",
"title_canon_sha256": "3cd34b4aa917c8083a3143344deec773f80f10ab657f0460cc42eced52bb6e68"
},
"schema_version": "1.0",
"source": {
"id": "1710.08815",
"kind": "arxiv",
"version": 1
}
}