{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RKTQOS6TN3FYFXEQFJIL4I4BHO","short_pith_number":"pith:RKTQOS6T","schema_version":"1.0","canonical_sha256":"8aa7074bd36ecb82dc902a50be23813bb56a28c21ff84ab11948c28696ac3b8e","source":{"kind":"arxiv","id":"1310.5255","version":1},"attestation_state":"computed","paper":{"title":"Efficient and Robust Allocation Algorithms in Clouds under Memory Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"LaBRI), Lionel Eyraud-Dubois (INRIA Bordeaux - Sud-Ouest, Olivier Beaumont (INRIA Bordeaux - Sud-Ouest, Paul Renaud-Goud (INRIA Bordeaux - Sud-Ouest","submitted_at":"2013-10-19T17:32:17Z","abstract_excerpt":"We consider robust resource allocation of services in Clouds. More specifically, we consider the case of a large public or private Cloud platform that runs a relatively small set of large and independent services. These services are characterized by their demand along several dimensions (CPU, memory,...) and by their quality of service requirements, that have been defined through an SLA in the case of a public Cloud or fixed by the administrator in the case of a private Cloud. This quality of service defines the required robustness of the service, by setting an upper limit on the probability 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":"1310.5255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-10-19T17:32:17Z","cross_cats_sorted":[],"title_canon_sha256":"a3ec437c3b221ccc94f969c162a654bfffbaa2557b8f670aa349c7ec27bf0641","abstract_canon_sha256":"0f104fb19e391efaa8304f1e3925372606084bf7bf1f68cf4b1c4c41c6a87e5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:46.346473Z","signature_b64":"N8/+duaDNLdHiw6eztYW+h7zabrewft6MU8XS4IIl8dFVnBluDLIHaWxl9w9f0Tc0gVzG90aCGen1ZjHhc/ZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8aa7074bd36ecb82dc902a50be23813bb56a28c21ff84ab11948c28696ac3b8e","last_reissued_at":"2026-05-18T03:09:46.345506Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:46.345506Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient and Robust Allocation Algorithms in Clouds under Memory Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"LaBRI), Lionel Eyraud-Dubois (INRIA Bordeaux - Sud-Ouest, Olivier Beaumont (INRIA Bordeaux - Sud-Ouest, Paul Renaud-Goud (INRIA Bordeaux - Sud-Ouest","submitted_at":"2013-10-19T17:32:17Z","abstract_excerpt":"We consider robust resource allocation of services in Clouds. More specifically, we consider the case of a large public or private Cloud platform that runs a relatively small set of large and independent services. These services are characterized by their demand along several dimensions (CPU, memory,...) and by their quality of service requirements, that have been defined through an SLA in the case of a public Cloud or fixed by the administrator in the case of a private Cloud. This quality of service defines the required robustness of the service, by setting an upper limit on the probability t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5255","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":"1310.5255","created_at":"2026-05-18T03:09:46.345693+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.5255v1","created_at":"2026-05-18T03:09:46.345693+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5255","created_at":"2026-05-18T03:09:46.345693+00:00"},{"alias_kind":"pith_short_12","alias_value":"RKTQOS6TN3FY","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"RKTQOS6TN3FYFXEQ","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"RKTQOS6T","created_at":"2026-05-18T12:27:57.521954+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/RKTQOS6TN3FYFXEQFJIL4I4BHO","json":"https://pith.science/pith/RKTQOS6TN3FYFXEQFJIL4I4BHO.json","graph_json":"https://pith.science/api/pith-number/RKTQOS6TN3FYFXEQFJIL4I4BHO/graph.json","events_json":"https://pith.science/api/pith-number/RKTQOS6TN3FYFXEQFJIL4I4BHO/events.json","paper":"https://pith.science/paper/RKTQOS6T"},"agent_actions":{"view_html":"https://pith.science/pith/RKTQOS6TN3FYFXEQFJIL4I4BHO","download_json":"https://pith.science/pith/RKTQOS6TN3FYFXEQFJIL4I4BHO.json","view_paper":"https://pith.science/paper/RKTQOS6T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.5255&json=true","fetch_graph":"https://pith.science/api/pith-number/RKTQOS6TN3FYFXEQFJIL4I4BHO/graph.json","fetch_events":"https://pith.science/api/pith-number/RKTQOS6TN3FYFXEQFJIL4I4BHO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RKTQOS6TN3FYFXEQFJIL4I4BHO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RKTQOS6TN3FYFXEQFJIL4I4BHO/action/storage_attestation","attest_author":"https://pith.science/pith/RKTQOS6TN3FYFXEQFJIL4I4BHO/action/author_attestation","sign_citation":"https://pith.science/pith/RKTQOS6TN3FYFXEQFJIL4I4BHO/action/citation_signature","submit_replication":"https://pith.science/pith/RKTQOS6TN3FYFXEQFJIL4I4BHO/action/replication_record"}},"created_at":"2026-05-18T03:09:46.345693+00:00","updated_at":"2026-05-18T03:09:46.345693+00:00"}