Pith Number
pith:NHCOW327
pith:2017:NHCOW327AFF4BRMWH7S5IOM6N3
not attested
not anchored
not stored
refs pending
Nearly Work-Efficient Parallel Algorithm for Digraph Reachability
arxiv:1711.01700 v1 · 2017-11-06 · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{NHCOW327AFF4BRMWH7S5IOM6N3}
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:31:17.097492Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
69c4eb6f5f014bc0c5963fe5d4399e6ef5582aa9b310e68715a582967111b6e1
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/NHCOW327AFF4BRMWH7S5IOM6N3 \
| 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: 69c4eb6f5f014bc0c5963fe5d4399e6ef5582aa9b310e68715a582967111b6e1
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "a1d774e1494c09c1a51b2d665896fb803b4386aba975381f623c5f9889581336",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2017-11-06T02:44:03Z",
"title_canon_sha256": "0d3e4ccd13e54bd3bfbb2730a165160966844583ae3a05f8e4b442008b093097"
},
"schema_version": "1.0",
"source": {
"id": "1711.01700",
"kind": "arxiv",
"version": 1
}
}