Pith Number
pith:3E6QC6F3
pith:2011:3E6QC6F3LHBNWNYHL5WAYL6N4P
not attested
not anchored
not stored
refs pending
Optimal Schedules for Parallelizing Anytime Algorithms: The Case of Shared Resources
arxiv:1106.5269 v1 · 2011-06-26 · cs.AI
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{3E6QC6F3LHBNWNYHL5WAYL6N4P}
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:19:13.920323Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
d93d0178bb59c2db37075f6c0c2fcde3f949d35ef6af30d26b08da97d1014b95
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/3E6QC6F3LHBNWNYHL5WAYL6N4P \
| 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: d93d0178bb59c2db37075f6c0c2fcde3f949d35ef6af30d26b08da97d1014b95
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "179b2106a15b41ce4ce341ebe20b60c8bf14e36891095819617229fe4210c95a",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.AI",
"submitted_at": "2011-06-26T21:08:20Z",
"title_canon_sha256": "e6a863778c7bf768413db406832dca4d2b037b703f9fb7203e9685088655b9cb"
},
"schema_version": "1.0",
"source": {
"id": "1106.5269",
"kind": "arxiv",
"version": 1
}
}