Pith Number
pith:PS4YDYQL
pith:2016:PS4YDYQL4RKVBN3HRWHT4VDF7O
not attested
not anchored
not stored
refs pending
A 17/12-Approximation Algorithm for 2-Vertex-Connected Spanning Subgraphs on Graphs with Minimum Degree At Least 3
arxiv:1612.04790 v2 · 2016-12-14 · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{PS4YDYQL4RKVBN3HRWHT4VDF7O}
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:52:37.221002Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
7cb981e20be45550b7678d8f3e5465fb94eba2b0385bc900770371349cf64121
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/PS4YDYQL4RKVBN3HRWHT4VDF7O \
| 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: 7cb981e20be45550b7678d8f3e5465fb94eba2b0385bc900770371349cf64121
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "f3493e04cb4ec2f42e53c99b57a4d3f7aadeb57cd7f1e392434d7f8c37ccf9c7",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2016-12-14T20:07:40Z",
"title_canon_sha256": "0e58e78c300704247c98b7018f498acbe8510610343543cbe87b9022e694c8b0"
},
"schema_version": "1.0",
"source": {
"id": "1612.04790",
"kind": "arxiv",
"version": 2
}
}