{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VIM3UPN4NHV2433TO7KGRL4XFQ","short_pith_number":"pith:VIM3UPN4","canonical_record":{"source":{"id":"1204.0939","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-04-04T12:53:48Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"256119e9fa318e8f27ef28bf62ab61d2e1ced23a51889ebbd4ced3c1aab30c2c","abstract_canon_sha256":"bbdc8db620aec46d8442e7d4ac9abc86c18c5f0611b20d1d47a515f1ed13b5a3"},"schema_version":"1.0"},"canonical_sha256":"aa19ba3dbc69ebae6f7377d468af972c1aee75b0abdadf4317ded1a286db89cd","source":{"kind":"arxiv","id":"1204.0939","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0939","created_at":"2026-05-18T03:49:34Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0939v1","created_at":"2026-05-18T03:49:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0939","created_at":"2026-05-18T03:49:34Z"},{"alias_kind":"pith_short_12","alias_value":"VIM3UPN4NHV2","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VIM3UPN4NHV2433T","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VIM3UPN4","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VIM3UPN4NHV2433TO7KGRL4XFQ","target":"record","payload":{"canonical_record":{"source":{"id":"1204.0939","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-04-04T12:53:48Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"256119e9fa318e8f27ef28bf62ab61d2e1ced23a51889ebbd4ced3c1aab30c2c","abstract_canon_sha256":"bbdc8db620aec46d8442e7d4ac9abc86c18c5f0611b20d1d47a515f1ed13b5a3"},"schema_version":"1.0"},"canonical_sha256":"aa19ba3dbc69ebae6f7377d468af972c1aee75b0abdadf4317ded1a286db89cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:34.783540Z","signature_b64":"7ZSrJFfXLV4sKcu9Lw9o7dOesTPayeA5P5kmEWA4qVErOCaWniPsieilw9wXEqcQowxtyQD+vfR+lZTkml6DDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa19ba3dbc69ebae6f7377d468af972c1aee75b0abdadf4317ded1a286db89cd","last_reissued_at":"2026-05-18T03:49:34.782964Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:34.782964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.0939","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-18T03:49:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QRZ4GSmc6S2/EgUgeWA3841tQw0ckd6WKIj7p1yqRJWjEemSspbsu6ku2Hp8IGaqxy8v2nKJCT6xDMlAZgBBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T19:38:53.059197Z"},"content_sha256":"fc6cbb577751482e44e43298bbd0f0efffaca9b7ea176242465d0b6f191c053a","schema_version":"1.0","event_id":"sha256:fc6cbb577751482e44e43298bbd0f0efffaca9b7ea176242465d0b6f191c053a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VIM3UPN4NHV2433TO7KGRL4XFQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reclaiming the energy of a schedule: models and algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DC","authors_text":"Anne Benoit, Fanny Dufoss\\'e, Guillaume Aupy, Yves Robert","submitted_at":"2012-04-04T12:53:48Z","abstract_excerpt":"We consider a task graph to be executed on a set of processors. We assume that the mapping is given, say by an ordered list of tasks to execute on each processor, and we aim at optimizing the energy consumption while enforcing a prescribed bound on the execution time. While it is not possible to change the allocation of a task, it is possible to change its speed. Rather than using a local approach such as backfilling, we consider the problem as a whole and study the impact of several speed variation models on its complexity. For continuous speeds, we give a closed-form formula for trees and se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0939","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-18T03:49:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IwwiEL09hEjJ1MFfrdRV7P2TUSGw0HtnVHpzbbvG1Ded8JN8/kGneQ/fsTJ0NqWnICaE3XBlkiJybZURXpXBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T19:38:53.059558Z"},"content_sha256":"ee0e711e92f70e0e394341bbec11bb3b33bc4fd8bd3330a1a2279fb57e040383","schema_version":"1.0","event_id":"sha256:ee0e711e92f70e0e394341bbec11bb3b33bc4fd8bd3330a1a2279fb57e040383"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VIM3UPN4NHV2433TO7KGRL4XFQ/bundle.json","state_url":"https://pith.science/pith/VIM3UPN4NHV2433TO7KGRL4XFQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VIM3UPN4NHV2433TO7KGRL4XFQ/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-21T19:38:53Z","links":{"resolver":"https://pith.science/pith/VIM3UPN4NHV2433TO7KGRL4XFQ","bundle":"https://pith.science/pith/VIM3UPN4NHV2433TO7KGRL4XFQ/bundle.json","state":"https://pith.science/pith/VIM3UPN4NHV2433TO7KGRL4XFQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VIM3UPN4NHV2433TO7KGRL4XFQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VIM3UPN4NHV2433TO7KGRL4XFQ","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":"bbdc8db620aec46d8442e7d4ac9abc86c18c5f0611b20d1d47a515f1ed13b5a3","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-04-04T12:53:48Z","title_canon_sha256":"256119e9fa318e8f27ef28bf62ab61d2e1ced23a51889ebbd4ced3c1aab30c2c"},"schema_version":"1.0","source":{"id":"1204.0939","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0939","created_at":"2026-05-18T03:49:34Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0939v1","created_at":"2026-05-18T03:49:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0939","created_at":"2026-05-18T03:49:34Z"},{"alias_kind":"pith_short_12","alias_value":"VIM3UPN4NHV2","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VIM3UPN4NHV2433T","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VIM3UPN4","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:ee0e711e92f70e0e394341bbec11bb3b33bc4fd8bd3330a1a2279fb57e040383","target":"graph","created_at":"2026-05-18T03:49:34Z","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 consider a task graph to be executed on a set of processors. We assume that the mapping is given, say by an ordered list of tasks to execute on each processor, and we aim at optimizing the energy consumption while enforcing a prescribed bound on the execution time. While it is not possible to change the allocation of a task, it is possible to change its speed. Rather than using a local approach such as backfilling, we consider the problem as a whole and study the impact of several speed variation models on its complexity. For continuous speeds, we give a closed-form formula for trees and se","authors_text":"Anne Benoit, Fanny Dufoss\\'e, Guillaume Aupy, Yves Robert","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-04-04T12:53:48Z","title":"Reclaiming the energy of a schedule: models and algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0939","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:fc6cbb577751482e44e43298bbd0f0efffaca9b7ea176242465d0b6f191c053a","target":"record","created_at":"2026-05-18T03:49:34Z","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":"bbdc8db620aec46d8442e7d4ac9abc86c18c5f0611b20d1d47a515f1ed13b5a3","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-04-04T12:53:48Z","title_canon_sha256":"256119e9fa318e8f27ef28bf62ab61d2e1ced23a51889ebbd4ced3c1aab30c2c"},"schema_version":"1.0","source":{"id":"1204.0939","kind":"arxiv","version":1}},"canonical_sha256":"aa19ba3dbc69ebae6f7377d468af972c1aee75b0abdadf4317ded1a286db89cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa19ba3dbc69ebae6f7377d468af972c1aee75b0abdadf4317ded1a286db89cd","first_computed_at":"2026-05-18T03:49:34.782964Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:49:34.782964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7ZSrJFfXLV4sKcu9Lw9o7dOesTPayeA5P5kmEWA4qVErOCaWniPsieilw9wXEqcQowxtyQD+vfR+lZTkml6DDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:49:34.783540Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.0939","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc6cbb577751482e44e43298bbd0f0efffaca9b7ea176242465d0b6f191c053a","sha256:ee0e711e92f70e0e394341bbec11bb3b33bc4fd8bd3330a1a2279fb57e040383"],"state_sha256":"c8ccee50e6ce63451539180a963de5a821e206af61628fa07a5f947278e6cc6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CfwvUtkdChtIlTwEYZaYE7akPfKoTkMeZL0AGkrmyga+D0NkOT9xEMPWIccZl1+hmKJ8sOLy8pbo/CZ6VzVFCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T19:38:53.061503Z","bundle_sha256":"c883b72094d4b67f8e003b0e595f2139792e02be822cf5c54cd83fa118ef2515"}}