{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:BAZFR7A3EHHWZRPMA6LZLQU3ID","short_pith_number":"pith:BAZFR7A3","canonical_record":{"source":{"id":"1111.3398","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-15T00:28:24Z","cross_cats_sorted":[],"title_canon_sha256":"f39d3b66123c42d28b60f3276a74db076c901fe489356a6d7b3fb0a6e485fc22","abstract_canon_sha256":"4794321e70edf73edd2662338cd0a4bb55c82515e5b57f3627834c7d82439124"},"schema_version":"1.0"},"canonical_sha256":"083258fc1b21cf6cc5ec079795c29b40e3646e776caec5827b1dc12f8aa26a7e","source":{"kind":"arxiv","id":"1111.3398","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.3398","created_at":"2026-05-18T03:42:44Z"},{"alias_kind":"arxiv_version","alias_value":"1111.3398v2","created_at":"2026-05-18T03:42:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3398","created_at":"2026-05-18T03:42:44Z"},{"alias_kind":"pith_short_12","alias_value":"BAZFR7A3EHHW","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BAZFR7A3EHHWZRPM","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BAZFR7A3","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:BAZFR7A3EHHWZRPMA6LZLQU3ID","target":"record","payload":{"canonical_record":{"source":{"id":"1111.3398","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-15T00:28:24Z","cross_cats_sorted":[],"title_canon_sha256":"f39d3b66123c42d28b60f3276a74db076c901fe489356a6d7b3fb0a6e485fc22","abstract_canon_sha256":"4794321e70edf73edd2662338cd0a4bb55c82515e5b57f3627834c7d82439124"},"schema_version":"1.0"},"canonical_sha256":"083258fc1b21cf6cc5ec079795c29b40e3646e776caec5827b1dc12f8aa26a7e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:44.670870Z","signature_b64":"B+IaWLQ55P7CdulCvmOSJ4f0zjHtpR0pSnJ9U2BHqzpAV1UCtLCcJtgPkrcB73CW14eDY/7DFuvyixa0XCcoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"083258fc1b21cf6cc5ec079795c29b40e3646e776caec5827b1dc12f8aa26a7e","last_reissued_at":"2026-05-18T03:42:44.670432Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:44.670432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.3398","source_version":2,"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:42:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kXEtsQGnUoO4hhTNe6TWGo06G2LAQKycZEzfyQClzF5UH/OMdFPYfhxnfvVi9yavM2ASNHPrvjQdwQdm0rvEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T12:34:05.538520Z"},"content_sha256":"cfd461f16bc835970e834b5d3d61bd1a1c1053fe4486d7e620b68572cc1ef3a6","schema_version":"1.0","event_id":"sha256:cfd461f16bc835970e834b5d3d61bd1a1c1053fe4486d7e620b68572cc1ef3a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:BAZFR7A3EHHWZRPMA6LZLQU3ID","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Speed scaling with power down scheduling for agreeable deadlines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christoph D\\\"urr, Evripidis Bampis, Fadi Kacem, Ioannis Milis","submitted_at":"2011-11-15T00:28:24Z","abstract_excerpt":"We consider the problem of scheduling on a single processor a given set of n jobs. Each job j has a workload w_j and a release time r_j. The processor can vary its speed and hibernate to reduce energy consumption. In a schedule minimizing overall consumed energy, it might be that some jobs complete arbitrarily far from their release time. So in order to guarantee some quality of service, we would like to impose a deadline d_j=r_j+F for every job j, where F is a guarantee on the *flow time*. We provide an O(n^3) algorithm for the more general case of *agreeable deadlines*, where jobs have relea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3398","kind":"arxiv","version":2},"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:42:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R0ysc11NQA16vqTkjHC43Aoq2Xx/cp0yBlsWGBRrJM8IrX39XA/zrhCLzM11R2O/b0/6qAfYWIiKtRu2WPgeAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T12:34:05.538860Z"},"content_sha256":"19877396e6e7a00f8c83d00affe4f72944157e4d757bb17917303e36da44131d","schema_version":"1.0","event_id":"sha256:19877396e6e7a00f8c83d00affe4f72944157e4d757bb17917303e36da44131d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BAZFR7A3EHHWZRPMA6LZLQU3ID/bundle.json","state_url":"https://pith.science/pith/BAZFR7A3EHHWZRPMA6LZLQU3ID/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BAZFR7A3EHHWZRPMA6LZLQU3ID/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-27T12:34:05Z","links":{"resolver":"https://pith.science/pith/BAZFR7A3EHHWZRPMA6LZLQU3ID","bundle":"https://pith.science/pith/BAZFR7A3EHHWZRPMA6LZLQU3ID/bundle.json","state":"https://pith.science/pith/BAZFR7A3EHHWZRPMA6LZLQU3ID/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BAZFR7A3EHHWZRPMA6LZLQU3ID/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BAZFR7A3EHHWZRPMA6LZLQU3ID","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":"4794321e70edf73edd2662338cd0a4bb55c82515e5b57f3627834c7d82439124","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-15T00:28:24Z","title_canon_sha256":"f39d3b66123c42d28b60f3276a74db076c901fe489356a6d7b3fb0a6e485fc22"},"schema_version":"1.0","source":{"id":"1111.3398","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.3398","created_at":"2026-05-18T03:42:44Z"},{"alias_kind":"arxiv_version","alias_value":"1111.3398v2","created_at":"2026-05-18T03:42:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3398","created_at":"2026-05-18T03:42:44Z"},{"alias_kind":"pith_short_12","alias_value":"BAZFR7A3EHHW","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BAZFR7A3EHHWZRPM","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BAZFR7A3","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:19877396e6e7a00f8c83d00affe4f72944157e4d757bb17917303e36da44131d","target":"graph","created_at":"2026-05-18T03:42:44Z","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 consider the problem of scheduling on a single processor a given set of n jobs. Each job j has a workload w_j and a release time r_j. The processor can vary its speed and hibernate to reduce energy consumption. In a schedule minimizing overall consumed energy, it might be that some jobs complete arbitrarily far from their release time. So in order to guarantee some quality of service, we would like to impose a deadline d_j=r_j+F for every job j, where F is a guarantee on the *flow time*. We provide an O(n^3) algorithm for the more general case of *agreeable deadlines*, where jobs have relea","authors_text":"Christoph D\\\"urr, Evripidis Bampis, Fadi Kacem, Ioannis Milis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-15T00:28:24Z","title":"Speed scaling with power down scheduling for agreeable deadlines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3398","kind":"arxiv","version":2},"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:cfd461f16bc835970e834b5d3d61bd1a1c1053fe4486d7e620b68572cc1ef3a6","target":"record","created_at":"2026-05-18T03:42:44Z","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":"4794321e70edf73edd2662338cd0a4bb55c82515e5b57f3627834c7d82439124","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-11-15T00:28:24Z","title_canon_sha256":"f39d3b66123c42d28b60f3276a74db076c901fe489356a6d7b3fb0a6e485fc22"},"schema_version":"1.0","source":{"id":"1111.3398","kind":"arxiv","version":2}},"canonical_sha256":"083258fc1b21cf6cc5ec079795c29b40e3646e776caec5827b1dc12f8aa26a7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"083258fc1b21cf6cc5ec079795c29b40e3646e776caec5827b1dc12f8aa26a7e","first_computed_at":"2026-05-18T03:42:44.670432Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:44.670432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B+IaWLQ55P7CdulCvmOSJ4f0zjHtpR0pSnJ9U2BHqzpAV1UCtLCcJtgPkrcB73CW14eDY/7DFuvyixa0XCcoAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:44.670870Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.3398","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cfd461f16bc835970e834b5d3d61bd1a1c1053fe4486d7e620b68572cc1ef3a6","sha256:19877396e6e7a00f8c83d00affe4f72944157e4d757bb17917303e36da44131d"],"state_sha256":"a678e5458e7587fab4301df284238bd7413e1367d25f70c30e2f9c71a1aa790e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bP6XBv0SRXQzPNHDQJCk++zoahioXJwQCcYyh92Y3fg1108vWeigAFuyNGbVjsnK3WcYO8AoUQBjLQfx2ptRAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T12:34:05.540677Z","bundle_sha256":"389279f172292386744345a0d55740939c215d6beff5b5aa6f305aaf4e14a39c"}}