Pith Number
pith:2UDHCBFQ
pith:2026:2UDHCBFQUAD25G2CMVNJCDCH7P
not attested
not anchored
not stored
refs pending
Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs
arxiv:2605.27998 v1 · 2026-05-27 · cs.DS · cs.DM
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{2UDHCBFQUAD25G2CMVNJCDCH7P}
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-28T01:04:55.632829Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
d5067104b0a007ae9b42655a910c47fbd8a9413a1909540a5d58718979efb0f4
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/2UDHCBFQUAD25G2CMVNJCDCH7P \
| 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: d5067104b0a007ae9b42655a910c47fbd8a9413a1909540a5d58718979efb0f4
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "7927130626abecd87a7e5559416c54ec01205ebcf89a7bbc84c0519d03eeb9a3",
"cross_cats_sorted": [
"cs.DM"
],
"license": "http://creativecommons.org/licenses/by-nc-nd/4.0/",
"primary_cat": "cs.DS",
"submitted_at": "2026-05-27T05:41:29Z",
"title_canon_sha256": "393f3185045749f042a844b3f1be3625a06e574dfe4376aa4141f20d6417b092"
},
"schema_version": "1.0",
"source": {
"id": "2605.27998",
"kind": "arxiv",
"version": 1
}
}