Pith Number
pith:5QTCGDKL
pith:2018:5QTCGDKLY32F2EMPOMSWW4TOFR
not attested
not anchored
not stored
refs pending
Efficient online algorithms for fast-rate regret bounds under sparsity
arxiv:1805.09174 v1 · 2018-05-23 · math.ST · cs.LG · stat.TH
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{5QTCGDKLY32F2EMPOMSWW4TOFR}
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-18T00:15:08.300274Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
ec26230d4bc6f45d118f73256b726e2c655856e7e707dca7f8d16271795f676e
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/5QTCGDKLY32F2EMPOMSWW4TOFR \
| 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: ec26230d4bc6f45d118f73256b726e2c655856e7e707dca7f8d16271795f676e
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "74dc177b37dc4c17ba118c9ef47608ebea06e6a2dd3954009f151c98b0832d78",
"cross_cats_sorted": [
"cs.LG",
"stat.TH"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "math.ST",
"submitted_at": "2018-05-23T13:49:11Z",
"title_canon_sha256": "a2de9b67eb1110f2e94cad137a806a517c9f6b071679ecb6e98e7808b242c9b5"
},
"schema_version": "1.0",
"source": {
"id": "1805.09174",
"kind": "arxiv",
"version": 1
}
}