{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JNZH334EX4H6AZMKO2T6BRVWZC","short_pith_number":"pith:JNZH334E","canonical_record":{"source":{"id":"1404.1124","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-04-04T01:24:25Z","cross_cats_sorted":[],"title_canon_sha256":"d5632c5697fde9bce1f25ce57780c9f1e406f8062d88b4323840c6a0b64f7f4a","abstract_canon_sha256":"46d77659ab876e5214d47959a79086f1f45a0b95d0e6f24cc8db2ebaf00d5230"},"schema_version":"1.0"},"canonical_sha256":"4b727def84bf0fe0658a76a7e0c6b6c89882566852910f43113dbe3c9e587900","source":{"kind":"arxiv","id":"1404.1124","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1124","created_at":"2026-05-18T02:53:55Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1124v2","created_at":"2026-05-18T02:53:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1124","created_at":"2026-05-18T02:53:55Z"},{"alias_kind":"pith_short_12","alias_value":"JNZH334EX4H6","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JNZH334EX4H6AZMK","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JNZH334E","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JNZH334EX4H6AZMKO2T6BRVWZC","target":"record","payload":{"canonical_record":{"source":{"id":"1404.1124","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-04-04T01:24:25Z","cross_cats_sorted":[],"title_canon_sha256":"d5632c5697fde9bce1f25ce57780c9f1e406f8062d88b4323840c6a0b64f7f4a","abstract_canon_sha256":"46d77659ab876e5214d47959a79086f1f45a0b95d0e6f24cc8db2ebaf00d5230"},"schema_version":"1.0"},"canonical_sha256":"4b727def84bf0fe0658a76a7e0c6b6c89882566852910f43113dbe3c9e587900","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:55.681734Z","signature_b64":"PBaOOvblR+w9/epxe1EjZgBKinl34tD7I3S/nv7mh3WTgmGl5WMTVjqNEYtkeXzGohBW16vaeslV4vSNawPTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b727def84bf0fe0658a76a7e0c6b6c89882566852910f43113dbe3c9e587900","last_reissued_at":"2026-05-18T02:53:55.679874Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:55.679874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.1124","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":"Pl/4xLzWc+4U09+DtLbtLS+hrKUmplJGMNOQtgPU8VmJtigiymCAm5JLvW/6mYS2bH6KH8Q6R1UEDCTVSmNzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:41:02.793247Z"},"content_sha256":"59cb0d52eec1f31ce06586e41fd9c4464869eddbf0511d3494272b78088aae59","schema_version":"1.0","event_id":"sha256:59cb0d52eec1f31ce06586e41fd9c4464869eddbf0511d3494272b78088aae59"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JNZH334EX4H6AZMKO2T6BRVWZC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Task Allocation Schema Based on Response Time Optimization 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-04-04T01:24:25Z","abstract_excerpt":"Cloud computing is a newly emerging distributed computing 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 the previous task slices' sequential execution of an independent task in the model of which the target is processing time, we build a model that targets at the response time, in which the task slices are executed in parallel. T"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1124","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":"+Q8PnAd9AXhxw5CsFT2umhQRMvWdSGNudHFieGe0gzXuD7EPVFQ6jHRm+WpRXD1Ev3cJqcEbKJ0cgToV/MbsDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:41:02.793616Z"},"content_sha256":"a3a9fd118b3d2f33a7781b1148d61aa67f91d51966c262ef7e1ffc5ffb587a47","schema_version":"1.0","event_id":"sha256:a3a9fd118b3d2f33a7781b1148d61aa67f91d51966c262ef7e1ffc5ffb587a47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JNZH334EX4H6AZMKO2T6BRVWZC/bundle.json","state_url":"https://pith.science/pith/JNZH334EX4H6AZMKO2T6BRVWZC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JNZH334EX4H6AZMKO2T6BRVWZC/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-03T06:41:02Z","links":{"resolver":"https://pith.science/pith/JNZH334EX4H6AZMKO2T6BRVWZC","bundle":"https://pith.science/pith/JNZH334EX4H6AZMKO2T6BRVWZC/bundle.json","state":"https://pith.science/pith/JNZH334EX4H6AZMKO2T6BRVWZC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JNZH334EX4H6AZMKO2T6BRVWZC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JNZH334EX4H6AZMKO2T6BRVWZC","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":"46d77659ab876e5214d47959a79086f1f45a0b95d0e6f24cc8db2ebaf00d5230","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-04-04T01:24:25Z","title_canon_sha256":"d5632c5697fde9bce1f25ce57780c9f1e406f8062d88b4323840c6a0b64f7f4a"},"schema_version":"1.0","source":{"id":"1404.1124","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1124","created_at":"2026-05-18T02:53:55Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1124v2","created_at":"2026-05-18T02:53:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1124","created_at":"2026-05-18T02:53:55Z"},{"alias_kind":"pith_short_12","alias_value":"JNZH334EX4H6","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JNZH334EX4H6AZMK","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JNZH334E","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:a3a9fd118b3d2f33a7781b1148d61aa67f91d51966c262ef7e1ffc5ffb587a47","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 computing 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 the previous task slices' sequential execution of an independent task in the model of which the target is processing time, we build a model that targets at the response time, in which the task slices are executed in parallel. T","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-04-04T01:24:25Z","title":"A Task Allocation Schema Based on Response Time Optimization in Cloud Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1124","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:59cb0d52eec1f31ce06586e41fd9c4464869eddbf0511d3494272b78088aae59","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":"46d77659ab876e5214d47959a79086f1f45a0b95d0e6f24cc8db2ebaf00d5230","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-04-04T01:24:25Z","title_canon_sha256":"d5632c5697fde9bce1f25ce57780c9f1e406f8062d88b4323840c6a0b64f7f4a"},"schema_version":"1.0","source":{"id":"1404.1124","kind":"arxiv","version":2}},"canonical_sha256":"4b727def84bf0fe0658a76a7e0c6b6c89882566852910f43113dbe3c9e587900","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b727def84bf0fe0658a76a7e0c6b6c89882566852910f43113dbe3c9e587900","first_computed_at":"2026-05-18T02:53:55.679874Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:55.679874Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PBaOOvblR+w9/epxe1EjZgBKinl34tD7I3S/nv7mh3WTgmGl5WMTVjqNEYtkeXzGohBW16vaeslV4vSNawPTAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:55.681734Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.1124","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59cb0d52eec1f31ce06586e41fd9c4464869eddbf0511d3494272b78088aae59","sha256:a3a9fd118b3d2f33a7781b1148d61aa67f91d51966c262ef7e1ffc5ffb587a47"],"state_sha256":"6a9e04d225786eae5ba7241322328f9bd82ee7a5189f600452e35400c5eae096"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vw7esltUHBLRw9uWcdEnC4+M1PbReKKK10mmVowQGkBnYN5GAzYbEiVBDWAD7WJMAPaiHlJK2s1leW3VhU7PBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:41:02.795510Z","bundle_sha256":"90a31ccad2cbcda343ec347bde98afedf3088a5a60a28d068bd6aecb873d2a8b"}}