Pith Number
pith:6V4GCZ3I
pith:2017:6V4GCZ3I23D6GLKSRJLAHFNTUL
not attested
not anchored
not stored
refs pending
Space-Efficient Algorithms for Longest Increasing Subsequence
arxiv:1712.09230 v1 · 2017-12-26 · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{6V4GCZ3I23D6GLKSRJLAHFNTUL}
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:27:14.153820Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
f578616768d6c7e32d528a560395b3a2dcadee4785134b85266d60ff67c6d95a
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/6V4GCZ3I23D6GLKSRJLAHFNTUL \
| 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: f578616768d6c7e32d528a560395b3a2dcadee4785134b85266d60ff67c6d95a
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "80f03fd190f9a1c186c7498ec10ee4a7187cdf82d1442eb93b28752a7d4bb956",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2017-12-26T10:55:12Z",
"title_canon_sha256": "aa91ab59f8b55f965e479aec5a240cb34531320aa21c5483e344ac0356b8bd9e"
},
"schema_version": "1.0",
"source": {
"id": "1712.09230",
"kind": "arxiv",
"version": 1
}
}