{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5ZNDSZ5OYTJIRGNYTO73V34NSN","short_pith_number":"pith:5ZNDSZ5O","schema_version":"1.0","canonical_sha256":"ee5a3967aec4d28899b89bbfbaef8d934459b6138d12051d602b72b06140803c","source":{"kind":"arxiv","id":"1902.01899","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1902.01899","created_at":"2026-05-17T23:54:38.481165+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.01899v1","created_at":"2026-05-17T23:54:38.481165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.01899","created_at":"2026-05-17T23:54:38.481165+00:00"},{"alias_kind":"pith_short_12","alias_value":"5ZNDSZ5OYTJI","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5ZNDSZ5OYTJIRGNY","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5ZNDSZ5O","created_at":"2026-05-18T12:33:10.108867+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5ZNDSZ5OYTJIRGNYTO73V34NSN","json":"https://pith.science/pith/5ZNDSZ5OYTJIRGNYTO73V34NSN.json","graph_json":"https://pith.science/api/pith-number/5ZNDSZ5OYTJIRGNYTO73V34NSN/graph.json","events_json":"https://pith.science/api/pith-number/5ZNDSZ5OYTJIRGNYTO73V34NSN/events.json","paper":"https://pith.science/paper/5ZNDSZ5O"},"agent_actions":{"view_html":"https://pith.science/pith/5ZNDSZ5OYTJIRGNYTO73V34NSN","download_json":"https://pith.science/pith/5ZNDSZ5OYTJIRGNYTO73V34NSN.json","view_paper":"https://pith.science/paper/5ZNDSZ5O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.01899&json=true","fetch_graph":"https://pith.science/api/pith-number/5ZNDSZ5OYTJIRGNYTO73V34NSN/graph.json","fetch_events":"https://pith.science/api/pith-number/5ZNDSZ5OYTJIRGNYTO73V34NSN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5ZNDSZ5OYTJIRGNYTO73V34NSN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5ZNDSZ5OYTJIRGNYTO73V34NSN/action/storage_attestation","attest_author":"https://pith.science/pith/5ZNDSZ5OYTJIRGNYTO73V34NSN/action/author_attestation","sign_citation":"https://pith.science/pith/5ZNDSZ5OYTJIRGNYTO73V34NSN/action/citation_signature","submit_replication":"https://pith.science/pith/5ZNDSZ5OYTJIRGNYTO73V34NSN/action/replication_record"}},"created_at":"2026-05-17T23:54:38.481165+00:00","updated_at":"2026-05-17T23:54:38.481165+00:00"}