Pith Number
pith:5R5IFLMJ
pith:2023:5R5IFLMJSLWV32ZVB73TUQ5VGM
not attested
not anchored
not stored
refs pending
KD-Club: An Efficient Exact Algorithm with New Coloring-based Upper Bound for the Maximum k-Defective Clique Problem
arxiv:2308.07235 v2 · 2023-08-14 · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{5R5IFLMJSLWV32ZVB73TUQ5VGM}
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-05T07:31:54.086442Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
ec7a82ad8992ed5deb350ff73a43b5332b281079c770c6072ee01133ebf92e19
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/5R5IFLMJSLWV32ZVB73TUQ5VGM \
| 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: ec7a82ad8992ed5deb350ff73a43b5332b281079c770c6072ee01133ebf92e19
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "fded0b5f20c760ccaaa7761e4c0dd8dbbd4476eb582faea3ff8ced2ab7fa1a8e",
"cross_cats_sorted": [],
"license": "http://creativecommons.org/licenses/by/4.0/",
"primary_cat": "cs.DS",
"submitted_at": "2023-08-14T16:17:29Z",
"title_canon_sha256": "bee6bc3787feee6ef1d6bf7d5e0d78949bdaed4dd87aaa3ee7c947fc791f97c2"
},
"schema_version": "1.0",
"source": {
"id": "2308.07235",
"kind": "arxiv",
"version": 2
}
}