{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XS3CIPMTEJ2AW2SL3YXYX664I6","short_pith_number":"pith:XS3CIPMT","schema_version":"1.0","canonical_sha256":"bcb6243d9322740b6a4bde2f8bfbdc478ce5d72d527534e8d4e531f2da5b91a2","source":{"kind":"arxiv","id":"1403.4991","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1403.4991","created_at":"2026-05-18T02:55:58.366242+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.4991v1","created_at":"2026-05-18T02:55:58.366242+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.4991","created_at":"2026-05-18T02:55:58.366242+00:00"},{"alias_kind":"pith_short_12","alias_value":"XS3CIPMTEJ2A","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XS3CIPMTEJ2AW2SL","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XS3CIPMT","created_at":"2026-05-18T12:28:57.508820+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/XS3CIPMTEJ2AW2SL3YXYX664I6","json":"https://pith.science/pith/XS3CIPMTEJ2AW2SL3YXYX664I6.json","graph_json":"https://pith.science/api/pith-number/XS3CIPMTEJ2AW2SL3YXYX664I6/graph.json","events_json":"https://pith.science/api/pith-number/XS3CIPMTEJ2AW2SL3YXYX664I6/events.json","paper":"https://pith.science/paper/XS3CIPMT"},"agent_actions":{"view_html":"https://pith.science/pith/XS3CIPMTEJ2AW2SL3YXYX664I6","download_json":"https://pith.science/pith/XS3CIPMTEJ2AW2SL3YXYX664I6.json","view_paper":"https://pith.science/paper/XS3CIPMT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.4991&json=true","fetch_graph":"https://pith.science/api/pith-number/XS3CIPMTEJ2AW2SL3YXYX664I6/graph.json","fetch_events":"https://pith.science/api/pith-number/XS3CIPMTEJ2AW2SL3YXYX664I6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XS3CIPMTEJ2AW2SL3YXYX664I6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XS3CIPMTEJ2AW2SL3YXYX664I6/action/storage_attestation","attest_author":"https://pith.science/pith/XS3CIPMTEJ2AW2SL3YXYX664I6/action/author_attestation","sign_citation":"https://pith.science/pith/XS3CIPMTEJ2AW2SL3YXYX664I6/action/citation_signature","submit_replication":"https://pith.science/pith/XS3CIPMTEJ2AW2SL3YXYX664I6/action/replication_record"}},"created_at":"2026-05-18T02:55:58.366242+00:00","updated_at":"2026-05-18T02:55:58.366242+00:00"}