{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5XHQLUM3ICTMS4DUZZNC4PYZWR","short_pith_number":"pith:5XHQLUM3","canonical_record":{"source":{"id":"1402.3782","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-16T10:15:47Z","cross_cats_sorted":[],"title_canon_sha256":"b285d4b3a37ef45c86cff06a4040f1d00df0c595da9dadffe8d03dbaa50061dd","abstract_canon_sha256":"ceaa3a354fe7810d2247f58fcdd6e844cfb6306eccd93cbb4c0a987777e6ac47"},"schema_version":"1.0"},"canonical_sha256":"edcf05d19b40a6c97074ce5a2e3f19b44a15bce004671a10cea32d357f8df066","source":{"kind":"arxiv","id":"1402.3782","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3782","created_at":"2026-05-18T02:58:55Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3782v1","created_at":"2026-05-18T02:58:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3782","created_at":"2026-05-18T02:58:55Z"},{"alias_kind":"pith_short_12","alias_value":"5XHQLUM3ICTM","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"5XHQLUM3ICTMS4DU","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"5XHQLUM3","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5XHQLUM3ICTMS4DUZZNC4PYZWR","target":"record","payload":{"canonical_record":{"source":{"id":"1402.3782","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-16T10:15:47Z","cross_cats_sorted":[],"title_canon_sha256":"b285d4b3a37ef45c86cff06a4040f1d00df0c595da9dadffe8d03dbaa50061dd","abstract_canon_sha256":"ceaa3a354fe7810d2247f58fcdd6e844cfb6306eccd93cbb4c0a987777e6ac47"},"schema_version":"1.0"},"canonical_sha256":"edcf05d19b40a6c97074ce5a2e3f19b44a15bce004671a10cea32d357f8df066","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:55.630369Z","signature_b64":"kdyOMSj5BzneMoKFNK3iMZ1HbLrrarNKy976Sa3GpG11NIv5T6aXkWBtFrmiTFdjOzRA3g4n7egrStoVQJ42Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edcf05d19b40a6c97074ce5a2e3f19b44a15bce004671a10cea32d357f8df066","last_reissued_at":"2026-05-18T02:58:55.629838Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:55.629838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.3782","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-18T02:58:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kfUdKnxbOBQQ8woPbKU/GXeEpsvL7DZxZxH9tmD4Wk9GsPVcHqCXdNurz847TCjjsdgrRg9O7OYkDiAxV4LOCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:25:01.231126Z"},"content_sha256":"c33a88e4c522d46b9d0870d87a6f337c326e7f8af8808d00c2966d3972155c40","schema_version":"1.0","event_id":"sha256:c33a88e4c522d46b9d0870d87a6f337c326e7f8af8808d00c2966d3972155c40"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5XHQLUM3ICTMS4DUZZNC4PYZWR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Throughput Maximization in Multiprocessor Speed-Scaling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eric Angel, Evripidis Bampis, Nguyen Kim Thang, Vincent Chau","submitted_at":"2014-02-16T10:15:47Z","abstract_excerpt":"We are given a set of $n$ jobs that have to be executed on a set of $m$ speed-scalable machines that can vary their speeds dynamically using the energy model introduced in [Yao et al., FOCS'95]. Every job $j$ is characterized by its release date $r_j$, its deadline $d_j$, its processing volume $p_{i,j}$ if $j$ is executed on machine $i$ and its weight $w_j$. We are also given a budget of energy $E$ and our objective is to maximize the weighted throughput, i.e. the total weight of jobs that are completed between their respective release dates and deadlines. We propose a polynomial-time approxim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3782","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-18T02:58:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b442CZNgZRgMtGKmA/5lJ+DMR0KsO2xGgvqg9pLFoDR4xv2GuALAdBIpU4zWWEy236nz1Vbl+ASmJyoAA+1OAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:25:01.231766Z"},"content_sha256":"50fc49a57173e02a8924014408cd59b0d3d1c9cac7dfdeed6ef7ba1e219abd30","schema_version":"1.0","event_id":"sha256:50fc49a57173e02a8924014408cd59b0d3d1c9cac7dfdeed6ef7ba1e219abd30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5XHQLUM3ICTMS4DUZZNC4PYZWR/bundle.json","state_url":"https://pith.science/pith/5XHQLUM3ICTMS4DUZZNC4PYZWR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5XHQLUM3ICTMS4DUZZNC4PYZWR/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-31T00:25:01Z","links":{"resolver":"https://pith.science/pith/5XHQLUM3ICTMS4DUZZNC4PYZWR","bundle":"https://pith.science/pith/5XHQLUM3ICTMS4DUZZNC4PYZWR/bundle.json","state":"https://pith.science/pith/5XHQLUM3ICTMS4DUZZNC4PYZWR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5XHQLUM3ICTMS4DUZZNC4PYZWR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5XHQLUM3ICTMS4DUZZNC4PYZWR","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":"ceaa3a354fe7810d2247f58fcdd6e844cfb6306eccd93cbb4c0a987777e6ac47","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-16T10:15:47Z","title_canon_sha256":"b285d4b3a37ef45c86cff06a4040f1d00df0c595da9dadffe8d03dbaa50061dd"},"schema_version":"1.0","source":{"id":"1402.3782","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3782","created_at":"2026-05-18T02:58:55Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3782v1","created_at":"2026-05-18T02:58:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3782","created_at":"2026-05-18T02:58:55Z"},{"alias_kind":"pith_short_12","alias_value":"5XHQLUM3ICTM","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"5XHQLUM3ICTMS4DU","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"5XHQLUM3","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:50fc49a57173e02a8924014408cd59b0d3d1c9cac7dfdeed6ef7ba1e219abd30","target":"graph","created_at":"2026-05-18T02:58:55Z","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 are given a set of $n$ jobs that have to be executed on a set of $m$ speed-scalable machines that can vary their speeds dynamically using the energy model introduced in [Yao et al., FOCS'95]. Every job $j$ is characterized by its release date $r_j$, its deadline $d_j$, its processing volume $p_{i,j}$ if $j$ is executed on machine $i$ and its weight $w_j$. We are also given a budget of energy $E$ and our objective is to maximize the weighted throughput, i.e. the total weight of jobs that are completed between their respective release dates and deadlines. We propose a polynomial-time approxim","authors_text":"Eric Angel, Evripidis Bampis, Nguyen Kim Thang, Vincent Chau","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-16T10:15:47Z","title":"Throughput Maximization in Multiprocessor Speed-Scaling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3782","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:c33a88e4c522d46b9d0870d87a6f337c326e7f8af8808d00c2966d3972155c40","target":"record","created_at":"2026-05-18T02:58:55Z","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":"ceaa3a354fe7810d2247f58fcdd6e844cfb6306eccd93cbb4c0a987777e6ac47","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-16T10:15:47Z","title_canon_sha256":"b285d4b3a37ef45c86cff06a4040f1d00df0c595da9dadffe8d03dbaa50061dd"},"schema_version":"1.0","source":{"id":"1402.3782","kind":"arxiv","version":1}},"canonical_sha256":"edcf05d19b40a6c97074ce5a2e3f19b44a15bce004671a10cea32d357f8df066","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"edcf05d19b40a6c97074ce5a2e3f19b44a15bce004671a10cea32d357f8df066","first_computed_at":"2026-05-18T02:58:55.629838Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:55.629838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kdyOMSj5BzneMoKFNK3iMZ1HbLrrarNKy976Sa3GpG11NIv5T6aXkWBtFrmiTFdjOzRA3g4n7egrStoVQJ42Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:55.630369Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.3782","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c33a88e4c522d46b9d0870d87a6f337c326e7f8af8808d00c2966d3972155c40","sha256:50fc49a57173e02a8924014408cd59b0d3d1c9cac7dfdeed6ef7ba1e219abd30"],"state_sha256":"2c5005d1479e0adacb77574aab4095c350fb6b64a9c0d46b7feea049a2feec6e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6+N9TImIUV57zVERNWBlxSvmsUeg5S2vrLqUpkmFNmwU8gt40TsXa4cf9dEFDt8wiGWCm+NetD4bQZVGbcwGAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:25:01.234801Z","bundle_sha256":"1571668ead453685d32550842109fa7461f7835ea0a4e727e6ce111f4e11f505"}}