{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:QXAURGLXZBJFVSBMSXDNB4Q7TO","short_pith_number":"pith:QXAURGLX","schema_version":"1.0","canonical_sha256":"85c1489977c8525ac82c95c6d0f21f9ba2646d9e93bd60f56055dc4535398de8","source":{"kind":"arxiv","id":"1805.04154","version":1},"attestation_state":"computed","paper":{"title":"Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"J. Ian Munro, Sebastian Wild","submitted_at":"2018-05-10T20:00:42Z","abstract_excerpt":"We present two stable mergesort variants, \"peeksort\" and \"powersort\", that exploit existing runs and find nearly-optimal merging orders with practically negligible overhead. Previous methods either require substantial effort for determining the merging order (Takaoka 2009; Barbay & Navarro 2013) or do not have a constant-factor optimal worst-case guarantee (Peters 2001; Auger, Nicaud & Pivoteau 2015; Buss & Knop 2018). We demonstrate that our methods are competitive in terms of running time with state-of-the-art implementations of stable sorting methods."},"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":"1805.04154","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-10T20:00:42Z","cross_cats_sorted":[],"title_canon_sha256":"08ed7bfd0bbad0b48820c30d6df9c1c37934061fd792a3306c42b00e3c972269","abstract_canon_sha256":"cdd91078cdc574e6a62a9fff4d8ca0475c9590d93524804c1fa0cb713820c5cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:03.318045Z","signature_b64":"5slYf+5MZ8RZcBN17MmkT32xro5HJ1lI0Ej0RYDsKgPY/mLKY7P+PCksyIU6fFBmMntqLs/aGIO2ss7rQo83AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85c1489977c8525ac82c95c6d0f21f9ba2646d9e93bd60f56055dc4535398de8","last_reissued_at":"2026-05-17T23:47:03.317338Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:03.317338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"J. Ian Munro, Sebastian Wild","submitted_at":"2018-05-10T20:00:42Z","abstract_excerpt":"We present two stable mergesort variants, \"peeksort\" and \"powersort\", that exploit existing runs and find nearly-optimal merging orders with practically negligible overhead. Previous methods either require substantial effort for determining the merging order (Takaoka 2009; Barbay & Navarro 2013) or do not have a constant-factor optimal worst-case guarantee (Peters 2001; Auger, Nicaud & Pivoteau 2015; Buss & Knop 2018). We demonstrate that our methods are competitive in terms of running time with state-of-the-art implementations of stable sorting methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04154","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":"1805.04154","created_at":"2026-05-17T23:47:03.317447+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.04154v1","created_at":"2026-05-17T23:47:03.317447+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04154","created_at":"2026-05-17T23:47:03.317447+00:00"},{"alias_kind":"pith_short_12","alias_value":"QXAURGLXZBJF","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"QXAURGLXZBJFVSBM","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"QXAURGLX","created_at":"2026-05-18T12:32:50.500415+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/QXAURGLXZBJFVSBMSXDNB4Q7TO","json":"https://pith.science/pith/QXAURGLXZBJFVSBMSXDNB4Q7TO.json","graph_json":"https://pith.science/api/pith-number/QXAURGLXZBJFVSBMSXDNB4Q7TO/graph.json","events_json":"https://pith.science/api/pith-number/QXAURGLXZBJFVSBMSXDNB4Q7TO/events.json","paper":"https://pith.science/paper/QXAURGLX"},"agent_actions":{"view_html":"https://pith.science/pith/QXAURGLXZBJFVSBMSXDNB4Q7TO","download_json":"https://pith.science/pith/QXAURGLXZBJFVSBMSXDNB4Q7TO.json","view_paper":"https://pith.science/paper/QXAURGLX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.04154&json=true","fetch_graph":"https://pith.science/api/pith-number/QXAURGLXZBJFVSBMSXDNB4Q7TO/graph.json","fetch_events":"https://pith.science/api/pith-number/QXAURGLXZBJFVSBMSXDNB4Q7TO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QXAURGLXZBJFVSBMSXDNB4Q7TO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QXAURGLXZBJFVSBMSXDNB4Q7TO/action/storage_attestation","attest_author":"https://pith.science/pith/QXAURGLXZBJFVSBMSXDNB4Q7TO/action/author_attestation","sign_citation":"https://pith.science/pith/QXAURGLXZBJFVSBMSXDNB4Q7TO/action/citation_signature","submit_replication":"https://pith.science/pith/QXAURGLXZBJFVSBMSXDNB4Q7TO/action/replication_record"}},"created_at":"2026-05-17T23:47:03.317447+00:00","updated_at":"2026-05-17T23:47:03.317447+00:00"}