{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:S53FWEKGD5R6GBQTANVKM2O3DV","short_pith_number":"pith:S53FWEKG","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"},"canonical_sha256":"97765b11461f63e30613036aa669db1d51a1b03cf1cacd55993d3b3ffe5684ca","source":{"kind":"arxiv","id":"1407.0892","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0892","created_at":"2026-05-18T02:48:25Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0892v1","created_at":"2026-05-18T02:48:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0892","created_at":"2026-05-18T02:48:25Z"},{"alias_kind":"pith_short_12","alias_value":"S53FWEKGD5R6","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"S53FWEKGD5R6GBQT","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"S53FWEKG","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:S53FWEKGD5R6GBQTANVKM2O3DV","target":"record","payload":{"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"},"canonical_sha256":"97765b11461f63e30613036aa669db1d51a1b03cf1cacd55993d3b3ffe5684ca","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"},"source_kind":"arxiv","source_id":"1407.0892","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:48:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sUEqNbG37R2TQsGaTu2OdBRaX+61f8m8rAbi9kdJ1ru3dICQXd4WqQe7p7f0kTHNdpZVMkytoUFIxlEhmJs6Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:17:02.467133Z"},"content_sha256":"573658a563506577a4d5f0aeb1a8c0f18ca7b4f11c0c8244802b78d2534423e5","schema_version":"1.0","event_id":"sha256:573658a563506577a4d5f0aeb1a8c0f18ca7b4f11c0c8244802b78d2534423e5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:S53FWEKGD5R6GBQTANVKM2O3DV","target":"graph","payload":{"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"},"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:48:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mo7jBY++vswR80yC4m0r0VAlnDgh/V2wK38B3N8MbWvbnfgeAiTF6oxToMdocckQzA/cUjh7DmcEE0BVhOuMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:17:02.467490Z"},"content_sha256":"adb814b4cb7a888d8895364c347e8516409dfec464d8fcae52274c88f8fec9b0","schema_version":"1.0","event_id":"sha256:adb814b4cb7a888d8895364c347e8516409dfec464d8fcae52274c88f8fec9b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S53FWEKGD5R6GBQTANVKM2O3DV/bundle.json","state_url":"https://pith.science/pith/S53FWEKGD5R6GBQTANVKM2O3DV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S53FWEKGD5R6GBQTANVKM2O3DV/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-01T15:17:02Z","links":{"resolver":"https://pith.science/pith/S53FWEKGD5R6GBQTANVKM2O3DV","bundle":"https://pith.science/pith/S53FWEKGD5R6GBQTANVKM2O3DV/bundle.json","state":"https://pith.science/pith/S53FWEKGD5R6GBQTANVKM2O3DV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S53FWEKGD5R6GBQTANVKM2O3DV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:S53FWEKGD5R6GBQTANVKM2O3DV","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":"f15c1b3ea98198d4f208259c717e889da410e3a5c5a205242a356c390f5b1995","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-03T12:41:07Z","title_canon_sha256":"ef100c28c710376519439ed06eda4fa4440d85cfca01db25902376c27ab526f8"},"schema_version":"1.0","source":{"id":"1407.0892","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0892","created_at":"2026-05-18T02:48:25Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0892v1","created_at":"2026-05-18T02:48:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0892","created_at":"2026-05-18T02:48:25Z"},{"alias_kind":"pith_short_12","alias_value":"S53FWEKGD5R6","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"S53FWEKGD5R6GBQT","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"S53FWEKG","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:adb814b4cb7a888d8895364c347e8516409dfec464d8fcae52274c88f8fec9b0","target":"graph","created_at":"2026-05-18T02:48:25Z","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 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","authors_text":"Antonios Antoniadis, Chien-Chung Huang, Sebastian Ott","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-03T12:41:07Z","title":"A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0892","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:573658a563506577a4d5f0aeb1a8c0f18ca7b4f11c0c8244802b78d2534423e5","target":"record","created_at":"2026-05-18T02:48:25Z","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":"f15c1b3ea98198d4f208259c717e889da410e3a5c5a205242a356c390f5b1995","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-03T12:41:07Z","title_canon_sha256":"ef100c28c710376519439ed06eda4fa4440d85cfca01db25902376c27ab526f8"},"schema_version":"1.0","source":{"id":"1407.0892","kind":"arxiv","version":1}},"canonical_sha256":"97765b11461f63e30613036aa669db1d51a1b03cf1cacd55993d3b3ffe5684ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"97765b11461f63e30613036aa669db1d51a1b03cf1cacd55993d3b3ffe5684ca","first_computed_at":"2026-05-18T02:48:25.192423Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:48:25.192423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LglDDYIkxN7Lniu0L6UjdhqvlTHiGTnmpMD3jt9H/5AESnpUdJ8KEZKQGT0a3kSZhIIrPes3icNWGQ2J27T7DA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:48:25.193039Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.0892","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:573658a563506577a4d5f0aeb1a8c0f18ca7b4f11c0c8244802b78d2534423e5","sha256:adb814b4cb7a888d8895364c347e8516409dfec464d8fcae52274c88f8fec9b0"],"state_sha256":"1b7d31aec8f3757f292ea2b2212d8cc1780ac7e1308eee90d8fec356e9bf151c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TctH+eyVV278Pibkm1h7xtaa7MUOyY+OtDsdNI0tNpRyc81PmmM5JjbnudlmfvSL+XSDsKRVB97aAW/2i9GjCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:17:02.469715Z","bundle_sha256":"5fd635b4b1003824a927d1b1d80d5d6de72652df6cf2574a4f70041ee7c18d25"}}