Pith Number
pith:JA6DRDOK
pith:2015:JA6DRDOKWN4D23VL4ZGU3D6PO2
not attested
not anchored
not stored
refs pending
Exploiting Reduction Rules and Data Structures: Local Search for Minimum Vertex Cover in Massive Graphs
arxiv:1509.05870 v1 · 2015-09-19 · cs.DS · cs.AI
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{JA6DRDOKWN4D23VL4ZGU3D6PO2}
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:32:36.479099Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
483c388dcab3783d6eabe64d4d8fcf76a045c874efafd4283d1119d67eee2731
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/JA6DRDOKWN4D23VL4ZGU3D6PO2 \
| 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: 483c388dcab3783d6eabe64d4d8fcf76a045c874efafd4283d1119d67eee2731
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "d20cc6f914b3a43fb0e1e8f66f995de3ee16e2c267536cd6984197fff55f9807",
"cross_cats_sorted": [
"cs.AI"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2015-09-19T10:48:31Z",
"title_canon_sha256": "3d5229672e111f4315d94c4d6f044d6be058a26932aac758acd52e990eb53760"
},
"schema_version": "1.0",
"source": {
"id": "1509.05870",
"kind": "arxiv",
"version": 1
}
}