{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XS3CIPMTEJ2AW2SL3YXYX664I6","short_pith_number":"pith:XS3CIPMT","canonical_record":{"source":{"id":"1403.4991","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-19T21:52:55Z","cross_cats_sorted":[],"title_canon_sha256":"667cd1351a818760704e4e4ccee96b19974e2f8337c6244878c94d00b8a12e1b","abstract_canon_sha256":"a196df5d03c834ee46acaaa1d46272214feb1505ad9683d23766c7216e8980c1"},"schema_version":"1.0"},"canonical_sha256":"bcb6243d9322740b6a4bde2f8bfbdc478ce5d72d527534e8d4e531f2da5b91a2","source":{"kind":"arxiv","id":"1403.4991","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4991","created_at":"2026-05-18T02:55:58Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4991v1","created_at":"2026-05-18T02:55:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4991","created_at":"2026-05-18T02:55:58Z"},{"alias_kind":"pith_short_12","alias_value":"XS3CIPMTEJ2A","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XS3CIPMTEJ2AW2SL","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XS3CIPMT","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XS3CIPMTEJ2AW2SL3YXYX664I6","target":"record","payload":{"canonical_record":{"source":{"id":"1403.4991","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-19T21:52:55Z","cross_cats_sorted":[],"title_canon_sha256":"667cd1351a818760704e4e4ccee96b19974e2f8337c6244878c94d00b8a12e1b","abstract_canon_sha256":"a196df5d03c834ee46acaaa1d46272214feb1505ad9683d23766c7216e8980c1"},"schema_version":"1.0"},"canonical_sha256":"bcb6243d9322740b6a4bde2f8bfbdc478ce5d72d527534e8d4e531f2da5b91a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:58.366570Z","signature_b64":"ZdEhy8ByfFpYS/oCn4E6GWYAegM7uFhnxW/Pr0zJlFpGVfZnwVVTwg7IZn78RQIvacWT0MOCdHVfNUIlGqMhDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcb6243d9322740b6a4bde2f8bfbdc478ce5d72d527534e8d4e531f2da5b91a2","last_reissued_at":"2026-05-18T02:55:58.366194Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:58.366194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.4991","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:55:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lghnKXEPSxwKSqLTKB5oFmf9vBLtHyOxC24eAAVESHNHw8T/5zTgId/KD+04jHGjkeTVVSlFmlCTzhgxeSA7Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:17:40.576681Z"},"content_sha256":"d0b049cea201db26ccbf727212e479d1aad994e1a5c5903c29045bf1405dc85a","schema_version":"1.0","event_id":"sha256:d0b049cea201db26ccbf727212e479d1aad994e1a5c5903c29045bf1405dc85a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XS3CIPMTEJ2AW2SL3YXYX664I6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Energy Efficient Scheduling and Routing via Randomized Rounding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander Kononov, Dimitrios Letsios, Evripidis Bampis, Giorgio Lucarelli, Maxim Sviridenko","submitted_at":"2014-03-19T21:52:55Z","abstract_excerpt":"We propose a unifying framework based on configuration linear programs and randomized rounding, for different energy optimization problems in the dynamic speed-scaling setting. We apply our framework to various scheduling and routing problems in heterogeneous computing and networking environments. We first consider the energy minimization problem of scheduling a set of jobs on a set of parallel speed scalable processors in a fully heterogeneous setting. For both the preemptive-non-migratory and the preemptive-migratory variants, our approach allows us to obtain solutions of almost the same qua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4991","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:55:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EkPDldFqEIy5cmR9Jtpq/pB1b5DTBG5ALZuxyeYhbiYai6MlDodKREQQfkpJFUdaTkx4VpQQXzFOQS6CIdR8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:17:40.577481Z"},"content_sha256":"a3902b23b8286c4a2062a9d4e000ac64ef98af04c6f3f20d1dd338b2bc25bac5","schema_version":"1.0","event_id":"sha256:a3902b23b8286c4a2062a9d4e000ac64ef98af04c6f3f20d1dd338b2bc25bac5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XS3CIPMTEJ2AW2SL3YXYX664I6/bundle.json","state_url":"https://pith.science/pith/XS3CIPMTEJ2AW2SL3YXYX664I6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XS3CIPMTEJ2AW2SL3YXYX664I6/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-05-31T18:17:40Z","links":{"resolver":"https://pith.science/pith/XS3CIPMTEJ2AW2SL3YXYX664I6","bundle":"https://pith.science/pith/XS3CIPMTEJ2AW2SL3YXYX664I6/bundle.json","state":"https://pith.science/pith/XS3CIPMTEJ2AW2SL3YXYX664I6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XS3CIPMTEJ2AW2SL3YXYX664I6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XS3CIPMTEJ2AW2SL3YXYX664I6","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":"a196df5d03c834ee46acaaa1d46272214feb1505ad9683d23766c7216e8980c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-19T21:52:55Z","title_canon_sha256":"667cd1351a818760704e4e4ccee96b19974e2f8337c6244878c94d00b8a12e1b"},"schema_version":"1.0","source":{"id":"1403.4991","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.4991","created_at":"2026-05-18T02:55:58Z"},{"alias_kind":"arxiv_version","alias_value":"1403.4991v1","created_at":"2026-05-18T02:55:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4991","created_at":"2026-05-18T02:55:58Z"},{"alias_kind":"pith_short_12","alias_value":"XS3CIPMTEJ2A","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XS3CIPMTEJ2AW2SL","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XS3CIPMT","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:a3902b23b8286c4a2062a9d4e000ac64ef98af04c6f3f20d1dd338b2bc25bac5","target":"graph","created_at":"2026-05-18T02:55:58Z","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 propose a unifying framework based on configuration linear programs and randomized rounding, for different energy optimization problems in the dynamic speed-scaling setting. We apply our framework to various scheduling and routing problems in heterogeneous computing and networking environments. We first consider the energy minimization problem of scheduling a set of jobs on a set of parallel speed scalable processors in a fully heterogeneous setting. For both the preemptive-non-migratory and the preemptive-migratory variants, our approach allows us to obtain solutions of almost the same qua","authors_text":"Alexander Kononov, Dimitrios Letsios, Evripidis Bampis, Giorgio Lucarelli, Maxim Sviridenko","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-19T21:52:55Z","title":"Energy Efficient Scheduling and Routing via Randomized Rounding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.4991","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:d0b049cea201db26ccbf727212e479d1aad994e1a5c5903c29045bf1405dc85a","target":"record","created_at":"2026-05-18T02:55:58Z","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":"a196df5d03c834ee46acaaa1d46272214feb1505ad9683d23766c7216e8980c1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-19T21:52:55Z","title_canon_sha256":"667cd1351a818760704e4e4ccee96b19974e2f8337c6244878c94d00b8a12e1b"},"schema_version":"1.0","source":{"id":"1403.4991","kind":"arxiv","version":1}},"canonical_sha256":"bcb6243d9322740b6a4bde2f8bfbdc478ce5d72d527534e8d4e531f2da5b91a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bcb6243d9322740b6a4bde2f8bfbdc478ce5d72d527534e8d4e531f2da5b91a2","first_computed_at":"2026-05-18T02:55:58.366194Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:58.366194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZdEhy8ByfFpYS/oCn4E6GWYAegM7uFhnxW/Pr0zJlFpGVfZnwVVTwg7IZn78RQIvacWT0MOCdHVfNUIlGqMhDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:58.366570Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.4991","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0b049cea201db26ccbf727212e479d1aad994e1a5c5903c29045bf1405dc85a","sha256:a3902b23b8286c4a2062a9d4e000ac64ef98af04c6f3f20d1dd338b2bc25bac5"],"state_sha256":"9f73efbfb8a275e1cbc1753e177529ba1872328d5c4eafcc50ab7e7cc33463a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bSGnyiIHcYvgdoBF+DBmrXZ3nHfApywgXCJMCIDvAzU70u394zFFgtwodtnKMBYytT1zzX/AIt2MtjRe5uU/Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:17:40.581749Z","bundle_sha256":"a435d72ed07cc84fd8d850834295c9ca4e6a3de2fb67e046ccf14a4b02355143"}}