Pith Number
pith:KKRWS76X
pith:2016:KKRWS76XVYPKCK4VBSGXHXKTU7
not attested
not anchored
not stored
refs pending
Approximation Algorithms for Clustering Problems with Lower Bounds and Outliers
arxiv:1608.01700 v3 · 2016-08-04 · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{KKRWS76XVYPKCK4VBSGXHXKTU7}
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-18T01:00:19.100173Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
52a3697fd7ae1ea12b950c8d73dd53a7d43df95c35099c287d1e91b28d13ecb3
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/KKRWS76XVYPKCK4VBSGXHXKTU7 \
| 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: 52a3697fd7ae1ea12b950c8d73dd53a7d43df95c35099c287d1e91b28d13ecb3
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "efed1a7e0fa9f32eed40f0f91fc79344d1f3af9df58b376fbdfb78cba954f9a8",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2016-08-04T21:12:49Z",
"title_canon_sha256": "5570c696cbb597f8674a6475e357a06b39145c7b3e6f61c0907cbfae684b1290"
},
"schema_version": "1.0",
"source": {
"id": "1608.01700",
"kind": "arxiv",
"version": 3
}
}