{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UV7EETJ5IGNWW2S4R64IHGX2RP","short_pith_number":"pith:UV7EETJ5","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"},"canonical_sha256":"a57e424d3d419b6b6a5c8fb8839afa8bc5fba9bb15ddfd01dddd53ce6a28c2f5","source":{"kind":"arxiv","id":"1705.00849","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00849","created_at":"2026-05-18T00:45:09Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00849v1","created_at":"2026-05-18T00:45:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00849","created_at":"2026-05-18T00:45:09Z"},{"alias_kind":"pith_short_12","alias_value":"UV7EETJ5IGNW","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"UV7EETJ5IGNWW2S4","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"UV7EETJ5","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UV7EETJ5IGNWW2S4R64IHGX2RP","target":"record","payload":{"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"},"canonical_sha256":"a57e424d3d419b6b6a5c8fb8839afa8bc5fba9bb15ddfd01dddd53ce6a28c2f5","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"},"source_kind":"arxiv","source_id":"1705.00849","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:45:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0tF960XgTOixR5d5V207rCBGrdXBpbXU+NUY2tCH34NLRIjsjLKlM7UAGqOnRmy2E81/HQ+BA04wgPOfDa14Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:51:26.179923Z"},"content_sha256":"d61d8751afdfde6816203f072af9e7e13026344d549c81126a273007ad37d782","schema_version":"1.0","event_id":"sha256:d61d8751afdfde6816203f072af9e7e13026344d549c81126a273007ad37d782"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UV7EETJ5IGNWW2S4R64IHGX2RP","target":"graph","payload":{"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"},"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:45:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lxPUQgA1iW7c+tzQimwOluW3gOBNVSUo80xZH5Pbxza5vhWnFmh4Een543r7wHayVfM9FroD6eq5Zf+aVzXPCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:51:26.180623Z"},"content_sha256":"71e91a974277b2bca8b97ef7b2a6a8906f5ba2f9570eee96290b10c7eeed1c3c","schema_version":"1.0","event_id":"sha256:71e91a974277b2bca8b97ef7b2a6a8906f5ba2f9570eee96290b10c7eeed1c3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UV7EETJ5IGNWW2S4R64IHGX2RP/bundle.json","state_url":"https://pith.science/pith/UV7EETJ5IGNWW2S4R64IHGX2RP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UV7EETJ5IGNWW2S4R64IHGX2RP/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-27T06:51:26Z","links":{"resolver":"https://pith.science/pith/UV7EETJ5IGNWW2S4R64IHGX2RP","bundle":"https://pith.science/pith/UV7EETJ5IGNWW2S4R64IHGX2RP/bundle.json","state":"https://pith.science/pith/UV7EETJ5IGNWW2S4R64IHGX2RP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UV7EETJ5IGNWW2S4R64IHGX2RP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UV7EETJ5IGNWW2S4R64IHGX2RP","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":"3b319aca5a617341b052081fbbfe227e496e281d6d1dd18df3f1182db73b94d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-02T08:14:42Z","title_canon_sha256":"977f7cb3ea604599f79e3f82a0f5967c4d737bca00fff5be49c9c9240523d6e2"},"schema_version":"1.0","source":{"id":"1705.00849","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.00849","created_at":"2026-05-18T00:45:09Z"},{"alias_kind":"arxiv_version","alias_value":"1705.00849v1","created_at":"2026-05-18T00:45:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.00849","created_at":"2026-05-18T00:45:09Z"},{"alias_kind":"pith_short_12","alias_value":"UV7EETJ5IGNW","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"UV7EETJ5IGNWW2S4","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"UV7EETJ5","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:71e91a974277b2bca8b97ef7b2a6a8906f5ba2f9570eee96290b10c7eeed1c3c","target":"graph","created_at":"2026-05-18T00:45:09Z","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":"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","authors_text":"Junichi Teruyama, Kazuo Iwama","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-02T08:14:42Z","title":"Improved Average Complexity for Comparison-Based Sorting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.00849","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:d61d8751afdfde6816203f072af9e7e13026344d549c81126a273007ad37d782","target":"record","created_at":"2026-05-18T00:45:09Z","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":"3b319aca5a617341b052081fbbfe227e496e281d6d1dd18df3f1182db73b94d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-02T08:14:42Z","title_canon_sha256":"977f7cb3ea604599f79e3f82a0f5967c4d737bca00fff5be49c9c9240523d6e2"},"schema_version":"1.0","source":{"id":"1705.00849","kind":"arxiv","version":1}},"canonical_sha256":"a57e424d3d419b6b6a5c8fb8839afa8bc5fba9bb15ddfd01dddd53ce6a28c2f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a57e424d3d419b6b6a5c8fb8839afa8bc5fba9bb15ddfd01dddd53ce6a28c2f5","first_computed_at":"2026-05-18T00:45:09.577914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:09.577914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Oo1JsSYkQ1m+xU878L/GJmboSX0pg34+K1Y1+lsX9xaurLRX7KRVxQkSFBK0PMvdWOvrioAIs6q7GPTflDxbDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:09.578363Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.00849","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d61d8751afdfde6816203f072af9e7e13026344d549c81126a273007ad37d782","sha256:71e91a974277b2bca8b97ef7b2a6a8906f5ba2f9570eee96290b10c7eeed1c3c"],"state_sha256":"9158d6003f0620332ab0d59cf4ea2078fbcff866c78359dd6c27e4b5f87074f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6ut+pG1Eu2JBp1gO+bEPlBJPG7kkC7kcSg/tCdaI3ng3dnow0xYB8zAEPnM9hoT+wadpn5EbCj6sMG/FKoqjBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T06:51:26.184701Z","bundle_sha256":"cce6d244a7a5b6314fbd7e34e52ff1fcdf52778d3ae3ffebc411804782970179"}}