Pith Number
pith:RZZCDUOP
pith:2015:RZZCDUOPQJRTB6KZ5HSROJJBV2
not attested
not anchored
not stored
refs pending
A parallel algorithm for the constrained shortest path problem on lattice graphs
arxiv:1511.06441 v2 · 2015-11-19 · math.OC · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{RZZCDUOPQJRTB6KZ5HSROJJBV2}
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:28:07.430807Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
8e7221d1cf826330f959e9e5172521ae8b2ea0342a54f84d8742d06b30334cf0
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/RZZCDUOPQJRTB6KZ5HSROJJBV2 \
| 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: 8e7221d1cf826330f959e9e5172521ae8b2ea0342a54f84d8742d06b30334cf0
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "01bb8e4426dc179e70c0032e87730697db66108121a80161d6d38333ed65b39c",
"cross_cats_sorted": [
"cs.DS"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "math.OC",
"submitted_at": "2015-11-19T23:06:12Z",
"title_canon_sha256": "ecae98d30868e9394f99f27c9a559bff975ec532eb5f825186ee33eee1044d23"
},
"schema_version": "1.0",
"source": {
"id": "1511.06441",
"kind": "arxiv",
"version": 2
}
}