Pith Number
pith:P2K7FVQP
pith:2026:P2K7FVQP3C3IPMH7A6HOS3VTCE
not attested
not anchored
not stored
refs pending
Improved Approximation Algorithms for Parallel Task Scheduling and Multiple Cluster Scheduling
arxiv:2607.00878 v1 · 2026-07-01 · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{P2K7FVQP3C3IPMH7A6HOS3VTCE}
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-02T01:18:22.048732Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
7e95f2d60fd8b687b0ff078ee96eb3111bc7eb792af872b5fbc19043549f70dc
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/P2K7FVQP3C3IPMH7A6HOS3VTCE \
| 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: 7e95f2d60fd8b687b0ff078ee96eb3111bc7eb792af872b5fbc19043549f70dc
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "ef6ff033a6566a29e41c77139446f51b02388f3be825a615d734faaa0ac7391e",
"cross_cats_sorted": [],
"license": "http://creativecommons.org/licenses/by/4.0/",
"primary_cat": "cs.DS",
"submitted_at": "2026-07-01T12:43:36Z",
"title_canon_sha256": "8c5ccf353be27aa9ed7843459cc997f6ac0a8054fc62e62ecf090e4e6545ff44"
},
"schema_version": "1.0",
"source": {
"id": "2607.00878",
"kind": "arxiv",
"version": 1
}
}