Pith Number
pith:57IIDYZ4
pith:2018:57IIDYZ4SKIV5WQUYPSL3VXRR6
not attested
not anchored
not stored
refs pending
$O(\log^2k/\log\log{k})$-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm
arxiv:1811.03020 v1 · 2018-11-07 · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{57IIDYZ4SKIV5WQUYPSL3VXRR6}
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:01:20.127328Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
efd081e33c92915eda14c3e4bdd6f18fb62dcc7e97b26020953178b492e20b34
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/57IIDYZ4SKIV5WQUYPSL3VXRR6 \
| 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: efd081e33c92915eda14c3e4bdd6f18fb62dcc7e97b26020953178b492e20b34
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "9c957a0f1263f74fbd737ac734d6fe0af8e2e4120e88a5ed5789252d61f2a350",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2018-11-07T17:12:46Z",
"title_canon_sha256": "ceb8afd0569bf6ff7ec41598897ff57fb6f5baab5e2f88a7309134160d900faf"
},
"schema_version": "1.0",
"source": {
"id": "1811.03020",
"kind": "arxiv",
"version": 1
}
}