{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VGFIXWHA3V52CBUFWHO2O22VVK","short_pith_number":"pith:VGFIXWHA","schema_version":"1.0","canonical_sha256":"a98a8bd8e0dd7ba10685b1dda76b55aabd2c9c3b4c5dea5b3de69592aa522470","source":{"kind":"arxiv","id":"1210.4673","version":1},"attestation_state":"computed","paper":{"title":"Approximation algorithms for energy, reliability and makespan optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anne Benoit, Guillaume Aupy","submitted_at":"2012-10-17T09:03:28Z","abstract_excerpt":"In this paper, we consider the problem of scheduling an application on a parallel computational platform. The application is a particular task graph, either a linear chain of tasks, or a set of independent tasks. The platform is made of identical processors, whose speed can be dynamically modified. It is also subject to failures: if a processor is slowed down to decrease the energy consumption, it has a higher chance to fail. Therefore, the scheduling problem requires to re-execute or replicate tasks (i.e., execute twice a same task, either on the same processor, or on two distinct processors)"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1210.4673","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-17T09:03:28Z","cross_cats_sorted":[],"title_canon_sha256":"4b1326687fc04c12a79ccd280fed6ebfca48a82083bfd8da90cc9257087e1441","abstract_canon_sha256":"0a09b7806e6a255baef276d161fc2f2f462f57030894c1d9368c08746fb98793"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:56.479982Z","signature_b64":"i7ORuep9OSyj/UMCwFqDQ4Ja/0yxCkP8HwdTZGOZsJRCgh7wDxziB4OaP6dPy87irT5MbCnNNOp28q1LO0RuCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a98a8bd8e0dd7ba10685b1dda76b55aabd2c9c3b4c5dea5b3de69592aa522470","last_reissued_at":"2026-05-18T03:42:56.479040Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:56.479040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation algorithms for energy, reliability and makespan optimization problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anne Benoit, Guillaume Aupy","submitted_at":"2012-10-17T09:03:28Z","abstract_excerpt":"In this paper, we consider the problem of scheduling an application on a parallel computational platform. The application is a particular task graph, either a linear chain of tasks, or a set of independent tasks. The platform is made of identical processors, whose speed can be dynamically modified. It is also subject to failures: if a processor is slowed down to decrease the energy consumption, it has a higher chance to fail. Therefore, the scheduling problem requires to re-execute or replicate tasks (i.e., execute twice a same task, either on the same processor, or on two distinct processors)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4673","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.4673","created_at":"2026-05-18T03:42:56.479214+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.4673v1","created_at":"2026-05-18T03:42:56.479214+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4673","created_at":"2026-05-18T03:42:56.479214+00:00"},{"alias_kind":"pith_short_12","alias_value":"VGFIXWHA3V52","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VGFIXWHA3V52CBUF","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VGFIXWHA","created_at":"2026-05-18T12:27:25.539911+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VGFIXWHA3V52CBUFWHO2O22VVK","json":"https://pith.science/pith/VGFIXWHA3V52CBUFWHO2O22VVK.json","graph_json":"https://pith.science/api/pith-number/VGFIXWHA3V52CBUFWHO2O22VVK/graph.json","events_json":"https://pith.science/api/pith-number/VGFIXWHA3V52CBUFWHO2O22VVK/events.json","paper":"https://pith.science/paper/VGFIXWHA"},"agent_actions":{"view_html":"https://pith.science/pith/VGFIXWHA3V52CBUFWHO2O22VVK","download_json":"https://pith.science/pith/VGFIXWHA3V52CBUFWHO2O22VVK.json","view_paper":"https://pith.science/paper/VGFIXWHA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.4673&json=true","fetch_graph":"https://pith.science/api/pith-number/VGFIXWHA3V52CBUFWHO2O22VVK/graph.json","fetch_events":"https://pith.science/api/pith-number/VGFIXWHA3V52CBUFWHO2O22VVK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VGFIXWHA3V52CBUFWHO2O22VVK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VGFIXWHA3V52CBUFWHO2O22VVK/action/storage_attestation","attest_author":"https://pith.science/pith/VGFIXWHA3V52CBUFWHO2O22VVK/action/author_attestation","sign_citation":"https://pith.science/pith/VGFIXWHA3V52CBUFWHO2O22VVK/action/citation_signature","submit_replication":"https://pith.science/pith/VGFIXWHA3V52CBUFWHO2O22VVK/action/replication_record"}},"created_at":"2026-05-18T03:42:56.479214+00:00","updated_at":"2026-05-18T03:42:56.479214+00:00"}