Pith Number
pith:IHPBQUIM
pith:2018:IHPBQUIMJUGTXHGJWVVVTAYALO
not attested
not anchored
not stored
refs pending
Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm
arxiv:1806.07586 v1 · 2018-06-20 · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{IHPBQUIMJUGTXHGJWVVVTAYALO}
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:12:47.276989Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
41de18510c4d0d3b9cc9b56b5983005b9859323f9c108e6b8dd8aa497b2ece00
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/IHPBQUIMJUGTXHGJWVVVTAYALO \
| 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: 41de18510c4d0d3b9cc9b56b5983005b9859323f9c108e6b8dd8aa497b2ece00
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "94154fbd39d208922f59b5aa19b5694625d642cda0e42e84d0d4e67747293cf0",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2018-06-20T07:26:37Z",
"title_canon_sha256": "bae3b9dbe1fde5b558f8959ab53842653963487a1fde1d06da0f0da98ab8c0b4"
},
"schema_version": "1.0",
"source": {
"id": "1806.07586",
"kind": "arxiv",
"version": 1
}
}