{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:Z2QTJGBJKKATISXZ5FUFW7AXZK","short_pith_number":"pith:Z2QTJGBJ","canonical_record":{"source":{"id":"1403.5012","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-03-20T00:48:42Z","cross_cats_sorted":[],"title_canon_sha256":"1118fb33d8d4618ac36d092e579b81457da0374231367eb65fb060f9f85c2c8b","abstract_canon_sha256":"51f0c95790ae4c5e0d626b6f5d401d8e5a0ba7c50222bef1ba66d89290a59fd6"},"schema_version":"1.0"},"canonical_sha256":"cea13498295281344af9e9685b7c17caadde6fd31e0f7f4c2b5fb1af1cb49fe4","source":{"kind":"arxiv","id":"1403.5012","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.5012","created_at":"2026-05-18T02:53:55Z"},{"alias_kind":"arxiv_version","alias_value":"1403.5012v2","created_at":"2026-05-18T02:53:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5012","created_at":"2026-05-18T02:53:55Z"},{"alias_kind":"pith_short_12","alias_value":"Z2QTJGBJKKAT","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z2QTJGBJKKATISXZ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z2QTJGBJ","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:Z2QTJGBJKKATISXZ5FUFW7AXZK","target":"record","payload":{"canonical_record":{"source":{"id":"1403.5012","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-03-20T00:48:42Z","cross_cats_sorted":[],"title_canon_sha256":"1118fb33d8d4618ac36d092e579b81457da0374231367eb65fb060f9f85c2c8b","abstract_canon_sha256":"51f0c95790ae4c5e0d626b6f5d401d8e5a0ba7c50222bef1ba66d89290a59fd6"},"schema_version":"1.0"},"canonical_sha256":"cea13498295281344af9e9685b7c17caadde6fd31e0f7f4c2b5fb1af1cb49fe4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:55.754998Z","signature_b64":"bY3n/QSuViUETX0DnxUfsJgEUstPHJbsSI4Z0aKlrNdkP7Z+MwqnyzBY6ag1HK9zirBjCn7iq6yZwUDdQvdtAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cea13498295281344af9e9685b7c17caadde6fd31e0f7f4c2b5fb1af1cb49fe4","last_reissued_at":"2026-05-18T02:53:55.754104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:55.754104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.5012","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-18T02:53:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GPuZBbKDQjl4pLy1UOp+c0q+8rmtA9+XlEG5PhTwWU4tUpiUsPywrqFR5FKbkVyP96l3MHOvoKzpNlBMFttECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:55:15.989679Z"},"content_sha256":"f3b3ad78d524f77360047d3ff02a7bb16e326d0243fff95b592716f178886733","schema_version":"1.0","event_id":"sha256:f3b3ad78d524f77360047d3ff02a7bb16e326d0243fff95b592716f178886733"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:Z2QTJGBJKKATISXZ5FUFW7AXZK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Non-Cooperative Game Model for Reliability-Based Task Scheduling in Cloud Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Kai Li, Meilin Liu, Yong Wang","submitted_at":"2014-03-20T00:48:42Z","abstract_excerpt":"Cloud computing is a newly emerging distributed system which is evolved from Grid computing. Task scheduling is the core research of cloud computing which studies how to allocate the tasks among the physical nodes, so that the tasks can get a balanced allocation or each task's execution cost decreases to the minimum, or the overall system performance is optimal. Unlike task scheduling based on time or cost before, aiming at the special reliability requirements in cloud computing, we propose a non-cooperative game model for reliability-based task scheduling approach. This model takes the steady"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5012","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-18T02:53:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/FIh2J06kQjeOSPhfh8CivZ9A/iK6XD/Ly26kgrNJqj7fQWAQTkM/VZ1E7w4jTEre7DDJJCzHCHrSml1vM4RAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:55:15.990024Z"},"content_sha256":"b60b002cfdaa4b34e79d190d0b199072c70f66340545440b74e0f0242171c9fe","schema_version":"1.0","event_id":"sha256:b60b002cfdaa4b34e79d190d0b199072c70f66340545440b74e0f0242171c9fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z2QTJGBJKKATISXZ5FUFW7AXZK/bundle.json","state_url":"https://pith.science/pith/Z2QTJGBJKKATISXZ5FUFW7AXZK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z2QTJGBJKKATISXZ5FUFW7AXZK/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-02T19:55:15Z","links":{"resolver":"https://pith.science/pith/Z2QTJGBJKKATISXZ5FUFW7AXZK","bundle":"https://pith.science/pith/Z2QTJGBJKKATISXZ5FUFW7AXZK/bundle.json","state":"https://pith.science/pith/Z2QTJGBJKKATISXZ5FUFW7AXZK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z2QTJGBJKKATISXZ5FUFW7AXZK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:Z2QTJGBJKKATISXZ5FUFW7AXZK","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":"51f0c95790ae4c5e0d626b6f5d401d8e5a0ba7c50222bef1ba66d89290a59fd6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-03-20T00:48:42Z","title_canon_sha256":"1118fb33d8d4618ac36d092e579b81457da0374231367eb65fb060f9f85c2c8b"},"schema_version":"1.0","source":{"id":"1403.5012","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.5012","created_at":"2026-05-18T02:53:55Z"},{"alias_kind":"arxiv_version","alias_value":"1403.5012v2","created_at":"2026-05-18T02:53:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5012","created_at":"2026-05-18T02:53:55Z"},{"alias_kind":"pith_short_12","alias_value":"Z2QTJGBJKKAT","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z2QTJGBJKKATISXZ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z2QTJGBJ","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:b60b002cfdaa4b34e79d190d0b199072c70f66340545440b74e0f0242171c9fe","target":"graph","created_at":"2026-05-18T02:53:55Z","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 a newly emerging distributed system which is evolved from Grid computing. Task scheduling is the core research of cloud computing which studies how to allocate the tasks among the physical nodes, so that the tasks can get a balanced allocation or each task's execution cost decreases to the minimum, or the overall system performance is optimal. Unlike task scheduling based on time or cost before, aiming at the special reliability requirements in cloud computing, we propose a non-cooperative game model for reliability-based task scheduling approach. This model takes the steady","authors_text":"Kai Li, Meilin Liu, Yong Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-03-20T00:48:42Z","title":"A Non-Cooperative Game Model for Reliability-Based Task Scheduling in Cloud Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5012","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:f3b3ad78d524f77360047d3ff02a7bb16e326d0243fff95b592716f178886733","target":"record","created_at":"2026-05-18T02:53:55Z","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":"51f0c95790ae4c5e0d626b6f5d401d8e5a0ba7c50222bef1ba66d89290a59fd6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-03-20T00:48:42Z","title_canon_sha256":"1118fb33d8d4618ac36d092e579b81457da0374231367eb65fb060f9f85c2c8b"},"schema_version":"1.0","source":{"id":"1403.5012","kind":"arxiv","version":2}},"canonical_sha256":"cea13498295281344af9e9685b7c17caadde6fd31e0f7f4c2b5fb1af1cb49fe4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cea13498295281344af9e9685b7c17caadde6fd31e0f7f4c2b5fb1af1cb49fe4","first_computed_at":"2026-05-18T02:53:55.754104Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:55.754104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bY3n/QSuViUETX0DnxUfsJgEUstPHJbsSI4Z0aKlrNdkP7Z+MwqnyzBY6ag1HK9zirBjCn7iq6yZwUDdQvdtAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:55.754998Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.5012","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3b3ad78d524f77360047d3ff02a7bb16e326d0243fff95b592716f178886733","sha256:b60b002cfdaa4b34e79d190d0b199072c70f66340545440b74e0f0242171c9fe"],"state_sha256":"13544dcaf19ac9843f484a67997dc9a4b8fb1a161ef7eb4daf14d727b9aaa2c9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x/dBabZQc6Jl9U5Klpkey/vzrP+WQcG3JyjVJDor8GG+Vq0l6bftuhCgL/keCF13EWcfInGkOCIsyDFHs8dYDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:55:15.991947Z","bundle_sha256":"fbe01a91e942daeac2bb3a052ce62b5b3083cb190ce9a0b357ee03fdd17fd02a"}}