Pith Number
pith:BV4QHA3T
pith:2017:BV4QHA3TRZWNI56Z5PTXW24LX7
not attested
not anchored
not stored
refs pending
Fine-Grained I/O Complexity via Reductions: New lower bounds, faster algorithms, and a time hierarchy
arxiv:1711.07960 v3 · 2017-11-21 · cs.DS · cs.CC
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{BV4QHA3TRZWNI56Z5PTXW24LX7}
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:28:51.544601Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
0d790383738e6cd477d9ebe77b6b8bbfe9fa03926923afdd4aae1ac6191b372f
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/BV4QHA3TRZWNI56Z5PTXW24LX7 \
| 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: 0d790383738e6cd477d9ebe77b6b8bbfe9fa03926923afdd4aae1ac6191b372f
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "cac90392a765d52a661e9fbe598967c4d200c245161ea46ba3299f5e10208de5",
"cross_cats_sorted": [
"cs.CC"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2017-11-21T18:37:27Z",
"title_canon_sha256": "da506d6e956abd01c574a4bef6a865a3a7c3a43a8465dcbf301465b1aa13cb88"
},
"schema_version": "1.0",
"source": {
"id": "1711.07960",
"kind": "arxiv",
"version": 3
}
}