Pith Number
pith:HXXXVRU4
pith:2014:HXXXVRU42N5OQLAYUTN32YPFQK
not attested
not anchored
not stored
refs pending
A direct proof for Lovett's bound on the communication complexity of low rank matrices
arxiv:1409.6366 v1 · 2014-09-22 · cs.CC · cs.DM
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{HXXXVRU42N5OQLAYUTN32YPFQK}
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-05-18T02:42:07.298414Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
3def7ac69cd37ae82c18a4dbbd61e58296d6034fa7d019e8631303db61cb805b
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/HXXXVRU42N5OQLAYUTN32YPFQK \
| 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: 3def7ac69cd37ae82c18a4dbbd61e58296d6034fa7d019e8631303db61cb805b
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "0672555490e43d0bf9b899f05af16bbc86ee8ab9b2f03cc4218dd1ebc6bdc5fa",
"cross_cats_sorted": [
"cs.DM"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.CC",
"submitted_at": "2014-09-22T22:40:24Z",
"title_canon_sha256": "9701a79a1d858e2affb16c0f7e46803cff9786d10849199aafbaf56ed12526fe"
},
"schema_version": "1.0",
"source": {
"id": "1409.6366",
"kind": "arxiv",
"version": 1
}
}