{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:O4DEJWXNSXMHFK7EDQIQRIC2T3","short_pith_number":"pith:O4DEJWXN","schema_version":"1.0","canonical_sha256":"770644daed95d872abe41c1108a05a9ecc84b85806439a9136810f4b00c9350f","source":{"kind":"arxiv","id":"1407.7654","version":1},"attestation_state":"computed","paper":{"title":"Speed-scaling with no Preemptions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dimitrios Letsios, Evripidis Bampis, Giorgio Lucarelli","submitted_at":"2014-07-29T07:55:23Z","abstract_excerpt":"We revisit the non-preemptive speed-scaling problem, in which a set of jobs have to be executed on a single or a set of parallel speed-scalable processor(s) between their release dates and deadlines so that the energy consumption to be minimized. We adopt the speed-scaling mechanism first introduced in [Yao et al., FOCS 1995] according to which the power dissipated is a convex function of the processor's speed. Intuitively, the higher is the speed of a processor, the higher is the energy consumption. For the single-processor case, we improve the best known approximation algorithm by providing "},"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":"1407.7654","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-29T07:55:23Z","cross_cats_sorted":[],"title_canon_sha256":"323d60496148671a53251a75fc668c6ffd7a1438f7fd4b99385903b0bfe252d2","abstract_canon_sha256":"0d32a7ef148d3ec5d425daf04a751d817bf21c7863bc7670308693262f98b96c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:22.081165Z","signature_b64":"XEddUDlw4ipVS3EFO21RYguRthTJwuavCGuwuw1kTQp+Mt8evRz7sBknWkaYYPWna0thTWx6kbL32yrDQQrLBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"770644daed95d872abe41c1108a05a9ecc84b85806439a9136810f4b00c9350f","last_reissued_at":"2026-05-18T02:46:22.080678Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:22.080678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Speed-scaling with no Preemptions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dimitrios Letsios, Evripidis Bampis, Giorgio Lucarelli","submitted_at":"2014-07-29T07:55:23Z","abstract_excerpt":"We revisit the non-preemptive speed-scaling problem, in which a set of jobs have to be executed on a single or a set of parallel speed-scalable processor(s) between their release dates and deadlines so that the energy consumption to be minimized. We adopt the speed-scaling mechanism first introduced in [Yao et al., FOCS 1995] according to which the power dissipated is a convex function of the processor's speed. Intuitively, the higher is the speed of a processor, the higher is the energy consumption. For the single-processor case, we improve the best known approximation algorithm by providing "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7654","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":"1407.7654","created_at":"2026-05-18T02:46:22.080744+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.7654v1","created_at":"2026-05-18T02:46:22.080744+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7654","created_at":"2026-05-18T02:46:22.080744+00:00"},{"alias_kind":"pith_short_12","alias_value":"O4DEJWXNSXMH","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"O4DEJWXNSXMHFK7E","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"O4DEJWXN","created_at":"2026-05-18T12:28:41.024544+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/O4DEJWXNSXMHFK7EDQIQRIC2T3","json":"https://pith.science/pith/O4DEJWXNSXMHFK7EDQIQRIC2T3.json","graph_json":"https://pith.science/api/pith-number/O4DEJWXNSXMHFK7EDQIQRIC2T3/graph.json","events_json":"https://pith.science/api/pith-number/O4DEJWXNSXMHFK7EDQIQRIC2T3/events.json","paper":"https://pith.science/paper/O4DEJWXN"},"agent_actions":{"view_html":"https://pith.science/pith/O4DEJWXNSXMHFK7EDQIQRIC2T3","download_json":"https://pith.science/pith/O4DEJWXNSXMHFK7EDQIQRIC2T3.json","view_paper":"https://pith.science/paper/O4DEJWXN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.7654&json=true","fetch_graph":"https://pith.science/api/pith-number/O4DEJWXNSXMHFK7EDQIQRIC2T3/graph.json","fetch_events":"https://pith.science/api/pith-number/O4DEJWXNSXMHFK7EDQIQRIC2T3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O4DEJWXNSXMHFK7EDQIQRIC2T3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O4DEJWXNSXMHFK7EDQIQRIC2T3/action/storage_attestation","attest_author":"https://pith.science/pith/O4DEJWXNSXMHFK7EDQIQRIC2T3/action/author_attestation","sign_citation":"https://pith.science/pith/O4DEJWXNSXMHFK7EDQIQRIC2T3/action/citation_signature","submit_replication":"https://pith.science/pith/O4DEJWXNSXMHFK7EDQIQRIC2T3/action/replication_record"}},"created_at":"2026-05-18T02:46:22.080744+00:00","updated_at":"2026-05-18T02:46:22.080744+00:00"}