Pith Number
pith:4M6M7IXD
pith:2025:4M6M7IXDYL5OA2GUEW2YJTNIE4
not attested
not anchored
not stored
refs pending
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem
arxiv:2507.14089 v1 · 2025-07-18 · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{4M6M7IXDYL5OA2GUEW2YJTNIE4}
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-05T11:39:28.584465Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
e33ccfa2e3c2fae068d425b584cda827367b62ff0b2325191516c0472c7fdc21
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/4M6M7IXDYL5OA2GUEW2YJTNIE4 \
| 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: e33ccfa2e3c2fae068d425b584cda827367b62ff0b2325191516c0472c7fdc21
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "a6af7326c9296c259f626e47a0919fa3fdf321c3bc7446b2a8a585f7c973d6c1",
"cross_cats_sorted": [],
"license": "http://creativecommons.org/licenses/by/4.0/",
"primary_cat": "cs.DS",
"submitted_at": "2025-07-18T17:13:36Z",
"title_canon_sha256": "f24ff0bf540a8d3eb6d40a1518eae7662838e00bef3b661c19a875fc0052d19a"
},
"schema_version": "1.0",
"source": {
"id": "2507.14089",
"kind": "arxiv",
"version": 1
}
}