{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:N2ZP22RND66JOOQA7KDSCZXNUR","short_pith_number":"pith:N2ZP22RN","canonical_record":{"source":{"id":"1807.11328","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-30T13:03:27Z","cross_cats_sorted":[],"title_canon_sha256":"219c84cd6b7b6ff6b4d0b58d1eb080bf93b6fb8c6ffef7b3cd7bc428ff1836ed","abstract_canon_sha256":"6a28fbce826d019be06c5bf5746b22af7238f980a029607794b6babf94406ec4"},"schema_version":"1.0"},"canonical_sha256":"6eb2fd6a2d1fbc973a00fa872166eda44fc8851bf77dc2a407545d04b034d530","source":{"kind":"arxiv","id":"1807.11328","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.11328","created_at":"2026-05-17T23:53:57Z"},{"alias_kind":"arxiv_version","alias_value":"1807.11328v3","created_at":"2026-05-17T23:53:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11328","created_at":"2026-05-17T23:53:57Z"},{"alias_kind":"pith_short_12","alias_value":"N2ZP22RND66J","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"N2ZP22RND66JOOQA","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"N2ZP22RN","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:N2ZP22RND66JOOQA7KDSCZXNUR","target":"record","payload":{"canonical_record":{"source":{"id":"1807.11328","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-30T13:03:27Z","cross_cats_sorted":[],"title_canon_sha256":"219c84cd6b7b6ff6b4d0b58d1eb080bf93b6fb8c6ffef7b3cd7bc428ff1836ed","abstract_canon_sha256":"6a28fbce826d019be06c5bf5746b22af7238f980a029607794b6babf94406ec4"},"schema_version":"1.0"},"canonical_sha256":"6eb2fd6a2d1fbc973a00fa872166eda44fc8851bf77dc2a407545d04b034d530","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:57.591966Z","signature_b64":"BGhwTPqpgTFDV8Orx1TxzzlsUDAmZhgYHeF0qGH0EM9RFUEYRRz5XkazgaXczEtAS+kjZH2GagrwikAQXO4YCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6eb2fd6a2d1fbc973a00fa872166eda44fc8851bf77dc2a407545d04b034d530","last_reissued_at":"2026-05-17T23:53:57.591211Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:57.591211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.11328","source_version":3,"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:53:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M8+sGdjJ/Rbn3Jk1MTdOsWgQ0zm7AtWNljlslKacptKQ2YJNIepAbvboWpOGx3kJgVFiIGMnNXScBwH0/48qDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:56:02.034221Z"},"content_sha256":"ae1ddf7692175796d910223c9860608c8d3f892977514d15dab7f24785c665f7","schema_version":"1.0","event_id":"sha256:ae1ddf7692175796d910223c9860608c8d3f892977514d15dab7f24785c665f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:N2ZP22RND66JOOQA7KDSCZXNUR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Guidesort: Simpler Optimal Deterministic Sorting for the Parallel Disk Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Torben Hagerup","submitted_at":"2018-07-30T13:03:27Z","abstract_excerpt":"A new algorithm, Guidesort, for sorting in the uniprocessor variant of the parallel disk model (PDM) of Vitter and Shriver is presented. The algorithm is deterministic and executes a number of (parallel) I/O operations that comes within a constant factor $C$ of the optimum. The algorithm and its analysis are simpler than those proposed in previous work, and the achievable constant factor $C$ of essentially 3 appears to be smaller than for all other known deterministic algorithms, at least for plausible parameter values."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11328","kind":"arxiv","version":3},"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:53:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bUGsQ+1g2HMGqIlzYYP2nI0hTqi/Qh7S2VlyxZ0y4YxAyabPBhqz0QUs5cjOfCS5r5/qoSh0RG6lwzwau0w7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:56:02.034593Z"},"content_sha256":"5db7d7b4eb2fecbec049b908afc2e87bb07ac2097e61e80233475556dc05b3b6","schema_version":"1.0","event_id":"sha256:5db7d7b4eb2fecbec049b908afc2e87bb07ac2097e61e80233475556dc05b3b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N2ZP22RND66JOOQA7KDSCZXNUR/bundle.json","state_url":"https://pith.science/pith/N2ZP22RND66JOOQA7KDSCZXNUR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N2ZP22RND66JOOQA7KDSCZXNUR/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-06-06T19:56:02Z","links":{"resolver":"https://pith.science/pith/N2ZP22RND66JOOQA7KDSCZXNUR","bundle":"https://pith.science/pith/N2ZP22RND66JOOQA7KDSCZXNUR/bundle.json","state":"https://pith.science/pith/N2ZP22RND66JOOQA7KDSCZXNUR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N2ZP22RND66JOOQA7KDSCZXNUR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:N2ZP22RND66JOOQA7KDSCZXNUR","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":"6a28fbce826d019be06c5bf5746b22af7238f980a029607794b6babf94406ec4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-30T13:03:27Z","title_canon_sha256":"219c84cd6b7b6ff6b4d0b58d1eb080bf93b6fb8c6ffef7b3cd7bc428ff1836ed"},"schema_version":"1.0","source":{"id":"1807.11328","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.11328","created_at":"2026-05-17T23:53:57Z"},{"alias_kind":"arxiv_version","alias_value":"1807.11328v3","created_at":"2026-05-17T23:53:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11328","created_at":"2026-05-17T23:53:57Z"},{"alias_kind":"pith_short_12","alias_value":"N2ZP22RND66J","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"N2ZP22RND66JOOQA","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"N2ZP22RN","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:5db7d7b4eb2fecbec049b908afc2e87bb07ac2097e61e80233475556dc05b3b6","target":"graph","created_at":"2026-05-17T23:53:57Z","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":"A new algorithm, Guidesort, for sorting in the uniprocessor variant of the parallel disk model (PDM) of Vitter and Shriver is presented. The algorithm is deterministic and executes a number of (parallel) I/O operations that comes within a constant factor $C$ of the optimum. The algorithm and its analysis are simpler than those proposed in previous work, and the achievable constant factor $C$ of essentially 3 appears to be smaller than for all other known deterministic algorithms, at least for plausible parameter values.","authors_text":"Torben Hagerup","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-30T13:03:27Z","title":"Guidesort: Simpler Optimal Deterministic Sorting for the Parallel Disk Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.11328","kind":"arxiv","version":3},"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:ae1ddf7692175796d910223c9860608c8d3f892977514d15dab7f24785c665f7","target":"record","created_at":"2026-05-17T23:53:57Z","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":"6a28fbce826d019be06c5bf5746b22af7238f980a029607794b6babf94406ec4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-30T13:03:27Z","title_canon_sha256":"219c84cd6b7b6ff6b4d0b58d1eb080bf93b6fb8c6ffef7b3cd7bc428ff1836ed"},"schema_version":"1.0","source":{"id":"1807.11328","kind":"arxiv","version":3}},"canonical_sha256":"6eb2fd6a2d1fbc973a00fa872166eda44fc8851bf77dc2a407545d04b034d530","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6eb2fd6a2d1fbc973a00fa872166eda44fc8851bf77dc2a407545d04b034d530","first_computed_at":"2026-05-17T23:53:57.591211Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:57.591211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BGhwTPqpgTFDV8Orx1TxzzlsUDAmZhgYHeF0qGH0EM9RFUEYRRz5XkazgaXczEtAS+kjZH2GagrwikAQXO4YCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:57.591966Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.11328","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae1ddf7692175796d910223c9860608c8d3f892977514d15dab7f24785c665f7","sha256:5db7d7b4eb2fecbec049b908afc2e87bb07ac2097e61e80233475556dc05b3b6"],"state_sha256":"99092e19d6ff6232270e64196659a4843e76626fc6e0f5d180367027d0fdde84"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6BkPXPVSiwCW1D+DQ/zKjzO6qwV/lVeTzuVTfdjx1Y/M/yKWQftSr1yt9hd1uxYf7GT+Q9lSgxTz1zj5tnToDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T19:56:02.038151Z","bundle_sha256":"efbd0a42c081f2745eca0a6854e6b853829be749cfd3aca9645dda6e38ed389a"}}