{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:UDBY4VSMVOO25N6TAUJL7V4V2K","short_pith_number":"pith:UDBY4VSM","schema_version":"1.0","canonical_sha256":"a0c38e564cab9daeb7d30512bfd795d2a795571cc53bbfca52fb01e6a433f613","source":{"kind":"arxiv","id":"1302.4414","version":2},"attestation_state":"computed","paper":{"title":"Approximation Algorithms for Energy Minimization in Cloud Service Allocation under Reliability Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"INRIA Bordeaux - Sud-Ouest), Olivier Beaumont (LaBRI, Paul Renaud-Goud (LaBRI), Philippe Duchon (LaBRI","submitted_at":"2013-02-18T20:33:15Z","abstract_excerpt":"We consider allocation problems that arise in the context of service allocation in Clouds. More specifically, we assume on the one part that each computing resource is associated to a capacity constraint, that can be chosen using Dynamic Voltage and Frequency Scaling (DVFS) method, and to a probability of failure. On the other hand, we assume that the service runs as a set of independent instances of identical Virtual Machines. Moreover, there exists a Service Level Agreement (SLA) between the Cloud provider and the client that can be expressed as follows: the client comes with a minimal numbe"},"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":"1302.4414","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-02-18T20:33:15Z","cross_cats_sorted":[],"title_canon_sha256":"a940cb8c890fb8f0a2f6bef02f810b5427694c7cbd0f2d2187dc4064eccf9725","abstract_canon_sha256":"4da005dceb3ff66e633460c3b7a9105e4dd4850a38d34bed680eb9a1812b2cff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:47.851441Z","signature_b64":"QG2JJKVYiv0n1B6Th4gGOFyEgGB9czPw53O+KkyK3fYz29Wgo/8ATXBKLcmy1z9ivHfmR6fBAmXdw6Mm+jy5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0c38e564cab9daeb7d30512bfd795d2a795571cc53bbfca52fb01e6a433f613","last_reissued_at":"2026-05-18T03:10:47.850526Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:47.850526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Energy Minimization in Cloud Service Allocation under Reliability Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"INRIA Bordeaux - Sud-Ouest), Olivier Beaumont (LaBRI, Paul Renaud-Goud (LaBRI), Philippe Duchon (LaBRI","submitted_at":"2013-02-18T20:33:15Z","abstract_excerpt":"We consider allocation problems that arise in the context of service allocation in Clouds. More specifically, we assume on the one part that each computing resource is associated to a capacity constraint, that can be chosen using Dynamic Voltage and Frequency Scaling (DVFS) method, and to a probability of failure. On the other hand, we assume that the service runs as a set of independent instances of identical Virtual Machines. Moreover, there exists a Service Level Agreement (SLA) between the Cloud provider and the client that can be expressed as follows: the client comes with a minimal numbe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4414","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":"1302.4414","created_at":"2026-05-18T03:10:47.850682+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.4414v2","created_at":"2026-05-18T03:10:47.850682+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4414","created_at":"2026-05-18T03:10:47.850682+00:00"},{"alias_kind":"pith_short_12","alias_value":"UDBY4VSMVOO2","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"UDBY4VSMVOO25N6T","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"UDBY4VSM","created_at":"2026-05-18T12:28:02.375192+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/UDBY4VSMVOO25N6TAUJL7V4V2K","json":"https://pith.science/pith/UDBY4VSMVOO25N6TAUJL7V4V2K.json","graph_json":"https://pith.science/api/pith-number/UDBY4VSMVOO25N6TAUJL7V4V2K/graph.json","events_json":"https://pith.science/api/pith-number/UDBY4VSMVOO25N6TAUJL7V4V2K/events.json","paper":"https://pith.science/paper/UDBY4VSM"},"agent_actions":{"view_html":"https://pith.science/pith/UDBY4VSMVOO25N6TAUJL7V4V2K","download_json":"https://pith.science/pith/UDBY4VSMVOO25N6TAUJL7V4V2K.json","view_paper":"https://pith.science/paper/UDBY4VSM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.4414&json=true","fetch_graph":"https://pith.science/api/pith-number/UDBY4VSMVOO25N6TAUJL7V4V2K/graph.json","fetch_events":"https://pith.science/api/pith-number/UDBY4VSMVOO25N6TAUJL7V4V2K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UDBY4VSMVOO25N6TAUJL7V4V2K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UDBY4VSMVOO25N6TAUJL7V4V2K/action/storage_attestation","attest_author":"https://pith.science/pith/UDBY4VSMVOO25N6TAUJL7V4V2K/action/author_attestation","sign_citation":"https://pith.science/pith/UDBY4VSMVOO25N6TAUJL7V4V2K/action/citation_signature","submit_replication":"https://pith.science/pith/UDBY4VSMVOO25N6TAUJL7V4V2K/action/replication_record"}},"created_at":"2026-05-18T03:10:47.850682+00:00","updated_at":"2026-05-18T03:10:47.850682+00:00"}