Pith Number

pith:WZ62EISU

pith:2026:WZ62EISUVWLM7B4XD2WQCMX4UX

not attested not anchored not stored refs resolved

zSort: Stable Distribution Sort using Z-Score Partitioning

Aditya Shastri, Ashutosh Londhe, Hiren Kumar Thakkar, Hriday Jain, Ketan Sabale

zSort is a stable distribution sort using z-score partitioning that achieves up to 4.5x speedup over comparison-based stable sorts while matching unstable algorithms like Skasort on many inputs.

arxiv:2605.14419 v1 · 2026-05-14 · 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{WZ62EISUVWLM7B4XD2WQCMX4UX}

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

zSort consistently outperforms widely used comparison based stable sorting algorithms, achieving up to 3x-4.5x speedups, and a relatively better performance compared to LSD Radix, with larger gains on duplicate heavy and partially ordered inputs.

C2weakest assumption

The assumption that z-score based partitioning remains effective and avoids extreme worst-case behavior across all real-world input distributions without requiring additional safeguards or pass scaling.

C3one line summary

zSort is a stable distribution sort using z-score partitioning that achieves up to 4.5x speedup over comparison-based stable sorts while matching unstable algorithms like Skasort on many inputs.

References

27 extracted · 27 resolved · 0 Pith anchors

[1] Sorting it out in hardware: A state- of-the-art survey 2025

[2] Implementing sorting in database systems 2006

[3] https://sortbenchmark.org/ (ac- cessed Mar, 2026) 2026

[4] Choosing the” best” sorting algorithm for optimal energy consumption 2009

[5] Introduction to algorithms 2022

Receipt and verification

First computed	2026-05-17T23:39:07.269746Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

b67da22254ad96cf87971ead0132fca5f7eb17799316b4516ed0e36db5f88c07

Aliases

arxiv: 2605.14419 · arxiv_version: 2605.14419v1 · doi: 10.48550/arxiv.2605.14419 · pith_short_12: WZ62EISUVWLM · pith_short_16: WZ62EISUVWLM7B4X · pith_short_8: WZ62EISU

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/WZ62EISUVWLM7B4XD2WQCMX4UX \
  | 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: b67da22254ad96cf87971ead0132fca5f7eb17799316b4516ed0e36db5f88c07

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "14d36508109c2b13375df8d4794a4155dd8a6203ea39cfe56ec2b3469ea8bd44",
    "cross_cats_sorted": [],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "primary_cat": "cs.DS",
    "submitted_at": "2026-05-14T06:06:15Z",
    "title_canon_sha256": "c6b3b1cd973115544fef10871d3b5600524047b0af21c93c24d070391b09b40b"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.14419",
    "kind": "arxiv",
    "version": 1
  }
}