{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:H45PSGJMINVDVLNOP326LEURYM","short_pith_number":"pith:H45PSGJM","canonical_record":{"source":{"id":"1206.1264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2012-06-06T16:07:58Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"337bdd4e3861b9eead749424468e39ca4f0aad768858fb28f280c515901c25cb","abstract_canon_sha256":"e1e19e7604e1610877910bb93856c8cd8c07d67a291842c1588fdaf6e6f5ef57"},"schema_version":"1.0"},"canonical_sha256":"3f3af9192c436a3aadae7ef5e59291c300452034fddf9ce7d47535b7ec5d2526","source":{"kind":"arxiv","id":"1206.1264","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.1264","created_at":"2026-05-18T03:54:06Z"},{"alias_kind":"arxiv_version","alias_value":"1206.1264v1","created_at":"2026-05-18T03:54:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1264","created_at":"2026-05-18T03:54:06Z"},{"alias_kind":"pith_short_12","alias_value":"H45PSGJMINVD","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"H45PSGJMINVDVLNO","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"H45PSGJM","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:H45PSGJMINVDVLNOP326LEURYM","target":"record","payload":{"canonical_record":{"source":{"id":"1206.1264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2012-06-06T16:07:58Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"337bdd4e3861b9eead749424468e39ca4f0aad768858fb28f280c515901c25cb","abstract_canon_sha256":"e1e19e7604e1610877910bb93856c8cd8c07d67a291842c1588fdaf6e6f5ef57"},"schema_version":"1.0"},"canonical_sha256":"3f3af9192c436a3aadae7ef5e59291c300452034fddf9ce7d47535b7ec5d2526","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:06.548072Z","signature_b64":"2Qevb7Mt5nygCHRNqKsl2S3Ho22aNQdEcYqkGbqjrJ+13BHbrRkENlCve64fxfcAAQnWzUu+ZGPcJjYqNFDzBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f3af9192c436a3aadae7ef5e59291c300452034fddf9ce7d47535b7ec5d2526","last_reissued_at":"2026-05-18T03:54:06.547414Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:06.547414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.1264","source_version":1,"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:54:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XBZzG/vgSVuttcAMS9jeuqIlk4f5ZAIMbBz0qJQ0h+wpP7Sww/89SxMRkzIKkbQlw//L2M80EWtkBdabvdu0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:08:18.388433Z"},"content_sha256":"7e404f20f29f8d94566f8c9df8690f8105ba5517b79afddd789f20586c740c13","schema_version":"1.0","event_id":"sha256:7e404f20f29f8d94566f8c9df8690f8105ba5517b79afddd789f20586c740c13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:H45PSGJMINVDVLNOP326LEURYM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Heavy Traffic Optimal Resource Allocation Algorithms for Cloud Computing Clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PF","authors_text":"Lei Ying, R Srikant, Siva Theja Maguluri","submitted_at":"2012-06-06T16:07:58Z","abstract_excerpt":"Cloud computing is emerging as an important platform for business, personal and mobile computing applications. In this paper, we study a stochastic model of cloud computing, where jobs arrive according to a stochastic process and request resources like CPU, memory and storage space. We consider a model where the resource allocation problem can be separated into a routing or load balancing problem and a scheduling problem. We study the join-the-shortest-queue routing and power-of-two-choices routing algorithms with MaxWeight scheduling algorithm. It was known that these algorithms are throughpu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1264","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"},"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:54:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w1J59GuyyBz20f8cLRkzEq8zUa2IVDJ1MNREv6acB0I4up19CTTKAuj4dHraQesXlI9qFv6xUt7GuBOqjhqFDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T14:08:18.389026Z"},"content_sha256":"a734dec9d68275b3264eb8ed39acbdcbe9f5d6b19b55700576b32d8fa1c579e6","schema_version":"1.0","event_id":"sha256:a734dec9d68275b3264eb8ed39acbdcbe9f5d6b19b55700576b32d8fa1c579e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H45PSGJMINVDVLNOP326LEURYM/bundle.json","state_url":"https://pith.science/pith/H45PSGJMINVDVLNOP326LEURYM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H45PSGJMINVDVLNOP326LEURYM/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-23T14:08:18Z","links":{"resolver":"https://pith.science/pith/H45PSGJMINVDVLNOP326LEURYM","bundle":"https://pith.science/pith/H45PSGJMINVDVLNOP326LEURYM/bundle.json","state":"https://pith.science/pith/H45PSGJMINVDVLNOP326LEURYM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H45PSGJMINVDVLNOP326LEURYM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:H45PSGJMINVDVLNOP326LEURYM","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":"e1e19e7604e1610877910bb93856c8cd8c07d67a291842c1588fdaf6e6f5ef57","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2012-06-06T16:07:58Z","title_canon_sha256":"337bdd4e3861b9eead749424468e39ca4f0aad768858fb28f280c515901c25cb"},"schema_version":"1.0","source":{"id":"1206.1264","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.1264","created_at":"2026-05-18T03:54:06Z"},{"alias_kind":"arxiv_version","alias_value":"1206.1264v1","created_at":"2026-05-18T03:54:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1264","created_at":"2026-05-18T03:54:06Z"},{"alias_kind":"pith_short_12","alias_value":"H45PSGJMINVD","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"H45PSGJMINVDVLNO","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"H45PSGJM","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:a734dec9d68275b3264eb8ed39acbdcbe9f5d6b19b55700576b32d8fa1c579e6","target":"graph","created_at":"2026-05-18T03:54:06Z","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":"Cloud computing is emerging as an important platform for business, personal and mobile computing applications. In this paper, we study a stochastic model of cloud computing, where jobs arrive according to a stochastic process and request resources like CPU, memory and storage space. We consider a model where the resource allocation problem can be separated into a routing or load balancing problem and a scheduling problem. We study the join-the-shortest-queue routing and power-of-two-choices routing algorithms with MaxWeight scheduling algorithm. It was known that these algorithms are throughpu","authors_text":"Lei Ying, R Srikant, Siva Theja Maguluri","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2012-06-06T16:07:58Z","title":"Heavy Traffic Optimal Resource Allocation Algorithms for Cloud Computing Clusters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1264","kind":"arxiv","version":1},"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:7e404f20f29f8d94566f8c9df8690f8105ba5517b79afddd789f20586c740c13","target":"record","created_at":"2026-05-18T03:54:06Z","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":"e1e19e7604e1610877910bb93856c8cd8c07d67a291842c1588fdaf6e6f5ef57","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2012-06-06T16:07:58Z","title_canon_sha256":"337bdd4e3861b9eead749424468e39ca4f0aad768858fb28f280c515901c25cb"},"schema_version":"1.0","source":{"id":"1206.1264","kind":"arxiv","version":1}},"canonical_sha256":"3f3af9192c436a3aadae7ef5e59291c300452034fddf9ce7d47535b7ec5d2526","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f3af9192c436a3aadae7ef5e59291c300452034fddf9ce7d47535b7ec5d2526","first_computed_at":"2026-05-18T03:54:06.547414Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:54:06.547414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2Qevb7Mt5nygCHRNqKsl2S3Ho22aNQdEcYqkGbqjrJ+13BHbrRkENlCve64fxfcAAQnWzUu+ZGPcJjYqNFDzBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:54:06.548072Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.1264","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7e404f20f29f8d94566f8c9df8690f8105ba5517b79afddd789f20586c740c13","sha256:a734dec9d68275b3264eb8ed39acbdcbe9f5d6b19b55700576b32d8fa1c579e6"],"state_sha256":"1dbd264bf66f5bef09508cccecae808ba0c9023c730b869fd7a2c56b4d10439a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NvNtWcMHyYVA08JnvRGNpJN/hdGhISPV4kOWET1OjVq4Wi3iWUef8vcbIBlMrk9LxTCJ308jDQrkaheu5stMBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T14:08:18.391842Z","bundle_sha256":"12a22c9d1699a095eb50cc972b3b1a34f1679187caf7b9d2dc655b8fcd7de18d"}}