Pith Number
pith:SAVVJSJD
pith:2018:SAVVJSJDL3JNOPSFLL2NZKKJ2B
not attested
not anchored
not stored
refs pending
Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with Strongly Sublinear Memory
arxiv:1802.06748 v3 · 2018-02-19 · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{SAVVJSJDL3JNOPSFLL2NZKKJ2B}
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:45:10.010270Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
902b54c9235ed2d73e455af4dca949d048e4a3ad2ac1eba312fd72e92ec4bf5c
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/SAVVJSJDL3JNOPSFLL2NZKKJ2B \
| 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: 902b54c9235ed2d73e455af4dca949d048e4a3ad2ac1eba312fd72e92ec4bf5c
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "0fa8a51af32d9bfde3d8c0092198ada2f3efbb29fb49007258697452807f0a0d",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2018-02-19T18:29:32Z",
"title_canon_sha256": "55da17e7f04ea06f923ac2be3b5d64212c04bd5ab61c5c4a21ed83c6694d1a62"
},
"schema_version": "1.0",
"source": {
"id": "1802.06748",
"kind": "arxiv",
"version": 3
}
}