Pith Number

pith:3732IHEH

pith:2026:3732IHEHSKDCCLCZNRIYBX6QZY

not attested not anchored not stored refs pending

Smallest suffixient set maintenance in near-real-time

Dominik K\"oppl, Gregory Kucherov

The smallest suffixient set of a string can be maintained online with polyloglog time per letter using Weiner's suffix tree.

arxiv:2604.27548 v2 · 2026-04-30 · 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{3732IHEHSKDCCLCZNRIYBX6QZY}

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 study how to maintain the smallest suffixient set online in near-real-time, that is with small (in our case, polyloglog) worst-case time on processing each letter. Two frameworks are considered: when the text is given letter-by-letter in either a right-to-left or left-to-right direction. Our central algorithmic tool is Weiner's suffix tree algorithm and associated algorithmic primitives for its efficient implementation.

C2weakest assumption

That Weiner's suffix tree algorithm and its primitives can be adapted and implemented to support online maintenance with only polyloglog time per letter without additional logarithmic or worse factors depending on alphabet size or other hidden costs.

C3one line summary

The smallest suffixient set can be maintained online in polyloglog time per letter in either left-to-right or right-to-left direction via Weiner's suffix tree primitives.

Cited by

2 papers in Pith

Computing Smallest Suffixient Arrays in Sublinear Time

Practical Linear-Time Computation of Smallest Suffixient Sets

Receipt and verification

First computed	2026-06-02T02:04:18.299983Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

dff7a41c879286212c596c5180dfd0ce29ee044689515c910418ae79c84627d0

Aliases

arxiv: 2604.27548 · arxiv_version: 2604.27548v2 · doi: 10.48550/arxiv.2604.27548 · pith_short_12: 3732IHEHSKDC · pith_short_16: 3732IHEHSKDCCLCZ · pith_short_8: 3732IHEH

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/3732IHEHSKDCCLCZNRIYBX6QZY \
  | 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: dff7a41c879286212c596c5180dfd0ce29ee044689515c910418ae79c84627d0

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "c3e33610471966eb4ef6b5940642a2e551738fa33c466774ce07fee22a080c70",
    "cross_cats_sorted": [],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "primary_cat": "cs.DS",
    "submitted_at": "2026-04-30T07:54:25Z",
    "title_canon_sha256": "5d45fab2af411df5e9a2ae750f3295de261d069e7a24f0af1c0263da1d7883ee"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2604.27548",
    "kind": "arxiv",
    "version": 2
  }
}