Pith Number
pith:R74OOINW
pith:2013:R74OOINWPRYES5JPB5VX5IIY5D
not attested
not anchored
not stored
refs pending
On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods
arxiv:1303.4375 v1 · 2013-03-18 · cs.IT · math.IT
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{R74OOINWPRYES5JPB5VX5IIY5D}
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-18T03:30:38.730232Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
8ff8e721b67c7049752f0f6b7ea118e8c5402aae9dba21b65c5613747f7d6fdd
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/R74OOINWPRYES5JPB5VX5IIY5D \
| 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: 8ff8e721b67c7049752f0f6b7ea118e8c5402aae9dba21b65c5613747f7d6fdd
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "dba920e2d25316a8d9cc783d3f08c66a572e8d25ebf2a4e02cdd4118121c579c",
"cross_cats_sorted": [
"math.IT"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.IT",
"submitted_at": "2013-03-18T19:42:10Z",
"title_canon_sha256": "328013de2b69c9e7a2e4146a752290f974a057a35554554db52427765dc02a9a"
},
"schema_version": "1.0",
"source": {
"id": "1303.4375",
"kind": "arxiv",
"version": 1
}
}