{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5EM7GRVDCNTS6NDURCGGISNV5T","short_pith_number":"pith:5EM7GRVD","canonical_record":{"source":{"id":"1312.4203","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-15T23:10:27Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"826a0851897b159e310ee5ba6b99803cbfb1081e893bfce77222f33d7445d62e","abstract_canon_sha256":"5a83c13fd8a0eb1d374ef1ec4d43196a76a1e3d54251568462b001d65161392d"},"schema_version":"1.0"},"canonical_sha256":"e919f346a313672f3474888c6449b5ecc3c191de8e2e721749e65ebe5c405d4d","source":{"kind":"arxiv","id":"1312.4203","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4203","created_at":"2026-05-18T02:49:09Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4203v3","created_at":"2026-05-18T02:49:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4203","created_at":"2026-05-18T02:49:09Z"},{"alias_kind":"pith_short_12","alias_value":"5EM7GRVDCNTS","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5EM7GRVDCNTS6NDU","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5EM7GRVD","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5EM7GRVDCNTS6NDURCGGISNV5T","target":"record","payload":{"canonical_record":{"source":{"id":"1312.4203","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-15T23:10:27Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"826a0851897b159e310ee5ba6b99803cbfb1081e893bfce77222f33d7445d62e","abstract_canon_sha256":"5a83c13fd8a0eb1d374ef1ec4d43196a76a1e3d54251568462b001d65161392d"},"schema_version":"1.0"},"canonical_sha256":"e919f346a313672f3474888c6449b5ecc3c191de8e2e721749e65ebe5c405d4d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:09.872941Z","signature_b64":"zHKZ6DV9tmSPU+uYBbiou0YzzMs8jhf3npotXHyWmfHtYpeuRc7t2O2U+Ei0TbP5OpxgDc5C+Ivptm4Z2EWiCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e919f346a313672f3474888c6449b5ecc3c191de8e2e721749e65ebe5c405d4d","last_reissued_at":"2026-05-18T02:49:09.872514Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:09.872514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.4203","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-18T02:49:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NXMfXQawl7boyvTl1q/8J1aHJ2X/zcaK0UHVIR4WHYIW4ONxE+xfBkjVLHbgMC7E7BVr02FqUW0O9aZF+vJkAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T03:57:36.416532Z"},"content_sha256":"6bd1fda72114d01b235b05bdec71c87579e849b3935ddca1fe036c757c6730eb","schema_version":"1.0","event_id":"sha256:6bd1fda72114d01b235b05bdec71c87579e849b3935ddca1fe036c757c6730eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5EM7GRVDCNTS6NDURCGGISNV5T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Dimitrios Fotakis, Emmanouil Zampetakis, Georgios Zois, Ioannis Milis","submitted_at":"2013-12-15T23:10:27Z","abstract_excerpt":"We propose constant approximation algorithms for generalizations of the Flexible Flow Shop (FFS) problem which form a realistic model for non-preemptive scheduling in MapReduce systems. Our results concern the minimization of the total weighted completion time of a set of MapReduce jobs on unrelated processors and improve substantially on the model proposed by Moseley et al. (SPAA 2011) in two directions. First, we consider each job consisting of multiple Map and Reduce tasks, as this is the key idea behind MapReduce computations, and we propose a constant approximation algorithm. Then, we int"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4203","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-18T02:49:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y4x+ar2612QqWLtqNY4QucS7PDmhnxHvlRIwJBXPUkmqi5LhkM23UzoK+NMcCPTkj66mTMpFFtXiu4WdbLn9Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T03:57:36.416871Z"},"content_sha256":"8b2267e847ad87d10f4e328fc566407cf4b409f550980ac96e6cfa0051195e1d","schema_version":"1.0","event_id":"sha256:8b2267e847ad87d10f4e328fc566407cf4b409f550980ac96e6cfa0051195e1d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5EM7GRVDCNTS6NDURCGGISNV5T/bundle.json","state_url":"https://pith.science/pith/5EM7GRVDCNTS6NDURCGGISNV5T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5EM7GRVDCNTS6NDURCGGISNV5T/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-22T03:57:36Z","links":{"resolver":"https://pith.science/pith/5EM7GRVDCNTS6NDURCGGISNV5T","bundle":"https://pith.science/pith/5EM7GRVDCNTS6NDURCGGISNV5T/bundle.json","state":"https://pith.science/pith/5EM7GRVDCNTS6NDURCGGISNV5T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5EM7GRVDCNTS6NDURCGGISNV5T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5EM7GRVDCNTS6NDURCGGISNV5T","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":"5a83c13fd8a0eb1d374ef1ec4d43196a76a1e3d54251568462b001d65161392d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-15T23:10:27Z","title_canon_sha256":"826a0851897b159e310ee5ba6b99803cbfb1081e893bfce77222f33d7445d62e"},"schema_version":"1.0","source":{"id":"1312.4203","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.4203","created_at":"2026-05-18T02:49:09Z"},{"alias_kind":"arxiv_version","alias_value":"1312.4203v3","created_at":"2026-05-18T02:49:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4203","created_at":"2026-05-18T02:49:09Z"},{"alias_kind":"pith_short_12","alias_value":"5EM7GRVDCNTS","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5EM7GRVDCNTS6NDU","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5EM7GRVD","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:8b2267e847ad87d10f4e328fc566407cf4b409f550980ac96e6cfa0051195e1d","target":"graph","created_at":"2026-05-18T02:49:09Z","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":"We propose constant approximation algorithms for generalizations of the Flexible Flow Shop (FFS) problem which form a realistic model for non-preemptive scheduling in MapReduce systems. Our results concern the minimization of the total weighted completion time of a set of MapReduce jobs on unrelated processors and improve substantially on the model proposed by Moseley et al. (SPAA 2011) in two directions. First, we consider each job consisting of multiple Map and Reduce tasks, as this is the key idea behind MapReduce computations, and we propose a constant approximation algorithm. Then, we int","authors_text":"Dimitrios Fotakis, Emmanouil Zampetakis, Georgios Zois, Ioannis Milis","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-15T23:10:27Z","title":"Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4203","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:6bd1fda72114d01b235b05bdec71c87579e849b3935ddca1fe036c757c6730eb","target":"record","created_at":"2026-05-18T02:49:09Z","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":"5a83c13fd8a0eb1d374ef1ec4d43196a76a1e3d54251568462b001d65161392d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-12-15T23:10:27Z","title_canon_sha256":"826a0851897b159e310ee5ba6b99803cbfb1081e893bfce77222f33d7445d62e"},"schema_version":"1.0","source":{"id":"1312.4203","kind":"arxiv","version":3}},"canonical_sha256":"e919f346a313672f3474888c6449b5ecc3c191de8e2e721749e65ebe5c405d4d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e919f346a313672f3474888c6449b5ecc3c191de8e2e721749e65ebe5c405d4d","first_computed_at":"2026-05-18T02:49:09.872514Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:09.872514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zHKZ6DV9tmSPU+uYBbiou0YzzMs8jhf3npotXHyWmfHtYpeuRc7t2O2U+Ei0TbP5OpxgDc5C+Ivptm4Z2EWiCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:09.872941Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.4203","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6bd1fda72114d01b235b05bdec71c87579e849b3935ddca1fe036c757c6730eb","sha256:8b2267e847ad87d10f4e328fc566407cf4b409f550980ac96e6cfa0051195e1d"],"state_sha256":"fc39867e7b72657688b1bbbf54b9e5cfd695de59e0d29bc05ff590774dc3d1ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w0jPHx817SH+hdbKnZuNjOVlI5IBX+ghW+q8RYBUdl02J26icXBTMOjUYaGSFY22oPAoiOq2YT1tXuMNPA9zAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T03:57:36.418957Z","bundle_sha256":"1933a571e374e6332f049a9f94a1ea0c2243591084cb44980db7f84801bf81c2"}}