{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ILRYP7HVBKEBGQLHTNAFP4RTOZ","short_pith_number":"pith:ILRYP7HV","canonical_record":{"source":{"id":"1303.0377","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-02T11:38:17Z","cross_cats_sorted":[],"title_canon_sha256":"7ef186b357422d2ede49bcbc235e1efe6fb3d38d30838ec6eef4a64bdab543cd","abstract_canon_sha256":"7609eb3382dae694ea0b8d205f92fdb0cf36508e24a371ecbb792b559e147507"},"schema_version":"1.0"},"canonical_sha256":"42e387fcf50a881341679b4057f23376784772d2cd81e1a150463af5560fad44","source":{"kind":"arxiv","id":"1303.0377","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0377","created_at":"2026-05-18T01:37:05Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0377v1","created_at":"2026-05-18T01:37:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0377","created_at":"2026-05-18T01:37:05Z"},{"alias_kind":"pith_short_12","alias_value":"ILRYP7HVBKEB","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"ILRYP7HVBKEBGQLH","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"ILRYP7HV","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ILRYP7HVBKEBGQLHTNAFP4RTOZ","target":"record","payload":{"canonical_record":{"source":{"id":"1303.0377","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-02T11:38:17Z","cross_cats_sorted":[],"title_canon_sha256":"7ef186b357422d2ede49bcbc235e1efe6fb3d38d30838ec6eef4a64bdab543cd","abstract_canon_sha256":"7609eb3382dae694ea0b8d205f92fdb0cf36508e24a371ecbb792b559e147507"},"schema_version":"1.0"},"canonical_sha256":"42e387fcf50a881341679b4057f23376784772d2cd81e1a150463af5560fad44","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:05.972808Z","signature_b64":"tMykO0nXZhB8vlqi3IvWJ/6EmpDaPA6MYAXag9g+0YuiG8lhUE2NgIim/zHpQrTFIbB/f+Px7MHTH4VtEZD5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42e387fcf50a881341679b4057f23376784772d2cd81e1a150463af5560fad44","last_reissued_at":"2026-05-18T01:37:05.972173Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:05.972173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.0377","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-18T01:37:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"otlQAzUcAP/xjXW5Is76eJtdETI4qLPP21FP+nxcIR6xCCRar3k4erz16bXS47fRtItBXea2pOorHZAzmJ52BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:07:53.368772Z"},"content_sha256":"39af789d31913251e19b9bd46f952c88607b38e2d863dcb97d404244c0727f8b","schema_version":"1.0","event_id":"sha256:39af789d31913251e19b9bd46f952c88607b38e2d863dcb97d404244c0727f8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ILRYP7HVBKEBGQLHTNAFP4RTOZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Online Algorithm for Dynamic Speed Scaling with Sleep State","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gunjan Kumar, Saswata Shannigrahi","submitted_at":"2013-03-02T11:38:17Z","abstract_excerpt":"In this paper, we consider an energy-efficient scheduling problem where $n$ jobs $J_1, J_2, ..., J_n$ need to be executed such that the total energy usage of these jobs is minimized while ensuring that each job is finished within it's deadline. We work in an online setting where a job is known only at it's arrival time, along with it's processing volume and deadline. In such a setting, the currently best-known algorithm by Han et al. \\cite{han} provides a competitive ratio max $\\{4, 2 + {\\alpha}^{\\alpha}\\}$ of energy usage. In this paper, we present a new online algorithm SqOA which provides a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0377","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-18T01:37:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S3Qj5RHuhhkmSJ1MmizpoT5XOphEIGc47VpjmN1jD/EXUnZi05fK6SrF3DroECGUvnTz2lVz/4U//SWrtjZRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:07:53.369176Z"},"content_sha256":"ed38bf3bc4c61d29b566fdf7c106fe4f4ceb65463464b4ae516a466812f9584a","schema_version":"1.0","event_id":"sha256:ed38bf3bc4c61d29b566fdf7c106fe4f4ceb65463464b4ae516a466812f9584a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ILRYP7HVBKEBGQLHTNAFP4RTOZ/bundle.json","state_url":"https://pith.science/pith/ILRYP7HVBKEBGQLHTNAFP4RTOZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ILRYP7HVBKEBGQLHTNAFP4RTOZ/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-31T00:07:53Z","links":{"resolver":"https://pith.science/pith/ILRYP7HVBKEBGQLHTNAFP4RTOZ","bundle":"https://pith.science/pith/ILRYP7HVBKEBGQLHTNAFP4RTOZ/bundle.json","state":"https://pith.science/pith/ILRYP7HVBKEBGQLHTNAFP4RTOZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ILRYP7HVBKEBGQLHTNAFP4RTOZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ILRYP7HVBKEBGQLHTNAFP4RTOZ","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":"7609eb3382dae694ea0b8d205f92fdb0cf36508e24a371ecbb792b559e147507","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-02T11:38:17Z","title_canon_sha256":"7ef186b357422d2ede49bcbc235e1efe6fb3d38d30838ec6eef4a64bdab543cd"},"schema_version":"1.0","source":{"id":"1303.0377","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0377","created_at":"2026-05-18T01:37:05Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0377v1","created_at":"2026-05-18T01:37:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0377","created_at":"2026-05-18T01:37:05Z"},{"alias_kind":"pith_short_12","alias_value":"ILRYP7HVBKEB","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"ILRYP7HVBKEBGQLH","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"ILRYP7HV","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:ed38bf3bc4c61d29b566fdf7c106fe4f4ceb65463464b4ae516a466812f9584a","target":"graph","created_at":"2026-05-18T01:37:05Z","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":"In this paper, we consider an energy-efficient scheduling problem where $n$ jobs $J_1, J_2, ..., J_n$ need to be executed such that the total energy usage of these jobs is minimized while ensuring that each job is finished within it's deadline. We work in an online setting where a job is known only at it's arrival time, along with it's processing volume and deadline. In such a setting, the currently best-known algorithm by Han et al. \\cite{han} provides a competitive ratio max $\\{4, 2 + {\\alpha}^{\\alpha}\\}$ of energy usage. In this paper, we present a new online algorithm SqOA which provides a","authors_text":"Gunjan Kumar, Saswata Shannigrahi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-02T11:38:17Z","title":"New Online Algorithm for Dynamic Speed Scaling with Sleep State"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0377","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:39af789d31913251e19b9bd46f952c88607b38e2d863dcb97d404244c0727f8b","target":"record","created_at":"2026-05-18T01:37:05Z","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":"7609eb3382dae694ea0b8d205f92fdb0cf36508e24a371ecbb792b559e147507","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-02T11:38:17Z","title_canon_sha256":"7ef186b357422d2ede49bcbc235e1efe6fb3d38d30838ec6eef4a64bdab543cd"},"schema_version":"1.0","source":{"id":"1303.0377","kind":"arxiv","version":1}},"canonical_sha256":"42e387fcf50a881341679b4057f23376784772d2cd81e1a150463af5560fad44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42e387fcf50a881341679b4057f23376784772d2cd81e1a150463af5560fad44","first_computed_at":"2026-05-18T01:37:05.972173Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:05.972173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tMykO0nXZhB8vlqi3IvWJ/6EmpDaPA6MYAXag9g+0YuiG8lhUE2NgIim/zHpQrTFIbB/f+Px7MHTH4VtEZD5AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:05.972808Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.0377","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39af789d31913251e19b9bd46f952c88607b38e2d863dcb97d404244c0727f8b","sha256:ed38bf3bc4c61d29b566fdf7c106fe4f4ceb65463464b4ae516a466812f9584a"],"state_sha256":"6c66e8e9de99904f18105da56e1bd80243d0783189dd8fc805aef8ef5b96c624"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"05+CEaWtJSOlOMUVpOirqXIKPv2Ti1Ur1DyOOrnhwrV3pEAgfZnrlQfEsge5glo/Q9gknd9oBYizuq3XRPYQAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:07:53.371785Z","bundle_sha256":"4355f7da0179b728333014054a28c17d4720060c1b8a231bf5525b2ea687dbd1"}}