Pith Number
pith:XMT2IWU5
pith:2006:XMT2IWU5Y3XB43XLTVZCJWMJ7E
not attested
not anchored
not stored
refs pending
Towards a classical proof of exponential lower bound for 2-probe smooth codes
arxiv:cs/0607042 v1 · 2006-07-11 · cs.CR · cs.IT · math.IT
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{XMT2IWU5Y3XB43XLTVZCJWMJ7E}
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-07-04T15:02:52.818561Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
bb27a45a9dc6ee1e6eeb9d7224d989f93aa35d6471c3618e1f2f8b8d0a39b43d
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/XMT2IWU5Y3XB43XLTVZCJWMJ7E \
| 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: bb27a45a9dc6ee1e6eeb9d7224d989f93aa35d6471c3618e1f2f8b8d0a39b43d
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "90849ac6bed9b2059ca36754cc1c1b73787cb8e687d4df551f3cd953aac55fff",
"cross_cats_sorted": [
"cs.IT",
"math.IT"
],
"license": "",
"primary_cat": "cs.CR",
"submitted_at": "2006-07-11T02:56:28Z",
"title_canon_sha256": "7d74121e51a339d45cd733457895051abad2f9ce5b45bea19007f84b232f240e"
},
"schema_version": "1.0",
"source": {
"id": "cs/0607042",
"kind": "arxiv",
"version": 1
}
}