Pith Number
pith:2B2QZ432
pith:2015:2B2QZ432PPSPJWU5HKCGSGSGUT
not attested
not anchored
not stored
refs pending
An $O(n^{\epsilon})$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs
arxiv:1501.05828 v1 · 2015-01-23 · cs.DS · cs.CC
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{2B2QZ432PPSPJWU5HKCGSGSGUT}
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:28:48.875610Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
d0750cf37a7be4f4da9d3a84691a46a4e8c32b2b009bd8e3ca4abb1251f623fb
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/2B2QZ432PPSPJWU5HKCGSGSGUT \
| 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: d0750cf37a7be4f4da9d3a84691a46a4e8c32b2b009bd8e3ca4abb1251f623fb
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "fe7f74ddd7fcd9844480384a477e10875d4e99110e718c08cd17e1197a540d38",
"cross_cats_sorted": [
"cs.CC"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2015-01-23T15:23:25Z",
"title_canon_sha256": "e9c7215baeea4bad3ebf8f66d6757dd8c886fcf14596151753c7887093d5f0e1"
},
"schema_version": "1.0",
"source": {
"id": "1501.05828",
"kind": "arxiv",
"version": 1
}
}