{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GIHQWBGCR3MNPSSSPZ7PNINZAW","short_pith_number":"pith:GIHQWBGC","schema_version":"1.0","canonical_sha256":"320f0b04c28ed8d7ca527e7ef6a1b905bd3f92a20c97151cb7d7505eac831241","source":{"kind":"arxiv","id":"1905.09656","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.09656","created_at":"2026-05-17T23:45:16.373647+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.09656v1","created_at":"2026-05-17T23:45:16.373647+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09656","created_at":"2026-05-17T23:45:16.373647+00:00"},{"alias_kind":"pith_short_12","alias_value":"GIHQWBGCR3MN","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GIHQWBGCR3MNPSSS","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GIHQWBGC","created_at":"2026-05-18T12:33:18.533446+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/GIHQWBGCR3MNPSSSPZ7PNINZAW","json":"https://pith.science/pith/GIHQWBGCR3MNPSSSPZ7PNINZAW.json","graph_json":"https://pith.science/api/pith-number/GIHQWBGCR3MNPSSSPZ7PNINZAW/graph.json","events_json":"https://pith.science/api/pith-number/GIHQWBGCR3MNPSSSPZ7PNINZAW/events.json","paper":"https://pith.science/paper/GIHQWBGC"},"agent_actions":{"view_html":"https://pith.science/pith/GIHQWBGCR3MNPSSSPZ7PNINZAW","download_json":"https://pith.science/pith/GIHQWBGCR3MNPSSSPZ7PNINZAW.json","view_paper":"https://pith.science/paper/GIHQWBGC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.09656&json=true","fetch_graph":"https://pith.science/api/pith-number/GIHQWBGCR3MNPSSSPZ7PNINZAW/graph.json","fetch_events":"https://pith.science/api/pith-number/GIHQWBGCR3MNPSSSPZ7PNINZAW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GIHQWBGCR3MNPSSSPZ7PNINZAW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GIHQWBGCR3MNPSSSPZ7PNINZAW/action/storage_attestation","attest_author":"https://pith.science/pith/GIHQWBGCR3MNPSSSPZ7PNINZAW/action/author_attestation","sign_citation":"https://pith.science/pith/GIHQWBGCR3MNPSSSPZ7PNINZAW/action/citation_signature","submit_replication":"https://pith.science/pith/GIHQWBGCR3MNPSSSPZ7PNINZAW/action/replication_record"}},"created_at":"2026-05-17T23:45:16.373647+00:00","updated_at":"2026-05-17T23:45:16.373647+00:00"}