Pith Number
pith:332UOK6I
pith:2011:332UOK6IV7S4V7LZNAOSLLFDDY
not attested
not anchored
not stored
refs pending
Efficient calculation of the worst-case error and (fast) component-by-component construction of higher order polynomial lattice rules
arxiv:1105.2599 v2 · 2011-05-13 · math.NA
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{332UOK6IV7S4V7LZNAOSLLFDDY}
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:15:45.622544Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
def5472bc8afe5cafd79681d25aca31e06a208844dcbfe9e78d04eeb8a96aa69
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/332UOK6IV7S4V7LZNAOSLLFDDY \
| 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: def5472bc8afe5cafd79681d25aca31e06a208844dcbfe9e78d04eeb8a96aa69
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "1e0ad5a932d3afee07b299c3ae56a0815041eadd8561d1b81479dda202afcfca",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "math.NA",
"submitted_at": "2011-05-13T02:31:20Z",
"title_canon_sha256": "87b3a0475dadf729683cba11fccacdab6dfa9da0177f8c1026f5ab0cf253cfe2"
},
"schema_version": "1.0",
"source": {
"id": "1105.2599",
"kind": "arxiv",
"version": 2
}
}