Pith Number
pith:OPS6Q6MZ
pith:2019:OPS6Q6MZ4Y3D3SH5MHQDFRVNVW
not attested
not anchored
not stored
refs pending
Improving the complexity of Parys' recursive algorithm
arxiv:1904.11810 v4 · 2019-04-26 · cs.GT · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{OPS6Q6MZ4Y3D3SH5MHQDFRVNVW}
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.
Cited by
Receipt and verification
| First computed | 2026-05-17T23:44:06.893009Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
73e5e87999e6363dc8fd61e032c6adad9ee7963f1b6f43902a01347a1ab65858
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/OPS6Q6MZ4Y3D3SH5MHQDFRVNVW \
| 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: 73e5e87999e6363dc8fd61e032c6adad9ee7963f1b6f43902a01347a1ab65858
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "36816770fe5a05f19dd8c762d1c26240050e9088b26137c8b07d99228ccfe66e",
"cross_cats_sorted": [
"cs.DS"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.GT",
"submitted_at": "2019-04-26T12:49:13Z",
"title_canon_sha256": "51a2f81836f58efd596f6a8d26756cc3a057383c110265cf867304632e055a93"
},
"schema_version": "1.0",
"source": {
"id": "1904.11810",
"kind": "arxiv",
"version": 4
}
}