{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:EV73X5VA6ZSM46L6UHI2VMAF6I","short_pith_number":"pith:EV73X5VA","canonical_record":{"source":{"id":"1801.04641","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-15T02:16:39Z","cross_cats_sorted":[],"title_canon_sha256":"96f2c7d409bd8e390b2b9493bf9173b1c9693bbcecca47cfd99cf586d1b7d4b8","abstract_canon_sha256":"a1ec92b4261a4b99a4d3fd8729f52c4c7d5ee3533da252bbc224ca29178f6f49"},"schema_version":"1.0"},"canonical_sha256":"257fbbf6a0f664ce797ea1d1aab005f2080385dd506439dbe777a454a36ba2a8","source":{"kind":"arxiv","id":"1801.04641","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04641","created_at":"2026-05-17T23:54:26Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04641v4","created_at":"2026-05-17T23:54:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04641","created_at":"2026-05-17T23:54:26Z"},{"alias_kind":"pith_short_12","alias_value":"EV73X5VA6ZSM","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EV73X5VA6ZSM46L6","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EV73X5VA","created_at":"2026-05-18T12:32:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:EV73X5VA6ZSM46L6UHI2VMAF6I","target":"record","payload":{"canonical_record":{"source":{"id":"1801.04641","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-15T02:16:39Z","cross_cats_sorted":[],"title_canon_sha256":"96f2c7d409bd8e390b2b9493bf9173b1c9693bbcecca47cfd99cf586d1b7d4b8","abstract_canon_sha256":"a1ec92b4261a4b99a4d3fd8729f52c4c7d5ee3533da252bbc224ca29178f6f49"},"schema_version":"1.0"},"canonical_sha256":"257fbbf6a0f664ce797ea1d1aab005f2080385dd506439dbe777a454a36ba2a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:26.441919Z","signature_b64":"3zgzH8ZKyGR3Zwzl8IsyKdM0BqemCPhb6OneakqQJGApNz/CtWtDWBRqBO203bOzn1MXFdoL8Aw5/DqmQDQ6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"257fbbf6a0f664ce797ea1d1aab005f2080385dd506439dbe777a454a36ba2a8","last_reissued_at":"2026-05-17T23:54:26.441295Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:26.441295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.04641","source_version":4,"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:54:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CXGIJ2/bbTASdVmORjKHIVNZavHvsjB16RAtoJ7M1ARLMdEcnHQAR+hGjb2gXJlrO9yH0yOEdfDQCc6LsQMDAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T15:52:10.414399Z"},"content_sha256":"26a96e234cb2bd1198de57ee42735c69a1c779003eb52aea330110140de06567","schema_version":"1.0","event_id":"sha256:26a96e234cb2bd1198de57ee42735c69a1c779003eb52aea330110140de06567"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:EV73X5VA6ZSM46L6UHI2VMAF6I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strategies for Stable Merge Sorting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander Knop, Sam Buss","submitted_at":"2018-01-15T02:16:39Z","abstract_excerpt":"We introduce new stable natural merge sort algorithms, called $2$-merge sort and $\\alpha$-merge sort. We prove upper and lower bounds for several merge sort algorithms, including Timsort, Shivers' sort, $\\alpha$-stack sorts, and our new $2$-merge and $\\alpha$-merge sorts. The upper and lower bounds have the forms $c \\cdot n \\log m$ and $c \\cdot n \\log n$ for inputs of length~$n$ comprising $m$~monotone runs. For Timsort, we prove a lower bound of $(1.5 - o(1)) n \\log n$. For $2$-merge sort, we prove optimal upper and lower bounds of approximately $(1.089 \\pm o(1))n \\log m$. We prove similar as"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04641","kind":"arxiv","version":4},"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-17T23:54:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tPpMwF9VyI8eMG5LeWNv15wqy5tfbyU0TRSXbN9lnJ8IQTW/Pd8thoCfTN8YjSMGxtNJ4NwJqQLybBN58XueAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T15:52:10.414731Z"},"content_sha256":"eec025a7f96cb8f6741723e9d6b1623287f345ac09cf49b8d4eb2bfcff0f98cd","schema_version":"1.0","event_id":"sha256:eec025a7f96cb8f6741723e9d6b1623287f345ac09cf49b8d4eb2bfcff0f98cd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EV73X5VA6ZSM46L6UHI2VMAF6I/bundle.json","state_url":"https://pith.science/pith/EV73X5VA6ZSM46L6UHI2VMAF6I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EV73X5VA6ZSM46L6UHI2VMAF6I/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-06-28T15:52:10Z","links":{"resolver":"https://pith.science/pith/EV73X5VA6ZSM46L6UHI2VMAF6I","bundle":"https://pith.science/pith/EV73X5VA6ZSM46L6UHI2VMAF6I/bundle.json","state":"https://pith.science/pith/EV73X5VA6ZSM46L6UHI2VMAF6I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EV73X5VA6ZSM46L6UHI2VMAF6I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:EV73X5VA6ZSM46L6UHI2VMAF6I","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":"a1ec92b4261a4b99a4d3fd8729f52c4c7d5ee3533da252bbc224ca29178f6f49","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-15T02:16:39Z","title_canon_sha256":"96f2c7d409bd8e390b2b9493bf9173b1c9693bbcecca47cfd99cf586d1b7d4b8"},"schema_version":"1.0","source":{"id":"1801.04641","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.04641","created_at":"2026-05-17T23:54:26Z"},{"alias_kind":"arxiv_version","alias_value":"1801.04641v4","created_at":"2026-05-17T23:54:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04641","created_at":"2026-05-17T23:54:26Z"},{"alias_kind":"pith_short_12","alias_value":"EV73X5VA6ZSM","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_16","alias_value":"EV73X5VA6ZSM46L6","created_at":"2026-05-18T12:32:22Z"},{"alias_kind":"pith_short_8","alias_value":"EV73X5VA","created_at":"2026-05-18T12:32:22Z"}],"graph_snapshots":[{"event_id":"sha256:eec025a7f96cb8f6741723e9d6b1623287f345ac09cf49b8d4eb2bfcff0f98cd","target":"graph","created_at":"2026-05-17T23:54:26Z","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":"We introduce new stable natural merge sort algorithms, called $2$-merge sort and $\\alpha$-merge sort. We prove upper and lower bounds for several merge sort algorithms, including Timsort, Shivers' sort, $\\alpha$-stack sorts, and our new $2$-merge and $\\alpha$-merge sorts. The upper and lower bounds have the forms $c \\cdot n \\log m$ and $c \\cdot n \\log n$ for inputs of length~$n$ comprising $m$~monotone runs. For Timsort, we prove a lower bound of $(1.5 - o(1)) n \\log n$. For $2$-merge sort, we prove optimal upper and lower bounds of approximately $(1.089 \\pm o(1))n \\log m$. We prove similar as","authors_text":"Alexander Knop, Sam Buss","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-15T02:16:39Z","title":"Strategies for Stable Merge Sorting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04641","kind":"arxiv","version":4},"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:26a96e234cb2bd1198de57ee42735c69a1c779003eb52aea330110140de06567","target":"record","created_at":"2026-05-17T23:54:26Z","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":"a1ec92b4261a4b99a4d3fd8729f52c4c7d5ee3533da252bbc224ca29178f6f49","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-01-15T02:16:39Z","title_canon_sha256":"96f2c7d409bd8e390b2b9493bf9173b1c9693bbcecca47cfd99cf586d1b7d4b8"},"schema_version":"1.0","source":{"id":"1801.04641","kind":"arxiv","version":4}},"canonical_sha256":"257fbbf6a0f664ce797ea1d1aab005f2080385dd506439dbe777a454a36ba2a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"257fbbf6a0f664ce797ea1d1aab005f2080385dd506439dbe777a454a36ba2a8","first_computed_at":"2026-05-17T23:54:26.441295Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:26.441295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3zgzH8ZKyGR3Zwzl8IsyKdM0BqemCPhb6OneakqQJGApNz/CtWtDWBRqBO203bOzn1MXFdoL8Aw5/DqmQDQ6Aw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:26.441919Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.04641","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26a96e234cb2bd1198de57ee42735c69a1c779003eb52aea330110140de06567","sha256:eec025a7f96cb8f6741723e9d6b1623287f345ac09cf49b8d4eb2bfcff0f98cd"],"state_sha256":"729396669f262b3f32cbb914f99e526f642d3eb29c4c539da2ad4c66fc0020cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YvlDll7b38LeznzAFRQkwvmSAQuWcE7sMxRnHl0VLxVr5FSQ0z9zVQAU9Vf7Au1dW4fvXmxz9nXWAKGcSDnnAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T15:52:10.416554Z","bundle_sha256":"8aa12eec29e1079b349b221ced44718f219a9d1a7c328ec658a57d9ff1f38b50"}}