Pith Number
pith:FYSSB6XS
pith:2013:FYSSB6XSQ63OOBOJ4JWUPGYKXW
not attested
not anchored
not stored
refs pending
A complexity theorem for the Novelli-Pak-Stoyanovskii algorithm
arxiv:1306.5134 v2 · 2013-06-21 · math.CO
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{FYSSB6XSQ63OOBOJ4JWUPGYKXW}
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:53:40.906165Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
2e2520faf287b6e705c9e26d479b0abd87f7b5724c79aad1d35c5fa4d9cd382b
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/FYSSB6XSQ63OOBOJ4JWUPGYKXW \
| 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: 2e2520faf287b6e705c9e26d479b0abd87f7b5724c79aad1d35c5fa4d9cd382b
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "ee020eceababe05edfd305e8e1c52fc931b77d1d525aa59c99a8acfdaad22942",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "math.CO",
"submitted_at": "2013-06-21T13:26:37Z",
"title_canon_sha256": "b4568efa5d245a40b22e5cc20e059c0311237d8a0ca230a13db454b2a97d0acc"
},
"schema_version": "1.0",
"source": {
"id": "1306.5134",
"kind": "arxiv",
"version": 2
}
}