{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5ZNDSZ5OYTJIRGNYTO73V34NSN","short_pith_number":"pith:5ZNDSZ5O","canonical_record":{"source":{"id":"1902.01899","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-05T20:34:34Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3de0b7a2b9e4bd69bc7e21653958b67a37e621a82584037fd35e44014cfc5623","abstract_canon_sha256":"84b4907d472b0818d38e8b63655309bfde614f2831ab4c74964178ca772a7f08"},"schema_version":"1.0"},"canonical_sha256":"ee5a3967aec4d28899b89bbfbaef8d934459b6138d12051d602b72b06140803c","source":{"kind":"arxiv","id":"1902.01899","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01899","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01899v1","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01899","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"pith_short_12","alias_value":"5ZNDSZ5OYTJI","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5ZNDSZ5OYTJIRGNY","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5ZNDSZ5O","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5ZNDSZ5OYTJIRGNYTO73V34NSN","target":"record","payload":{"canonical_record":{"source":{"id":"1902.01899","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-05T20:34:34Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3de0b7a2b9e4bd69bc7e21653958b67a37e621a82584037fd35e44014cfc5623","abstract_canon_sha256":"84b4907d472b0818d38e8b63655309bfde614f2831ab4c74964178ca772a7f08"},"schema_version":"1.0"},"canonical_sha256":"ee5a3967aec4d28899b89bbfbaef8d934459b6138d12051d602b72b06140803c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:38.481705Z","signature_b64":"fY8DxR8c39YNv3XRncS53QOD1l1tdyUSS+F6SnMVkLykii20drSxx8CN+4cqfKv7KbyFeYg6as43Shd4sVAZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee5a3967aec4d28899b89bbfbaef8d934459b6138d12051d602b72b06140803c","last_reissued_at":"2026-05-17T23:54:38.481098Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:38.481098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.01899","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:54:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NXJLUBwdF/wxCpWhV1/g0k/n8Zf3MM5QE/XKTpNNdqmuY0LRD/1s6+d4NV/+rqUx0b36MUxlfxqQIsC3wp6BBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:19:34.413809Z"},"content_sha256":"83f1ee7cfc67b4c727714a58066adc640e67c81dcbf7165854a6928b9c61d00b","schema_version":"1.0","event_id":"sha256:83f1ee7cfc67b4c727714a58066adc640e67c81dcbf7165854a6928b9c61d00b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5ZNDSZ5OYTJIRGNYTO73V34NSN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reinforcement Learning for Optimal Load Distribution Sequencing in Resource-Sharing System","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DC","authors_text":"Fei Wu, Thomas Robertazzi, Yang Cao","submitted_at":"2019-02-05T20:34:34Z","abstract_excerpt":"Divisible Load Theory (DLT) is a powerful tool for modeling divisible load problems in data-intensive systems. This paper studied an optimal divisible load distribution sequencing problem using a machine learning framework. The problem is to decide the optimal sequence to distribute divisible load to processors in order to achieve minimum finishing time. The scheduling is performed in a resource-sharing system where each physical processor is virtualized to multiple virtual processors. A reinforcement learning method called Multi-armed bandit (MAB) is used for our problem. We first provide a n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01899","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:54:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vYVZyRxVtxARtNZ8lMfzFJzksHy+v8oag2+rlfQiKpGkiRHdcMiFchMQ5z+M9qZMchZ/pSBzTSBXhzE/yZ5VBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:19:34.414155Z"},"content_sha256":"257f8a12ce8b3121838b0a33902ddfe80d7bcad8c796be8036e366ee6897e5bf","schema_version":"1.0","event_id":"sha256:257f8a12ce8b3121838b0a33902ddfe80d7bcad8c796be8036e366ee6897e5bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ZNDSZ5OYTJIRGNYTO73V34NSN/bundle.json","state_url":"https://pith.science/pith/5ZNDSZ5OYTJIRGNYTO73V34NSN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ZNDSZ5OYTJIRGNYTO73V34NSN/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-27T18:19:34Z","links":{"resolver":"https://pith.science/pith/5ZNDSZ5OYTJIRGNYTO73V34NSN","bundle":"https://pith.science/pith/5ZNDSZ5OYTJIRGNYTO73V34NSN/bundle.json","state":"https://pith.science/pith/5ZNDSZ5OYTJIRGNYTO73V34NSN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ZNDSZ5OYTJIRGNYTO73V34NSN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5ZNDSZ5OYTJIRGNYTO73V34NSN","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":"84b4907d472b0818d38e8b63655309bfde614f2831ab4c74964178ca772a7f08","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-05T20:34:34Z","title_canon_sha256":"3de0b7a2b9e4bd69bc7e21653958b67a37e621a82584037fd35e44014cfc5623"},"schema_version":"1.0","source":{"id":"1902.01899","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.01899","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"arxiv_version","alias_value":"1902.01899v1","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01899","created_at":"2026-05-17T23:54:38Z"},{"alias_kind":"pith_short_12","alias_value":"5ZNDSZ5OYTJI","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5ZNDSZ5OYTJIRGNY","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5ZNDSZ5O","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:257f8a12ce8b3121838b0a33902ddfe80d7bcad8c796be8036e366ee6897e5bf","target":"graph","created_at":"2026-05-17T23:54:38Z","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":"Divisible Load Theory (DLT) is a powerful tool for modeling divisible load problems in data-intensive systems. This paper studied an optimal divisible load distribution sequencing problem using a machine learning framework. The problem is to decide the optimal sequence to distribute divisible load to processors in order to achieve minimum finishing time. The scheduling is performed in a resource-sharing system where each physical processor is virtualized to multiple virtual processors. A reinforcement learning method called Multi-armed bandit (MAB) is used for our problem. We first provide a n","authors_text":"Fei Wu, Thomas Robertazzi, Yang Cao","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-05T20:34:34Z","title":"Reinforcement Learning for Optimal Load Distribution Sequencing in Resource-Sharing System"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.01899","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:83f1ee7cfc67b4c727714a58066adc640e67c81dcbf7165854a6928b9c61d00b","target":"record","created_at":"2026-05-17T23:54:38Z","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":"84b4907d472b0818d38e8b63655309bfde614f2831ab4c74964178ca772a7f08","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-05T20:34:34Z","title_canon_sha256":"3de0b7a2b9e4bd69bc7e21653958b67a37e621a82584037fd35e44014cfc5623"},"schema_version":"1.0","source":{"id":"1902.01899","kind":"arxiv","version":1}},"canonical_sha256":"ee5a3967aec4d28899b89bbfbaef8d934459b6138d12051d602b72b06140803c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee5a3967aec4d28899b89bbfbaef8d934459b6138d12051d602b72b06140803c","first_computed_at":"2026-05-17T23:54:38.481098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:38.481098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fY8DxR8c39YNv3XRncS53QOD1l1tdyUSS+F6SnMVkLykii20drSxx8CN+4cqfKv7KbyFeYg6as43Shd4sVAZAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:38.481705Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.01899","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83f1ee7cfc67b4c727714a58066adc640e67c81dcbf7165854a6928b9c61d00b","sha256:257f8a12ce8b3121838b0a33902ddfe80d7bcad8c796be8036e366ee6897e5bf"],"state_sha256":"4c8ec7b55414ba93aefcfa95821c73ed7cadd19fc1ddeb7b66964d27af6716ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TdzeSgOjfgDomTaxslrrUFf/cXlyq18EAh/+hHUIfeW163JoOzasTZDrPiew+/K0WNhp9Ouxp4PwKRg+ip5yAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T18:19:34.416097Z","bundle_sha256":"9f9c969827862226e758f4b3f11ff0c1a4ea343f7bc2d2e39b611e27436d6800"}}