Pith Number
pith:ZJUSDZZM
pith:2010:ZJUSDZZMJDV3NPGKKMQIONB76I
not attested
not anchored
not stored
refs pending
Prunnig Algorithm of Generation a Minimal Set of Rule Reducts Based on Rough Set Theory
arxiv:1011.0190 v1 · 2010-10-31 · cs.AI
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{ZJUSDZZMJDV3NPGKKMQIONB76I}
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-18T02:23:38.016855Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
ca6921e72c48ebb6bcca532087343ff21f4c109e7443c62cf4fe3c670d9c7251
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/ZJUSDZZMJDV3NPGKKMQIONB76I \
| 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: ca6921e72c48ebb6bcca532087343ff21f4c109e7443c62cf4fe3c670d9c7251
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "430f19aeddec8be9d11e800178f37eb2549980d8c547757ee755e4cadef3e7df",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.AI",
"submitted_at": "2010-10-31T18:46:50Z",
"title_canon_sha256": "7c9d0b99d02f3cc91947448b8b4c8d98d9627dc2a7b616d1672e44a0b4f7ef62"
},
"schema_version": "1.0",
"source": {
"id": "1011.0190",
"kind": "arxiv",
"version": 1
}
}