Pith Number
pith:6EVJGTTO
pith:2015:6EVJGTTOGM2TEUNY544N65YVTD
not attested
not anchored
not stored
refs pending
A Sampling Technique of Proving Lower Bounds for Noisy Computations
arxiv:1503.00321 v1 · 2015-03-01 · cs.CC · cs.DC
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{6EVJGTTOGM2TEUNY544N65YVTD}
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-18T02:25:54.675560Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
f12a934e6e33353251b8ef38df771598e36b38c48e226d81aa47d18d9d75ffc6
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/6EVJGTTOGM2TEUNY544N65YVTD \
| 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: f12a934e6e33353251b8ef38df771598e36b38c48e226d81aa47d18d9d75ffc6
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "82f8e68934215217fe14d7a04ce9cbff952ec51b7a4824eb8de849e6a3bc5790",
"cross_cats_sorted": [
"cs.DC"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.CC",
"submitted_at": "2015-03-01T18:14:23Z",
"title_canon_sha256": "575f79f5588d307e0a0192f96e41a611b5805a553473a93f6b72839a74cf3b7e"
},
"schema_version": "1.0",
"source": {
"id": "1503.00321",
"kind": "arxiv",
"version": 1
}
}