Pith Number
pith:MUHDF3UN
pith:2013:MUHDF3UNCVGHV2BE4D73SWMYTL
not attested
not anchored
not stored
refs pending
A New Method to Compute the 2-adic Complexity of Binary Sequences
arxiv:1309.1625 v1 · 2013-09-06 · cs.CR
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{MUHDF3UNCVGHV2BE4D73SWMYTL}
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:13:59.002028Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
650e32ee8d154c7ae824e0ffb959989af47ada048a8407bf3ee8a1e25cb5fc8f
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/MUHDF3UNCVGHV2BE4D73SWMYTL \
| 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: 650e32ee8d154c7ae824e0ffb959989af47ada048a8407bf3ee8a1e25cb5fc8f
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "66d92d3f960915d35f0a7b4113614bb7dfb356f631a8b7770f4b687657115ce8",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.CR",
"submitted_at": "2013-09-06T12:57:35Z",
"title_canon_sha256": "57422239ff2f4fc3bdc6b323bea296b5739f6863f554b071c306c9b632643c82"
},
"schema_version": "1.0",
"source": {
"id": "1309.1625",
"kind": "arxiv",
"version": 1
}
}