{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:WZ62EISUVWLM7B4XD2WQCMX4UX","short_pith_number":"pith:WZ62EISU","canonical_record":{"source":{"id":"2605.14419","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-14T06:06:15Z","cross_cats_sorted":[],"title_canon_sha256":"c6b3b1cd973115544fef10871d3b5600524047b0af21c93c24d070391b09b40b","abstract_canon_sha256":"14d36508109c2b13375df8d4794a4155dd8a6203ea39cfe56ec2b3469ea8bd44"},"schema_version":"1.0"},"canonical_sha256":"b67da22254ad96cf87971ead0132fca5f7eb17799316b4516ed0e36db5f88c07","source":{"kind":"arxiv","id":"2605.14419","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14419","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14419v1","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14419","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"pith_short_12","alias_value":"WZ62EISUVWLM","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"WZ62EISUVWLM7B4X","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"WZ62EISU","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:WZ62EISUVWLM7B4XD2WQCMX4UX","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14419","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-14T06:06:15Z","cross_cats_sorted":[],"title_canon_sha256":"c6b3b1cd973115544fef10871d3b5600524047b0af21c93c24d070391b09b40b","abstract_canon_sha256":"14d36508109c2b13375df8d4794a4155dd8a6203ea39cfe56ec2b3469ea8bd44"},"schema_version":"1.0"},"canonical_sha256":"b67da22254ad96cf87971ead0132fca5f7eb17799316b4516ed0e36db5f88c07","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:07.270400Z","signature_b64":"0GfV8nnVpUy7s5QoHtCkiFCgw63GtVsTaXLnC+7U+yrq1oveHpzSX6nc7n9CRaDQ3v7y6xsAtrooMxa4FU+eBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b67da22254ad96cf87971ead0132fca5f7eb17799316b4516ed0e36db5f88c07","last_reissued_at":"2026-05-17T23:39:07.269746Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:07.269746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14419","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LILZZ4MnlEAA2LBm7kjyfC1FxKf4AU6gp4RoOcWiBf2AW7YF5knKItxCHLH/Pny2EauUaGTSZeRemZcwNWY/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:58:16.861421Z"},"content_sha256":"1d786366b360d6d3e1dfc792776f4fec520ba25054799bcdc33384577d832522","schema_version":"1.0","event_id":"sha256:1d786366b360d6d3e1dfc792776f4fec520ba25054799bcdc33384577d832522"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:WZ62EISUVWLM7B4XD2WQCMX4UX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"zSort: Stable Distribution Sort using Z-Score Partitioning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"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.","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aditya Shastri, Ashutosh Londhe, Hiren Kumar Thakkar, Hriday Jain, Ketan Sabale","submitted_at":"2026-05-14T06:06:15Z","abstract_excerpt":"Sorting is a foundational primitive in modern data processing, influencing the execution speed of high-performance data pipelines. However, the algorithmic landscape is currently bifurcated by a pervasive \"Stability Tax\": practitioners must sacrifice either order preservation for high throughput or execution speed for stability. To address these limitations, this paper introduces, zSort, an adaptive z-score based distribution sorting algorithm that guarantees stability while avoiding pass complexity that scales with key-width. The performance of the proposed technique is evaluated using Microa"},"claims":{"count":3,"items":[{"kind":"strongest_claim","text":"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.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"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.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"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.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"}],"snapshot_sha256":"e3211cbdf90fdea2c1ea16bbf7ad69d73c065df91d51d166a94047661f7b8634"},"source":{"id":"2605.14419","kind":"arxiv","version":1},"verdict":{"id":"c934d811-deb9-426e-9199-03338fc243eb","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T02:15:35.735291Z","strongest_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.","one_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.","pipeline_version":"pith-pipeline@v0.9.0","weakest_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.","pith_extraction_headline":""},"references":{"count":27,"sample":[{"doi":"","year":2025,"title":"Sorting it out in hardware: A state- of-the-art survey","work_id":"e1510ca3-30c8-4e46-9546-b36d44fa713d","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2006,"title":"Implementing sorting in database systems","work_id":"f76997d0-b19a-4412-b356-fd4bfbeed907","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2026,"title":"https://sortbenchmark.org/ (ac- cessed Mar, 2026)","work_id":"e7c6ed66-1ef2-4c4d-9fd6-9d8b4aed0446","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2009,"title":"Choosing the” best” sorting algorithm for optimal energy consumption","work_id":"a7d75a72-8320-49aa-950a-2b1f3c477f69","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Introduction to algorithms","work_id":"b66767c9-5e71-474b-8bcd-dab6379eeff5","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":27,"snapshot_sha256":"12d2ef568771bb54c9ef92f9ae4ada06d88a966d856acbe4fa489bd5ef551f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"c934d811-deb9-426e-9199-03338fc243eb"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hzt3z6fMcB2C4tyqzLoFoBOAwUFPBODPDt4M9O8tspS8sXkXAD4xaxbOn92Wdq0QlYlg680kfttQAHu1LltRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:58:16.862509Z"},"content_sha256":"3dd37625683990cf5bd10884b4b1a109a9060cb9abe51314209c38ec8528485c","schema_version":"1.0","event_id":"sha256:3dd37625683990cf5bd10884b4b1a109a9060cb9abe51314209c38ec8528485c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WZ62EISUVWLM7B4XD2WQCMX4UX/bundle.json","state_url":"https://pith.science/pith/WZ62EISUVWLM7B4XD2WQCMX4UX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WZ62EISUVWLM7B4XD2WQCMX4UX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T10:58:16Z","links":{"resolver":"https://pith.science/pith/WZ62EISUVWLM7B4XD2WQCMX4UX","bundle":"https://pith.science/pith/WZ62EISUVWLM7B4XD2WQCMX4UX/bundle.json","state":"https://pith.science/pith/WZ62EISUVWLM7B4XD2WQCMX4UX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WZ62EISUVWLM7B4XD2WQCMX4UX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WZ62EISUVWLM7B4XD2WQCMX4UX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"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}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14419","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14419v1","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14419","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"pith_short_12","alias_value":"WZ62EISUVWLM","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"WZ62EISUVWLM7B4X","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"WZ62EISU","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:3dd37625683990cf5bd10884b4b1a109a9060cb9abe51314209c38ec8528485c","target":"graph","created_at":"2026-05-17T23:39:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":3,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"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."}],"snapshot_sha256":"e3211cbdf90fdea2c1ea16bbf7ad69d73c065df91d51d166a94047661f7b8634"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Sorting is a foundational primitive in modern data processing, influencing the execution speed of high-performance data pipelines. However, the algorithmic landscape is currently bifurcated by a pervasive \"Stability Tax\": practitioners must sacrifice either order preservation for high throughput or execution speed for stability. To address these limitations, this paper introduces, zSort, an adaptive z-score based distribution sorting algorithm that guarantees stability while avoiding pass complexity that scales with key-width. The performance of the proposed technique is evaluated using Microa","authors_text":"Aditya Shastri, Ashutosh Londhe, Hiren Kumar Thakkar, Hriday Jain, Ketan Sabale","cross_cats":[],"headline":"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.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-14T06:06:15Z","title":"zSort: Stable Distribution Sort using Z-Score Partitioning"},"references":{"count":27,"internal_anchors":0,"resolved_work":27,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Sorting it out in hardware: A state- of-the-art survey","work_id":"e1510ca3-30c8-4e46-9546-b36d44fa713d","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Implementing sorting in database systems","work_id":"f76997d0-b19a-4412-b356-fd4bfbeed907","year":2006},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"https://sortbenchmark.org/ (ac- cessed Mar, 2026)","work_id":"e7c6ed66-1ef2-4c4d-9fd6-9d8b4aed0446","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Choosing the” best” sorting algorithm for optimal energy consumption","work_id":"a7d75a72-8320-49aa-950a-2b1f3c477f69","year":2009},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Introduction to algorithms","work_id":"b66767c9-5e71-474b-8bcd-dab6379eeff5","year":2022}],"snapshot_sha256":"12d2ef568771bb54c9ef92f9ae4ada06d88a966d856acbe4fa489bd5ef551f57"},"source":{"id":"2605.14419","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T02:15:35.735291Z","id":"c934d811-deb9-426e-9199-03338fc243eb","model_set":{"reader":"grok-4.3"},"one_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.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"","strongest_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.","weakest_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."}},"verdict_id":"c934d811-deb9-426e-9199-03338fc243eb"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1d786366b360d6d3e1dfc792776f4fec520ba25054799bcdc33384577d832522","target":"record","created_at":"2026-05-17T23:39:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"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}},"canonical_sha256":"b67da22254ad96cf87971ead0132fca5f7eb17799316b4516ed0e36db5f88c07","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b67da22254ad96cf87971ead0132fca5f7eb17799316b4516ed0e36db5f88c07","first_computed_at":"2026-05-17T23:39:07.269746Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:07.269746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0GfV8nnVpUy7s5QoHtCkiFCgw63GtVsTaXLnC+7U+yrq1oveHpzSX6nc7n9CRaDQ3v7y6xsAtrooMxa4FU+eBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:07.270400Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14419","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d786366b360d6d3e1dfc792776f4fec520ba25054799bcdc33384577d832522","sha256:3dd37625683990cf5bd10884b4b1a109a9060cb9abe51314209c38ec8528485c"],"state_sha256":"c729bfcd8bf6166397ac91ec6303c8fe870fef5cbc171bd76716d289b0197a69"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ow2Mxl1kdokm7/yAxROg8qXzp3D9eOrve7YL0bAT2ZLAVuarY+j25CAOXuJt2yRIJLvfeXHpZK2Z0kPA+46hBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:58:16.867091Z","bundle_sha256":"93cac27046c636c94cf76b79c60ad45bffadaca0cba2bfd53d6faa5d62dfd4ce"}}