{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UANT475NUIYEZY3PQQANFOQEJG","short_pith_number":"pith:UANT475N","canonical_record":{"source":{"id":"1810.04718","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-10T19:20:36Z","cross_cats_sorted":[],"title_canon_sha256":"7f6fb7855f0050ebbf495921372e6d64362d30eed2aaea383dde3487b168222a","abstract_canon_sha256":"d307a235ac85a6a80ac763338b8079d2aeaec082a7f3ea7ac23136b1eabf3c51"},"schema_version":"1.0"},"canonical_sha256":"a01b3e7fada2304ce36f8400d2ba04499ed9472b42c02638133ea886e1b5e2cb","source":{"kind":"arxiv","id":"1810.04718","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04718","created_at":"2026-07-05T00:54:27Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04718v2","created_at":"2026-07-05T00:54:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04718","created_at":"2026-07-05T00:54:27Z"},{"alias_kind":"pith_short_12","alias_value":"UANT475NUIYE","created_at":"2026-07-05T00:54:27Z"},{"alias_kind":"pith_short_16","alias_value":"UANT475NUIYEZY3P","created_at":"2026-07-05T00:54:27Z"},{"alias_kind":"pith_short_8","alias_value":"UANT475N","created_at":"2026-07-05T00:54:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UANT475NUIYEZY3PQQANFOQEJG","target":"record","payload":{"canonical_record":{"source":{"id":"1810.04718","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-10T19:20:36Z","cross_cats_sorted":[],"title_canon_sha256":"7f6fb7855f0050ebbf495921372e6d64362d30eed2aaea383dde3487b168222a","abstract_canon_sha256":"d307a235ac85a6a80ac763338b8079d2aeaec082a7f3ea7ac23136b1eabf3c51"},"schema_version":"1.0"},"canonical_sha256":"a01b3e7fada2304ce36f8400d2ba04499ed9472b42c02638133ea886e1b5e2cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:54:27.699609Z","signature_b64":"UbLjpIa2qGn1u4NKxdO1nDlSnCEU2kZkxhBRopqW4ZZKjTeLs2FQ2c4FKgWYg/xt57vfSH+P3yGRgaryMdTpBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a01b3e7fada2304ce36f8400d2ba04499ed9472b42c02638133ea886e1b5e2cb","last_reissued_at":"2026-07-05T00:54:27.699188Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:54:27.699188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.04718","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-07-05T00:54:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6BbyQpencjhu6B1YdKcYDVwAZEAff7v+9DMrIjMrJO46lBqltUeGzkSuZF5olA9kQaDmxyau73zPScDwf1i6Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:51:43.100980Z"},"content_sha256":"0811d5ab58f2938e749b96ef53485836d9b821182e9ff7de3f392d4adb22a660","schema_version":"1.0","event_id":"sha256:0811d5ab58f2938e749b96ef53485836d9b821182e9ff7de3f392d4adb22a660"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UANT475NUIYEZY3PQQANFOQEJG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Stochastic Approximation Approach for Foresighted Task Scheduling in Cloud Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Seyedakbar Mostafavi, Vesal Hakami","submitted_at":"2018-10-10T19:20:36Z","abstract_excerpt":"With the increasing and elastic demand for cloud resources, finding an optimal task scheduling mechanism become a challenge for cloud service providers. Due to the time-varying nature of resource demands in length and processing over time and dynamics and heterogeneity of cloud resources, existing myopic task scheduling solutions intended to maximize the performance of task scheduling are inefficient and sacrifice the long-time system performance in terms of resource utilization and response time. In this paper, we propose an optimal solution for performing foresighted task scheduling in a clo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04718","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1810.04718/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:54:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6P3EWKUVnR2ZxLumdki2cDvfWnm8+iwge8knN9SVOUr5UVo2HadxnlF0B+08mp4N72PY4DliVIKVJC3ZYWRDAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T05:51:43.101904Z"},"content_sha256":"5e57452b6b5e0e80410f93e7fc37d314c95b2151712efe1f1bdcbe0f2438df98","schema_version":"1.0","event_id":"sha256:5e57452b6b5e0e80410f93e7fc37d314c95b2151712efe1f1bdcbe0f2438df98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UANT475NUIYEZY3PQQANFOQEJG/bundle.json","state_url":"https://pith.science/pith/UANT475NUIYEZY3PQQANFOQEJG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UANT475NUIYEZY3PQQANFOQEJG/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-08-16T05:51:43Z","links":{"resolver":"https://pith.science/pith/UANT475NUIYEZY3PQQANFOQEJG","bundle":"https://pith.science/pith/UANT475NUIYEZY3PQQANFOQEJG/bundle.json","state":"https://pith.science/pith/UANT475NUIYEZY3PQQANFOQEJG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UANT475NUIYEZY3PQQANFOQEJG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UANT475NUIYEZY3PQQANFOQEJG","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":"d307a235ac85a6a80ac763338b8079d2aeaec082a7f3ea7ac23136b1eabf3c51","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-10T19:20:36Z","title_canon_sha256":"7f6fb7855f0050ebbf495921372e6d64362d30eed2aaea383dde3487b168222a"},"schema_version":"1.0","source":{"id":"1810.04718","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04718","created_at":"2026-07-05T00:54:27Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04718v2","created_at":"2026-07-05T00:54:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04718","created_at":"2026-07-05T00:54:27Z"},{"alias_kind":"pith_short_12","alias_value":"UANT475NUIYE","created_at":"2026-07-05T00:54:27Z"},{"alias_kind":"pith_short_16","alias_value":"UANT475NUIYEZY3P","created_at":"2026-07-05T00:54:27Z"},{"alias_kind":"pith_short_8","alias_value":"UANT475N","created_at":"2026-07-05T00:54:27Z"}],"graph_snapshots":[{"event_id":"sha256:5e57452b6b5e0e80410f93e7fc37d314c95b2151712efe1f1bdcbe0f2438df98","target":"graph","created_at":"2026-07-05T00:54:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1810.04718/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"With the increasing and elastic demand for cloud resources, finding an optimal task scheduling mechanism become a challenge for cloud service providers. Due to the time-varying nature of resource demands in length and processing over time and dynamics and heterogeneity of cloud resources, existing myopic task scheduling solutions intended to maximize the performance of task scheduling are inefficient and sacrifice the long-time system performance in terms of resource utilization and response time. In this paper, we propose an optimal solution for performing foresighted task scheduling in a clo","authors_text":"Seyedakbar Mostafavi, Vesal Hakami","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-10T19:20:36Z","title":"A Stochastic Approximation Approach for Foresighted Task Scheduling in Cloud Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04718","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:0811d5ab58f2938e749b96ef53485836d9b821182e9ff7de3f392d4adb22a660","target":"record","created_at":"2026-07-05T00:54:27Z","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":"d307a235ac85a6a80ac763338b8079d2aeaec082a7f3ea7ac23136b1eabf3c51","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-10T19:20:36Z","title_canon_sha256":"7f6fb7855f0050ebbf495921372e6d64362d30eed2aaea383dde3487b168222a"},"schema_version":"1.0","source":{"id":"1810.04718","kind":"arxiv","version":2}},"canonical_sha256":"a01b3e7fada2304ce36f8400d2ba04499ed9472b42c02638133ea886e1b5e2cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a01b3e7fada2304ce36f8400d2ba04499ed9472b42c02638133ea886e1b5e2cb","first_computed_at":"2026-07-05T00:54:27.699188Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:54:27.699188Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UbLjpIa2qGn1u4NKxdO1nDlSnCEU2kZkxhBRopqW4ZZKjTeLs2FQ2c4FKgWYg/xt57vfSH+P3yGRgaryMdTpBA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:54:27.699609Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.04718","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0811d5ab58f2938e749b96ef53485836d9b821182e9ff7de3f392d4adb22a660","sha256:5e57452b6b5e0e80410f93e7fc37d314c95b2151712efe1f1bdcbe0f2438df98"],"state_sha256":"9c4e384c5e546a85641df95431589328b079a826b9504681557c04e3166e2e40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l3YLac9Gy6tv0tH+33uwklwW7p0Z2cMFuv3UC69oUAS5I7PKazgC32T0DAHXMoMFVOLGrT8Eb7/I2uGQKCQiDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T05:51:43.113156Z","bundle_sha256":"43faf56f3ac3614b5a40a4fb8837b22bb414b04e0d9d3560ca669068f9fa1990"}}