{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:EQCMH4H4CQUBOY5GAC3AB7YFIW","short_pith_number":"pith:EQCMH4H4","canonical_record":{"source":{"id":"1302.3720","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-15T10:42:53Z","cross_cats_sorted":[],"title_canon_sha256":"9279f05ea3b0fc56e1c7cc7cfbac709c72ab64e822b94056300458493a3aea49","abstract_canon_sha256":"bbcb3becf86bf09c5334cf6a79e7516298904a28877c431b16d29729e61ccdd9"},"schema_version":"1.0"},"canonical_sha256":"2404c3f0fc14281763a600b600ff0545894cde15bd76344dc2ebef877941b713","source":{"kind":"arxiv","id":"1302.3720","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3720","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3720v1","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3720","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"pith_short_12","alias_value":"EQCMH4H4CQUB","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EQCMH4H4CQUBOY5G","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EQCMH4H4","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:EQCMH4H4CQUBOY5GAC3AB7YFIW","target":"record","payload":{"canonical_record":{"source":{"id":"1302.3720","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-15T10:42:53Z","cross_cats_sorted":[],"title_canon_sha256":"9279f05ea3b0fc56e1c7cc7cfbac709c72ab64e822b94056300458493a3aea49","abstract_canon_sha256":"bbcb3becf86bf09c5334cf6a79e7516298904a28877c431b16d29729e61ccdd9"},"schema_version":"1.0"},"canonical_sha256":"2404c3f0fc14281763a600b600ff0545894cde15bd76344dc2ebef877941b713","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:36.004875Z","signature_b64":"vC7mxEobbzvG1RCAwc5j7FGT/hC2hvdc5TZ76/iKwlc9xWOMhApu7Z69cX9Lj8rgaZReAI6b/kbahWsb6pDXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2404c3f0fc14281763a600b600ff0545894cde15bd76344dc2ebef877941b713","last_reissued_at":"2026-05-18T03:33:36.004014Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:36.004014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.3720","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:33:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CR4O26C9OHk1bIBzuxWqJ+f05RMBLSYSilYIezgH1a0b7Ch5mj1Ecgw9E/vMT1xAa91UQzYyY/hroV4cmLIcAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:46:28.879084Z"},"content_sha256":"3857a9346913fe394e90c38589678c675717150bc0167b54b6c4be5698fc7941","schema_version":"1.0","event_id":"sha256:3857a9346913fe394e90c38589678c675717150bc0167b54b6c4be5698fc7941"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:EQCMH4H4CQUBOY5GAC3AB7YFIW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Energy-aware checkpointing of divisible tasks with soft or hard deadlines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anne Benoit, Guillaume Aupy, Paul Renaud-Goud, Rami Melhem, Yves Robert","submitted_at":"2013-02-15T10:42:53Z","abstract_excerpt":"In this paper, we aim at minimizing the energy consumption when executing a divisible workload under a bound on the total execution time, while resilience is provided through checkpointing. We discuss several variants of this multi-criteria problem. Given the workload, we need to decide how many chunks to use, what are the sizes of these chunks, and at which speed each chunk is executed. Furthermore, since a failure may occur during the execution of a chunk, we also need to decide at which speed a chunk should be re-executed in the event of a failure. The goal is to minimize the expectation of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3720","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:33:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TC/Tzh3uka+IRASZdQuW4GK1ZFp8LdPZ84U9PN1qO5yAx0o4MgTUkyAhdMzzxPslYbzlpRrgQsi96Obb8EkRDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T14:46:28.879707Z"},"content_sha256":"07109147d88bcc09c91e721b2a72658e326b7a2acf286a074d35a4690628c82c","schema_version":"1.0","event_id":"sha256:07109147d88bcc09c91e721b2a72658e326b7a2acf286a074d35a4690628c82c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EQCMH4H4CQUBOY5GAC3AB7YFIW/bundle.json","state_url":"https://pith.science/pith/EQCMH4H4CQUBOY5GAC3AB7YFIW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EQCMH4H4CQUBOY5GAC3AB7YFIW/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-30T14:46:28Z","links":{"resolver":"https://pith.science/pith/EQCMH4H4CQUBOY5GAC3AB7YFIW","bundle":"https://pith.science/pith/EQCMH4H4CQUBOY5GAC3AB7YFIW/bundle.json","state":"https://pith.science/pith/EQCMH4H4CQUBOY5GAC3AB7YFIW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EQCMH4H4CQUBOY5GAC3AB7YFIW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EQCMH4H4CQUBOY5GAC3AB7YFIW","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":"bbcb3becf86bf09c5334cf6a79e7516298904a28877c431b16d29729e61ccdd9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-15T10:42:53Z","title_canon_sha256":"9279f05ea3b0fc56e1c7cc7cfbac709c72ab64e822b94056300458493a3aea49"},"schema_version":"1.0","source":{"id":"1302.3720","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3720","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3720v1","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3720","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"pith_short_12","alias_value":"EQCMH4H4CQUB","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EQCMH4H4CQUBOY5G","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EQCMH4H4","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:07109147d88bcc09c91e721b2a72658e326b7a2acf286a074d35a4690628c82c","target":"graph","created_at":"2026-05-18T03:33:36Z","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":"In this paper, we aim at minimizing the energy consumption when executing a divisible workload under a bound on the total execution time, while resilience is provided through checkpointing. We discuss several variants of this multi-criteria problem. Given the workload, we need to decide how many chunks to use, what are the sizes of these chunks, and at which speed each chunk is executed. Furthermore, since a failure may occur during the execution of a chunk, we also need to decide at which speed a chunk should be re-executed in the event of a failure. The goal is to minimize the expectation of","authors_text":"Anne Benoit, Guillaume Aupy, Paul Renaud-Goud, Rami Melhem, Yves Robert","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-15T10:42:53Z","title":"Energy-aware checkpointing of divisible tasks with soft or hard deadlines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3720","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:3857a9346913fe394e90c38589678c675717150bc0167b54b6c4be5698fc7941","target":"record","created_at":"2026-05-18T03:33:36Z","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":"bbcb3becf86bf09c5334cf6a79e7516298904a28877c431b16d29729e61ccdd9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-15T10:42:53Z","title_canon_sha256":"9279f05ea3b0fc56e1c7cc7cfbac709c72ab64e822b94056300458493a3aea49"},"schema_version":"1.0","source":{"id":"1302.3720","kind":"arxiv","version":1}},"canonical_sha256":"2404c3f0fc14281763a600b600ff0545894cde15bd76344dc2ebef877941b713","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2404c3f0fc14281763a600b600ff0545894cde15bd76344dc2ebef877941b713","first_computed_at":"2026-05-18T03:33:36.004014Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:36.004014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vC7mxEobbzvG1RCAwc5j7FGT/hC2hvdc5TZ76/iKwlc9xWOMhApu7Z69cX9Lj8rgaZReAI6b/kbahWsb6pDXDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:36.004875Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.3720","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3857a9346913fe394e90c38589678c675717150bc0167b54b6c4be5698fc7941","sha256:07109147d88bcc09c91e721b2a72658e326b7a2acf286a074d35a4690628c82c"],"state_sha256":"a8e3aa5bf4df4628cce40ec244400cb60909253e71b0ee2887ad379dabf9f009"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qDhwbOWBMeP9hclruU7W2KiRa65rxG6KWLRjwrrQy1N9pYoNMiv4+X8it2jGIaFzMtDxGCL5+fyNDsSNOzz1Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T14:46:28.882463Z","bundle_sha256":"f438bdbde5d3f9ec28028f3554377644af57d3c5a2db63dbc26291245410ea54"}}