{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:HUIGC6PQYO6WL2B2AXJ2QX72B7","short_pith_number":"pith:HUIGC6PQ","canonical_record":{"source":{"id":"2608.08348","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-08-08T22:04:57Z","cross_cats_sorted":[],"title_canon_sha256":"9013fa1e588d63020004852ffc1730befbac68dbd44abbf8c360dc011b175e9a","abstract_canon_sha256":"aa73dce36a97a1cf77e3569ae8aeb1272da5b8cf63e93226a899ab8c1af041c2"},"schema_version":"1.0"},"canonical_sha256":"3d106179f0c3bd65e83a05d3a85ffa0fce287ffea8f7fe215e5a482247dc5756","source":{"kind":"arxiv","id":"2608.08348","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.08348","created_at":"2026-08-11T01:22:23Z"},{"alias_kind":"arxiv_version","alias_value":"2608.08348v1","created_at":"2026-08-11T01:22:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.08348","created_at":"2026-08-11T01:22:23Z"},{"alias_kind":"pith_short_12","alias_value":"HUIGC6PQYO6W","created_at":"2026-08-11T01:22:23Z"},{"alias_kind":"pith_short_16","alias_value":"HUIGC6PQYO6WL2B2","created_at":"2026-08-11T01:22:23Z"},{"alias_kind":"pith_short_8","alias_value":"HUIGC6PQ","created_at":"2026-08-11T01:22:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:HUIGC6PQYO6WL2B2AXJ2QX72B7","target":"record","payload":{"canonical_record":{"source":{"id":"2608.08348","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-08-08T22:04:57Z","cross_cats_sorted":[],"title_canon_sha256":"9013fa1e588d63020004852ffc1730befbac68dbd44abbf8c360dc011b175e9a","abstract_canon_sha256":"aa73dce36a97a1cf77e3569ae8aeb1272da5b8cf63e93226a899ab8c1af041c2"},"schema_version":"1.0"},"canonical_sha256":"3d106179f0c3bd65e83a05d3a85ffa0fce287ffea8f7fe215e5a482247dc5756","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T01:22:23.108237Z","signature_b64":"vhW1lQTpvrNC4isDRKS8g0uUwxkWUFMDJ2tJoU4Xzbk+FKP9PbLTHShwoqT+yHa4P0zbr3Qg3IY21AuV/mp8Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d106179f0c3bd65e83a05d3a85ffa0fce287ffea8f7fe215e5a482247dc5756","last_reissued_at":"2026-08-11T01:22:23.105222Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T01:22:23.105222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.08348","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-08-11T01:22:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fK2OUmphIu6ull9YvMlHAuFv8x6oMHu/2zrLQaw1r2mnOQajhg1jwUYZqab42Ik33gs/GpIJI1l3u8lSxMbADQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T06:12:02.502948Z"},"content_sha256":"4cdba9a1b492374880e4d81e51fa3bb90629b8b100c03e79176cc0e50ac82fb6","schema_version":"1.0","event_id":"sha256:4cdba9a1b492374880e4d81e51fa3bb90629b8b100c03e79176cc0e50ac82fb6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:HUIGC6PQYO6WL2B2AXJ2QX72B7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sebastian Wild","submitted_at":"2026-08-08T22:04:57Z","abstract_excerpt":"We consider standard top-down recursive Mergesort, where we do a single comparison before calling merge to check if the two recursively sorted subproblems happens to already be correctly ordered. (If so, we can skip the merging step). We show for any input $A[0..n)$ of elements consisting of $r$ runs (maximal increasing contiguous subranges in $A$) of respective lengths $L_1,\\ldots, L_r$, the mergecost $M$ (the sum of output sizes of all merges) satisfies $M \\le (\\mathcal H+3)n$ for $\\mathcal H = \\sum_{i=1}^r (L_i / n) \\log_2(n/L_i)$ the runlength entropy."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.08348","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.08348/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-08-11T01:22:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n8brd3LlR7CQU+7XSjxpZQnzt5f9/bd2rzLLU99cOiz9psaSHyeOdAcUuKjBy5Pz03KXAtmZajsDUSCyhDnQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T06:12:02.503472Z"},"content_sha256":"de1cf696137287a866123b1035bcbb305a4ca4ecb6ff5b0dd2d575aa78eb3e6f","schema_version":"1.0","event_id":"sha256:de1cf696137287a866123b1035bcbb305a4ca4ecb6ff5b0dd2d575aa78eb3e6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HUIGC6PQYO6WL2B2AXJ2QX72B7/bundle.json","state_url":"https://pith.science/pith/HUIGC6PQYO6WL2B2AXJ2QX72B7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HUIGC6PQYO6WL2B2AXJ2QX72B7/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-08-17T06:12:02Z","links":{"resolver":"https://pith.science/pith/HUIGC6PQYO6WL2B2AXJ2QX72B7","bundle":"https://pith.science/pith/HUIGC6PQYO6WL2B2AXJ2QX72B7/bundle.json","state":"https://pith.science/pith/HUIGC6PQYO6WL2B2AXJ2QX72B7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HUIGC6PQYO6WL2B2AXJ2QX72B7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HUIGC6PQYO6WL2B2AXJ2QX72B7","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":"aa73dce36a97a1cf77e3569ae8aeb1272da5b8cf63e93226a899ab8c1af041c2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-08-08T22:04:57Z","title_canon_sha256":"9013fa1e588d63020004852ffc1730befbac68dbd44abbf8c360dc011b175e9a"},"schema_version":"1.0","source":{"id":"2608.08348","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.08348","created_at":"2026-08-11T01:22:23Z"},{"alias_kind":"arxiv_version","alias_value":"2608.08348v1","created_at":"2026-08-11T01:22:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.08348","created_at":"2026-08-11T01:22:23Z"},{"alias_kind":"pith_short_12","alias_value":"HUIGC6PQYO6W","created_at":"2026-08-11T01:22:23Z"},{"alias_kind":"pith_short_16","alias_value":"HUIGC6PQYO6WL2B2","created_at":"2026-08-11T01:22:23Z"},{"alias_kind":"pith_short_8","alias_value":"HUIGC6PQ","created_at":"2026-08-11T01:22:23Z"}],"graph_snapshots":[{"event_id":"sha256:de1cf696137287a866123b1035bcbb305a4ca4ecb6ff5b0dd2d575aa78eb3e6f","target":"graph","created_at":"2026-08-11T01:22:23Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.08348/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider standard top-down recursive Mergesort, where we do a single comparison before calling merge to check if the two recursively sorted subproblems happens to already be correctly ordered. (If so, we can skip the merging step). We show for any input $A[0..n)$ of elements consisting of $r$ runs (maximal increasing contiguous subranges in $A$) of respective lengths $L_1,\\ldots, L_r$, the mergecost $M$ (the sum of output sizes of all merges) satisfies $M \\le (\\mathcal H+3)n$ for $\\mathcal H = \\sum_{i=1}^r (L_i / n) \\log_2(n/L_i)$ the runlength entropy.","authors_text":"Sebastian Wild","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-08-08T22:04:57Z","title":"Top-Down Mergesort with Sorted Check Has Mergecost $\\le(\\mathcal H+3)n$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.08348","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:4cdba9a1b492374880e4d81e51fa3bb90629b8b100c03e79176cc0e50ac82fb6","target":"record","created_at":"2026-08-11T01:22:23Z","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":"aa73dce36a97a1cf77e3569ae8aeb1272da5b8cf63e93226a899ab8c1af041c2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-08-08T22:04:57Z","title_canon_sha256":"9013fa1e588d63020004852ffc1730befbac68dbd44abbf8c360dc011b175e9a"},"schema_version":"1.0","source":{"id":"2608.08348","kind":"arxiv","version":1}},"canonical_sha256":"3d106179f0c3bd65e83a05d3a85ffa0fce287ffea8f7fe215e5a482247dc5756","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d106179f0c3bd65e83a05d3a85ffa0fce287ffea8f7fe215e5a482247dc5756","first_computed_at":"2026-08-11T01:22:23.105222Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-11T01:22:23.105222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vhW1lQTpvrNC4isDRKS8g0uUwxkWUFMDJ2tJoU4Xzbk+FKP9PbLTHShwoqT+yHa4P0zbr3Qg3IY21AuV/mp8Dg==","signature_status":"signed_v1","signed_at":"2026-08-11T01:22:23.108237Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.08348","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4cdba9a1b492374880e4d81e51fa3bb90629b8b100c03e79176cc0e50ac82fb6","sha256:de1cf696137287a866123b1035bcbb305a4ca4ecb6ff5b0dd2d575aa78eb3e6f"],"state_sha256":"f7514bea3c67c516e3f061bbe2ff5cd5d69884643952438735a434045b92049c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KndkYogrIzoxa7dIkca4DdjyUCRi1+QAsoyNkOx+TLlm6qOMCxNH+tCm+OJs0qSmbAQWNjR6yUM4N/+kFZCGCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T06:12:02.508479Z","bundle_sha256":"117989502b5a88ac6e281e271cc23c37f6ef96ce1311ca7bd56bbdd12de17f30"}}