Pith Number
pith:F6WHY6PW
pith:2015:F6WHY6PWAH4NT2XYM5DAJU4SZG
not attested
not anchored
not stored
refs pending
A Practical O(R\log\log n+n) time Algorithm for Computing the Longest Common Subsequence
arxiv:1508.05553 v1 · 2015-08-23 · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{F6WHY6PWAH4NT2XYM5DAJU4SZG}
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-18T01:34:52.219652Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
2fac7c79f601f8d9eaf8674604d392c990ce8d5532774ffe3a0c454431cb3455
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/F6WHY6PWAH4NT2XYM5DAJU4SZG \
| 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: 2fac7c79f601f8d9eaf8674604d392c990ce8d5532774ffe3a0c454431cb3455
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "9581ce2cdfadc8fdb030e97a1562aefcc740b0370a06b1a1c3535ff7e8e5a9b7",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2015-08-23T00:56:03Z",
"title_canon_sha256": "b28943b70ea2f1849d92c0aedd324eb4d316db74c14c8aefd154a2ea976a60dd"
},
"schema_version": "1.0",
"source": {
"id": "1508.05553",
"kind": "arxiv",
"version": 1
}
}