Pith Number
pith:NUBJR5P3
pith:2006:NUBJR5P3PMHQSLHJHV5QBWEADM
not attested
not anchored
not stored
refs pending
The one-way communication complexity of the Boolean Hidden Matching Problem
arxiv:quant-ph/0607173 v1 · 2006-07-25 · quant-ph · cs.CC
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{NUBJR5P3PMHQSLHJHV5QBWEADM}
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.
Cited by
Receipt and verification
| First computed | 2026-07-04T14:56:14.535139Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
6d0298f5fb7b0f092ce93d7b00d8801b1dfe6e4cf7a3aa6de27a13d419dc8932
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/NUBJR5P3PMHQSLHJHV5QBWEADM \
| 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: 6d0298f5fb7b0f092ce93d7b00d8801b1dfe6e4cf7a3aa6de27a13d419dc8932
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "a8b45b2a996ec205867736689ad68ea3de4b0c10a23019c4f5ce67a608103f53",
"cross_cats_sorted": [
"cs.CC"
],
"license": "",
"primary_cat": "quant-ph",
"submitted_at": "2006-07-25T10:07:29Z",
"title_canon_sha256": "62d8cc3ec4879d3e95817130c914b0410dc22e3c97365dee2db64d7775c14578"
},
"schema_version": "1.0",
"source": {
"id": "quant-ph/0607173",
"kind": "arxiv",
"version": 1
}
}