Pith Number
pith:DUWQXHB7
pith:2015:DUWQXHB7QUGTPIPMQYMDXZJXCM
not attested
not anchored
not stored
refs pending
Parity Decision Tree Complexity and 4-Party Communication Complexity of XOR-functions Are Polynomially Equivalent
arxiv:1506.02936 v3 · 2015-06-09 · cs.CC
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{DUWQXHB7QUGTPIPMQYMDXZJXCM}
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-18T01:37:47.119527Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
1d2d0b9c3f850d37a1ec86183be537130aa8e9ef888da7c0a0b09506da1f8566
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/DUWQXHB7QUGTPIPMQYMDXZJXCM \
| 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: 1d2d0b9c3f850d37a1ec86183be537130aa8e9ef888da7c0a0b09506da1f8566
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "868e237507869d86fafcda2063b87875c7908679f801aaab3f3fcbb07dbe34ab",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.CC",
"submitted_at": "2015-06-09T14:42:20Z",
"title_canon_sha256": "e054215ecdbdb618624a1074cca381ee4d144d52a28859c3b2381f3dc31f850c"
},
"schema_version": "1.0",
"source": {
"id": "1506.02936",
"kind": "arxiv",
"version": 3
}
}