Pith Number
pith:RPHEUZIK
pith:2018:RPHEUZIK4GUS5SAC3YAVEIENVY
not attested
not anchored
not stored
refs pending
A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs
arxiv:1801.09809 v2 · 2018-01-30 · cs.DC
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{RPHEUZIK4GUS5SAC3YAVEIENVY}
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-07-05T01:32:54.920562Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
8bce4a650ae1a92ec802de0152208dae16aeeac5a0441884ff1dc089d42b5b51
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/RPHEUZIK4GUS5SAC3YAVEIENVY \
| 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: 8bce4a650ae1a92ec802de0152208dae16aeeac5a0441884ff1dc089d42b5b51
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "5bb697ead6c51f7441bf94b63b6e57107e93d72e7f91b92f166a3e289c03f8c5",
"cross_cats_sorted": [],
"license": "http://creativecommons.org/licenses/by/4.0/",
"primary_cat": "cs.DC",
"submitted_at": "2018-01-30T00:18:06Z",
"title_canon_sha256": "2b46b963fe9c5d12b6dfd79721ab792560e9ca427876a628a75740ce11549d0d"
},
"schema_version": "1.0",
"source": {
"id": "1801.09809",
"kind": "arxiv",
"version": 2
}
}