{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5XHQLUM3ICTMS4DUZZNC4PYZWR","short_pith_number":"pith:5XHQLUM3","schema_version":"1.0","canonical_sha256":"edcf05d19b40a6c97074ce5a2e3f19b44a15bce004671a10cea32d357f8df066","source":{"kind":"arxiv","id":"1402.3782","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1402.3782","created_at":"2026-05-18T02:58:55.629918+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.3782v1","created_at":"2026-05-18T02:58:55.629918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3782","created_at":"2026-05-18T02:58:55.629918+00:00"},{"alias_kind":"pith_short_12","alias_value":"5XHQLUM3ICTM","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"5XHQLUM3ICTMS4DU","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"5XHQLUM3","created_at":"2026-05-18T12:28:16.859392+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/5XHQLUM3ICTMS4DUZZNC4PYZWR","json":"https://pith.science/pith/5XHQLUM3ICTMS4DUZZNC4PYZWR.json","graph_json":"https://pith.science/api/pith-number/5XHQLUM3ICTMS4DUZZNC4PYZWR/graph.json","events_json":"https://pith.science/api/pith-number/5XHQLUM3ICTMS4DUZZNC4PYZWR/events.json","paper":"https://pith.science/paper/5XHQLUM3"},"agent_actions":{"view_html":"https://pith.science/pith/5XHQLUM3ICTMS4DUZZNC4PYZWR","download_json":"https://pith.science/pith/5XHQLUM3ICTMS4DUZZNC4PYZWR.json","view_paper":"https://pith.science/paper/5XHQLUM3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.3782&json=true","fetch_graph":"https://pith.science/api/pith-number/5XHQLUM3ICTMS4DUZZNC4PYZWR/graph.json","fetch_events":"https://pith.science/api/pith-number/5XHQLUM3ICTMS4DUZZNC4PYZWR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5XHQLUM3ICTMS4DUZZNC4PYZWR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5XHQLUM3ICTMS4DUZZNC4PYZWR/action/storage_attestation","attest_author":"https://pith.science/pith/5XHQLUM3ICTMS4DUZZNC4PYZWR/action/author_attestation","sign_citation":"https://pith.science/pith/5XHQLUM3ICTMS4DUZZNC4PYZWR/action/citation_signature","submit_replication":"https://pith.science/pith/5XHQLUM3ICTMS4DUZZNC4PYZWR/action/replication_record"}},"created_at":"2026-05-18T02:58:55.629918+00:00","updated_at":"2026-05-18T02:58:55.629918+00:00"}