Pith Number
pith:OX3PLYV2
pith:2005:OX3PLYV2GCDZHB4LIB3IUA2VWO
not attested
not anchored
not stored
refs pending
A polynomial algorithm for the k-cluster problem on interval graphs
arxiv:cs/0512046 v3 · 2005-12-11 · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{OX3PLYV2GCDZHB4LIB3IUA2VWO}
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-18T04:08:54.144885Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
75f6f5e2ba308793878b40768a0355b3b266097829cc557ff4391ed88ad734ee
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/OX3PLYV2GCDZHB4LIB3IUA2VWO \
| 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: 75f6f5e2ba308793878b40768a0355b3b266097829cc557ff4391ed88ad734ee
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "a5edbbc4ebb336edff0e71e20641291995b75e97526ac07f1fce8dbf6ac24394",
"cross_cats_sorted": [],
"license": "",
"primary_cat": "cs.DS",
"submitted_at": "2005-12-11T23:13:44Z",
"title_canon_sha256": "496cecb473fe908143b1b450cb27bc23767b1a146ff0be846562bd6501e8ad59"
},
"schema_version": "1.0",
"source": {
"id": "cs/0512046",
"kind": "arxiv",
"version": 3
}
}