{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RDWMI7SADYSVHYGZNNEU4YDF4O","short_pith_number":"pith:RDWMI7SA","canonical_record":{"source":{"id":"1402.2810","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-12T13:16:16Z","cross_cats_sorted":[],"title_canon_sha256":"1f0a67b1c0d9e37a7fb7bd53974011262351c1006903116543936e1b37491217","abstract_canon_sha256":"57a2704abb89d28b8d2cbf4e3b4145133382145cca2fe8c8d28d5ac1292c2995"},"schema_version":"1.0"},"canonical_sha256":"88ecc47e401e2553e0d96b494e6065e3a9135fa139e38a9b76ac4e1b9155343b","source":{"kind":"arxiv","id":"1402.2810","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2810","created_at":"2026-05-18T02:59:17Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2810v1","created_at":"2026-05-18T02:59:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2810","created_at":"2026-05-18T02:59:17Z"},{"alias_kind":"pith_short_12","alias_value":"RDWMI7SADYSV","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RDWMI7SADYSVHYGZ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RDWMI7SA","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RDWMI7SADYSVHYGZNNEU4YDF4O","target":"record","payload":{"canonical_record":{"source":{"id":"1402.2810","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-12T13:16:16Z","cross_cats_sorted":[],"title_canon_sha256":"1f0a67b1c0d9e37a7fb7bd53974011262351c1006903116543936e1b37491217","abstract_canon_sha256":"57a2704abb89d28b8d2cbf4e3b4145133382145cca2fe8c8d28d5ac1292c2995"},"schema_version":"1.0"},"canonical_sha256":"88ecc47e401e2553e0d96b494e6065e3a9135fa139e38a9b76ac4e1b9155343b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:17.222249Z","signature_b64":"6l5PCP8vAS4OzCPQFmQNxZ8ymSnqYjMjsPjjSPOjgD3W/krsx4yEhWzV2Y8hp/5EGHLA+m73L1Ofry8i4Oa+BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88ecc47e401e2553e0d96b494e6065e3a9135fa139e38a9b76ac4e1b9155343b","last_reissued_at":"2026-05-18T02:59:17.221519Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:17.221519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.2810","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:59:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eCKNSzgBAkUl9VX/rqRBN9Yh9Ag9o/+uMxo2EdwuBMotwj/kqZ+dgpJvRcn3U6BpkttL4rh9NANnkE5/l2biAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T14:50:46.424708Z"},"content_sha256":"bf0db838f468fcf8729f08270d661cabd29ce48f1d2487d3ae1b9bbf1a893d23","schema_version":"1.0","event_id":"sha256:bf0db838f468fcf8729f08270d661cabd29ce48f1d2487d3ae1b9bbf1a893d23"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RDWMI7SADYSVHYGZNNEU4YDF4O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Energy Efficient Scheduling of MapReduce Jobs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dimitrios Letsios, Evripidis Bampis, Georgios Zois, Giorgio Lucarelli, Ioannis Milis, Vincent Chau","submitted_at":"2014-02-12T13:16:16Z","abstract_excerpt":"MapReduce is emerged as a prominent programming model for data-intensive computation. In this work, we study power-aware MapReduce scheduling in the speed scaling setting first introduced by Yao et al. [FOCS 1995]. We focus on the minimization of the total weighted completion time of a set of MapReduce jobs under a given budget of energy. Using a linear programming relaxation of our problem, we derive a polynomial time constant-factor approximation algorithm. We also propose a convex programming formulation that we combine with standard list scheduling policies, and we evaluate their performan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2810","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:59:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6I8cpebFOOpGxCl082fKQe1bCFSrkH7v9/8vuASOFoY/QeVfY/cATDWcuufBA1/nhNB5n0pVfVEFJbpiPbGvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T14:50:46.425062Z"},"content_sha256":"680ede0a07a5892140810d72fe8e596450270a25dcee781a02728a1614aa9181","schema_version":"1.0","event_id":"sha256:680ede0a07a5892140810d72fe8e596450270a25dcee781a02728a1614aa9181"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RDWMI7SADYSVHYGZNNEU4YDF4O/bundle.json","state_url":"https://pith.science/pith/RDWMI7SADYSVHYGZNNEU4YDF4O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RDWMI7SADYSVHYGZNNEU4YDF4O/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-21T14:50:46Z","links":{"resolver":"https://pith.science/pith/RDWMI7SADYSVHYGZNNEU4YDF4O","bundle":"https://pith.science/pith/RDWMI7SADYSVHYGZNNEU4YDF4O/bundle.json","state":"https://pith.science/pith/RDWMI7SADYSVHYGZNNEU4YDF4O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RDWMI7SADYSVHYGZNNEU4YDF4O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RDWMI7SADYSVHYGZNNEU4YDF4O","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":"57a2704abb89d28b8d2cbf4e3b4145133382145cca2fe8c8d28d5ac1292c2995","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-12T13:16:16Z","title_canon_sha256":"1f0a67b1c0d9e37a7fb7bd53974011262351c1006903116543936e1b37491217"},"schema_version":"1.0","source":{"id":"1402.2810","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2810","created_at":"2026-05-18T02:59:17Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2810v1","created_at":"2026-05-18T02:59:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2810","created_at":"2026-05-18T02:59:17Z"},{"alias_kind":"pith_short_12","alias_value":"RDWMI7SADYSV","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RDWMI7SADYSVHYGZ","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RDWMI7SA","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:680ede0a07a5892140810d72fe8e596450270a25dcee781a02728a1614aa9181","target":"graph","created_at":"2026-05-18T02:59:17Z","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":"MapReduce is emerged as a prominent programming model for data-intensive computation. In this work, we study power-aware MapReduce scheduling in the speed scaling setting first introduced by Yao et al. [FOCS 1995]. We focus on the minimization of the total weighted completion time of a set of MapReduce jobs under a given budget of energy. Using a linear programming relaxation of our problem, we derive a polynomial time constant-factor approximation algorithm. We also propose a convex programming formulation that we combine with standard list scheduling policies, and we evaluate their performan","authors_text":"Dimitrios Letsios, Evripidis Bampis, Georgios Zois, Giorgio Lucarelli, Ioannis Milis, Vincent Chau","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-12T13:16:16Z","title":"Energy Efficient Scheduling of MapReduce Jobs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2810","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:bf0db838f468fcf8729f08270d661cabd29ce48f1d2487d3ae1b9bbf1a893d23","target":"record","created_at":"2026-05-18T02:59:17Z","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":"57a2704abb89d28b8d2cbf4e3b4145133382145cca2fe8c8d28d5ac1292c2995","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-12T13:16:16Z","title_canon_sha256":"1f0a67b1c0d9e37a7fb7bd53974011262351c1006903116543936e1b37491217"},"schema_version":"1.0","source":{"id":"1402.2810","kind":"arxiv","version":1}},"canonical_sha256":"88ecc47e401e2553e0d96b494e6065e3a9135fa139e38a9b76ac4e1b9155343b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88ecc47e401e2553e0d96b494e6065e3a9135fa139e38a9b76ac4e1b9155343b","first_computed_at":"2026-05-18T02:59:17.221519Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:17.221519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6l5PCP8vAS4OzCPQFmQNxZ8ymSnqYjMjsPjjSPOjgD3W/krsx4yEhWzV2Y8hp/5EGHLA+m73L1Ofry8i4Oa+BA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:17.222249Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.2810","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf0db838f468fcf8729f08270d661cabd29ce48f1d2487d3ae1b9bbf1a893d23","sha256:680ede0a07a5892140810d72fe8e596450270a25dcee781a02728a1614aa9181"],"state_sha256":"88f2b535dcdff2abe4314affa3b65579b4700a294884d2f6ae75a5caa7260cf5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y2ksrcoo/Cz+zdSxQPvnlpGSena6bXvoMFAX5bSgHbAmH1S08yL6AZofLchsIaohETtbxOYLrgGsX12L64JdDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T14:50:46.427057Z","bundle_sha256":"ca63272dc0d107e3ac05c28ee56a05cd8d850a2e87b1dd4546dedbc837c33b56"}}