Pith Number
pith:6YYCBBVM
pith:2024:6YYCBBVMXJ7MW6BCBTRR2247DW
not attested
not anchored
not stored
refs pending
Near-Optimal Quantum Algorithm for Finding the Longest Common Substring between Run-Length Encoded Strings
arxiv:2411.02421 v1 · 2024-10-21 · quant-ph
Add to your LaTeX paper
\usepackage{pith}
\pithnumber{6YYCBBVMXJ7MW6BCBTRR2247DW}
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-07-05T09:31:11.530203Z |
|---|---|
| Builder | pith-number-builder-2026-05-17-v1 |
| Signature | Pith Ed25519
(pith-v1-2026-05) · public key |
| Schema | pith-number/v1.0 |
Canonical hash
f6302086acba7ecb78220ce31d6b9f1d8f5a582407651e69be915e66d2a7dead
Aliases
· · · · ·Agent API
Verify this Pith Number yourself
curl -sH 'Accept: application/ld+json' https://pith.science/pith/6YYCBBVMXJ7MW6BCBTRR2247DW \
| 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: f6302086acba7ecb78220ce31d6b9f1d8f5a582407651e69be915e66d2a7dead
Canonical record JSON
{
"metadata": {
"abstract_canon_sha256": "e58e832aa231391e3a740185282a4fd57e42cf517db753d5f234cb8731359260",
"cross_cats_sorted": [],
"license": "http://creativecommons.org/licenses/by/4.0/",
"primary_cat": "quant-ph",
"submitted_at": "2024-10-21T15:52:08Z",
"title_canon_sha256": "36a39ca609f50096d4f69944f82ebb5e270933e4912b13088d4d588e989ed570"
},
"schema_version": "1.0",
"source": {
"id": "2411.02421",
"kind": "arxiv",
"version": 1
}
}