Pith Number
pith:4C63H4JC
pith:2016:4C63H4JCKFQKPM6PQ2HCXBARKZ
not attested
not anchored
not stored
refs pending
A fast modulo primes algorithm for searching perfect cuboids and its implementation
arxiv:1601.00636 v1 · 2016-01-04 · math.NT
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{4C63H4JCKFQKPM6PQ2HCXBARKZ}
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-18T01:23:26.895789Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
e0bdb3f1225160a7b3cf868e2b8411567987b573a7b3839b49456245e816558d
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/4C63H4JCKFQKPM6PQ2HCXBARKZ \
| 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: e0bdb3f1225160a7b3cf868e2b8411567987b573a7b3839b49456245e816558d
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "b8c14c2d64acb2ddfd0b85efe834cbcd33d17db1290c5e908b56845ee2bccb81",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "math.NT",
"submitted_at": "2016-01-04T20:45:19Z",
"title_canon_sha256": "c1324b60bd2cef95a9a8e002bfa0925f7f435969c6ab24cad3024136ced56637"
},
"schema_version": "1.0",
"source": {
"id": "1601.00636",
"kind": "arxiv",
"version": 1
}
}