Pith Number
pith:BVLR74A7
pith:2019:BVLR74A7FZ6NLUXOXSJ3DDNYDY
not attested
not anchored
not stored
refs pending
A New Fast Unweighted All-pairs Shortest Path Search Algorithm Based on Pruning by Shortest Path Trees
arxiv:1908.06806 v1 · 2019-08-19 · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{BVLR74A7FZ6NLUXOXSJ3DDNYDY}
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-07-04T23:58:19.549567Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
0d571ff01f2e7cd5d2eebc93b18db81e1c64aaf7d66597677a106cbf4f9efc71
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/BVLR74A7FZ6NLUXOXSJ3DDNYDY \
| 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: 0d571ff01f2e7cd5d2eebc93b18db81e1c64aaf7d66597677a106cbf4f9efc71
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "d4c394b55f545656986f5650931aae67dff29410e5f6650426c1d00ba25f60c1",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2019-08-19T13:55:35Z",
"title_canon_sha256": "04a740d950ec7ea93f97d1070e5c45b90276b985e74b995d014e6ba0d6a72b01"
},
"schema_version": "1.0",
"source": {
"id": "1908.06806",
"kind": "arxiv",
"version": 1
}
}