Pith Number
pith:YZKNKW4J
pith:2005:YZKNKW4JF7Z6PS6NZQUOUOMFPI
not attested
not anchored
not stored
refs pending
The computational complexity of Kauffman nets and the P versus NP problem
arxiv:cond-mat/0510840 v1 · 2005-10-31 · cond-mat.dis-nn · cond-mat.stat-mech
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{YZKNKW4JF7Z6PS6NZQUOUOMFPI}
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-18T03:24:31.822185Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
c654d55b892ff3e7cbcdcc28ea39857a1170d914753e1d8e3e9212e9e565727f
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/YZKNKW4JF7Z6PS6NZQUOUOMFPI \
| 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: c654d55b892ff3e7cbcdcc28ea39857a1170d914753e1d8e3e9212e9e565727f
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "216f916c053cd147541c02ef957e348efaaf7348ae5237026bec4a2d788f1064",
"cross_cats_sorted": [
"cond-mat.stat-mech"
],
"license": "",
"primary_cat": "cond-mat.dis-nn",
"submitted_at": "2005-10-31T16:41:16Z",
"title_canon_sha256": "b00423ddb34049bc79d493c29ad2d2360431d25be0a958cf6ad2a688bf78f1a6"
},
"schema_version": "1.0",
"source": {
"id": "cond-mat/0510840",
"kind": "arxiv",
"version": 1
}
}