{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GIHQWBGCR3MNPSSSPZ7PNINZAW","short_pith_number":"pith:GIHQWBGC","canonical_record":{"source":{"id":"1905.09656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-23T13:50:56Z","cross_cats_sorted":[],"title_canon_sha256":"cb5e2ef1553c29e118e021e8122466447e46924c72d4665e7fb090740b46da50","abstract_canon_sha256":"6c82a9fc233f13f2262630cf783a6a18cf7b5229c81d40208161d815bd017cf7"},"schema_version":"1.0"},"canonical_sha256":"320f0b04c28ed8d7ca527e7ef6a1b905bd3f92a20c97151cb7d7505eac831241","source":{"kind":"arxiv","id":"1905.09656","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09656","created_at":"2026-05-17T23:45:16Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09656v1","created_at":"2026-05-17T23:45:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09656","created_at":"2026-05-17T23:45:16Z"},{"alias_kind":"pith_short_12","alias_value":"GIHQWBGCR3MN","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GIHQWBGCR3MNPSSS","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GIHQWBGC","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GIHQWBGCR3MNPSSSPZ7PNINZAW","target":"record","payload":{"canonical_record":{"source":{"id":"1905.09656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-23T13:50:56Z","cross_cats_sorted":[],"title_canon_sha256":"cb5e2ef1553c29e118e021e8122466447e46924c72d4665e7fb090740b46da50","abstract_canon_sha256":"6c82a9fc233f13f2262630cf783a6a18cf7b5229c81d40208161d815bd017cf7"},"schema_version":"1.0"},"canonical_sha256":"320f0b04c28ed8d7ca527e7ef6a1b905bd3f92a20c97151cb7d7505eac831241","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:16.374135Z","signature_b64":"PlAnzRtHsTSJ/2NZLVs6AgBlAi7poz5gx7fJB1ZVJw82oaHsp/pDHzZ5y6vBMio4q/umjVR1tC3Yr3Xzsu1TBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"320f0b04c28ed8d7ca527e7ef6a1b905bd3f92a20c97151cb7d7505eac831241","last_reissued_at":"2026-05-17T23:45:16.373560Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:16.373560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.09656","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:45:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TNOS/5J5MfQyCWx2b7afU7hBZKo4FNmFMFvghcbAgLsjpHzpT9a9dX+2rGLUoj0RVKnO5euNVkG2iE8roI2mAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:27:03.908282Z"},"content_sha256":"4f04fcf5a038f1aeeb3b4cb2ecb3c56495d4d18ca0cb65c8447fd05fa8dcae14","schema_version":"1.0","event_id":"sha256:4f04fcf5a038f1aeeb3b4cb2ecb3c56495d4d18ca0cb65c8447fd05fa8dcae14"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GIHQWBGCR3MNPSSSPZ7PNINZAW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Average Case of MergeInsertion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Armin Wei{\\ss}, Florian Stober","submitted_at":"2019-05-23T13:50:56Z","abstract_excerpt":"MergeInsertion, also known as the Ford-Johnson algorithm, is a sorting algorithm which, up to today, for many input sizes achieves the best known upper bound on the number of comparisons. Indeed, it gets extremely close to the information-theoretic lower bound. While the worst-case behavior is well understood, only little is known about the average case.\n  This work takes a closer look at the average case behavior. In particular, we establish an upper bound of $n \\log n - 1.4005n + o(n)$ comparisons. We also give an exact description of the probability distribution of the length of the chain a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09656","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-17T23:45:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1vrmdXobf6lKezj7qLQK/bz+2II/6SHkj15twVjX2bqdp9x90RTkZhkApQibUF+mN4mcGEWC6pXuVZb+05DCDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:27:03.908698Z"},"content_sha256":"78d2c44b210fd938417b86afd5d777aa58341f5c5d54d7ed010283107f11bcd6","schema_version":"1.0","event_id":"sha256:78d2c44b210fd938417b86afd5d777aa58341f5c5d54d7ed010283107f11bcd6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GIHQWBGCR3MNPSSSPZ7PNINZAW/bundle.json","state_url":"https://pith.science/pith/GIHQWBGCR3MNPSSSPZ7PNINZAW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GIHQWBGCR3MNPSSSPZ7PNINZAW/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-26T15:27:03Z","links":{"resolver":"https://pith.science/pith/GIHQWBGCR3MNPSSSPZ7PNINZAW","bundle":"https://pith.science/pith/GIHQWBGCR3MNPSSSPZ7PNINZAW/bundle.json","state":"https://pith.science/pith/GIHQWBGCR3MNPSSSPZ7PNINZAW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GIHQWBGCR3MNPSSSPZ7PNINZAW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GIHQWBGCR3MNPSSSPZ7PNINZAW","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":"6c82a9fc233f13f2262630cf783a6a18cf7b5229c81d40208161d815bd017cf7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-23T13:50:56Z","title_canon_sha256":"cb5e2ef1553c29e118e021e8122466447e46924c72d4665e7fb090740b46da50"},"schema_version":"1.0","source":{"id":"1905.09656","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09656","created_at":"2026-05-17T23:45:16Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09656v1","created_at":"2026-05-17T23:45:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09656","created_at":"2026-05-17T23:45:16Z"},{"alias_kind":"pith_short_12","alias_value":"GIHQWBGCR3MN","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GIHQWBGCR3MNPSSS","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GIHQWBGC","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:78d2c44b210fd938417b86afd5d777aa58341f5c5d54d7ed010283107f11bcd6","target":"graph","created_at":"2026-05-17T23:45:16Z","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":"MergeInsertion, also known as the Ford-Johnson algorithm, is a sorting algorithm which, up to today, for many input sizes achieves the best known upper bound on the number of comparisons. Indeed, it gets extremely close to the information-theoretic lower bound. While the worst-case behavior is well understood, only little is known about the average case.\n  This work takes a closer look at the average case behavior. In particular, we establish an upper bound of $n \\log n - 1.4005n + o(n)$ comparisons. We also give an exact description of the probability distribution of the length of the chain a","authors_text":"Armin Wei{\\ss}, Florian Stober","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-23T13:50:56Z","title":"On the Average Case of MergeInsertion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09656","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:4f04fcf5a038f1aeeb3b4cb2ecb3c56495d4d18ca0cb65c8447fd05fa8dcae14","target":"record","created_at":"2026-05-17T23:45:16Z","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":"6c82a9fc233f13f2262630cf783a6a18cf7b5229c81d40208161d815bd017cf7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-23T13:50:56Z","title_canon_sha256":"cb5e2ef1553c29e118e021e8122466447e46924c72d4665e7fb090740b46da50"},"schema_version":"1.0","source":{"id":"1905.09656","kind":"arxiv","version":1}},"canonical_sha256":"320f0b04c28ed8d7ca527e7ef6a1b905bd3f92a20c97151cb7d7505eac831241","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"320f0b04c28ed8d7ca527e7ef6a1b905bd3f92a20c97151cb7d7505eac831241","first_computed_at":"2026-05-17T23:45:16.373560Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:16.373560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PlAnzRtHsTSJ/2NZLVs6AgBlAi7poz5gx7fJB1ZVJw82oaHsp/pDHzZ5y6vBMio4q/umjVR1tC3Yr3Xzsu1TBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:16.374135Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.09656","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f04fcf5a038f1aeeb3b4cb2ecb3c56495d4d18ca0cb65c8447fd05fa8dcae14","sha256:78d2c44b210fd938417b86afd5d777aa58341f5c5d54d7ed010283107f11bcd6"],"state_sha256":"a7d23cbb788bcfc0aeedd728c8006c2c793ee49cf627219157cf264e306759de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W+vjltuHvm1fjsU0WqJDo+n4eyTGhyJxqvDP8lUsR7Ot2E1x9/bQC4c5u/k27cLDpS9HQtEjExJFvKR55TkiCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:27:03.912292Z","bundle_sha256":"1b5f7bcb43f82879b0cd5594e13904bfae0d41af6c88102260a35adf877a3a02"}}