{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7JLBUABJ7VPSHKOW2QZ3HVH4E4","short_pith_number":"pith:7JLBUABJ","canonical_record":{"source":{"id":"1410.6754","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-24T17:56:48Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"abc1e98af0551ecea4abbfe41a91c534e3a056f89a70e6084948ae366ff329f9","abstract_canon_sha256":"32d28bfca55369cd8d8f44814888b99d9c14277e086575f2e750e6ee741fc847"},"schema_version":"1.0"},"canonical_sha256":"fa561a0029fd5f23a9d6d433b3d4fc270bccfbca8ed7aa8b79daef5f336ae0c4","source":{"kind":"arxiv","id":"1410.6754","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6754","created_at":"2026-05-18T02:26:12Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6754v2","created_at":"2026-05-18T02:26:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6754","created_at":"2026-05-18T02:26:12Z"},{"alias_kind":"pith_short_12","alias_value":"7JLBUABJ7VPS","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7JLBUABJ7VPSHKOW","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7JLBUABJ","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7JLBUABJ7VPSHKOW2QZ3HVH4E4","target":"record","payload":{"canonical_record":{"source":{"id":"1410.6754","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-24T17:56:48Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"abc1e98af0551ecea4abbfe41a91c534e3a056f89a70e6084948ae366ff329f9","abstract_canon_sha256":"32d28bfca55369cd8d8f44814888b99d9c14277e086575f2e750e6ee741fc847"},"schema_version":"1.0"},"canonical_sha256":"fa561a0029fd5f23a9d6d433b3d4fc270bccfbca8ed7aa8b79daef5f336ae0c4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:12.553281Z","signature_b64":"MU3hBQsIEHg7r9LsjqyHWVOHp3Ptm3E6EkSChy+f0xLmVYtqBHclhu1/0V+VdtQlVs3k6b65vxLxUKNcpfX7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa561a0029fd5f23a9d6d433b3d4fc270bccfbca8ed7aa8b79daef5f336ae0c4","last_reissued_at":"2026-05-18T02:26:12.552735Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:12.552735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.6754","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-18T02:26:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LgDc4QtWjk1l/8/MKVxBpapWLyaV9aoQqQMRSHGO38FurOFLOKVUbVYTDodf+KDGwpFy7KIkr9OX4QCCgnDGDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:17:25.105067Z"},"content_sha256":"ddbb6441d2f94775b5bc1843cbb615a480d887ea786a87eb75f59b6eaf541780","schema_version":"1.0","event_id":"sha256:ddbb6441d2f94775b5bc1843cbb615a480d887ea786a87eb75f59b6eaf541780"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7JLBUABJ7VPSHKOW2QZ3HVH4E4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Practical Massively Parallel Sorting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Christian Schulz, Michael Axtmann, Peter Sanders, Timo Bingmann","submitted_at":"2014-10-24T17:56:48Z","abstract_excerpt":"Previous parallel sorting algorithms do not scale to the largest available machines, since they either have prohibitive communication volume or prohibitive critical path length. We describe algorithms that are a viable compromise and overcome this gap both in theory and practice. The algorithms are multi-level generalizations of the known algorithms sample sort and multiway mergesort. In particular our sample sort variant turns out to be very scalable. Some tools we develop may be of independent interest -- a simple, practical, and flexible sorting algorithm for small inputs working in logarit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6754","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-18T02:26:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8HQwumQX5xpa/0XSF7jW4p91M5naEEb08r09qs6lq0dgqLFsX0Akm84JNetUGTclvEjNQLTVjWWTVZFjuflbAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:17:25.105487Z"},"content_sha256":"232b30d3a4f01c8815a5fc7d46fd2982791deb51684e0b77db0b3cd8a8a09b92","schema_version":"1.0","event_id":"sha256:232b30d3a4f01c8815a5fc7d46fd2982791deb51684e0b77db0b3cd8a8a09b92"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7JLBUABJ7VPSHKOW2QZ3HVH4E4/bundle.json","state_url":"https://pith.science/pith/7JLBUABJ7VPSHKOW2QZ3HVH4E4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7JLBUABJ7VPSHKOW2QZ3HVH4E4/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-26T22:17:25Z","links":{"resolver":"https://pith.science/pith/7JLBUABJ7VPSHKOW2QZ3HVH4E4","bundle":"https://pith.science/pith/7JLBUABJ7VPSHKOW2QZ3HVH4E4/bundle.json","state":"https://pith.science/pith/7JLBUABJ7VPSHKOW2QZ3HVH4E4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7JLBUABJ7VPSHKOW2QZ3HVH4E4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7JLBUABJ7VPSHKOW2QZ3HVH4E4","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":"32d28bfca55369cd8d8f44814888b99d9c14277e086575f2e750e6ee741fc847","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-24T17:56:48Z","title_canon_sha256":"abc1e98af0551ecea4abbfe41a91c534e3a056f89a70e6084948ae366ff329f9"},"schema_version":"1.0","source":{"id":"1410.6754","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.6754","created_at":"2026-05-18T02:26:12Z"},{"alias_kind":"arxiv_version","alias_value":"1410.6754v2","created_at":"2026-05-18T02:26:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6754","created_at":"2026-05-18T02:26:12Z"},{"alias_kind":"pith_short_12","alias_value":"7JLBUABJ7VPS","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7JLBUABJ7VPSHKOW","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7JLBUABJ","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:232b30d3a4f01c8815a5fc7d46fd2982791deb51684e0b77db0b3cd8a8a09b92","target":"graph","created_at":"2026-05-18T02:26:12Z","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":"Previous parallel sorting algorithms do not scale to the largest available machines, since they either have prohibitive communication volume or prohibitive critical path length. We describe algorithms that are a viable compromise and overcome this gap both in theory and practice. The algorithms are multi-level generalizations of the known algorithms sample sort and multiway mergesort. In particular our sample sort variant turns out to be very scalable. Some tools we develop may be of independent interest -- a simple, practical, and flexible sorting algorithm for small inputs working in logarit","authors_text":"Christian Schulz, Michael Axtmann, Peter Sanders, Timo Bingmann","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-24T17:56:48Z","title":"Practical Massively Parallel Sorting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6754","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:ddbb6441d2f94775b5bc1843cbb615a480d887ea786a87eb75f59b6eaf541780","target":"record","created_at":"2026-05-18T02:26:12Z","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":"32d28bfca55369cd8d8f44814888b99d9c14277e086575f2e750e6ee741fc847","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-24T17:56:48Z","title_canon_sha256":"abc1e98af0551ecea4abbfe41a91c534e3a056f89a70e6084948ae366ff329f9"},"schema_version":"1.0","source":{"id":"1410.6754","kind":"arxiv","version":2}},"canonical_sha256":"fa561a0029fd5f23a9d6d433b3d4fc270bccfbca8ed7aa8b79daef5f336ae0c4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa561a0029fd5f23a9d6d433b3d4fc270bccfbca8ed7aa8b79daef5f336ae0c4","first_computed_at":"2026-05-18T02:26:12.552735Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:12.552735Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MU3hBQsIEHg7r9LsjqyHWVOHp3Ptm3E6EkSChy+f0xLmVYtqBHclhu1/0V+VdtQlVs3k6b65vxLxUKNcpfX7AA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:12.553281Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.6754","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ddbb6441d2f94775b5bc1843cbb615a480d887ea786a87eb75f59b6eaf541780","sha256:232b30d3a4f01c8815a5fc7d46fd2982791deb51684e0b77db0b3cd8a8a09b92"],"state_sha256":"8e41207178d0564835488d97cec2a40b101c3644aab9c448e0d071c33b989e6f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KWOoCyhfVWnNSceZOD4M9GWNRp8xRkj0NRp98hVGW1eQk7w7EtoYgIqZmH/UUgv15U7zgCccJu6jDZiJTrAACg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:17:25.108491Z","bundle_sha256":"ea2844768b0bffc4c85dddd4f2f87760ab65f490bd94445856649c0187cc884f"}}