{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:DTGMBRZOE5I65F2YBECPYPHQH7","short_pith_number":"pith:DTGMBRZO","canonical_record":{"source":{"id":"1107.2105","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-11T19:56:53Z","cross_cats_sorted":[],"title_canon_sha256":"884d53643fc1c8757f7a4c35570f73a15cde2196fed015ff3fa2d50f762ac94a","abstract_canon_sha256":"2b04d4cff982ac0c76b2d740a65c500251a1db4fce17e58ac106f45340b506cf"},"schema_version":"1.0"},"canonical_sha256":"1cccc0c72e2751ee97580904fc3cf03fed2c498ccac535cae543f64bb1433219","source":{"kind":"arxiv","id":"1107.2105","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2105","created_at":"2026-05-18T04:18:32Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2105v2","created_at":"2026-05-18T04:18:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2105","created_at":"2026-05-18T04:18:32Z"},{"alias_kind":"pith_short_12","alias_value":"DTGMBRZOE5I6","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DTGMBRZOE5I65F2Y","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DTGMBRZO","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:DTGMBRZOE5I65F2YBECPYPHQH7","target":"record","payload":{"canonical_record":{"source":{"id":"1107.2105","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-11T19:56:53Z","cross_cats_sorted":[],"title_canon_sha256":"884d53643fc1c8757f7a4c35570f73a15cde2196fed015ff3fa2d50f762ac94a","abstract_canon_sha256":"2b04d4cff982ac0c76b2d740a65c500251a1db4fce17e58ac106f45340b506cf"},"schema_version":"1.0"},"canonical_sha256":"1cccc0c72e2751ee97580904fc3cf03fed2c498ccac535cae543f64bb1433219","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:32.887844Z","signature_b64":"bdkOaXneCL1BcQLU4uWCXWwc8Up2dGOOHlEAUmsqhAqUXDOkpZ6D7S8oeT1PykFbw5WoKU/XDAYJybFz0B/OAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cccc0c72e2751ee97580904fc3cf03fed2c498ccac535cae543f64bb1433219","last_reissued_at":"2026-05-18T04:18:32.887123Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:32.887123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.2105","source_version":2,"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-18T04:18:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M3kkQAaXQPM2uOQEo65xFtkVgJYH+Hqw9EHQ4WTioK1TCUo3i+ftEgfEXtT8Gx9FtuAZFkRMkEF2pXkYzULqDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:39:42.161868Z"},"content_sha256":"ff8ef344b356e91eee4f9af59553ebf55fe5889f59d1909670013ecb007d9d89","schema_version":"1.0","event_id":"sha256:ff8ef344b356e91eee4f9af59553ebf55fe5889f59d1909670013ecb007d9d89"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:DTGMBRZOE5I65F2YBECPYPHQH7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Speed Scaling on Parallel Processors with Migration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dimitrios Letsios, Eric Angel, Evripidis Bampis, Fadi Kacem","submitted_at":"2011-07-11T19:56:53Z","abstract_excerpt":"We study the problem of scheduling a set of jobs with release dates, deadlines and processing requirements (or works), on parallel speed-scaled processors so as to minimize the total energy consumption. We consider that both preemption and migration of jobs are allowed. An exact polynomial-time algorithm has been proposed for this problem, which is based on the Ellipsoid algorithm. Here, we formulate the problem as a convex program and we propose a simpler polynomial-time combinatorial algorithm which is based on a reduction to the maximum flow problem. Our algorithm runs in $O(nf(n)logP)$ tim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2105","kind":"arxiv","version":2},"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-18T04:18:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TyFgwszzT/JmJOmTjWdEdu9a4KFZJ4eDD0x2uy8u+bzY828PWmVc2ZFDKEUPlGBbjYHVE9yEZnwbwoZlT+3oAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T03:39:42.162463Z"},"content_sha256":"1514b2e04e0f12820daa19f3dd152ba56b1e622605f528b4cc80766150cf7a6e","schema_version":"1.0","event_id":"sha256:1514b2e04e0f12820daa19f3dd152ba56b1e622605f528b4cc80766150cf7a6e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DTGMBRZOE5I65F2YBECPYPHQH7/bundle.json","state_url":"https://pith.science/pith/DTGMBRZOE5I65F2YBECPYPHQH7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DTGMBRZOE5I65F2YBECPYPHQH7/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-02T03:39:42Z","links":{"resolver":"https://pith.science/pith/DTGMBRZOE5I65F2YBECPYPHQH7","bundle":"https://pith.science/pith/DTGMBRZOE5I65F2YBECPYPHQH7/bundle.json","state":"https://pith.science/pith/DTGMBRZOE5I65F2YBECPYPHQH7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DTGMBRZOE5I65F2YBECPYPHQH7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:DTGMBRZOE5I65F2YBECPYPHQH7","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":"2b04d4cff982ac0c76b2d740a65c500251a1db4fce17e58ac106f45340b506cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-11T19:56:53Z","title_canon_sha256":"884d53643fc1c8757f7a4c35570f73a15cde2196fed015ff3fa2d50f762ac94a"},"schema_version":"1.0","source":{"id":"1107.2105","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2105","created_at":"2026-05-18T04:18:32Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2105v2","created_at":"2026-05-18T04:18:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2105","created_at":"2026-05-18T04:18:32Z"},{"alias_kind":"pith_short_12","alias_value":"DTGMBRZOE5I6","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"DTGMBRZOE5I65F2Y","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"DTGMBRZO","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:1514b2e04e0f12820daa19f3dd152ba56b1e622605f528b4cc80766150cf7a6e","target":"graph","created_at":"2026-05-18T04:18:32Z","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 study the problem of scheduling a set of jobs with release dates, deadlines and processing requirements (or works), on parallel speed-scaled processors so as to minimize the total energy consumption. We consider that both preemption and migration of jobs are allowed. An exact polynomial-time algorithm has been proposed for this problem, which is based on the Ellipsoid algorithm. Here, we formulate the problem as a convex program and we propose a simpler polynomial-time combinatorial algorithm which is based on a reduction to the maximum flow problem. Our algorithm runs in $O(nf(n)logP)$ tim","authors_text":"Dimitrios Letsios, Eric Angel, Evripidis Bampis, Fadi Kacem","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-11T19:56:53Z","title":"Speed Scaling on Parallel Processors with Migration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2105","kind":"arxiv","version":2},"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:ff8ef344b356e91eee4f9af59553ebf55fe5889f59d1909670013ecb007d9d89","target":"record","created_at":"2026-05-18T04:18:32Z","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":"2b04d4cff982ac0c76b2d740a65c500251a1db4fce17e58ac106f45340b506cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-11T19:56:53Z","title_canon_sha256":"884d53643fc1c8757f7a4c35570f73a15cde2196fed015ff3fa2d50f762ac94a"},"schema_version":"1.0","source":{"id":"1107.2105","kind":"arxiv","version":2}},"canonical_sha256":"1cccc0c72e2751ee97580904fc3cf03fed2c498ccac535cae543f64bb1433219","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1cccc0c72e2751ee97580904fc3cf03fed2c498ccac535cae543f64bb1433219","first_computed_at":"2026-05-18T04:18:32.887123Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:18:32.887123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bdkOaXneCL1BcQLU4uWCXWwc8Up2dGOOHlEAUmsqhAqUXDOkpZ6D7S8oeT1PykFbw5WoKU/XDAYJybFz0B/OAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:18:32.887844Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.2105","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff8ef344b356e91eee4f9af59553ebf55fe5889f59d1909670013ecb007d9d89","sha256:1514b2e04e0f12820daa19f3dd152ba56b1e622605f528b4cc80766150cf7a6e"],"state_sha256":"0a9588a32c4347c8aefda9c908a1cc7d37657122bdcf7627219ee3e4e190fbea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D3JBPbOf+97930kTz55gxLhgtew9unNoskOZdcoGqtGtQn1k0cQPQI2nRu6GeaFg5n1bjPAUm5PuD2gaFPc/AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T03:39:42.165184Z","bundle_sha256":"1dcf5cbee021a33cd25993f2f4390f44c5a2639f4863c0afbfccd7cdea3d2656"}}