{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:SQOR22GFJIG2R32NHACN2ACFSM","short_pith_number":"pith:SQOR22GF","canonical_record":{"source":{"id":"1403.5381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-03-21T07:10:16Z","cross_cats_sorted":[],"title_canon_sha256":"9eb67d469b77e3be64c4d2384d84a92a38f29ed3e65b7e990ea69b5aa5ab8316","abstract_canon_sha256":"3d671f138c17dae52b6df035c01e060f4bc13bb0080f979c988b07992b4f9527"},"schema_version":"1.0"},"canonical_sha256":"941d1d68c54a0da8ef4d3804dd0045933e98f82996c7181459fbc9c776057171","source":{"kind":"arxiv","id":"1403.5381","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.5381","created_at":"2026-05-18T02:55:56Z"},{"alias_kind":"arxiv_version","alias_value":"1403.5381v1","created_at":"2026-05-18T02:55:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5381","created_at":"2026-05-18T02:55:56Z"},{"alias_kind":"pith_short_12","alias_value":"SQOR22GFJIG2","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SQOR22GFJIG2R32N","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SQOR22GF","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:SQOR22GFJIG2R32NHACN2ACFSM","target":"record","payload":{"canonical_record":{"source":{"id":"1403.5381","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-03-21T07:10:16Z","cross_cats_sorted":[],"title_canon_sha256":"9eb67d469b77e3be64c4d2384d84a92a38f29ed3e65b7e990ea69b5aa5ab8316","abstract_canon_sha256":"3d671f138c17dae52b6df035c01e060f4bc13bb0080f979c988b07992b4f9527"},"schema_version":"1.0"},"canonical_sha256":"941d1d68c54a0da8ef4d3804dd0045933e98f82996c7181459fbc9c776057171","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:56.506541Z","signature_b64":"VED8ioj1TeaRlkk+K0DEpSLRpCUvmaEfkT5Caw+sw1L0whuFeI0VAxzXTSaw9mq9JgsI/EUr64yZ3FRcy2MGBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"941d1d68c54a0da8ef4d3804dd0045933e98f82996c7181459fbc9c776057171","last_reissued_at":"2026-05-18T02:55:56.506016Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:56.506016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.5381","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-05-18T02:55:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fvN36k3BoOgwAJX1H57ZQbquYix1u9j1E4q7HYGCfPJwsVbYfcw9G2u1maZxL5AQ9UgMRD4pvM8l+LZthPjIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:42:26.164037Z"},"content_sha256":"58bb2881129ce3460ed94829a6ff46542dc40dbf9bc25c20f78827eec6d069ef","schema_version":"1.0","event_id":"sha256:58bb2881129ce3460ed94829a6ff46542dc40dbf9bc25c20f78827eec6d069ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:SQOR22GFJIG2R32NHACN2ACFSM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"({\\alpha}, k)-Minimal Sorting and Skew Join in MPI and MapReduce","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Ada Wai-chee Fu, Silu Huang","submitted_at":"2014-03-21T07:10:16Z","abstract_excerpt":"As computer clusters are found to be highly effective for handling massive datasets, the design of efficient parallel algorithms for such a computing model is of great interest. We consider ({\\alpha}, k)-minimal algorithms for such a purpose, where {\\alpha} is the number of rounds in the algorithm, and k is a bound on the deviation from perfect workload balance. We focus on new ({\\alpha}, k)-minimal algorithms for sorting and skew equijoin operations for computer clusters. To the best of our knowledge the proposed sorting and skew join algorithms achieve the best workload balancing guarantee w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5381","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":""},"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:55:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ey1XjGDnb0J+CWjATTJ9xiqwGWaoOnMBGhCzxxOKEecXwIMz1fOAwsxftzW6pyNYbFt9x+rEq68mMp6WHGCXAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:42:26.164402Z"},"content_sha256":"e29de9055ca6868f55ce9799c7b3bff923531ded4c505ab229b4a2964c16b75b","schema_version":"1.0","event_id":"sha256:e29de9055ca6868f55ce9799c7b3bff923531ded4c505ab229b4a2964c16b75b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SQOR22GFJIG2R32NHACN2ACFSM/bundle.json","state_url":"https://pith.science/pith/SQOR22GFJIG2R32NHACN2ACFSM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SQOR22GFJIG2R32NHACN2ACFSM/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-02T19:42:26Z","links":{"resolver":"https://pith.science/pith/SQOR22GFJIG2R32NHACN2ACFSM","bundle":"https://pith.science/pith/SQOR22GFJIG2R32NHACN2ACFSM/bundle.json","state":"https://pith.science/pith/SQOR22GFJIG2R32NHACN2ACFSM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SQOR22GFJIG2R32NHACN2ACFSM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:SQOR22GFJIG2R32NHACN2ACFSM","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":"3d671f138c17dae52b6df035c01e060f4bc13bb0080f979c988b07992b4f9527","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-03-21T07:10:16Z","title_canon_sha256":"9eb67d469b77e3be64c4d2384d84a92a38f29ed3e65b7e990ea69b5aa5ab8316"},"schema_version":"1.0","source":{"id":"1403.5381","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.5381","created_at":"2026-05-18T02:55:56Z"},{"alias_kind":"arxiv_version","alias_value":"1403.5381v1","created_at":"2026-05-18T02:55:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5381","created_at":"2026-05-18T02:55:56Z"},{"alias_kind":"pith_short_12","alias_value":"SQOR22GFJIG2","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"SQOR22GFJIG2R32N","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"SQOR22GF","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:e29de9055ca6868f55ce9799c7b3bff923531ded4c505ab229b4a2964c16b75b","target":"graph","created_at":"2026-05-18T02:55:56Z","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":"As computer clusters are found to be highly effective for handling massive datasets, the design of efficient parallel algorithms for such a computing model is of great interest. We consider ({\\alpha}, k)-minimal algorithms for such a purpose, where {\\alpha} is the number of rounds in the algorithm, and k is a bound on the deviation from perfect workload balance. We focus on new ({\\alpha}, k)-minimal algorithms for sorting and skew equijoin operations for computer clusters. To the best of our knowledge the proposed sorting and skew join algorithms achieve the best workload balancing guarantee w","authors_text":"Ada Wai-chee Fu, Silu Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-03-21T07:10:16Z","title":"({\\alpha}, k)-Minimal Sorting and Skew Join in MPI and MapReduce"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5381","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:58bb2881129ce3460ed94829a6ff46542dc40dbf9bc25c20f78827eec6d069ef","target":"record","created_at":"2026-05-18T02:55:56Z","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":"3d671f138c17dae52b6df035c01e060f4bc13bb0080f979c988b07992b4f9527","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2014-03-21T07:10:16Z","title_canon_sha256":"9eb67d469b77e3be64c4d2384d84a92a38f29ed3e65b7e990ea69b5aa5ab8316"},"schema_version":"1.0","source":{"id":"1403.5381","kind":"arxiv","version":1}},"canonical_sha256":"941d1d68c54a0da8ef4d3804dd0045933e98f82996c7181459fbc9c776057171","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"941d1d68c54a0da8ef4d3804dd0045933e98f82996c7181459fbc9c776057171","first_computed_at":"2026-05-18T02:55:56.506016Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:56.506016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VED8ioj1TeaRlkk+K0DEpSLRpCUvmaEfkT5Caw+sw1L0whuFeI0VAxzXTSaw9mq9JgsI/EUr64yZ3FRcy2MGBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:56.506541Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.5381","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58bb2881129ce3460ed94829a6ff46542dc40dbf9bc25c20f78827eec6d069ef","sha256:e29de9055ca6868f55ce9799c7b3bff923531ded4c505ab229b4a2964c16b75b"],"state_sha256":"cbd1bcc05f5149c0eec331fd2132af7a991dbddea985122ece2f20b51e3ff2b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vunETByctUW3rSSlN22Xh0o0+iTe+Dya1TSbHm4rZE+rwANCgpvll8zOTPy7X52zJhcqZE+ynfYkGAVxksxjCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:42:26.167214Z","bundle_sha256":"40bb5a7ff1573e70abc9cca68b73ced91561594ad55dc5dbe3b8219ee324740a"}}