Pith Number
pith:DWW3PQD3
pith:2011:DWW3PQD3XDWEEBTLL6YSTFVBRF
not attested
not anchored
not stored
refs pending
Combinatorial Batch Codes: A Lower Bound and Optimal Constructions
arxiv:1102.4951 v1 · 2011-02-24 · cs.DM · math.CO
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{DWW3PQD3XDWEEBTLL6YSTFVBRF}
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.
Cited by
Receipt and verification
| First computed | 2026-05-18T04:27:57.696557Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
1dadb7c07bb8ec42066b5fb12996a1894ce7b554dd81b5a2021b4adb66f0c724
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/DWW3PQD3XDWEEBTLL6YSTFVBRF \
| 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: 1dadb7c07bb8ec42066b5fb12996a1894ce7b554dd81b5a2021b4adb66f0c724
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "23f4abc63cfce8b96b922b4e1109f2f01211886ab3040154e665c1cc5f6a0327",
"cross_cats_sorted": [
"math.CO"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DM",
"submitted_at": "2011-02-24T10:39:46Z",
"title_canon_sha256": "50b5f78c98b91ecb92f7693d4040951ca0f3fc9b693e3fb1906b13fbc8f43fb8"
},
"schema_version": "1.0",
"source": {
"id": "1102.4951",
"kind": "arxiv",
"version": 1
}
}