{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:44YAHDK3JST3SOCGV7VAO4SMB7","short_pith_number":"pith:44YAHDK3","canonical_record":{"source":{"id":"1807.05506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-07-15T08:00:52Z","cross_cats_sorted":[],"title_canon_sha256":"733fa6b3a2991b0b5fea5b3fcb192162ba0857e003b83c9a2b0dc02c919d2369","abstract_canon_sha256":"d86bbfd6cd17f7b0e0b4f70877b6f03fdf73405cfb3b662677f5eb28192f5417"},"schema_version":"1.0"},"canonical_sha256":"e730038d5b4ca7b93846afea07724c0fc59a14e1e9180b072f640ba66c4a3405","source":{"kind":"arxiv","id":"1807.05506","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.05506","created_at":"2026-05-18T00:10:43Z"},{"alias_kind":"arxiv_version","alias_value":"1807.05506v1","created_at":"2026-05-18T00:10:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05506","created_at":"2026-05-18T00:10:43Z"},{"alias_kind":"pith_short_12","alias_value":"44YAHDK3JST3","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"44YAHDK3JST3SOCG","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"44YAHDK3","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:44YAHDK3JST3SOCGV7VAO4SMB7","target":"record","payload":{"canonical_record":{"source":{"id":"1807.05506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-07-15T08:00:52Z","cross_cats_sorted":[],"title_canon_sha256":"733fa6b3a2991b0b5fea5b3fcb192162ba0857e003b83c9a2b0dc02c919d2369","abstract_canon_sha256":"d86bbfd6cd17f7b0e0b4f70877b6f03fdf73405cfb3b662677f5eb28192f5417"},"schema_version":"1.0"},"canonical_sha256":"e730038d5b4ca7b93846afea07724c0fc59a14e1e9180b072f640ba66c4a3405","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:43.392767Z","signature_b64":"HQWFVc6/AgeYcvDEnfE2W+S9SctCbaVm6ZVbhfjtNigXUeaGXk6Vrae61UNiGcTC0+MBswn25cRN3TedLfv2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e730038d5b4ca7b93846afea07724c0fc59a14e1e9180b072f640ba66c4a3405","last_reissued_at":"2026-05-18T00:10:43.392262Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:43.392262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.05506","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-18T00:10:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GhsWUB7iaZDaQFxm+E68WcOfx8GlEZnPR99dWS6VPHfBGOHu/OJOJ9gHrZ/a7i8p9CL2jYQEc6qMAPg7aUXqDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:42:40.737295Z"},"content_sha256":"0a877c31e4ec1bc21365b7bf207d6392c4be19270ad184d5e556e53e6c1403ab","schema_version":"1.0","event_id":"sha256:0a877c31e4ec1bc21365b7bf207d6392c4be19270ad184d5e556e53e6c1403ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:44YAHDK3JST3SOCGV7VAO4SMB7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-objective Non-cooperative Game Model for Cost-based Task Scheduling in Computational Grid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Xingtian Ren, Yifan Gao, Yong Wang, Ziyan Gao","submitted_at":"2018-07-15T08:00:52Z","abstract_excerpt":"Task scheduling is an important and complex problem in computational grid. A computational grid often covers a range of different kinds of nodes, which offers a complex environment. There is a need to develop algorithms that can capture this complexity as while as can be easily implemented and used to solve a wide range of load-balancing scenarios. In this paper, we propose a game theory based algorithm to the grid load balancing problem on the principle of minimizing the cost of the grid. The grid load-balancing problem is treated as a non-cooperative game. The experiment results demonstrate "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05506","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-18T00:10:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"npszxJhNvkkXDdGVWFOEWTJvzrte+xPl43h1xEVHd5djPaXKjcF9vFriHKlQUDY8KNq4b3AbA+aGs1sTWklxBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T06:42:40.738008Z"},"content_sha256":"6c90a8ff67474b4b4fc8d38c624977753ab53e4258ccd246e43b6fbb37d91b74","schema_version":"1.0","event_id":"sha256:6c90a8ff67474b4b4fc8d38c624977753ab53e4258ccd246e43b6fbb37d91b74"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/44YAHDK3JST3SOCGV7VAO4SMB7/bundle.json","state_url":"https://pith.science/pith/44YAHDK3JST3SOCGV7VAO4SMB7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/44YAHDK3JST3SOCGV7VAO4SMB7/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-06T06:42:40Z","links":{"resolver":"https://pith.science/pith/44YAHDK3JST3SOCGV7VAO4SMB7","bundle":"https://pith.science/pith/44YAHDK3JST3SOCGV7VAO4SMB7/bundle.json","state":"https://pith.science/pith/44YAHDK3JST3SOCGV7VAO4SMB7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/44YAHDK3JST3SOCGV7VAO4SMB7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:44YAHDK3JST3SOCGV7VAO4SMB7","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":"d86bbfd6cd17f7b0e0b4f70877b6f03fdf73405cfb3b662677f5eb28192f5417","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-07-15T08:00:52Z","title_canon_sha256":"733fa6b3a2991b0b5fea5b3fcb192162ba0857e003b83c9a2b0dc02c919d2369"},"schema_version":"1.0","source":{"id":"1807.05506","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.05506","created_at":"2026-05-18T00:10:43Z"},{"alias_kind":"arxiv_version","alias_value":"1807.05506v1","created_at":"2026-05-18T00:10:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.05506","created_at":"2026-05-18T00:10:43Z"},{"alias_kind":"pith_short_12","alias_value":"44YAHDK3JST3","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"44YAHDK3JST3SOCG","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"44YAHDK3","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:6c90a8ff67474b4b4fc8d38c624977753ab53e4258ccd246e43b6fbb37d91b74","target":"graph","created_at":"2026-05-18T00:10:43Z","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":"Task scheduling is an important and complex problem in computational grid. A computational grid often covers a range of different kinds of nodes, which offers a complex environment. There is a need to develop algorithms that can capture this complexity as while as can be easily implemented and used to solve a wide range of load-balancing scenarios. In this paper, we propose a game theory based algorithm to the grid load balancing problem on the principle of minimizing the cost of the grid. The grid load-balancing problem is treated as a non-cooperative game. The experiment results demonstrate ","authors_text":"Xingtian Ren, Yifan Gao, Yong Wang, Ziyan Gao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-07-15T08:00:52Z","title":"Multi-objective Non-cooperative Game Model for Cost-based Task Scheduling in Computational Grid"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.05506","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:0a877c31e4ec1bc21365b7bf207d6392c4be19270ad184d5e556e53e6c1403ab","target":"record","created_at":"2026-05-18T00:10:43Z","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":"d86bbfd6cd17f7b0e0b4f70877b6f03fdf73405cfb3b662677f5eb28192f5417","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-07-15T08:00:52Z","title_canon_sha256":"733fa6b3a2991b0b5fea5b3fcb192162ba0857e003b83c9a2b0dc02c919d2369"},"schema_version":"1.0","source":{"id":"1807.05506","kind":"arxiv","version":1}},"canonical_sha256":"e730038d5b4ca7b93846afea07724c0fc59a14e1e9180b072f640ba66c4a3405","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e730038d5b4ca7b93846afea07724c0fc59a14e1e9180b072f640ba66c4a3405","first_computed_at":"2026-05-18T00:10:43.392262Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:43.392262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HQWFVc6/AgeYcvDEnfE2W+S9SctCbaVm6ZVbhfjtNigXUeaGXk6Vrae61UNiGcTC0+MBswn25cRN3TedLfv2BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:43.392767Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.05506","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a877c31e4ec1bc21365b7bf207d6392c4be19270ad184d5e556e53e6c1403ab","sha256:6c90a8ff67474b4b4fc8d38c624977753ab53e4258ccd246e43b6fbb37d91b74"],"state_sha256":"3261f5d8002f81feb3c927e4f43a88846f671709bade9acd123a63e424ac5e65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1dDh7z9A4WkCerIf+bky5byFYdd6zki8yfHngGc46ScBP/fmAIQgdmtZm2J/FlK0v/Dedsk9Fp2pTvB4he/mDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T06:42:40.741752Z","bundle_sha256":"bbfe72de3f28e74bace4d6a5b7c527d69ca765e22ae6779372941e58443247c2"}}