Pith Number
pith:W7PRK4D5
pith:2013:W7PRK4D52BHZ3WENVH3XU5TCZQ
not attested
not anchored
not stored
refs pending
An $O^*(1.0821^n)$-Time Algorithm for Computing Maximum Independent Set in Graphs with Bounded Degree 3
arxiv:1308.1351 v4 · 2013-08-06 · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{W7PRK4D52BHZ3WENVH3XU5TCZQ}
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.
Cited by
Receipt and verification
| First computed | 2026-07-05T04:32:35.759520Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
b7df15707dd04f9dd88da9f77a7662cc229555dc059054d1b351f8d8f6acae3e
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/W7PRK4D52BHZ3WENVH3XU5TCZQ \
| 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: b7df15707dd04f9dd88da9f77a7662cc229555dc059054d1b351f8d8f6acae3e
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "ccf1afafc3f1927020c5212f090056f940623cdf9c2c7c8dc2e9a865fa19fe7a",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2013-08-06T17:08:50Z",
"title_canon_sha256": "8e2de0c00b92925162c28cebe04632bee2fcc028fc53646ae5f09cd821bc19d6"
},
"schema_version": "1.0",
"source": {
"id": "1308.1351",
"kind": "arxiv",
"version": 4
}
}