{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VGFIXWHA3V52CBUFWHO2O22VVK","short_pith_number":"pith:VGFIXWHA","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"},"canonical_sha256":"a98a8bd8e0dd7ba10685b1dda76b55aabd2c9c3b4c5dea5b3de69592aa522470","source":{"kind":"arxiv","id":"1210.4673","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4673","created_at":"2026-05-18T03:42:56Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4673v1","created_at":"2026-05-18T03:42:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4673","created_at":"2026-05-18T03:42:56Z"},{"alias_kind":"pith_short_12","alias_value":"VGFIXWHA3V52","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VGFIXWHA3V52CBUF","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VGFIXWHA","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VGFIXWHA3V52CBUFWHO2O22VVK","target":"record","payload":{"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"},"canonical_sha256":"a98a8bd8e0dd7ba10685b1dda76b55aabd2c9c3b4c5dea5b3de69592aa522470","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"},"source_kind":"arxiv","source_id":"1210.4673","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:42:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wDy/oDyRerxI10FdqPAM0uKex9VNFa2k/WgmV0mYShQwd51A1qG+g81EjwrJ2q9fsYKIq3rv9667jBMsxngMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:56:47.784496Z"},"content_sha256":"aabb7e6c448ff5cbee91dd83098f2a6a6c00e665cb22a9aa09f1e8c4947fba7a","schema_version":"1.0","event_id":"sha256:aabb7e6c448ff5cbee91dd83098f2a6a6c00e665cb22a9aa09f1e8c4947fba7a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VGFIXWHA3V52CBUFWHO2O22VVK","target":"graph","payload":{"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"},"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:42:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p2QQOAkiai1zU6pG4hkVH01QuukvBMtYbFVXd06FWi7UgHHg/1exF/pgJ6ghCFRlOPI9UOjcoor+04t+tcctAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T02:56:47.785178Z"},"content_sha256":"1ad698f5309deece85aceefa2e9bc29b3ebb23f69d055a02035abc4e23f5ff87","schema_version":"1.0","event_id":"sha256:1ad698f5309deece85aceefa2e9bc29b3ebb23f69d055a02035abc4e23f5ff87"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VGFIXWHA3V52CBUFWHO2O22VVK/bundle.json","state_url":"https://pith.science/pith/VGFIXWHA3V52CBUFWHO2O22VVK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VGFIXWHA3V52CBUFWHO2O22VVK/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-31T02:56:47Z","links":{"resolver":"https://pith.science/pith/VGFIXWHA3V52CBUFWHO2O22VVK","bundle":"https://pith.science/pith/VGFIXWHA3V52CBUFWHO2O22VVK/bundle.json","state":"https://pith.science/pith/VGFIXWHA3V52CBUFWHO2O22VVK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VGFIXWHA3V52CBUFWHO2O22VVK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VGFIXWHA3V52CBUFWHO2O22VVK","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":"0a09b7806e6a255baef276d161fc2f2f462f57030894c1d9368c08746fb98793","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-17T09:03:28Z","title_canon_sha256":"4b1326687fc04c12a79ccd280fed6ebfca48a82083bfd8da90cc9257087e1441"},"schema_version":"1.0","source":{"id":"1210.4673","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4673","created_at":"2026-05-18T03:42:56Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4673v1","created_at":"2026-05-18T03:42:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4673","created_at":"2026-05-18T03:42:56Z"},{"alias_kind":"pith_short_12","alias_value":"VGFIXWHA3V52","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VGFIXWHA3V52CBUF","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VGFIXWHA","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:1ad698f5309deece85aceefa2e9bc29b3ebb23f69d055a02035abc4e23f5ff87","target":"graph","created_at":"2026-05-18T03:42:56Z","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 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)","authors_text":"Anne Benoit, Guillaume Aupy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-17T09:03:28Z","title":"Approximation algorithms for energy, reliability and makespan optimization problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4673","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:aabb7e6c448ff5cbee91dd83098f2a6a6c00e665cb22a9aa09f1e8c4947fba7a","target":"record","created_at":"2026-05-18T03:42:56Z","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":"0a09b7806e6a255baef276d161fc2f2f462f57030894c1d9368c08746fb98793","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-10-17T09:03:28Z","title_canon_sha256":"4b1326687fc04c12a79ccd280fed6ebfca48a82083bfd8da90cc9257087e1441"},"schema_version":"1.0","source":{"id":"1210.4673","kind":"arxiv","version":1}},"canonical_sha256":"a98a8bd8e0dd7ba10685b1dda76b55aabd2c9c3b4c5dea5b3de69592aa522470","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a98a8bd8e0dd7ba10685b1dda76b55aabd2c9c3b4c5dea5b3de69592aa522470","first_computed_at":"2026-05-18T03:42:56.479040Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:56.479040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i7ORuep9OSyj/UMCwFqDQ4Ja/0yxCkP8HwdTZGOZsJRCgh7wDxziB4OaP6dPy87irT5MbCnNNOp28q1LO0RuCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:56.479982Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.4673","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aabb7e6c448ff5cbee91dd83098f2a6a6c00e665cb22a9aa09f1e8c4947fba7a","sha256:1ad698f5309deece85aceefa2e9bc29b3ebb23f69d055a02035abc4e23f5ff87"],"state_sha256":"b8ebbefa204163ba4693501f24d252d2b91522cb471121ad79eed68a4d4c5c19"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NuS7lHd0yH5aM4TSEPBJ1hBIeSgb/qyqEIfESrDXzbAlFX2kuGfCmJWOaTA5c0EqziOR2Mo2G2IleT577adMCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T02:56:47.788738Z","bundle_sha256":"4d6e385c47e74dc4aa47cd872155e5a2cfc24480f2cefbeb474ac13bf78b58f5"}}