{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QRTC6KMM7C422N6UT2MG3Z6CZI","short_pith_number":"pith:QRTC6KMM","canonical_record":{"source":{"id":"1306.1861","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-06-08T00:34:57Z","cross_cats_sorted":[],"title_canon_sha256":"d17e2468073efc191e622bd2e174f093683fa1f547cfb99f4b2d7e1c5b498989","abstract_canon_sha256":"6a5de67996e47197b672020980ff399c749f350349dc95543037fef79d4f49dd"},"schema_version":"1.0"},"canonical_sha256":"84662f298cf8b9ad37d49e986de7c2ca22eb1e9d671bff46c0412dc409f30cd1","source":{"kind":"arxiv","id":"1306.1861","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.1861","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"arxiv_version","alias_value":"1306.1861v1","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1861","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"pith_short_12","alias_value":"QRTC6KMM7C42","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QRTC6KMM7C422N6U","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QRTC6KMM","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QRTC6KMM7C422N6UT2MG3Z6CZI","target":"record","payload":{"canonical_record":{"source":{"id":"1306.1861","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-06-08T00:34:57Z","cross_cats_sorted":[],"title_canon_sha256":"d17e2468073efc191e622bd2e174f093683fa1f547cfb99f4b2d7e1c5b498989","abstract_canon_sha256":"6a5de67996e47197b672020980ff399c749f350349dc95543037fef79d4f49dd"},"schema_version":"1.0"},"canonical_sha256":"84662f298cf8b9ad37d49e986de7c2ca22eb1e9d671bff46c0412dc409f30cd1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:23.053500Z","signature_b64":"dnLZ7zVD513f36RQzgMp0CTr6Bs4oX9G3XivV0ZjSctKGmt4tcbksrW8ZR2Hqiw2SczE9FSQITG9Suii3SOMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84662f298cf8b9ad37d49e986de7c2ca22eb1e9d671bff46c0412dc409f30cd1","last_reissued_at":"2026-05-18T03:21:23.052813Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:23.052813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.1861","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:21:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tYraAQTQJAQvESKTwk3EKD42/zOssIXbBvVsmEupJmc/FGwp+3CB79qiqj2Iq9hEuJdAy+o43SG8D7/lrraZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:36:13.977796Z"},"content_sha256":"67e85b3c9a5b47d8b66c0b3e9453bdf8d525be4effc8e6064c899f86cbc776e6","schema_version":"1.0","event_id":"sha256:67e85b3c9a5b47d8b66c0b3e9453bdf8d525be4effc8e6064c899f86cbc776e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QRTC6KMM7C422N6UT2MG3Z6CZI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Parallel Scheduling of Non-uniform Tasks: Trading Failures for Energy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Antonio Fern\\'andez Anta, Chryssis Georgiou, Dariusz R. Kowalski, Elli Zavou","submitted_at":"2013-06-08T00:34:57Z","abstract_excerpt":"Consider a system in which tasks of different execution times arrive continuously and have to be executed by a set of processors that are prone to crashes and restarts. In this paper we model and study the impact of parallelism and failures on the competitiveness of such an online system. In a fault-free environment, a simple Longest-in-System scheduling policy, enhanced by a redundancy-avoidance mechanism, guarantees optimality in a long-term execution. In the presence of failures though, scheduling becomes a much more challenging task. In particular, no parallel deterministic algorithm can b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1861","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:21:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7cgQxvstVIAhDmDI6JkpnBRD4Vz5Xwuc8VtBYy1dQbWdsIA268J4otOIOcWaQbyYIP0Ed1OE9ao1HcWlEu3uBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T16:36:13.978136Z"},"content_sha256":"2d8b2f3939f516c4553f050413b88cc97d54445028e3dcbcc3475746b7438453","schema_version":"1.0","event_id":"sha256:2d8b2f3939f516c4553f050413b88cc97d54445028e3dcbcc3475746b7438453"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QRTC6KMM7C422N6UT2MG3Z6CZI/bundle.json","state_url":"https://pith.science/pith/QRTC6KMM7C422N6UT2MG3Z6CZI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QRTC6KMM7C422N6UT2MG3Z6CZI/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-23T16:36:13Z","links":{"resolver":"https://pith.science/pith/QRTC6KMM7C422N6UT2MG3Z6CZI","bundle":"https://pith.science/pith/QRTC6KMM7C422N6UT2MG3Z6CZI/bundle.json","state":"https://pith.science/pith/QRTC6KMM7C422N6UT2MG3Z6CZI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QRTC6KMM7C422N6UT2MG3Z6CZI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QRTC6KMM7C422N6UT2MG3Z6CZI","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":"6a5de67996e47197b672020980ff399c749f350349dc95543037fef79d4f49dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-06-08T00:34:57Z","title_canon_sha256":"d17e2468073efc191e622bd2e174f093683fa1f547cfb99f4b2d7e1c5b498989"},"schema_version":"1.0","source":{"id":"1306.1861","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.1861","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"arxiv_version","alias_value":"1306.1861v1","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1861","created_at":"2026-05-18T03:21:23Z"},{"alias_kind":"pith_short_12","alias_value":"QRTC6KMM7C42","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QRTC6KMM7C422N6U","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QRTC6KMM","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:2d8b2f3939f516c4553f050413b88cc97d54445028e3dcbcc3475746b7438453","target":"graph","created_at":"2026-05-18T03:21:23Z","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":"Consider a system in which tasks of different execution times arrive continuously and have to be executed by a set of processors that are prone to crashes and restarts. In this paper we model and study the impact of parallelism and failures on the competitiveness of such an online system. In a fault-free environment, a simple Longest-in-System scheduling policy, enhanced by a redundancy-avoidance mechanism, guarantees optimality in a long-term execution. In the presence of failures though, scheduling becomes a much more challenging task. In particular, no parallel deterministic algorithm can b","authors_text":"Antonio Fern\\'andez Anta, Chryssis Georgiou, Dariusz R. Kowalski, Elli Zavou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-06-08T00:34:57Z","title":"Online Parallel Scheduling of Non-uniform Tasks: Trading Failures for Energy"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1861","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:67e85b3c9a5b47d8b66c0b3e9453bdf8d525be4effc8e6064c899f86cbc776e6","target":"record","created_at":"2026-05-18T03:21:23Z","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":"6a5de67996e47197b672020980ff399c749f350349dc95543037fef79d4f49dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-06-08T00:34:57Z","title_canon_sha256":"d17e2468073efc191e622bd2e174f093683fa1f547cfb99f4b2d7e1c5b498989"},"schema_version":"1.0","source":{"id":"1306.1861","kind":"arxiv","version":1}},"canonical_sha256":"84662f298cf8b9ad37d49e986de7c2ca22eb1e9d671bff46c0412dc409f30cd1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84662f298cf8b9ad37d49e986de7c2ca22eb1e9d671bff46c0412dc409f30cd1","first_computed_at":"2026-05-18T03:21:23.052813Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:23.052813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dnLZ7zVD513f36RQzgMp0CTr6Bs4oX9G3XivV0ZjSctKGmt4tcbksrW8ZR2Hqiw2SczE9FSQITG9Suii3SOMAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:23.053500Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.1861","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:67e85b3c9a5b47d8b66c0b3e9453bdf8d525be4effc8e6064c899f86cbc776e6","sha256:2d8b2f3939f516c4553f050413b88cc97d54445028e3dcbcc3475746b7438453"],"state_sha256":"a3f1bdc5fbb29ff7ed8419b76720f18215c22630d4ca145e9f01c80167708287"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6VplWU5PKUDSws0DCw/M6PPTXEAUVvxINVPTJRggg43W7Bp4pj+/7Olq8JZd+K54u5QrOGGkivhRzDou3113Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T16:36:13.980037Z","bundle_sha256":"1137463c84665b32c4251396b39eaa23a204fcb78bea61d8f4db0811af2db6fb"}}