Pith Number
pith:QXIDBM5S
pith:2013:QXIDBM5S3J2MALSHUWRU3TIJMC
not attested
not anchored
not stored
refs pending
Efficient algorithms for the longest common subsequence in $k$-length substrings
arxiv:1311.4552 v1 · 2013-11-18 · cs.DS
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{QXIDBM5S3J2MALSHUWRU3TIJMC}
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-18T03:06:43.989407Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
85d030b3b2da74c02e47a5a34dcd09608968fa9c7ebd8bd4c3a019dfc1980c89
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/QXIDBM5S3J2MALSHUWRU3TIJMC \
| 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: 85d030b3b2da74c02e47a5a34dcd09608968fa9c7ebd8bd4c3a019dfc1980c89
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "91d335bb3620fdde8c2fbd716d77061b0723ec1d7db3387f0d5f603e9819a69c",
"cross_cats_sorted": [],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"primary_cat": "cs.DS",
"submitted_at": "2013-11-18T21:02:38Z",
"title_canon_sha256": "c00bff187f8d740b9711f51872c676f6faf91eb00a9d41e7c524caad9056d662"
},
"schema_version": "1.0",
"source": {
"id": "1311.4552",
"kind": "arxiv",
"version": 1
}
}