Pith Number

pith:UAS47XOB

pith:2026:UAS47XOBEXJNBG3TJUN4P43UVB

not attested not anchored not stored refs resolved

Parse indexing for choosing pseudo-MEMs

Travis Gagie

Parse indexing selects pseudo-MEMs guaranteed to contain every long MEM without picking k.

arxiv:2605.17574 v1 · 2026-05-17 · cs.DS

Open paper page JSON Open Graph Bundle Merged state Verified badge What is a Pith Number?

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{UAS47XOBEXJNBG3TJUN4P43UVB}

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 open · sign in to claim

4 Citations open

5 Replications open

✓ 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.

Claims

C1strongest claim

We show how to use parse indexing to choose pseudo-MEMs to eliminate this risk, with the added benefit that we need not choose k.

C2weakest assumption

That the properties of an existing parse index on the text are sufficient to identify a set of pseudo-MEMs that is guaranteed to contain every MEM of length at least k without introducing new parameters or post-hoc filters.

C3one line summary

The paper shows how parse indexing can select pseudo-MEMs that contain every MEM of length at least k while eliminating the need to choose k and the risk of discarding important matches.

References

16 extracted · 16 resolved · 1 Pith anchors

[1] KeBaB: k-mer based breaking for finding long MEMs 2025

[2] Faster run-length compressed suffix arrays 2025

[3] Fast and small subsampled r-indexes 2025

[4] FM-indexing gram- mars induced by suffix sorting for long patterns 2022

[5] Summary cache: a scalable wide-area web cache sharing protocol.IEEE/ACM Transactions on Networking, 8, 2000 2000

Formal links

2 machine-checked theorem links

Receipt and verification

First computed	2026-05-20T00:04:46.656929Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

a025cfddc125d2d09b734d1bc7f374a84391224420e7b0aebde9e6d7b9f6576c

Aliases

arxiv: 2605.17574 · arxiv_version: 2605.17574v1 · doi: 10.48550/arxiv.2605.17574 · pith_short_12: UAS47XOBEXJN · pith_short_16: UAS47XOBEXJNBG3T · pith_short_8: UAS47XOB

Agent API

Resolver JSON Graph JSON Events JSON Schema Signing key

Verify this Pith Number yourself

curl -sH 'Accept: application/ld+json' https://pith.science/pith/UAS47XOBEXJNBG3TJUN4P43UVB \
  | 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: a025cfddc125d2d09b734d1bc7f374a84391224420e7b0aebde9e6d7b9f6576c

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "2f53c70b4098df0d165d9918f418b17b64657eb3639c1e2e82d946bc95426e4c",
    "cross_cats_sorted": [],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "primary_cat": "cs.DS",
    "submitted_at": "2026-05-17T18:01:33Z",
    "title_canon_sha256": "73a176f929982a17643e19e806d90b5a899b4906bd363130a292aae25b4ae9f3"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.17574",
    "kind": "arxiv",
    "version": 1
  }
}