Pith Number
pith:C3PQPGFL
pith:2004:C3PQPGFL6XPCNWHH7EXN4CEUAZ
not attested
not anchored
not stored
refs pending
Lower bounds on the Deterministic and Quantum Communication Complexity of Hamming Distance
arxiv:cs/0411076 v2 · 2004-11-20 · cs.CC · quant-ph
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{C3PQPGFL6XPCNWHH7EXN4CEUAZ}
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:29:37.203494Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
16df0798abf5de26d8e7f92ede08940663206f118fc17629b15a3e07ed9c488c
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/C3PQPGFL6XPCNWHH7EXN4CEUAZ \
| 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: 16df0798abf5de26d8e7f92ede08940663206f118fc17629b15a3e07ed9c488c
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "2521a79e1628e9c707463913af7313bf2b5c737be6b5140e866d2518d4c2ecbd",
"cross_cats_sorted": [
"quant-ph"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.CC",
"submitted_at": "2004-11-20T19:55:19Z",
"title_canon_sha256": "de8a1fe868953f30a5f8a096e7628d4014c8d241f3183a3300f672ab0d11f1ba"
},
"schema_version": "1.0",
"source": {
"id": "cs/0411076",
"kind": "arxiv",
"version": 2
}
}