Pith Number
pith:5JSJDPVX
pith:2017:5JSJDPVX4XZGTCTVGW7UGI5O37
not attested
not anchored
not stored
refs pending
Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs
arxiv:1705.10709 v1 · 2017-05-30 · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{5JSJDPVX4XZGTCTVGW7UGI5O37}
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:43:23.720297Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
ea6491beb7e5f2698a7535bf4323aedfc8f322e38f7c5f06f7a024c74dd788bb
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/5JSJDPVX4XZGTCTVGW7UGI5O37 \
| 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: ea6491beb7e5f2698a7535bf4323aedfc8f322e38f7c5f06f7a024c74dd788bb
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "de8b2bd88738144ad3f3236c31825041f75ed6f72a9c9d22ef1399ef7ec97f9b",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2017-05-30T15:46:20Z",
"title_canon_sha256": "aecaf729cf165925e5247cf33b940e1f298923db19243afe83433e7588805f52"
},
"schema_version": "1.0",
"source": {
"id": "1705.10709",
"kind": "arxiv",
"version": 1
}
}