Pith Number
pith:EZ7RLXIJ
pith:2017:EZ7RLXIJRTOJDZRMEGYINK27GA
not attested
not anchored
not stored
refs pending
The Complexity of Maximum $k$-Order Bounded Component Set Problem
arxiv:1712.02870 v3 · 2017-11-29 · cs.DS · cs.DM
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{EZ7RLXIJRTOJDZRMEGYINK27GA}
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-18T00:19:56.648506Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
267f15dd098cdc91e62c21b086ab5f301a902008773e8dcf23a2fc68d9da7a4c
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/EZ7RLXIJRTOJDZRMEGYINK27GA \
| 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: 267f15dd098cdc91e62c21b086ab5f301a902008773e8dcf23a2fc68d9da7a4c
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "03819b853c8208593d0e6d4d752f763c5ff6293a7ffbd4aa69c67b740ef33275",
"cross_cats_sorted": [
"cs.DM"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2017-11-29T09:52:09Z",
"title_canon_sha256": "e04c05b46652d88852344fb0ea192eaf87917222fe0c138db1624de04bc752b8"
},
"schema_version": "1.0",
"source": {
"id": "1712.02870",
"kind": "arxiv",
"version": 3
}
}