{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:O4DEJWXNSXMHFK7EDQIQRIC2T3","short_pith_number":"pith:O4DEJWXN","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"},"canonical_sha256":"770644daed95d872abe41c1108a05a9ecc84b85806439a9136810f4b00c9350f","source":{"kind":"arxiv","id":"1407.7654","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7654","created_at":"2026-05-18T02:46:22Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7654v1","created_at":"2026-05-18T02:46:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7654","created_at":"2026-05-18T02:46:22Z"},{"alias_kind":"pith_short_12","alias_value":"O4DEJWXNSXMH","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"O4DEJWXNSXMHFK7E","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"O4DEJWXN","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:O4DEJWXNSXMHFK7EDQIQRIC2T3","target":"record","payload":{"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"},"canonical_sha256":"770644daed95d872abe41c1108a05a9ecc84b85806439a9136810f4b00c9350f","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"},"source_kind":"arxiv","source_id":"1407.7654","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:46:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T1A/GWjows/0slRwOIokrEw5PoFzK41KDX5zkAVwijeYu+5j+NPtfuDmC6oNypnvFFRePqs2idjQCUecpKsvAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:37:43.863792Z"},"content_sha256":"c22afa6fa8f4dae6fa2802b6a1ef8652cdeeaf83cde2ac5c2149f4549e74b615","schema_version":"1.0","event_id":"sha256:c22afa6fa8f4dae6fa2802b6a1ef8652cdeeaf83cde2ac5c2149f4549e74b615"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:O4DEJWXNSXMHFK7EDQIQRIC2T3","target":"graph","payload":{"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"},"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:46:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TR7oGtISxh2/sBfzkvOij07JqH+NfX1SGnE0Ml2U4yrJTsVVvPfAFtPrjY3vIqNT8gemLF+JcPu0TMQV9uP3BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:37:43.864140Z"},"content_sha256":"3859138918a94c5b6d76a3aacfe5201898bbcf493d31c85b87da909427d7e371","schema_version":"1.0","event_id":"sha256:3859138918a94c5b6d76a3aacfe5201898bbcf493d31c85b87da909427d7e371"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O4DEJWXNSXMHFK7EDQIQRIC2T3/bundle.json","state_url":"https://pith.science/pith/O4DEJWXNSXMHFK7EDQIQRIC2T3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O4DEJWXNSXMHFK7EDQIQRIC2T3/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-01T09:37:43Z","links":{"resolver":"https://pith.science/pith/O4DEJWXNSXMHFK7EDQIQRIC2T3","bundle":"https://pith.science/pith/O4DEJWXNSXMHFK7EDQIQRIC2T3/bundle.json","state":"https://pith.science/pith/O4DEJWXNSXMHFK7EDQIQRIC2T3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O4DEJWXNSXMHFK7EDQIQRIC2T3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:O4DEJWXNSXMHFK7EDQIQRIC2T3","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":"0d32a7ef148d3ec5d425daf04a751d817bf21c7863bc7670308693262f98b96c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-29T07:55:23Z","title_canon_sha256":"323d60496148671a53251a75fc668c6ffd7a1438f7fd4b99385903b0bfe252d2"},"schema_version":"1.0","source":{"id":"1407.7654","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.7654","created_at":"2026-05-18T02:46:22Z"},{"alias_kind":"arxiv_version","alias_value":"1407.7654v1","created_at":"2026-05-18T02:46:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7654","created_at":"2026-05-18T02:46:22Z"},{"alias_kind":"pith_short_12","alias_value":"O4DEJWXNSXMH","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"O4DEJWXNSXMHFK7E","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"O4DEJWXN","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:3859138918a94c5b6d76a3aacfe5201898bbcf493d31c85b87da909427d7e371","target":"graph","created_at":"2026-05-18T02:46:22Z","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 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 ","authors_text":"Dimitrios Letsios, Evripidis Bampis, Giorgio Lucarelli","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-29T07:55:23Z","title":"Speed-scaling with no Preemptions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7654","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:c22afa6fa8f4dae6fa2802b6a1ef8652cdeeaf83cde2ac5c2149f4549e74b615","target":"record","created_at":"2026-05-18T02:46:22Z","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":"0d32a7ef148d3ec5d425daf04a751d817bf21c7863bc7670308693262f98b96c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-29T07:55:23Z","title_canon_sha256":"323d60496148671a53251a75fc668c6ffd7a1438f7fd4b99385903b0bfe252d2"},"schema_version":"1.0","source":{"id":"1407.7654","kind":"arxiv","version":1}},"canonical_sha256":"770644daed95d872abe41c1108a05a9ecc84b85806439a9136810f4b00c9350f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"770644daed95d872abe41c1108a05a9ecc84b85806439a9136810f4b00c9350f","first_computed_at":"2026-05-18T02:46:22.080678Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:22.080678Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XEddUDlw4ipVS3EFO21RYguRthTJwuavCGuwuw1kTQp+Mt8evRz7sBknWkaYYPWna0thTWx6kbL32yrDQQrLBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:22.081165Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.7654","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c22afa6fa8f4dae6fa2802b6a1ef8652cdeeaf83cde2ac5c2149f4549e74b615","sha256:3859138918a94c5b6d76a3aacfe5201898bbcf493d31c85b87da909427d7e371"],"state_sha256":"01aedf05fea777b5f0d9e42c36c69c4ef3a08f0cd280f2c400e2a7473be6e02b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wtImwLsULARU/jafcTYUwrRlRh61Y++jQ4KpJBWqcTvwmjFLAw8QiE8dUDierbbDzkSkzRQICarOCwBttiy2Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T09:37:43.866138Z","bundle_sha256":"0060b4ed458a1b476cd9d39ffe2ddc34e64be1a801f87dfc2895bf745b4699ae"}}