Pith Number
pith:YQRJJTGL
pith:2017:YQRJJTGLO5JE2NJZ3GY7FWO2PZ
not attested
not anchored
not stored
refs pending
On the Combinatorial Lower Bound for the Extension Complexity of the Spanning Tree Polytope
arxiv:1702.01424 v1 · 2017-02-05 · cs.DM · math.OC
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{YQRJJTGLO5JE2NJZ3GY7FWO2PZ}
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:51:23.481229Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
c42294cccb77524d3539d9b1f2d9da7e52c087015eb0289d3aec340e4a6746b1
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/YQRJJTGLO5JE2NJZ3GY7FWO2PZ \
| 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: c42294cccb77524d3539d9b1f2d9da7e52c087015eb0289d3aec340e4a6746b1
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "b6599dd0a37913f8cf3bb1d2853722632e4dd0800dc11cd026bba63862f5f382",
"cross_cats_sorted": [
"math.OC"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DM",
"submitted_at": "2017-02-05T16:22:19Z",
"title_canon_sha256": "1287a2cdbc3a60c2976552b7b1ab0cee72cd2fdbda7b7db2e8dcb8365372d563"
},
"schema_version": "1.0",
"source": {
"id": "1702.01424",
"kind": "arxiv",
"version": 1
}
}