{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:S53FWEKGD5R6GBQTANVKM2O3DV","short_pith_number":"pith:S53FWEKG","schema_version":"1.0","canonical_sha256":"97765b11461f63e30613036aa669db1d51a1b03cf1cacd55993d3b3ffe5684ca","source":{"kind":"arxiv","id":"1407.0892","version":1},"attestation_state":"computed","paper":{"title":"A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Antonios Antoniadis, Chien-Chung Huang, Sebastian Ott","submitted_at":"2014-07-03T12:41:07Z","abstract_excerpt":"We study classical deadline-based preemptive scheduling of tasks in a computing environment equipped with both dynamic speed scaling and sleep state capabilities: Each task is specified by a release time, a deadline and a processing volume, and has to be scheduled on a single, speed-scalable processor that is supplied with a sleep state. In the sleep state, the processor consumes no energy, but a constant wake-up cost is required to transition back to the active state. In contrast to speed scaling alone, the addition of a sleep state makes it sometimes beneficial to accelerate the processing o"},"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":"1407.0892","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-03T12:41:07Z","cross_cats_sorted":[],"title_canon_sha256":"ef100c28c710376519439ed06eda4fa4440d85cfca01db25902376c27ab526f8","abstract_canon_sha256":"f15c1b3ea98198d4f208259c717e889da410e3a5c5a205242a356c390f5b1995"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:25.193039Z","signature_b64":"LglDDYIkxN7Lniu0L6UjdhqvlTHiGTnmpMD3jt9H/5AESnpUdJ8KEZKQGT0a3kSZhIIrPes3icNWGQ2J27T7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"97765b11461f63e30613036aa669db1d51a1b03cf1cacd55993d3b3ffe5684ca","last_reissued_at":"2026-05-18T02:48:25.192423Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:25.192423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Antonios Antoniadis, Chien-Chung Huang, Sebastian Ott","submitted_at":"2014-07-03T12:41:07Z","abstract_excerpt":"We study classical deadline-based preemptive scheduling of tasks in a computing environment equipped with both dynamic speed scaling and sleep state capabilities: Each task is specified by a release time, a deadline and a processing volume, and has to be scheduled on a single, speed-scalable processor that is supplied with a sleep state. In the sleep state, the processor consumes no energy, but a constant wake-up cost is required to transition back to the active state. In contrast to speed scaling alone, the addition of a sleep state makes it sometimes beneficial to accelerate the processing o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0892","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":"1407.0892","created_at":"2026-05-18T02:48:25.192519+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.0892v1","created_at":"2026-05-18T02:48:25.192519+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0892","created_at":"2026-05-18T02:48:25.192519+00:00"},{"alias_kind":"pith_short_12","alias_value":"S53FWEKGD5R6","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"S53FWEKGD5R6GBQT","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"S53FWEKG","created_at":"2026-05-18T12:28:49.207871+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/S53FWEKGD5R6GBQTANVKM2O3DV","json":"https://pith.science/pith/S53FWEKGD5R6GBQTANVKM2O3DV.json","graph_json":"https://pith.science/api/pith-number/S53FWEKGD5R6GBQTANVKM2O3DV/graph.json","events_json":"https://pith.science/api/pith-number/S53FWEKGD5R6GBQTANVKM2O3DV/events.json","paper":"https://pith.science/paper/S53FWEKG"},"agent_actions":{"view_html":"https://pith.science/pith/S53FWEKGD5R6GBQTANVKM2O3DV","download_json":"https://pith.science/pith/S53FWEKGD5R6GBQTANVKM2O3DV.json","view_paper":"https://pith.science/paper/S53FWEKG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.0892&json=true","fetch_graph":"https://pith.science/api/pith-number/S53FWEKGD5R6GBQTANVKM2O3DV/graph.json","fetch_events":"https://pith.science/api/pith-number/S53FWEKGD5R6GBQTANVKM2O3DV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S53FWEKGD5R6GBQTANVKM2O3DV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S53FWEKGD5R6GBQTANVKM2O3DV/action/storage_attestation","attest_author":"https://pith.science/pith/S53FWEKGD5R6GBQTANVKM2O3DV/action/author_attestation","sign_citation":"https://pith.science/pith/S53FWEKGD5R6GBQTANVKM2O3DV/action/citation_signature","submit_replication":"https://pith.science/pith/S53FWEKGD5R6GBQTANVKM2O3DV/action/replication_record"}},"created_at":"2026-05-18T02:48:25.192519+00:00","updated_at":"2026-05-18T02:48:25.192519+00:00"}