{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:AT2I6HMQ4YKR7ISSJWWFBEMGRD","short_pith_number":"pith:AT2I6HMQ","canonical_record":{"source":{"id":"1804.07494","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-20T08:48:47Z","cross_cats_sorted":[],"title_canon_sha256":"91262b2a073aa384312211bd127245ff7ebc31dbfa799391abd7c1ebf5c2a01e","abstract_canon_sha256":"9abc41dfbe54dcb42babf2d57e59d4585fc5349e29c1bbd31776ae5b4bc94b34"},"schema_version":"1.0"},"canonical_sha256":"04f48f1d90e6151fa2524dac50918688ea9d2c98ea0c89a1dcd7756a5fcac2e6","source":{"kind":"arxiv","id":"1804.07494","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.07494","created_at":"2026-05-18T00:02:25Z"},{"alias_kind":"arxiv_version","alias_value":"1804.07494v2","created_at":"2026-05-18T00:02:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07494","created_at":"2026-05-18T00:02:25Z"},{"alias_kind":"pith_short_12","alias_value":"AT2I6HMQ4YKR","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AT2I6HMQ4YKR7ISS","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AT2I6HMQ","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:AT2I6HMQ4YKR7ISSJWWFBEMGRD","target":"record","payload":{"canonical_record":{"source":{"id":"1804.07494","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-20T08:48:47Z","cross_cats_sorted":[],"title_canon_sha256":"91262b2a073aa384312211bd127245ff7ebc31dbfa799391abd7c1ebf5c2a01e","abstract_canon_sha256":"9abc41dfbe54dcb42babf2d57e59d4585fc5349e29c1bbd31776ae5b4bc94b34"},"schema_version":"1.0"},"canonical_sha256":"04f48f1d90e6151fa2524dac50918688ea9d2c98ea0c89a1dcd7756a5fcac2e6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:25.214250Z","signature_b64":"0SPxRr/LgscfbfNlEzFuu1s5C57n5BRq2hrzuxg9hD+kg02Dz9+M3ozf6q56LmYckhJv1EI8/bHYn8qrAOckCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04f48f1d90e6151fa2524dac50918688ea9d2c98ea0c89a1dcd7756a5fcac2e6","last_reissued_at":"2026-05-18T00:02:25.213525Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:25.213525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.07494","source_version":2,"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-18T00:02:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wo6jJ9+lBIyXxmiMGXShP8M57gWFIpn0I56gua++1A3K8wz13cuGrQTk6iAiDBVDf/3t/i8BV5P0PbCpJ/b1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:21:17.679549Z"},"content_sha256":"f6f8f5b5a8635a52ca776f4355e9e3a480ef24d2d4276e7d864a83880869a546","schema_version":"1.0","event_id":"sha256:f6f8f5b5a8635a52ca776f4355e9e3a480ef24d2d4276e7d864a83880869a546"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:AT2I6HMQ4YKR7ISSJWWFBEMGRD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Quicksort without Pairwise Element Exchange","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Jesper Larsson Tr\\\"aff","submitted_at":"2018-04-20T08:48:47Z","abstract_excerpt":"Quicksort is an instructive classroom approach to parallel sorting on distributed memory parallel computers with many opportunities for illustrating specific implementation alternatives and tradeoffs with common communication interfaces like MPI. The (two) standard distributed memory Quicksort implementations exchange partitioned data elements at each level of the Quicksort recursion. In this note, we show that this is not necessary: It suffices to distribute only the chosen pivots, and postpone element redistribution to the bottom of the recursion. This reduces the total volume of data exchan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07494","kind":"arxiv","version":2},"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-18T00:02:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3qtC2Gw9Z2dPixKD72k7WKLR09hZRvfzj972XkuWfTHvXw2uKIzeMKSjvltAuyBANHb8bkx8vORq1aiUvJeQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:21:17.680242Z"},"content_sha256":"059418b035b1b52fc15749224b82820091919c6a41bff9c4959e8a9b139b8f62","schema_version":"1.0","event_id":"sha256:059418b035b1b52fc15749224b82820091919c6a41bff9c4959e8a9b139b8f62"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AT2I6HMQ4YKR7ISSJWWFBEMGRD/bundle.json","state_url":"https://pith.science/pith/AT2I6HMQ4YKR7ISSJWWFBEMGRD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AT2I6HMQ4YKR7ISSJWWFBEMGRD/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-30T18:21:17Z","links":{"resolver":"https://pith.science/pith/AT2I6HMQ4YKR7ISSJWWFBEMGRD","bundle":"https://pith.science/pith/AT2I6HMQ4YKR7ISSJWWFBEMGRD/bundle.json","state":"https://pith.science/pith/AT2I6HMQ4YKR7ISSJWWFBEMGRD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AT2I6HMQ4YKR7ISSJWWFBEMGRD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:AT2I6HMQ4YKR7ISSJWWFBEMGRD","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":"9abc41dfbe54dcb42babf2d57e59d4585fc5349e29c1bbd31776ae5b4bc94b34","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-20T08:48:47Z","title_canon_sha256":"91262b2a073aa384312211bd127245ff7ebc31dbfa799391abd7c1ebf5c2a01e"},"schema_version":"1.0","source":{"id":"1804.07494","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.07494","created_at":"2026-05-18T00:02:25Z"},{"alias_kind":"arxiv_version","alias_value":"1804.07494v2","created_at":"2026-05-18T00:02:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.07494","created_at":"2026-05-18T00:02:25Z"},{"alias_kind":"pith_short_12","alias_value":"AT2I6HMQ4YKR","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"AT2I6HMQ4YKR7ISS","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"AT2I6HMQ","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:059418b035b1b52fc15749224b82820091919c6a41bff9c4959e8a9b139b8f62","target":"graph","created_at":"2026-05-18T00:02:25Z","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":"Quicksort is an instructive classroom approach to parallel sorting on distributed memory parallel computers with many opportunities for illustrating specific implementation alternatives and tradeoffs with common communication interfaces like MPI. The (two) standard distributed memory Quicksort implementations exchange partitioned data elements at each level of the Quicksort recursion. In this note, we show that this is not necessary: It suffices to distribute only the chosen pivots, and postpone element redistribution to the bottom of the recursion. This reduces the total volume of data exchan","authors_text":"Jesper Larsson Tr\\\"aff","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-20T08:48:47Z","title":"Parallel Quicksort without Pairwise Element Exchange"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.07494","kind":"arxiv","version":2},"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:f6f8f5b5a8635a52ca776f4355e9e3a480ef24d2d4276e7d864a83880869a546","target":"record","created_at":"2026-05-18T00:02:25Z","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":"9abc41dfbe54dcb42babf2d57e59d4585fc5349e29c1bbd31776ae5b4bc94b34","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-04-20T08:48:47Z","title_canon_sha256":"91262b2a073aa384312211bd127245ff7ebc31dbfa799391abd7c1ebf5c2a01e"},"schema_version":"1.0","source":{"id":"1804.07494","kind":"arxiv","version":2}},"canonical_sha256":"04f48f1d90e6151fa2524dac50918688ea9d2c98ea0c89a1dcd7756a5fcac2e6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04f48f1d90e6151fa2524dac50918688ea9d2c98ea0c89a1dcd7756a5fcac2e6","first_computed_at":"2026-05-18T00:02:25.213525Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:25.213525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0SPxRr/LgscfbfNlEzFuu1s5C57n5BRq2hrzuxg9hD+kg02Dz9+M3ozf6q56LmYckhJv1EI8/bHYn8qrAOckCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:25.214250Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.07494","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6f8f5b5a8635a52ca776f4355e9e3a480ef24d2d4276e7d864a83880869a546","sha256:059418b035b1b52fc15749224b82820091919c6a41bff9c4959e8a9b139b8f62"],"state_sha256":"bd0b383da6fed9d7db0a93a8c88a61be7b1f7aba50e3790243a85c51e3e4fe26"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z5uYqrYacAEG6okVA8E5ukIAmKprrUU75KhDkRD2EW/RGZjmckxZxY15vMs43k7aLQa9Rbcaw2caXSo2nZziAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:21:17.683861Z","bundle_sha256":"82c7014f2ab03e777db356bc9163e34e343cc4128499ba9094a84c1506df5e7f"}}