{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:V5PPUOJYOWXKHKILIVWI6UPFG2","short_pith_number":"pith:V5PPUOJY","schema_version":"1.0","canonical_sha256":"af5efa393875aea3a90b456c8f51e536ac97e26753e130be0542e673ccadffab","source":{"kind":"arxiv","id":"0908.3505","version":2},"attestation_state":"computed","paper":{"title":"Polynomial Time Algorithms for Minimum Energy Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christoph Durr, Marek Chrobak, Philippe Baptiste","submitted_at":"2009-08-24T21:44:45Z","abstract_excerpt":"The aim of power management policies is to reduce the amount of energy consumed by computer systems while maintaining satisfactory level of performance. One common method for saving energy is to simply suspend the system during the idle times. No energy is consumed in the suspend mode. However, the process of waking up the system itself requires a certain fixed amount of energy, and thus suspending the system is beneficial only if the idle time is long enough to compensate for this additional energy expenditure. In the specific problem studied in the paper, we have a set of jobs with release t"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"0908.3505","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-08-24T21:44:45Z","cross_cats_sorted":[],"title_canon_sha256":"28c53e73b829ef093f8a31c1103536d0d31c33b2bce2c28ee1b78448dcfe6a94","abstract_canon_sha256":"42d1ab20f2acf05971c028fe43c533b65e5927c491fe3266cbc5c55371a2ff4e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:26.223670Z","signature_b64":"ymsLSXoVhyzK4Op8L7/isHqoKhf3KOzqjN64hnD6Y0H5DwnCHtWiMXPU1eXAZZNEVwMjMGArsGuILK/7clIyDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af5efa393875aea3a90b456c8f51e536ac97e26753e130be0542e673ccadffab","last_reissued_at":"2026-05-18T04:41:26.222986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:26.222986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial Time Algorithms for Minimum Energy Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christoph Durr, Marek Chrobak, Philippe Baptiste","submitted_at":"2009-08-24T21:44:45Z","abstract_excerpt":"The aim of power management policies is to reduce the amount of energy consumed by computer systems while maintaining satisfactory level of performance. One common method for saving energy is to simply suspend the system during the idle times. No energy is consumed in the suspend mode. However, the process of waking up the system itself requires a certain fixed amount of energy, and thus suspending the system is beneficial only if the idle time is long enough to compensate for this additional energy expenditure. In the specific problem studied in the paper, we have a set of jobs with release t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0908.3505","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0908.3505","created_at":"2026-05-18T04:41:26.223097+00:00"},{"alias_kind":"arxiv_version","alias_value":"0908.3505v2","created_at":"2026-05-18T04:41:26.223097+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0908.3505","created_at":"2026-05-18T04:41:26.223097+00:00"},{"alias_kind":"pith_short_12","alias_value":"V5PPUOJYOWXK","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"V5PPUOJYOWXKHKIL","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"V5PPUOJY","created_at":"2026-05-18T12:26:02.257875+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/V5PPUOJYOWXKHKILIVWI6UPFG2","json":"https://pith.science/pith/V5PPUOJYOWXKHKILIVWI6UPFG2.json","graph_json":"https://pith.science/api/pith-number/V5PPUOJYOWXKHKILIVWI6UPFG2/graph.json","events_json":"https://pith.science/api/pith-number/V5PPUOJYOWXKHKILIVWI6UPFG2/events.json","paper":"https://pith.science/paper/V5PPUOJY"},"agent_actions":{"view_html":"https://pith.science/pith/V5PPUOJYOWXKHKILIVWI6UPFG2","download_json":"https://pith.science/pith/V5PPUOJYOWXKHKILIVWI6UPFG2.json","view_paper":"https://pith.science/paper/V5PPUOJY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0908.3505&json=true","fetch_graph":"https://pith.science/api/pith-number/V5PPUOJYOWXKHKILIVWI6UPFG2/graph.json","fetch_events":"https://pith.science/api/pith-number/V5PPUOJYOWXKHKILIVWI6UPFG2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V5PPUOJYOWXKHKILIVWI6UPFG2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V5PPUOJYOWXKHKILIVWI6UPFG2/action/storage_attestation","attest_author":"https://pith.science/pith/V5PPUOJYOWXKHKILIVWI6UPFG2/action/author_attestation","sign_citation":"https://pith.science/pith/V5PPUOJYOWXKHKILIVWI6UPFG2/action/citation_signature","submit_replication":"https://pith.science/pith/V5PPUOJYOWXKHKILIVWI6UPFG2/action/replication_record"}},"created_at":"2026-05-18T04:41:26.223097+00:00","updated_at":"2026-05-18T04:41:26.223097+00:00"}