{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:UDBY4VSMVOO25N6TAUJL7V4V2K","short_pith_number":"pith:UDBY4VSM","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"},"canonical_sha256":"a0c38e564cab9daeb7d30512bfd795d2a795571cc53bbfca52fb01e6a433f613","source":{"kind":"arxiv","id":"1302.4414","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4414","created_at":"2026-05-18T03:10:47Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4414v2","created_at":"2026-05-18T03:10:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4414","created_at":"2026-05-18T03:10:47Z"},{"alias_kind":"pith_short_12","alias_value":"UDBY4VSMVOO2","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UDBY4VSMVOO25N6T","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UDBY4VSM","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:UDBY4VSMVOO25N6TAUJL7V4V2K","target":"record","payload":{"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"},"canonical_sha256":"a0c38e564cab9daeb7d30512bfd795d2a795571cc53bbfca52fb01e6a433f613","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"},"source_kind":"arxiv","source_id":"1302.4414","source_version":2,"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-18T03:10:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9eKgZBP2vu3J3fDSq2DxbghOY0InYANryCuSPBtONTSMCloy2OvIIpGfyRoONqkXKyKiMgKAu7KIrKmA/pAtCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:58:38.319240Z"},"content_sha256":"dd639bda4a388cf6fef22e605fa44a11fe31165c64934fc5810f6681d8b3e9a3","schema_version":"1.0","event_id":"sha256:dd639bda4a388cf6fef22e605fa44a11fe31165c64934fc5810f6681d8b3e9a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:UDBY4VSMVOO25N6TAUJL7V4V2K","target":"graph","payload":{"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"},"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-18T03:10:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"di/cneLSofQ5BBiQ/S16PdswGvO9juqBWhRyZfqQf6BZaxJ7lZYu0ONxT35NHhD/NYkzjwRVDPsK+dEsUX33Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T04:58:38.319762Z"},"content_sha256":"7bc05b503b706784c21192ed00592404bc4c9208d57e76d1f59ec33b399fdebf","schema_version":"1.0","event_id":"sha256:7bc05b503b706784c21192ed00592404bc4c9208d57e76d1f59ec33b399fdebf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UDBY4VSMVOO25N6TAUJL7V4V2K/bundle.json","state_url":"https://pith.science/pith/UDBY4VSMVOO25N6TAUJL7V4V2K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UDBY4VSMVOO25N6TAUJL7V4V2K/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-06-24T04:58:38Z","links":{"resolver":"https://pith.science/pith/UDBY4VSMVOO25N6TAUJL7V4V2K","bundle":"https://pith.science/pith/UDBY4VSMVOO25N6TAUJL7V4V2K/bundle.json","state":"https://pith.science/pith/UDBY4VSMVOO25N6TAUJL7V4V2K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UDBY4VSMVOO25N6TAUJL7V4V2K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:UDBY4VSMVOO25N6TAUJL7V4V2K","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":"4da005dceb3ff66e633460c3b7a9105e4dd4850a38d34bed680eb9a1812b2cff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-02-18T20:33:15Z","title_canon_sha256":"a940cb8c890fb8f0a2f6bef02f810b5427694c7cbd0f2d2187dc4064eccf9725"},"schema_version":"1.0","source":{"id":"1302.4414","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4414","created_at":"2026-05-18T03:10:47Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4414v2","created_at":"2026-05-18T03:10:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4414","created_at":"2026-05-18T03:10:47Z"},{"alias_kind":"pith_short_12","alias_value":"UDBY4VSMVOO2","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"UDBY4VSMVOO25N6T","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"UDBY4VSM","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:7bc05b503b706784c21192ed00592404bc4c9208d57e76d1f59ec33b399fdebf","target":"graph","created_at":"2026-05-18T03:10:47Z","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":"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","authors_text":"INRIA Bordeaux - Sud-Ouest), Olivier Beaumont (LaBRI, Paul Renaud-Goud (LaBRI), Philippe Duchon (LaBRI","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-02-18T20:33:15Z","title":"Approximation Algorithms for Energy Minimization in Cloud Service Allocation under Reliability Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4414","kind":"arxiv","version":2},"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:dd639bda4a388cf6fef22e605fa44a11fe31165c64934fc5810f6681d8b3e9a3","target":"record","created_at":"2026-05-18T03:10:47Z","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":"4da005dceb3ff66e633460c3b7a9105e4dd4850a38d34bed680eb9a1812b2cff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-02-18T20:33:15Z","title_canon_sha256":"a940cb8c890fb8f0a2f6bef02f810b5427694c7cbd0f2d2187dc4064eccf9725"},"schema_version":"1.0","source":{"id":"1302.4414","kind":"arxiv","version":2}},"canonical_sha256":"a0c38e564cab9daeb7d30512bfd795d2a795571cc53bbfca52fb01e6a433f613","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0c38e564cab9daeb7d30512bfd795d2a795571cc53bbfca52fb01e6a433f613","first_computed_at":"2026-05-18T03:10:47.850526Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:47.850526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QG2JJKVYiv0n1B6Th4gGOFyEgGB9czPw53O+KkyK3fYz29Wgo/8ATXBKLcmy1z9ivHfmR6fBAmXdw6Mm+jy5Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:47.851441Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.4414","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd639bda4a388cf6fef22e605fa44a11fe31165c64934fc5810f6681d8b3e9a3","sha256:7bc05b503b706784c21192ed00592404bc4c9208d57e76d1f59ec33b399fdebf"],"state_sha256":"b3f4bf0e06fd80bedda03b13eb672ed75ac991488a7303d3a9a995e03e50ad93"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qjGf/pXl10MS/SplZ2guxHtrhIS8o8qRLV0/FWdhj0pZsSsYrqUvDBWUpLfvl7js7I8ihXyto4WxLai1z7I+Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T04:58:38.321780Z","bundle_sha256":"b0bfce976a489ea5ae3f709785a22a15aa457f3b452ffc5b93bce295bfab7439"}}