Pith Number
pith:5TTSWDX5
pith:2017:5TTSWDX5OABXTIBSHXEP6ZLOJG
not attested
not anchored
not stored
refs pending
Lower Bound On the Computational Complexity of Discounted Markov Decision Problems
arxiv:1705.07312 v1 · 2017-05-20 · cs.CC · cs.LG
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{5TTSWDX5OABXTIBSHXEP6ZLOJG}
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-18T00:43:49.639444Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
ece72b0efd700379a0323dc8ff656e499ce6d9f6491bb800c11af498f52eea72
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/5TTSWDX5OABXTIBSHXEP6ZLOJG \
| 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: ece72b0efd700379a0323dc8ff656e499ce6d9f6491bb800c11af498f52eea72
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "e2692c042bc09a22c8d7c81f47bd424666177552616ce00da61967e98b63229d",
"cross_cats_sorted": [
"cs.LG"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.CC",
"submitted_at": "2017-05-20T14:21:30Z",
"title_canon_sha256": "0e29395f0ecb014f4d431f88d6d0b05cdbc994cd717c73e4b8e5054f8561aca8"
},
"schema_version": "1.0",
"source": {
"id": "1705.07312",
"kind": "arxiv",
"version": 1
}
}