Pith Number
pith:4I4UXBXX
pith:2017:4I4UXBXXPYVQK5BENPWJJ36TLK
not attested
not anchored
not stored
refs pending
On the Complexity of Simple and Optimal Deterministic Mechanisms for an Additive Buyer
arxiv:1702.07032 v2 · 2017-02-22 · cs.GT · cs.CC · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{4I4UXBXXPYVQK5BENPWJJ36TLK}
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:40:19.250866Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
e2394b86f77e2b0574246bec94efd35aa72cd62a97f7fc1b6be3cb7b3c28352d
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/4I4UXBXXPYVQK5BENPWJJ36TLK \
| 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: e2394b86f77e2b0574246bec94efd35aa72cd62a97f7fc1b6be3cb7b3c28352d
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "041965232376a77a0e3fd8feef22c6c550353ec0e3042bbfcdc32cf10f4bfe53",
"cross_cats_sorted": [
"cs.CC",
"cs.DS"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.GT",
"submitted_at": "2017-02-22T22:43:45Z",
"title_canon_sha256": "b1a84ba9c54b2b20de7227a620c9502af4a5ac65895ececeb4afe5f9f7d0b38b"
},
"schema_version": "1.0",
"source": {
"id": "1702.07032",
"kind": "arxiv",
"version": 2
}
}