Pith Number
pith:PXIQLDPW
pith:2021:PXIQLDPWQNYVKYZNVJHJ7B4VAA
not attested
not anchored
not stored
refs pending
Current Algorithms for Detecting Subgraphs of Bounded Treewidth are Probably Optimal
arxiv:2105.05062 v1 · 2021-05-11 · cs.DS · cs.CC
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{PXIQLDPWQNYVKYZNVJHJ7B4VAA}
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-05T02:39:27.723871Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
7dd1058df6837155632daa4e9f87950011a4525c0a3234678f84392fa54c00a5
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/PXIQLDPWQNYVKYZNVJHJ7B4VAA \
| 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: 7dd1058df6837155632daa4e9f87950011a4525c0a3234678f84392fa54c00a5
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "577f59aaefbe0066267f93620e4757f107e8a0ec0297b2ed0d8edccdc2f10e89",
"cross_cats_sorted": [
"cs.CC"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"primary_cat": "cs.DS",
"submitted_at": "2021-05-11T14:12:43Z",
"title_canon_sha256": "68ecadd820f9f41e99ec737599abd411ba1e35c3a8f1592895e5663b9ee9f33e"
},
"schema_version": "1.0",
"source": {
"id": "2105.05062",
"kind": "arxiv",
"version": 1
}
}