{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YNNIWBN7EDVF7G4YNDG3IT4IXH","short_pith_number":"pith:YNNIWBN7","canonical_record":{"source":{"id":"1408.5995","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-26T03:23:05Z","cross_cats_sorted":[],"title_canon_sha256":"c636909d5ba67cb2099829cc7b50661b50652f857369e575718ae141993b9e73","abstract_canon_sha256":"b727ca47ee69ee3164e47495b7bae67dc16810af63c94319f16f6cb63cf2c27a"},"schema_version":"1.0"},"canonical_sha256":"c35a8b05bf20ea5f9b9868cdb44f88b9e97fdd00c54cc9b3c741414d527511b6","source":{"kind":"arxiv","id":"1408.5995","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5995","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5995v1","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5995","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"pith_short_12","alias_value":"YNNIWBN7EDVF","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YNNIWBN7EDVF7G4Y","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YNNIWBN7","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YNNIWBN7EDVF7G4YNDG3IT4IXH","target":"record","payload":{"canonical_record":{"source":{"id":"1408.5995","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-26T03:23:05Z","cross_cats_sorted":[],"title_canon_sha256":"c636909d5ba67cb2099829cc7b50661b50652f857369e575718ae141993b9e73","abstract_canon_sha256":"b727ca47ee69ee3164e47495b7bae67dc16810af63c94319f16f6cb63cf2c27a"},"schema_version":"1.0"},"canonical_sha256":"c35a8b05bf20ea5f9b9868cdb44f88b9e97fdd00c54cc9b3c741414d527511b6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:15.249071Z","signature_b64":"xSNLTglMfsrN5dlDXM9xjgjzS06DbzAnAWEnoPzNGlE+N/xGo/kJo7nvhrJWGRG82lAU9X8L3TG8xIZ8PUb0AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c35a8b05bf20ea5f9b9868cdb44f88b9e97fdd00c54cc9b3c741414d527511b6","last_reissued_at":"2026-05-18T02:44:15.248634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:15.248634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.5995","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:44:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NCEyNB/wZKjGyrDyTVTli5jopFkERHFwRmLEu1SCgIZy1q9epUzE3pW8DBPNCkde1pti4IL/A2m6aH8vgKCADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T08:19:43.129139Z"},"content_sha256":"526845a3d0417ecfebdb50883428b7a69bb5528db057402765085dcfe03a1f28","schema_version":"1.0","event_id":"sha256:526845a3d0417ecfebdb50883428b7a69bb5528db057402765085dcfe03a1f28"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YNNIWBN7EDVF7G4YNDG3IT4IXH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An $O(n^2)$ Algorithm for Computing Optimal Continuous Voltage Schedules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Frances F. Yao, Hao Yuan, Minming Li","submitted_at":"2014-08-26T03:23:05Z","abstract_excerpt":"Dynamic Voltage Scaling techniques allow the processor to set its speed dynamically in order to reduce energy consumption. In the continuous model, the processor can run at any speed, while in the discrete model, the processor can only run at finite number of speeds given as input. The current best algorithm for computing the optimal schedules for the continuous model runs at $O(n^2\\log n)$ time for scheduling $n$ jobs. In this paper, we improve the running time to $O(n^2)$ by speeding up the calculation of s-schedules using a more refined data structure. For the discrete model, we improve the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5995","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:44:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"azjbuqFE4adykDYM1RyQqoWW5b7kEgk/IRBGw9Lcyh0hj79gpUjOpj1PnknYy+XUije5ONf6yEjxsNBf2mKCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T08:19:43.129513Z"},"content_sha256":"dc39fa10cb2951bc2337e05f404f04974d2922c9d52d6b2d80c91eb2d27d8409","schema_version":"1.0","event_id":"sha256:dc39fa10cb2951bc2337e05f404f04974d2922c9d52d6b2d80c91eb2d27d8409"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YNNIWBN7EDVF7G4YNDG3IT4IXH/bundle.json","state_url":"https://pith.science/pith/YNNIWBN7EDVF7G4YNDG3IT4IXH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YNNIWBN7EDVF7G4YNDG3IT4IXH/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-07-04T08:19:43Z","links":{"resolver":"https://pith.science/pith/YNNIWBN7EDVF7G4YNDG3IT4IXH","bundle":"https://pith.science/pith/YNNIWBN7EDVF7G4YNDG3IT4IXH/bundle.json","state":"https://pith.science/pith/YNNIWBN7EDVF7G4YNDG3IT4IXH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YNNIWBN7EDVF7G4YNDG3IT4IXH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YNNIWBN7EDVF7G4YNDG3IT4IXH","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":"b727ca47ee69ee3164e47495b7bae67dc16810af63c94319f16f6cb63cf2c27a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-26T03:23:05Z","title_canon_sha256":"c636909d5ba67cb2099829cc7b50661b50652f857369e575718ae141993b9e73"},"schema_version":"1.0","source":{"id":"1408.5995","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.5995","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"arxiv_version","alias_value":"1408.5995v1","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5995","created_at":"2026-05-18T02:44:15Z"},{"alias_kind":"pith_short_12","alias_value":"YNNIWBN7EDVF","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YNNIWBN7EDVF7G4Y","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YNNIWBN7","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:dc39fa10cb2951bc2337e05f404f04974d2922c9d52d6b2d80c91eb2d27d8409","target":"graph","created_at":"2026-05-18T02:44:15Z","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":"Dynamic Voltage Scaling techniques allow the processor to set its speed dynamically in order to reduce energy consumption. In the continuous model, the processor can run at any speed, while in the discrete model, the processor can only run at finite number of speeds given as input. The current best algorithm for computing the optimal schedules for the continuous model runs at $O(n^2\\log n)$ time for scheduling $n$ jobs. In this paper, we improve the running time to $O(n^2)$ by speeding up the calculation of s-schedules using a more refined data structure. For the discrete model, we improve the","authors_text":"Frances F. Yao, Hao Yuan, Minming Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-26T03:23:05Z","title":"An $O(n^2)$ Algorithm for Computing Optimal Continuous Voltage Schedules"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5995","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:526845a3d0417ecfebdb50883428b7a69bb5528db057402765085dcfe03a1f28","target":"record","created_at":"2026-05-18T02:44:15Z","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":"b727ca47ee69ee3164e47495b7bae67dc16810af63c94319f16f6cb63cf2c27a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-26T03:23:05Z","title_canon_sha256":"c636909d5ba67cb2099829cc7b50661b50652f857369e575718ae141993b9e73"},"schema_version":"1.0","source":{"id":"1408.5995","kind":"arxiv","version":1}},"canonical_sha256":"c35a8b05bf20ea5f9b9868cdb44f88b9e97fdd00c54cc9b3c741414d527511b6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c35a8b05bf20ea5f9b9868cdb44f88b9e97fdd00c54cc9b3c741414d527511b6","first_computed_at":"2026-05-18T02:44:15.248634Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:15.248634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xSNLTglMfsrN5dlDXM9xjgjzS06DbzAnAWEnoPzNGlE+N/xGo/kJo7nvhrJWGRG82lAU9X8L3TG8xIZ8PUb0AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:15.249071Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.5995","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:526845a3d0417ecfebdb50883428b7a69bb5528db057402765085dcfe03a1f28","sha256:dc39fa10cb2951bc2337e05f404f04974d2922c9d52d6b2d80c91eb2d27d8409"],"state_sha256":"58055e0f38902ea1db6877507c6b2349d9ef1345a23e8eec6072f89755774454"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gb3GETAPeOUrDXkGR4fLgNgOlQi2v+n9oRCegQmXdW7kf3gzn5RNJIz2yh5agF/VUlXUo5UV0cDuf2+GZTpHCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T08:19:43.131519Z","bundle_sha256":"99fc7f7713fd113007f735bd8401d03d28ef6843a09eaa6aed5b1c7b9ae75524"}}