{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WOD5NLSTGZUKJUYQ6X4245OWWF","short_pith_number":"pith:WOD5NLST","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"},"canonical_sha256":"b387d6ae533668a4d310f5f9ae75d6b148f9f3b6770a7ca7de0b8893e91b4e50","source":{"kind":"arxiv","id":"1805.11297","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11297","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11297v1","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11297","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"pith_short_12","alias_value":"WOD5NLSTGZUK","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WOD5NLSTGZUKJUYQ","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WOD5NLST","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WOD5NLSTGZUKJUYQ6X4245OWWF","target":"record","payload":{"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"},"canonical_sha256":"b387d6ae533668a4d310f5f9ae75d6b148f9f3b6770a7ca7de0b8893e91b4e50","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"},"source_kind":"arxiv","source_id":"1805.11297","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-18T00:14:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BwyX/oVuqYwc/Bhk+H8cq14MFFjX8D3LLkbWBS5T9nrqSi3gpDRlAAv/aeO7pZr4cqo0lisRc+mBvfz1WxtuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T11:39:22.597653Z"},"content_sha256":"708cd8a2d7581579d6302999b23f39cddba7899db5bfeacb312255ff157cc7c6","schema_version":"1.0","event_id":"sha256:708cd8a2d7581579d6302999b23f39cddba7899db5bfeacb312255ff157cc7c6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WOD5NLSTGZUKJUYQ6X4245OWWF","target":"graph","payload":{"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"},"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-18T00:14:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2tDiEIkFFSA+cVULZqFmqdV6q1+EDe9EsPlsJymZxJZ+MoyB7hHWeRsQYpDDLVWy8AMnb3ESevnCkLMDV3z4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T11:39:22.597999Z"},"content_sha256":"6ef3ffe9f610728e3853f68e0afb48f7251088e1fdeaa8392416c92d37c6b487","schema_version":"1.0","event_id":"sha256:6ef3ffe9f610728e3853f68e0afb48f7251088e1fdeaa8392416c92d37c6b487"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WOD5NLSTGZUKJUYQ6X4245OWWF/bundle.json","state_url":"https://pith.science/pith/WOD5NLSTGZUKJUYQ6X4245OWWF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WOD5NLSTGZUKJUYQ6X4245OWWF/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-26T11:39:22Z","links":{"resolver":"https://pith.science/pith/WOD5NLSTGZUKJUYQ6X4245OWWF","bundle":"https://pith.science/pith/WOD5NLSTGZUKJUYQ6X4245OWWF/bundle.json","state":"https://pith.science/pith/WOD5NLSTGZUKJUYQ6X4245OWWF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WOD5NLSTGZUKJUYQ6X4245OWWF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WOD5NLSTGZUKJUYQ6X4245OWWF","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":"f0fe507d507a44107469c76484ef7fd85db37378f27c8f21117b9698ff857be8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-29T08:25:18Z","title_canon_sha256":"d3f8dbde23737c37d8771bba67c248711e439489005c1f443af5d96159bcec11"},"schema_version":"1.0","source":{"id":"1805.11297","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.11297","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"arxiv_version","alias_value":"1805.11297v1","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.11297","created_at":"2026-05-18T00:14:43Z"},{"alias_kind":"pith_short_12","alias_value":"WOD5NLSTGZUK","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WOD5NLSTGZUKJUYQ","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WOD5NLST","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:6ef3ffe9f610728e3853f68e0afb48f7251088e1fdeaa8392416c92d37c6b487","target":"graph","created_at":"2026-05-18T00:14:43Z","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":"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","authors_text":"Christoph D\\\"urr, {\\L}ukasz Je\\.z, Oscar C. V\\'asquez","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-29T08:25:18Z","title":"Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.11297","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:708cd8a2d7581579d6302999b23f39cddba7899db5bfeacb312255ff157cc7c6","target":"record","created_at":"2026-05-18T00:14:43Z","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":"f0fe507d507a44107469c76484ef7fd85db37378f27c8f21117b9698ff857be8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-29T08:25:18Z","title_canon_sha256":"d3f8dbde23737c37d8771bba67c248711e439489005c1f443af5d96159bcec11"},"schema_version":"1.0","source":{"id":"1805.11297","kind":"arxiv","version":1}},"canonical_sha256":"b387d6ae533668a4d310f5f9ae75d6b148f9f3b6770a7ca7de0b8893e91b4e50","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b387d6ae533668a4d310f5f9ae75d6b148f9f3b6770a7ca7de0b8893e91b4e50","first_computed_at":"2026-05-18T00:14:43.041545Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:43.041545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aanjV6wDTsGspcSuGKrN+t+D+GnIjb/Y0kf3HNpdlsxeu3gBM4TMgYym5KfbY6vWxCnFpRLH8r5TOA97zO7rAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:43.041995Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.11297","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:708cd8a2d7581579d6302999b23f39cddba7899db5bfeacb312255ff157cc7c6","sha256:6ef3ffe9f610728e3853f68e0afb48f7251088e1fdeaa8392416c92d37c6b487"],"state_sha256":"1010913190cfd118a991f2a95e8006324928afb03a572959c1d8bc2f1cd8eeca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7MUZTuv9Qm6erEwilBQs6X8yFrMbK7fiWnphv4cb2U0sMh8kp5ZMnarGrQKEjCmB/K4KWtl5KP0LC2OoNGuXBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T11:39:22.599918Z","bundle_sha256":"991eabe564544196aed7b6a980a17d8728457234ce83d9fe440c229fca231fdb"}}