{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7JOZHQLJA4GQLMJSOO3YCHJCTG","short_pith_number":"pith:7JOZHQLJ","canonical_record":{"source":{"id":"1903.01154","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2019-03-04T10:03:22Z","cross_cats_sorted":[],"title_canon_sha256":"2c01cc6431d00918552c9256e0a046a86499c95c58ca40738dcdea546b105d1a","abstract_canon_sha256":"07f6e9dba902056c274209a83eeb7ec5853ab23c604e6313a45734e074eea11a"},"schema_version":"1.0"},"canonical_sha256":"fa5d93c169070d05b13273b7811d2299b05a14cb729df72243ae04a329001272","source":{"kind":"arxiv","id":"1903.01154","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01154","created_at":"2026-05-17T23:52:12Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01154v1","created_at":"2026-05-17T23:52:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01154","created_at":"2026-05-17T23:52:12Z"},{"alias_kind":"pith_short_12","alias_value":"7JOZHQLJA4GQ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7JOZHQLJA4GQLMJS","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7JOZHQLJ","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7JOZHQLJA4GQLMJSOO3YCHJCTG","target":"record","payload":{"canonical_record":{"source":{"id":"1903.01154","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2019-03-04T10:03:22Z","cross_cats_sorted":[],"title_canon_sha256":"2c01cc6431d00918552c9256e0a046a86499c95c58ca40738dcdea546b105d1a","abstract_canon_sha256":"07f6e9dba902056c274209a83eeb7ec5853ab23c604e6313a45734e074eea11a"},"schema_version":"1.0"},"canonical_sha256":"fa5d93c169070d05b13273b7811d2299b05a14cb729df72243ae04a329001272","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:12.135163Z","signature_b64":"QaQaJ1jJ/dVDSPQhRq6AW2SIsjHJ8KTGRWnUJvUaXphoK6zzcpg8X6rNHD7HpmZhKZRypx+JmhYqOZjr2y08Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa5d93c169070d05b13273b7811d2299b05a14cb729df72243ae04a329001272","last_reissued_at":"2026-05-17T23:52:12.134534Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:12.134534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.01154","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-17T23:52:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KDcqMIPpQmTz+w2iuldZupqhitpA6uWsteh2R967mdOkvgwDLvKv13g/A+llOCPyhc+6ZejcDzXWB8p+zBfmCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:23:33.097039Z"},"content_sha256":"ae4e1b4f294d9f9693b6c5740bf1dd1992352d89305e9642595978fe48753a1e","schema_version":"1.0","event_id":"sha256:ae4e1b4f294d9f9693b6c5740bf1dd1992352d89305e9642595978fe48753a1e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7JOZHQLJA4GQLMJSOO3YCHJCTG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Workflow Scheduling in the Cloud with Weighted Upward-rank Priority Scheme Using Random Walk and Uniform Spare Budget Splitting","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Hang Zhang, Mingqi Li, Xiaoying Zheng, Ye Xia","submitted_at":"2019-03-04T10:03:22Z","abstract_excerpt":"We study a difficult problem of how to schedule complex workflows with precedence constraints under a limited budget in the cloud environment. We first formulate the scheduling problem as an integer programming problem, which can be optimized and used as the baseline of performance. We then consider the traditional approach of scheduling jobs in a prioritized order based on the upward-rank of each job. For those jobs with no precedence constraints among themselves, the plain upward-rank priority scheme assigns priorities in an arbitrary way. We propose a job prioritization scheme that uses Mar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01154","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-17T23:52:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y2/CjlkV1hSyZUnLpU0OFfFTw9ttmZwBK5y4oWGlNM8fYwYyBklVRbdnzEIEyPLY1u3xfqB13KrRWTUgfn++Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:23:33.097728Z"},"content_sha256":"cd712cc3274d12878000950f51203433b9a1a291069ce6b57448cd9f03000bcc","schema_version":"1.0","event_id":"sha256:cd712cc3274d12878000950f51203433b9a1a291069ce6b57448cd9f03000bcc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7JOZHQLJA4GQLMJSOO3YCHJCTG/bundle.json","state_url":"https://pith.science/pith/7JOZHQLJA4GQLMJSOO3YCHJCTG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7JOZHQLJA4GQLMJSOO3YCHJCTG/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-11T08:23:33Z","links":{"resolver":"https://pith.science/pith/7JOZHQLJA4GQLMJSOO3YCHJCTG","bundle":"https://pith.science/pith/7JOZHQLJA4GQLMJSOO3YCHJCTG/bundle.json","state":"https://pith.science/pith/7JOZHQLJA4GQLMJSOO3YCHJCTG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7JOZHQLJA4GQLMJSOO3YCHJCTG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7JOZHQLJA4GQLMJSOO3YCHJCTG","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":"07f6e9dba902056c274209a83eeb7ec5853ab23c604e6313a45734e074eea11a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2019-03-04T10:03:22Z","title_canon_sha256":"2c01cc6431d00918552c9256e0a046a86499c95c58ca40738dcdea546b105d1a"},"schema_version":"1.0","source":{"id":"1903.01154","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01154","created_at":"2026-05-17T23:52:12Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01154v1","created_at":"2026-05-17T23:52:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01154","created_at":"2026-05-17T23:52:12Z"},{"alias_kind":"pith_short_12","alias_value":"7JOZHQLJA4GQ","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"7JOZHQLJA4GQLMJS","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"7JOZHQLJ","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:cd712cc3274d12878000950f51203433b9a1a291069ce6b57448cd9f03000bcc","target":"graph","created_at":"2026-05-17T23:52:12Z","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":"We study a difficult problem of how to schedule complex workflows with precedence constraints under a limited budget in the cloud environment. We first formulate the scheduling problem as an integer programming problem, which can be optimized and used as the baseline of performance. We then consider the traditional approach of scheduling jobs in a prioritized order based on the upward-rank of each job. For those jobs with no precedence constraints among themselves, the plain upward-rank priority scheme assigns priorities in an arbitrary way. We propose a job prioritization scheme that uses Mar","authors_text":"Hang Zhang, Mingqi Li, Xiaoying Zheng, Ye Xia","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2019-03-04T10:03:22Z","title":"Workflow Scheduling in the Cloud with Weighted Upward-rank Priority Scheme Using Random Walk and Uniform Spare Budget Splitting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01154","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:ae4e1b4f294d9f9693b6c5740bf1dd1992352d89305e9642595978fe48753a1e","target":"record","created_at":"2026-05-17T23:52:12Z","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":"07f6e9dba902056c274209a83eeb7ec5853ab23c604e6313a45734e074eea11a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2019-03-04T10:03:22Z","title_canon_sha256":"2c01cc6431d00918552c9256e0a046a86499c95c58ca40738dcdea546b105d1a"},"schema_version":"1.0","source":{"id":"1903.01154","kind":"arxiv","version":1}},"canonical_sha256":"fa5d93c169070d05b13273b7811d2299b05a14cb729df72243ae04a329001272","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa5d93c169070d05b13273b7811d2299b05a14cb729df72243ae04a329001272","first_computed_at":"2026-05-17T23:52:12.134534Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:12.134534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QaQaJ1jJ/dVDSPQhRq6AW2SIsjHJ8KTGRWnUJvUaXphoK6zzcpg8X6rNHD7HpmZhKZRypx+JmhYqOZjr2y08Dg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:12.135163Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.01154","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ae4e1b4f294d9f9693b6c5740bf1dd1992352d89305e9642595978fe48753a1e","sha256:cd712cc3274d12878000950f51203433b9a1a291069ce6b57448cd9f03000bcc"],"state_sha256":"25bdfe45a130198a0a641549063c8c647666b0eaf97d03ac3197f03bbe9120da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"96X2WhAN67yKBJrklaU/6UZOPJypKYIz68SViC4JkvYSwOqP6xYPHsgnY9XrHePP7E6dmSvyC+qNSyb/p2RsAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T08:23:33.102056Z","bundle_sha256":"7fe2497105b3bc9570c1151b57ab7599c138865d1f2c0770e86ef7a7862e7cb8"}}