{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:R2WHJJVJHGUD3AM6UIRLXEQBQH","short_pith_number":"pith:R2WHJJVJ","schema_version":"1.0","canonical_sha256":"8eac74a6a939a83d819ea222bb920181e8eff681c611d042a815114a40389916","source":{"kind":"arxiv","id":"1808.07905","version":1},"attestation_state":"computed","paper":{"title":"Optimal Energy-Efficient Policies for Data Centers through Sensitivity-Based Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Jing-Yu Ma, Li Xia, Quan-Lin Li","submitted_at":"2018-08-23T18:57:12Z","abstract_excerpt":"In this paper, we propose a novel dynamic decision method by applying the sensitivity-based optimization theory to find the optimal energy-efficient policy of a data center with two groups of heterogeneous servers. Servers in Group 1 always work at high energy consumption, while servers in Group 2 may either work at high energy consumption or sleep at low energy consumption. An energy-efficient control policy determines the switch between work and sleep states of servers in Group 2 in a dynamic way. Since servers in Group 1 are always working with high priority to jobs, a transfer rule is prop"},"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":"1808.07905","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-08-23T18:57:12Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"74510308be51dc9f98ac61031cdc9056e5f7e38d6df3f944eb9a30fbdfd5ea04","abstract_canon_sha256":"2b5d417abb9a60c1a6d70f6184527a807184174110aa26616a9cb22b8256f49f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:23.043451Z","signature_b64":"MHlEibE4kJKyYKLNapdBbdYcCCy34p5dvVHC4pVlwwK6e5wbBDlEn7JQGUN/6BJNvnYCUch56qqUavxfqcTtCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8eac74a6a939a83d819ea222bb920181e8eff681c611d042a815114a40389916","last_reissued_at":"2026-05-18T00:07:23.042974Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:23.042974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Energy-Efficient Policies for Data Centers through Sensitivity-Based Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"math.OC","authors_text":"Jing-Yu Ma, Li Xia, Quan-Lin Li","submitted_at":"2018-08-23T18:57:12Z","abstract_excerpt":"In this paper, we propose a novel dynamic decision method by applying the sensitivity-based optimization theory to find the optimal energy-efficient policy of a data center with two groups of heterogeneous servers. Servers in Group 1 always work at high energy consumption, while servers in Group 2 may either work at high energy consumption or sleep at low energy consumption. An energy-efficient control policy determines the switch between work and sleep states of servers in Group 2 in a dynamic way. Since servers in Group 1 are always working with high priority to jobs, a transfer rule is prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.07905","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1808.07905","created_at":"2026-05-18T00:07:23.043067+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.07905v1","created_at":"2026-05-18T00:07:23.043067+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07905","created_at":"2026-05-18T00:07:23.043067+00:00"},{"alias_kind":"pith_short_12","alias_value":"R2WHJJVJHGUD","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"R2WHJJVJHGUD3AM6","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"R2WHJJVJ","created_at":"2026-05-18T12:32:50.500415+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/R2WHJJVJHGUD3AM6UIRLXEQBQH","json":"https://pith.science/pith/R2WHJJVJHGUD3AM6UIRLXEQBQH.json","graph_json":"https://pith.science/api/pith-number/R2WHJJVJHGUD3AM6UIRLXEQBQH/graph.json","events_json":"https://pith.science/api/pith-number/R2WHJJVJHGUD3AM6UIRLXEQBQH/events.json","paper":"https://pith.science/paper/R2WHJJVJ"},"agent_actions":{"view_html":"https://pith.science/pith/R2WHJJVJHGUD3AM6UIRLXEQBQH","download_json":"https://pith.science/pith/R2WHJJVJHGUD3AM6UIRLXEQBQH.json","view_paper":"https://pith.science/paper/R2WHJJVJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.07905&json=true","fetch_graph":"https://pith.science/api/pith-number/R2WHJJVJHGUD3AM6UIRLXEQBQH/graph.json","fetch_events":"https://pith.science/api/pith-number/R2WHJJVJHGUD3AM6UIRLXEQBQH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R2WHJJVJHGUD3AM6UIRLXEQBQH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R2WHJJVJHGUD3AM6UIRLXEQBQH/action/storage_attestation","attest_author":"https://pith.science/pith/R2WHJJVJHGUD3AM6UIRLXEQBQH/action/author_attestation","sign_citation":"https://pith.science/pith/R2WHJJVJHGUD3AM6UIRLXEQBQH/action/citation_signature","submit_replication":"https://pith.science/pith/R2WHJJVJHGUD3AM6UIRLXEQBQH/action/replication_record"}},"created_at":"2026-05-18T00:07:23.043067+00:00","updated_at":"2026-05-18T00:07:23.043067+00:00"}