Pith Number
pith:S2AULCSI
pith:2012:S2AULCSIRMF7KDSK7H4Z3X3UV6
not attested
not anchored
not stored
refs pending
On the Complexity of the Minimum Latency Scheduling Problem on the Euclidean Plane
arxiv:1203.2725 v1 · 2012-03-13 · cs.NI · cs.SY
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{S2AULCSIRMF7KDSK7H4Z3X3UV6}
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-18T04:00:14.784050Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
9681458a488b0bf50e4af9f99ddf74af870bdc9cd1851da7cf31a2e83609effd
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/S2AULCSIRMF7KDSK7H4Z3X3UV6 \
| 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: 9681458a488b0bf50e4af9f99ddf74af870bdc9cd1851da7cf31a2e83609effd
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "6093ef0f110a6799d5a08e696e570b4c06752f81850cdbade9ff48ab17c17605",
"cross_cats_sorted": [
"cs.SY"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.NI",
"submitted_at": "2012-03-13T07:34:27Z",
"title_canon_sha256": "31516045e1af77feff355c96d6be150eeb792d7652824abd37ef490fb27ab96d"
},
"schema_version": "1.0",
"source": {
"id": "1203.2725",
"kind": "arxiv",
"version": 1
}
}