{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QXAURGLXZBJFVSBMSXDNB4Q7TO","short_pith_number":"pith:QXAURGLX","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"},"canonical_sha256":"85c1489977c8525ac82c95c6d0f21f9ba2646d9e93bd60f56055dc4535398de8","source":{"kind":"arxiv","id":"1805.04154","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04154","created_at":"2026-05-17T23:47:03Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04154v1","created_at":"2026-05-17T23:47:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04154","created_at":"2026-05-17T23:47:03Z"},{"alias_kind":"pith_short_12","alias_value":"QXAURGLXZBJF","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"QXAURGLXZBJFVSBM","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"QXAURGLX","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QXAURGLXZBJFVSBMSXDNB4Q7TO","target":"record","payload":{"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"},"canonical_sha256":"85c1489977c8525ac82c95c6d0f21f9ba2646d9e93bd60f56055dc4535398de8","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"},"source_kind":"arxiv","source_id":"1805.04154","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:47:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7GqcbIKgCnCqrrD+C/y2mtsggyn3IFIFMbAZjLDfNygsnj3veMKvPAad+ZId4H2r70yayvivJwnGRgjAxNwrCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:15:40.247849Z"},"content_sha256":"6ee0ac90a4392cfd99a1dadbc4aa35610226f7bf90700e1408a52400ae1ab1ce","schema_version":"1.0","event_id":"sha256:6ee0ac90a4392cfd99a1dadbc4aa35610226f7bf90700e1408a52400ae1ab1ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QXAURGLXZBJFVSBMSXDNB4Q7TO","target":"graph","payload":{"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"},"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:47:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lSb3J27BaiYmQgok4RxH636bz3/LsDjIbmjlwuxvWLnubw+WWj+NmT6pRCPaSgu+QhbnX0oGCCBe7CnIVMtQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:15:40.248217Z"},"content_sha256":"be306388d6d4a4f6254cf625e44d33a5815ce0cf06ccc6716d09211ddb90f28e","schema_version":"1.0","event_id":"sha256:be306388d6d4a4f6254cf625e44d33a5815ce0cf06ccc6716d09211ddb90f28e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QXAURGLXZBJFVSBMSXDNB4Q7TO/bundle.json","state_url":"https://pith.science/pith/QXAURGLXZBJFVSBMSXDNB4Q7TO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QXAURGLXZBJFVSBMSXDNB4Q7TO/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-27T21:15:40Z","links":{"resolver":"https://pith.science/pith/QXAURGLXZBJFVSBMSXDNB4Q7TO","bundle":"https://pith.science/pith/QXAURGLXZBJFVSBMSXDNB4Q7TO/bundle.json","state":"https://pith.science/pith/QXAURGLXZBJFVSBMSXDNB4Q7TO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QXAURGLXZBJFVSBMSXDNB4Q7TO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QXAURGLXZBJFVSBMSXDNB4Q7TO","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":"cdd91078cdc574e6a62a9fff4d8ca0475c9590d93524804c1fa0cb713820c5cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-10T20:00:42Z","title_canon_sha256":"08ed7bfd0bbad0b48820c30d6df9c1c37934061fd792a3306c42b00e3c972269"},"schema_version":"1.0","source":{"id":"1805.04154","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04154","created_at":"2026-05-17T23:47:03Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04154v1","created_at":"2026-05-17T23:47:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04154","created_at":"2026-05-17T23:47:03Z"},{"alias_kind":"pith_short_12","alias_value":"QXAURGLXZBJF","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"QXAURGLXZBJFVSBM","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"QXAURGLX","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:be306388d6d4a4f6254cf625e44d33a5815ce0cf06ccc6716d09211ddb90f28e","target":"graph","created_at":"2026-05-17T23:47:03Z","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":"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.","authors_text":"J. Ian Munro, Sebastian Wild","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-10T20:00:42Z","title":"Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04154","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:6ee0ac90a4392cfd99a1dadbc4aa35610226f7bf90700e1408a52400ae1ab1ce","target":"record","created_at":"2026-05-17T23:47:03Z","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":"cdd91078cdc574e6a62a9fff4d8ca0475c9590d93524804c1fa0cb713820c5cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-10T20:00:42Z","title_canon_sha256":"08ed7bfd0bbad0b48820c30d6df9c1c37934061fd792a3306c42b00e3c972269"},"schema_version":"1.0","source":{"id":"1805.04154","kind":"arxiv","version":1}},"canonical_sha256":"85c1489977c8525ac82c95c6d0f21f9ba2646d9e93bd60f56055dc4535398de8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85c1489977c8525ac82c95c6d0f21f9ba2646d9e93bd60f56055dc4535398de8","first_computed_at":"2026-05-17T23:47:03.317338Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:03.317338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5slYf+5MZ8RZcBN17MmkT32xro5HJ1lI0Ej0RYDsKgPY/mLKY7P+PCksyIU6fFBmMntqLs/aGIO2ss7rQo83AA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:03.318045Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.04154","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ee0ac90a4392cfd99a1dadbc4aa35610226f7bf90700e1408a52400ae1ab1ce","sha256:be306388d6d4a4f6254cf625e44d33a5815ce0cf06ccc6716d09211ddb90f28e"],"state_sha256":"14612f04dd408abba7e84a882081b9eb646fc4d0ea45d3843676504098d60855"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5wzXsJ7Jg72BVkvJ2m2Af58bqu+5AvPFIYP5AEPG5nocDnoNV67Wi86UgoSPCCco4jRFeB1k1v5fFyiIW6OpAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:15:40.250575Z","bundle_sha256":"18eae5c6e8bf62d91d5ea9d05702c62cc375cbc447e45442b15f9fb6de3ba787"}}