{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:23XRETZSOTHFALYNH5O2CRPA7X","short_pith_number":"pith:23XRETZS","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"},"canonical_sha256":"d6ef124f3274ce502f0d3f5da145e0fddae3c1e99b54f50c98bf4df140fcb91e","source":{"kind":"arxiv","id":"1811.00833","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00833","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00833v1","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00833","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"pith_short_12","alias_value":"23XRETZSOTHF","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"23XRETZSOTHFALYN","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"23XRETZS","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:23XRETZSOTHFALYNH5O2CRPA7X","target":"record","payload":{"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"},"canonical_sha256":"d6ef124f3274ce502f0d3f5da145e0fddae3c1e99b54f50c98bf4df140fcb91e","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"},"source_kind":"arxiv","source_id":"1811.00833","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-18T00:01:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LyuFjV/189cfBaSf16v/DeCiPORsjpAaTwX5UIbxnV9J4jP4fe1/6xZ8PL7Nn9UJHyBsfI23KV0Nk6OBPSj+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:18:20.396874Z"},"content_sha256":"359f4351a1b780394951e7fbc6e5583657944be4e3b8123a892a4d665af6f596","schema_version":"1.0","event_id":"sha256:359f4351a1b780394951e7fbc6e5583657944be4e3b8123a892a4d665af6f596"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:23XRETZSOTHFALYNH5O2CRPA7X","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:01:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vf8NupTBkETIbSYxo6oqAPJkGVoG7FKvh0S6tDp0QhqdhwFDVy2hrnzBDTc7wp222nLUfW8wio3Bx0NKWkoxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:18:20.397502Z"},"content_sha256":"cf05f20b94d9db6334cb0d9f252baef00c3caa05321b26d2fcbdf3074c974092","schema_version":"1.0","event_id":"sha256:cf05f20b94d9db6334cb0d9f252baef00c3caa05321b26d2fcbdf3074c974092"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/23XRETZSOTHFALYNH5O2CRPA7X/bundle.json","state_url":"https://pith.science/pith/23XRETZSOTHFALYNH5O2CRPA7X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/23XRETZSOTHFALYNH5O2CRPA7X/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-26T14:18:20Z","links":{"resolver":"https://pith.science/pith/23XRETZSOTHFALYNH5O2CRPA7X","bundle":"https://pith.science/pith/23XRETZSOTHFALYNH5O2CRPA7X/bundle.json","state":"https://pith.science/pith/23XRETZSOTHFALYNH5O2CRPA7X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/23XRETZSOTHFALYNH5O2CRPA7X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:23XRETZSOTHFALYNH5O2CRPA7X","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":"7f66280b77d5a78ed7120b3f983a589ff32f63cf672fa3d75fe42593833010d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-02T12:18:23Z","title_canon_sha256":"42f9b483dea4ac2f21ec1b1a8cddee0bca07b74251659d7f91f5e41026d6597d"},"schema_version":"1.0","source":{"id":"1811.00833","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00833","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00833v1","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00833","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"pith_short_12","alias_value":"23XRETZSOTHF","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"23XRETZSOTHFALYN","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"23XRETZS","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:cf05f20b94d9db6334cb0d9f252baef00c3caa05321b26d2fcbdf3074c974092","target":"graph","created_at":"2026-05-18T00:01:42Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Armin Wei{\\ss}, Stefan Edelkamp","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-02T12:18:23Z","title":"Worst-Case Efficient Sorting with QuickMergesort"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00833","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:359f4351a1b780394951e7fbc6e5583657944be4e3b8123a892a4d665af6f596","target":"record","created_at":"2026-05-18T00:01:42Z","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":"7f66280b77d5a78ed7120b3f983a589ff32f63cf672fa3d75fe42593833010d0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-02T12:18:23Z","title_canon_sha256":"42f9b483dea4ac2f21ec1b1a8cddee0bca07b74251659d7f91f5e41026d6597d"},"schema_version":"1.0","source":{"id":"1811.00833","kind":"arxiv","version":1}},"canonical_sha256":"d6ef124f3274ce502f0d3f5da145e0fddae3c1e99b54f50c98bf4df140fcb91e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6ef124f3274ce502f0d3f5da145e0fddae3c1e99b54f50c98bf4df140fcb91e","first_computed_at":"2026-05-18T00:01:42.025229Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:42.025229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EWziRCvrL8DN3KKjoYNrxTWjZtF1J5zSzrH+v9R5TofXDY/G2JzHUFWCnMxspMqv8nCtAVFW3AMG+MTS6Xl/AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:42.025757Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.00833","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:359f4351a1b780394951e7fbc6e5583657944be4e3b8123a892a4d665af6f596","sha256:cf05f20b94d9db6334cb0d9f252baef00c3caa05321b26d2fcbdf3074c974092"],"state_sha256":"d5ed0235cded1d14d2d4e0fbd043aabbcbce90ff6b567b98339f0392d62b9859"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sWD3aWDmSmg2Le5lXqAWct2BBNRy0Tch8WR40ucQd0NHhhQYOs6nmDWSeO/zDAgweXqjA0mMmU7YAovXJ78LCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:18:20.401062Z","bundle_sha256":"788a67e98eb4b563b56e071c6c0b0f6e3ca8138eb276f65193108b57b0d94ffc"}}