Pith Number
pith:XDP6YMLU
pith:2010:XDP6YMLU6IU6SBXO5F2IMH2BF3
not attested
not anchored
not stored
refs pending
Lower Bounds for the Complexity of Monadic Second-Order Logic
arxiv:1001.5019 v2 · 2010-01-27 · cs.LO · cs.CC · cs.DM · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{XDP6YMLU6IU6SBXO5F2IMH2BF3}
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-18T02:24:39.397881Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
b8dfec3174f229e906eee974861f412ede41f2961f2170d8f0d3d35a4789a3ac
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/XDP6YMLU6IU6SBXO5F2IMH2BF3 \
| 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: b8dfec3174f229e906eee974861f412ede41f2961f2170d8f0d3d35a4789a3ac
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "974e4b2e4cae1d8ff01ea6f3391463b0f75ad6c1d892db9d1facf55b86b3cab4",
"cross_cats_sorted": [
"cs.CC",
"cs.DM",
"cs.DS"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.LO",
"submitted_at": "2010-01-27T20:51:47Z",
"title_canon_sha256": "8c34cdb70e54d71ab76abcdc870d99c46c30592e4787c2fe343d5ae1ef6b0487"
},
"schema_version": "1.0",
"source": {
"id": "1001.5019",
"kind": "arxiv",
"version": 2
}
}