Pith Number
pith:MCUIQV7N
pith:2019:MCUIQV7NCG437QODYW2QGXB6HG
not attested
not anchored
not stored
refs pending
Achievable Rate Region for Iterative Multi-User Detection via Low-cost Gaussian Approximation
arxiv:1907.09593 v1 · 2019-07-22 · cs.IT · math.IT
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{MCUIQV7NCG437QODYW2QGXB6HG}
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-17T23:39:52.816506Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
60a88857ed11b9bfc1c3c5b5035c3e39be2dc4b26f6edbfa586c8fe3838b416a
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/MCUIQV7NCG437QODYW2QGXB6HG \
| 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: 60a88857ed11b9bfc1c3c5b5035c3e39be2dc4b26f6edbfa586c8fe3838b416a
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "6087cbe50b74d2c2f6d8526b2929dad583e11f5e3293822efcb5d6787f562b59",
"cross_cats_sorted": [
"math.IT"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.IT",
"submitted_at": "2019-07-22T21:41:11Z",
"title_canon_sha256": "77ce3eb651a8a388eb8cbde35991502a350eedba387402c8ed608e9d7677a04d"
},
"schema_version": "1.0",
"source": {
"id": "1907.09593",
"kind": "arxiv",
"version": 1
}
}