Pith Number
pith:ZYM5S3FA
pith:2026:ZYM5S3FABRVF4BTN22GKV5GX3C
not attested
not anchored
not stored
refs pending
Auditing Near-Optimal Policies Can Be Exponentially Hard: Conditional Query Lower Bounds via Occupancy Rashomon Capacity
arxiv:2606.00414 v1 · 2026-05-29 · cs.LG
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{ZYM5S3FABRVF4BTN22GKV5GX3C}
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-06-02T01:03:53.938039Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
ce19d96ca00c6a5e066dd68caaf4d7d8a3a238a7e7a34cc2bb2ada8d5780f796
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/ZYM5S3FABRVF4BTN22GKV5GX3C \
| 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: ce19d96ca00c6a5e066dd68caaf4d7d8a3a238a7e7a34cc2bb2ada8d5780f796
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "f7a10cc44037f95b9d0418f8f2926278c28a96e6765c940f17a2025ebadc246b",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.LG",
"submitted_at": "2026-05-29T23:09:01Z",
"title_canon_sha256": "2df8ca2afa07b17edf67b16ed7e7baeb7f7ded56c308ada26489395b9e09eff6"
},
"schema_version": "1.0",
"source": {
"id": "2606.00414",
"kind": "arxiv",
"version": 1
}
}