{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UV7EETJ5IGNWW2S4R64IHGX2RP","short_pith_number":"pith:UV7EETJ5","schema_version":"1.0","canonical_sha256":"a57e424d3d419b6b6a5c8fb8839afa8bc5fba9bb15ddfd01dddd53ce6a28c2f5","source":{"kind":"arxiv","id":"1705.00849","version":1},"attestation_state":"computed","paper":{"title":"Improved Average Complexity for Comparison-Based Sorting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Junichi Teruyama, Kazuo Iwama","submitted_at":"2017-05-02T08:14:42Z","abstract_excerpt":"This paper studies the average complexity on the number of comparisons for sorting algorithms. Its information-theoretic lower bound is $n \\lg n - 1.4427n + O(\\log n)$. For many efficient algorithms, the first $n\\lg n$ term is easy to achieve and our focus is on the (negative) constant factor of the linear term. The current best value is $-1.3999$ for the MergeInsertion sort. Our new value is $-1.4106$, narrowing the gap by some $25\\%$. An important building block of our algorithm is \"two-element insertion,\" which inserts two numbers $A$ and $B$, $A<B$, into a sorted sequence $T$. This inserti"},"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":"1705.00849","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-02T08:14:42Z","cross_cats_sorted":[],"title_canon_sha256":"977f7cb3ea604599f79e3f82a0f5967c4d737bca00fff5be49c9c9240523d6e2","abstract_canon_sha256":"3b319aca5a617341b052081fbbfe227e496e281d6d1dd18df3f1182db73b94d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:09.578363Z","signature_b64":"Oo1JsSYkQ1m+xU878L/GJmboSX0pg34+K1Y1+lsX9xaurLRX7KRVxQkSFBK0PMvdWOvrioAIs6q7GPTflDxbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a57e424d3d419b6b6a5c8fb8839afa8bc5fba9bb15ddfd01dddd53ce6a28c2f5","last_reissued_at":"2026-05-18T00:45:09.577914Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:09.577914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Average Complexity for Comparison-Based Sorting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Junichi Teruyama, Kazuo Iwama","submitted_at":"2017-05-02T08:14:42Z","abstract_excerpt":"This paper studies the average complexity on the number of comparisons for sorting algorithms. Its information-theoretic lower bound is $n \\lg n - 1.4427n + O(\\log n)$. For many efficient algorithms, the first $n\\lg n$ term is easy to achieve and our focus is on the (negative) constant factor of the linear term. The current best value is $-1.3999$ for the MergeInsertion sort. Our new value is $-1.4106$, narrowing the gap by some $25\\%$. An important building block of our algorithm is \"two-element insertion,\" which inserts two numbers $A$ and $B$, $A<B$, into a sorted sequence $T$. This inserti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00849","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":"1705.00849","created_at":"2026-05-18T00:45:09.577980+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.00849v1","created_at":"2026-05-18T00:45:09.577980+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00849","created_at":"2026-05-18T00:45:09.577980+00:00"},{"alias_kind":"pith_short_12","alias_value":"UV7EETJ5IGNW","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"UV7EETJ5IGNWW2S4","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"UV7EETJ5","created_at":"2026-05-18T12:31:49.984773+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/UV7EETJ5IGNWW2S4R64IHGX2RP","json":"https://pith.science/pith/UV7EETJ5IGNWW2S4R64IHGX2RP.json","graph_json":"https://pith.science/api/pith-number/UV7EETJ5IGNWW2S4R64IHGX2RP/graph.json","events_json":"https://pith.science/api/pith-number/UV7EETJ5IGNWW2S4R64IHGX2RP/events.json","paper":"https://pith.science/paper/UV7EETJ5"},"agent_actions":{"view_html":"https://pith.science/pith/UV7EETJ5IGNWW2S4R64IHGX2RP","download_json":"https://pith.science/pith/UV7EETJ5IGNWW2S4R64IHGX2RP.json","view_paper":"https://pith.science/paper/UV7EETJ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.00849&json=true","fetch_graph":"https://pith.science/api/pith-number/UV7EETJ5IGNWW2S4R64IHGX2RP/graph.json","fetch_events":"https://pith.science/api/pith-number/UV7EETJ5IGNWW2S4R64IHGX2RP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UV7EETJ5IGNWW2S4R64IHGX2RP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UV7EETJ5IGNWW2S4R64IHGX2RP/action/storage_attestation","attest_author":"https://pith.science/pith/UV7EETJ5IGNWW2S4R64IHGX2RP/action/author_attestation","sign_citation":"https://pith.science/pith/UV7EETJ5IGNWW2S4R64IHGX2RP/action/citation_signature","submit_replication":"https://pith.science/pith/UV7EETJ5IGNWW2S4R64IHGX2RP/action/replication_record"}},"created_at":"2026-05-18T00:45:09.577980+00:00","updated_at":"2026-05-18T00:45:09.577980+00:00"}