{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:23XRETZSOTHFALYNH5O2CRPA7X","short_pith_number":"pith:23XRETZS","schema_version":"1.0","canonical_sha256":"d6ef124f3274ce502f0d3f5da145e0fddae3c1e99b54f50c98bf4df140fcb91e","source":{"kind":"arxiv","id":"1811.00833","version":1},"attestation_state":"computed","paper":{"title":"Worst-Case Efficient Sorting with QuickMergesort","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Armin Wei{\\ss}, Stefan Edelkamp","submitted_at":"2018-11-02T12:18:23Z","abstract_excerpt":"The two most prominent solutions for the sorting problem are Quicksort and Mergesort. While Quicksort is very fast on average, Mergesort additionally gives worst-case guarantees, but needs extra space for a linear number of elements. Worst-case efficient in-place sorting, however, remains a challenge: the standard solution, Heapsort, suffers from a bad cache behavior and is also not overly fast for in-cache instances.\n  In this work we present median-of-medians QuickMergesort (MoMQuickMergesort), a new variant of QuickMergesort, which combines Quicksort with Mergesort allowing the latter to be"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1811.00833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-02T12:18:23Z","cross_cats_sorted":[],"title_canon_sha256":"42f9b483dea4ac2f21ec1b1a8cddee0bca07b74251659d7f91f5e41026d6597d","abstract_canon_sha256":"7f66280b77d5a78ed7120b3f983a589ff32f63cf672fa3d75fe42593833010d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:42.025757Z","signature_b64":"EWziRCvrL8DN3KKjoYNrxTWjZtF1J5zSzrH+v9R5TofXDY/G2JzHUFWCnMxspMqv8nCtAVFW3AMG+MTS6Xl/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6ef124f3274ce502f0d3f5da145e0fddae3c1e99b54f50c98bf4df140fcb91e","last_reissued_at":"2026-05-18T00:01:42.025229Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:42.025229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Worst-Case Efficient Sorting with QuickMergesort","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Armin Wei{\\ss}, Stefan Edelkamp","submitted_at":"2018-11-02T12:18:23Z","abstract_excerpt":"The two most prominent solutions for the sorting problem are Quicksort and Mergesort. While Quicksort is very fast on average, Mergesort additionally gives worst-case guarantees, but needs extra space for a linear number of elements. Worst-case efficient in-place sorting, however, remains a challenge: the standard solution, Heapsort, suffers from a bad cache behavior and is also not overly fast for in-cache instances.\n  In this work we present median-of-medians QuickMergesort (MoMQuickMergesort), a new variant of QuickMergesort, which combines Quicksort with Mergesort allowing the latter to be"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00833","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.00833","created_at":"2026-05-18T00:01:42.025328+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.00833v1","created_at":"2026-05-18T00:01:42.025328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00833","created_at":"2026-05-18T00:01:42.025328+00:00"},{"alias_kind":"pith_short_12","alias_value":"23XRETZSOTHF","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"23XRETZSOTHFALYN","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"23XRETZS","created_at":"2026-05-18T12:31:59.375834+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/23XRETZSOTHFALYNH5O2CRPA7X","json":"https://pith.science/pith/23XRETZSOTHFALYNH5O2CRPA7X.json","graph_json":"https://pith.science/api/pith-number/23XRETZSOTHFALYNH5O2CRPA7X/graph.json","events_json":"https://pith.science/api/pith-number/23XRETZSOTHFALYNH5O2CRPA7X/events.json","paper":"https://pith.science/paper/23XRETZS"},"agent_actions":{"view_html":"https://pith.science/pith/23XRETZSOTHFALYNH5O2CRPA7X","download_json":"https://pith.science/pith/23XRETZSOTHFALYNH5O2CRPA7X.json","view_paper":"https://pith.science/paper/23XRETZS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.00833&json=true","fetch_graph":"https://pith.science/api/pith-number/23XRETZSOTHFALYNH5O2CRPA7X/graph.json","fetch_events":"https://pith.science/api/pith-number/23XRETZSOTHFALYNH5O2CRPA7X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/23XRETZSOTHFALYNH5O2CRPA7X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/23XRETZSOTHFALYNH5O2CRPA7X/action/storage_attestation","attest_author":"https://pith.science/pith/23XRETZSOTHFALYNH5O2CRPA7X/action/author_attestation","sign_citation":"https://pith.science/pith/23XRETZSOTHFALYNH5O2CRPA7X/action/citation_signature","submit_replication":"https://pith.science/pith/23XRETZSOTHFALYNH5O2CRPA7X/action/replication_record"}},"created_at":"2026-05-18T00:01:42.025328+00:00","updated_at":"2026-05-18T00:01:42.025328+00:00"}