Pith Number
pith:MJL3IUOZ
pith:2001:MJL3IUOZBKJ5S7OHZEZP4SWJCC
not attested
not anchored
not stored
refs pending
Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP
arxiv:cs/0110025 v2 · 2001-10-10 · cs.CC
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{MJL3IUOZBKJ5S7OHZEZP4SWJCC}
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-18T01:09:08.424527Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
6257b451d90a93d97dc7c932fe4ac910861c836b115c9e1f97753d1ceacd7732
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/MJL3IUOZBKJ5S7OHZEZP4SWJCC \
| 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: 6257b451d90a93d97dc7c932fe4ac910861c836b115c9e1f97753d1ceacd7732
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "1edb022821f4f9d308819e2d16707802aa85a416e945b3a7ee70d8ed83708d81",
"cross_cats_sorted": [],
"license": "",
"primary_cat": "cs.CC",
"submitted_at": "2001-10-10T15:02:35Z",
"title_canon_sha256": "89896e61a4d2624a04d44e750c790326f49f70d4c9f32cec8c77b24ab52d4624"
},
"schema_version": "1.0",
"source": {
"id": "cs/0110025",
"kind": "arxiv",
"version": 2
}
}