Pith Number
pith:HFWUQBMG
pith:2023:HFWUQBMGQ2NCRRB2NON6DA6FTS
not attested
not anchored
not stored
refs pending
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results
arxiv:2306.03640 v1 · 2023-05-26 · cs.CC · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{HFWUQBMGQ2NCRRB2NON6DA6FTS}
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-07-05T06:18:00.552960Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
396d480586869a28c43a6b9be183c59ca2e0ac90b0d6de08411af55d381c1cdc
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/HFWUQBMGQ2NCRRB2NON6DA6FTS \
| 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: 396d480586869a28c43a6b9be183c59ca2e0ac90b0d6de08411af55d381c1cdc
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "328b04b6b418ea5771b820fbff4e8a8d9a2ffc80e6d2af9947e0c1c0c6c0db64",
"cross_cats_sorted": [
"cs.DS"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.CC",
"submitted_at": "2023-05-26T09:26:10Z",
"title_canon_sha256": "b0c77878508725a6f53c131e19f837332188f6e4610991e87ab90c0b7c663f2e"
},
"schema_version": "1.0",
"source": {
"id": "2306.03640",
"kind": "arxiv",
"version": 1
}
}