Pith Number
pith:2RDVRQAT
pith:2014:2RDVRQAT6SYRI6JY6HQM72IUFT
not attested
not anchored
not stored
refs pending
Better Approximation Algorithms for Maximum Asymmetric Traveling Salesman and Shortest Superstring
arxiv:1401.3670 v1 · 2014-01-15 · cs.DS · cs.DM
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{2RDVRQAT6SYRI6JY6HQM72IUFT}
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-18T03:02:08.001132Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
d44758c013f4b1147938f1e0cfe9142cc47ea8eff05a5108285cf1467005d555
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/2RDVRQAT6SYRI6JY6HQM72IUFT \
| 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: d44758c013f4b1147938f1e0cfe9142cc47ea8eff05a5108285cf1467005d555
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "de4cf9cba796cca0f057920ac20d307ded513a46c2473cdd35a43e4b433892f6",
"cross_cats_sorted": [
"cs.DM"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2014-01-15T17:02:40Z",
"title_canon_sha256": "4f771641df3d913c0b0b12983c58fb7230baf0c7b18cdff8bc01fdb01cef20a8"
},
"schema_version": "1.0",
"source": {
"id": "1401.3670",
"kind": "arxiv",
"version": 1
}
}