Pith Number
pith:GJVVOERL
pith:2018:GJVVOERLIGE4T3FHCD3E27QQTV
not attested
not anchored
not stored
refs pending
Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
arxiv:1808.02901 v1 · 2018-08-08 · math.OC
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{GJVVOERLIGE4T3FHCD3E27QQTV}
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:08:30.697228Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
326b57122b4189c9eca710f64d7e109d54fb002dd4d4a862ffec420b84c12628
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/GJVVOERLIGE4T3FHCD3E27QQTV \
| 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: 326b57122b4189c9eca710f64d7e109d54fb002dd4d4a862ffec420b84c12628
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "2ddffb7dbd4371488dc6280136b5a90966ab540799e60dc1f774006750378ae8",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "math.OC",
"submitted_at": "2018-08-08T18:04:13Z",
"title_canon_sha256": "25151ce4963869c425aed3150216aca1e2c5d607bf068e9efc13082fd87e796a"
},
"schema_version": "1.0",
"source": {
"id": "1808.02901",
"kind": "arxiv",
"version": 1
}
}