{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WOD5NLSTGZUKJUYQ6X4245OWWF","short_pith_number":"pith:WOD5NLST","schema_version":"1.0","canonical_sha256":"b387d6ae533668a4d310f5f9ae75d6b148f9f3b6770a7ca7de0b8893e91b4e50","source":{"kind":"arxiv","id":"1805.11297","version":1},"attestation_state":"computed","paper":{"title":"Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christoph D\\\"urr, {\\L}ukasz Je\\.z, Oscar C. V\\'asquez","submitted_at":"2018-05-29T08:25:18Z","abstract_excerpt":"Since a few years there is an increasing interest in minimizing the energy consumption of computing systems. However in a shared computing system, users want to optimize their experienced quality of service, at the price of a high energy consumption. In this work, we address the problem of optimizing and designing mechanisms for a linear combination of weighted completion time and energy consumption on a single machine with dynamic speed-scaling. We show that minimizing linear combination reduces to a unit speed scheduling problem under a polynomial penalty function. In the mechanism design se"},"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":"1805.11297","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-29T08:25:18Z","cross_cats_sorted":[],"title_canon_sha256":"d3f8dbde23737c37d8771bba67c248711e439489005c1f443af5d96159bcec11","abstract_canon_sha256":"f0fe507d507a44107469c76484ef7fd85db37378f27c8f21117b9698ff857be8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:43.041995Z","signature_b64":"aanjV6wDTsGspcSuGKrN+t+D+GnIjb/Y0kf3HNpdlsxeu3gBM4TMgYym5KfbY6vWxCnFpRLH8r5TOA97zO7rAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b387d6ae533668a4d310f5f9ae75d6b148f9f3b6770a7ca7de0b8893e91b4e50","last_reissued_at":"2026-05-18T00:14:43.041545Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:43.041545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christoph D\\\"urr, {\\L}ukasz Je\\.z, Oscar C. V\\'asquez","submitted_at":"2018-05-29T08:25:18Z","abstract_excerpt":"Since a few years there is an increasing interest in minimizing the energy consumption of computing systems. However in a shared computing system, users want to optimize their experienced quality of service, at the price of a high energy consumption. In this work, we address the problem of optimizing and designing mechanisms for a linear combination of weighted completion time and energy consumption on a single machine with dynamic speed-scaling. We show that minimizing linear combination reduces to a unit speed scheduling problem under a polynomial penalty function. In the mechanism design se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11297","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":"1805.11297","created_at":"2026-05-18T00:14:43.041615+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.11297v1","created_at":"2026-05-18T00:14:43.041615+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11297","created_at":"2026-05-18T00:14:43.041615+00:00"},{"alias_kind":"pith_short_12","alias_value":"WOD5NLSTGZUK","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WOD5NLSTGZUKJUYQ","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WOD5NLST","created_at":"2026-05-18T12:33:01.666342+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/WOD5NLSTGZUKJUYQ6X4245OWWF","json":"https://pith.science/pith/WOD5NLSTGZUKJUYQ6X4245OWWF.json","graph_json":"https://pith.science/api/pith-number/WOD5NLSTGZUKJUYQ6X4245OWWF/graph.json","events_json":"https://pith.science/api/pith-number/WOD5NLSTGZUKJUYQ6X4245OWWF/events.json","paper":"https://pith.science/paper/WOD5NLST"},"agent_actions":{"view_html":"https://pith.science/pith/WOD5NLSTGZUKJUYQ6X4245OWWF","download_json":"https://pith.science/pith/WOD5NLSTGZUKJUYQ6X4245OWWF.json","view_paper":"https://pith.science/paper/WOD5NLST","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.11297&json=true","fetch_graph":"https://pith.science/api/pith-number/WOD5NLSTGZUKJUYQ6X4245OWWF/graph.json","fetch_events":"https://pith.science/api/pith-number/WOD5NLSTGZUKJUYQ6X4245OWWF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WOD5NLSTGZUKJUYQ6X4245OWWF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WOD5NLSTGZUKJUYQ6X4245OWWF/action/storage_attestation","attest_author":"https://pith.science/pith/WOD5NLSTGZUKJUYQ6X4245OWWF/action/author_attestation","sign_citation":"https://pith.science/pith/WOD5NLSTGZUKJUYQ6X4245OWWF/action/citation_signature","submit_replication":"https://pith.science/pith/WOD5NLSTGZUKJUYQ6X4245OWWF/action/replication_record"}},"created_at":"2026-05-18T00:14:43.041615+00:00","updated_at":"2026-05-18T00:14:43.041615+00:00"}