Pith Number
pith:UAZX32NJ
pith:2019:UAZX32NJNO4KZXFVTN7Q3CP4I5
not attested
not anchored
not stored
refs pending
Parallel and Memory-limited Algorithms for Optimal Task Scheduling Using a Duplicate-Free State-Space
arxiv:1905.05568 v1 · 2019-05-14 · cs.DC
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{UAZX32NJNO4KZXFVTN7Q3CP4I5}
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:46:14.188635Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
a0337de9a96bb8acdcb59b7f0d89fc4764759d4c79a2c8f85d25948f86ec7cb6
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/UAZX32NJNO4KZXFVTN7Q3CP4I5 \
| 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: a0337de9a96bb8acdcb59b7f0d89fc4764759d4c79a2c8f85d25948f86ec7cb6
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "9cb9545fc6f1be153ad082904e9d2a23d3289a6a715c933278ba907c89e954fc",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DC",
"submitted_at": "2019-05-14T12:52:53Z",
"title_canon_sha256": "fc172c62b1637884220343cee731a8144d63697a5a99a853747580dfeec1ad76"
},
"schema_version": "1.0",
"source": {
"id": "1905.05568",
"kind": "arxiv",
"version": 1
}
}