Pith Number
pith:CV5T7JD7
pith:2011:CV5T7JD7V4PNHTFJFKFFKFTJ5L
not attested
not anchored
not stored
refs pending
Approximation Algorithms and Hardness of the k-Route Cut Problem
arxiv:1112.3611 v2 · 2011-12-15 · cs.DS · cs.CC
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{CV5T7JD7V4PNHTFJFKFFKFTJ5L}
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:21:27.195444Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
157b3fa47faf1ed3cca92a8a551669eac71ce4ceec11c5d76519d426b9dbe822
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/CV5T7JD7V4PNHTFJFKFFKFTJ5L \
| 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: 157b3fa47faf1ed3cca92a8a551669eac71ce4ceec11c5d76519d426b9dbe822
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "e10b4608e87e4401af4cc3fcdd1b1ad8b254a33f7022b9629950cbb71fc7b451",
"cross_cats_sorted": [
"cs.CC"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2011-12-15T19:11:56Z",
"title_canon_sha256": "dfcd164cd2f9203eda86092a2cc50f4034c36388154e6cd69dff042eb0832110"
},
"schema_version": "1.0",
"source": {
"id": "1112.3611",
"kind": "arxiv",
"version": 2
}
}