{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:55MQUTEA3DTVTDCWHIJBPITW3T","short_pith_number":"pith:55MQUTEA","canonical_record":{"source":{"id":"1309.1732","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-06T18:48:07Z","cross_cats_sorted":[],"title_canon_sha256":"a710f4147d2c0b039a25871878b5255940a1439f218e91dd634f45a4c20885dc","abstract_canon_sha256":"6361cf5b455efdd8e2ab17f22fdcfccc2032e66e0cbf51352cc31e508bd77537"},"schema_version":"1.0"},"canonical_sha256":"ef590a4c80d8e7598c563a1217a276dcd09025749b27f2cef8e69c86b86e9c96","source":{"kind":"arxiv","id":"1309.1732","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1732","created_at":"2026-05-18T03:13:58Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1732v1","created_at":"2026-05-18T03:13:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1732","created_at":"2026-05-18T03:13:58Z"},{"alias_kind":"pith_short_12","alias_value":"55MQUTEA3DTV","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"55MQUTEA3DTVTDCW","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"55MQUTEA","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:55MQUTEA3DTVTDCWHIJBPITW3T","target":"record","payload":{"canonical_record":{"source":{"id":"1309.1732","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-06T18:48:07Z","cross_cats_sorted":[],"title_canon_sha256":"a710f4147d2c0b039a25871878b5255940a1439f218e91dd634f45a4c20885dc","abstract_canon_sha256":"6361cf5b455efdd8e2ab17f22fdcfccc2032e66e0cbf51352cc31e508bd77537"},"schema_version":"1.0"},"canonical_sha256":"ef590a4c80d8e7598c563a1217a276dcd09025749b27f2cef8e69c86b86e9c96","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:13:58.770967Z","signature_b64":"dAmJ/bdV3N6YsADvTeiFyNozTcIsjtDLMH9pbZGOxOFvZZrgqPPi332YdEqIJ3EWQ/EXILLiRjANzcWh08uJBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef590a4c80d8e7598c563a1217a276dcd09025749b27f2cef8e69c86b86e9c96","last_reissued_at":"2026-05-18T03:13:58.770401Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:13:58.770401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.1732","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-18T03:13:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SxgWeA5fL3e0Y3MnBOM/WLcy392QoqxamHkZSDfpMwaT0upHQCYd7pgJjFvK//buHbWx9oRHELAD3DcBavUiBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:22:57.989684Z"},"content_sha256":"75bf4f14efdb5e35105e99709d9d67ac04548d8118ceb912d86f277655b7aec2","schema_version":"1.0","event_id":"sha256:75bf4f14efdb5e35105e99709d9d67ac04548d8118ceb912d86f277655b7aec2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:55MQUTEA3DTVTDCWHIJBPITW3T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Throughput Maximization in the Speed-Scaling Setting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eric Angel, Evripidis Bampis, Vincent Chau","submitted_at":"2013-09-06T18:48:07Z","abstract_excerpt":"We are given a set of $n$ jobs and a single processor that can vary its speed dynamically. Each job $J_j$ is characterized by its processing requirement (work) $p_j$, its release date $r_j$ and its deadline $d_j$. We are also given a budget of energy $E$ and we study the scheduling problem of maximizing the throughput (i.e. the number of jobs which are completed on time). We propose a dynamic programming algorithm that solves the preemptive case of the problem, i.e. when the execution of the jobs may be interrupted and resumed later, in pseudo-polynomial time. Our algorithm can be adapted for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1732","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-18T03:13:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lrpa90mOYAPr9Te8gIjXisNWa0WJrw9+X0bpuScsSQZnhPytv07kltKrv8F745LNhdR8Tm5Yhcc6OWmsRTu1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:22:57.990090Z"},"content_sha256":"234a69c1a2325bc50c9e3542b39af7a8f21346e8f4f166f70c82d027acc9ae9b","schema_version":"1.0","event_id":"sha256:234a69c1a2325bc50c9e3542b39af7a8f21346e8f4f166f70c82d027acc9ae9b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/55MQUTEA3DTVTDCWHIJBPITW3T/bundle.json","state_url":"https://pith.science/pith/55MQUTEA3DTVTDCWHIJBPITW3T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/55MQUTEA3DTVTDCWHIJBPITW3T/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-31T05:22:57Z","links":{"resolver":"https://pith.science/pith/55MQUTEA3DTVTDCWHIJBPITW3T","bundle":"https://pith.science/pith/55MQUTEA3DTVTDCWHIJBPITW3T/bundle.json","state":"https://pith.science/pith/55MQUTEA3DTVTDCWHIJBPITW3T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/55MQUTEA3DTVTDCWHIJBPITW3T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:55MQUTEA3DTVTDCWHIJBPITW3T","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":"6361cf5b455efdd8e2ab17f22fdcfccc2032e66e0cbf51352cc31e508bd77537","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-06T18:48:07Z","title_canon_sha256":"a710f4147d2c0b039a25871878b5255940a1439f218e91dd634f45a4c20885dc"},"schema_version":"1.0","source":{"id":"1309.1732","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.1732","created_at":"2026-05-18T03:13:58Z"},{"alias_kind":"arxiv_version","alias_value":"1309.1732v1","created_at":"2026-05-18T03:13:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.1732","created_at":"2026-05-18T03:13:58Z"},{"alias_kind":"pith_short_12","alias_value":"55MQUTEA3DTV","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"55MQUTEA3DTVTDCW","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"55MQUTEA","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:234a69c1a2325bc50c9e3542b39af7a8f21346e8f4f166f70c82d027acc9ae9b","target":"graph","created_at":"2026-05-18T03:13: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 are given a set of $n$ jobs and a single processor that can vary its speed dynamically. Each job $J_j$ is characterized by its processing requirement (work) $p_j$, its release date $r_j$ and its deadline $d_j$. We are also given a budget of energy $E$ and we study the scheduling problem of maximizing the throughput (i.e. the number of jobs which are completed on time). We propose a dynamic programming algorithm that solves the preemptive case of the problem, i.e. when the execution of the jobs may be interrupted and resumed later, in pseudo-polynomial time. Our algorithm can be adapted for ","authors_text":"Eric Angel, Evripidis Bampis, Vincent Chau","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-06T18:48:07Z","title":"Throughput Maximization in the Speed-Scaling Setting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.1732","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:75bf4f14efdb5e35105e99709d9d67ac04548d8118ceb912d86f277655b7aec2","target":"record","created_at":"2026-05-18T03:13: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":"6361cf5b455efdd8e2ab17f22fdcfccc2032e66e0cbf51352cc31e508bd77537","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-06T18:48:07Z","title_canon_sha256":"a710f4147d2c0b039a25871878b5255940a1439f218e91dd634f45a4c20885dc"},"schema_version":"1.0","source":{"id":"1309.1732","kind":"arxiv","version":1}},"canonical_sha256":"ef590a4c80d8e7598c563a1217a276dcd09025749b27f2cef8e69c86b86e9c96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef590a4c80d8e7598c563a1217a276dcd09025749b27f2cef8e69c86b86e9c96","first_computed_at":"2026-05-18T03:13:58.770401Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:13:58.770401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"dAmJ/bdV3N6YsADvTeiFyNozTcIsjtDLMH9pbZGOxOFvZZrgqPPi332YdEqIJ3EWQ/EXILLiRjANzcWh08uJBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:13:58.770967Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.1732","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75bf4f14efdb5e35105e99709d9d67ac04548d8118ceb912d86f277655b7aec2","sha256:234a69c1a2325bc50c9e3542b39af7a8f21346e8f4f166f70c82d027acc9ae9b"],"state_sha256":"62c69994e4fd522611a3503337556a0853e3919d1f535b497994bdf9b43bd1fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"itJWaj8aeBg2f4FkaJEEVkpHXmT1I/dHN8w/elAp6DWu2zMLHv6+7rSmUq6QvY0GUIjSSwsLejOiANJMbBiaAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:22:57.995032Z","bundle_sha256":"45aadc2532fa2e303e13d5c1fd4b2b73ce1d57d8f4b63ce65aaa50c9a41f6e14"}}