Pith Number
pith:O3YYIBU2
pith:2024:O3YYIBU2R2M5UI55N3XEN42OVV
not attested
not anchored
not stored
refs pending
A Scalable Algorithm for Individually Fair K-means Clustering
arxiv:2402.06730 v1 · 2024-02-09 · cs.DS · cs.CY · cs.LG
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{O3YYIBU2R2M5UI55N3XEN42OVV}
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.
Cited by
Receipt and verification
| First computed | 2026-07-05T07:44:46.609762Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
76f184069a8e99da23bd6eee46f34ead70d6c2e649c3206526e6d3787b3de9c6
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/O3YYIBU2R2M5UI55N3XEN42OVV \
| 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: 76f184069a8e99da23bd6eee46f34ead70d6c2e649c3206526e6d3787b3de9c6
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "2e42486dd219957b2783721b673166b4d347d8770ce872747079e7de0651234c",
"cross_cats_sorted": [
"cs.CY",
"cs.LG"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"primary_cat": "cs.DS",
"submitted_at": "2024-02-09T19:01:48Z",
"title_canon_sha256": "7dc9d835a2b0997eddb581e05553b32a017c5048bbed5941c7b95f0f66d7276a"
},
"schema_version": "1.0",
"source": {
"id": "2402.06730",
"kind": "arxiv",
"version": 1
}
}