{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:N2ZP22RND66JOOQA7KDSCZXNUR","short_pith_number":"pith:N2ZP22RN","schema_version":"1.0","canonical_sha256":"6eb2fd6a2d1fbc973a00fa872166eda44fc8851bf77dc2a407545d04b034d530","source":{"kind":"arxiv","id":"1807.11328","version":3},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.11328","created_at":"2026-05-17T23:53:57.591337+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.11328v3","created_at":"2026-05-17T23:53:57.591337+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.11328","created_at":"2026-05-17T23:53:57.591337+00:00"},{"alias_kind":"pith_short_12","alias_value":"N2ZP22RND66J","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"N2ZP22RND66JOOQA","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"N2ZP22RN","created_at":"2026-05-18T12:32:40.477152+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/N2ZP22RND66JOOQA7KDSCZXNUR","json":"https://pith.science/pith/N2ZP22RND66JOOQA7KDSCZXNUR.json","graph_json":"https://pith.science/api/pith-number/N2ZP22RND66JOOQA7KDSCZXNUR/graph.json","events_json":"https://pith.science/api/pith-number/N2ZP22RND66JOOQA7KDSCZXNUR/events.json","paper":"https://pith.science/paper/N2ZP22RN"},"agent_actions":{"view_html":"https://pith.science/pith/N2ZP22RND66JOOQA7KDSCZXNUR","download_json":"https://pith.science/pith/N2ZP22RND66JOOQA7KDSCZXNUR.json","view_paper":"https://pith.science/paper/N2ZP22RN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.11328&json=true","fetch_graph":"https://pith.science/api/pith-number/N2ZP22RND66JOOQA7KDSCZXNUR/graph.json","fetch_events":"https://pith.science/api/pith-number/N2ZP22RND66JOOQA7KDSCZXNUR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N2ZP22RND66JOOQA7KDSCZXNUR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N2ZP22RND66JOOQA7KDSCZXNUR/action/storage_attestation","attest_author":"https://pith.science/pith/N2ZP22RND66JOOQA7KDSCZXNUR/action/author_attestation","sign_citation":"https://pith.science/pith/N2ZP22RND66JOOQA7KDSCZXNUR/action/citation_signature","submit_replication":"https://pith.science/pith/N2ZP22RND66JOOQA7KDSCZXNUR/action/replication_record"}},"created_at":"2026-05-17T23:53:57.591337+00:00","updated_at":"2026-05-17T23:53:57.591337+00:00"}