{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:D3DQF2BUZW6AWHNYJTN3F3K6OK","short_pith_number":"pith:D3DQF2BU","schema_version":"1.0","canonical_sha256":"1ec702e834cdbc0b1db84cdbb2ed5e729b27eb6081a62fe1bc2d9a55b1f778b5","source":{"kind":"arxiv","id":"2411.05346","version":1},"attestation_state":"computed","paper":{"title":"Reinforcement Learning for Adaptive Resource Scheduling in Complex System Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Jinghua Yan, Pochun Li, Xiaoye Wang, Xuan Li, Yuyang Xiao","submitted_at":"2024-11-08T05:58:09Z","abstract_excerpt":"This study presents a novel computer system performance optimization and adaptive workload management scheduling algorithm based on Q-learning. In modern computing environments, characterized by increasing data volumes, task complexity, and dynamic workloads, traditional static scheduling methods such as Round-Robin and Priority Scheduling fail to meet the demands of efficient resource allocation and real-time adaptability. By contrast, Q-learning, a reinforcement learning algorithm, continuously learns from system state changes, enabling dynamic scheduling and resource optimization. Through e"},"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":"2411.05346","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-11-08T05:58:09Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"0958c86164802d56a448d1d41f4c091d7721553fe3918fe6e3ba89b82da99c21","abstract_canon_sha256":"895ca3b20bef67c519d57c506f9eaa3efb4f2c2f4517a7aa6ce60179024a2915"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:32:59.045705Z","signature_b64":"OGgHoZu6/qqvqGs27bHmUtckPF2eh68ISsxfAsU6S8gC+cRFWmB7ybfgBdbzBJgTqioZybY8r9gyeuAu1vIyDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ec702e834cdbc0b1db84cdbb2ed5e729b27eb6081a62fe1bc2d9a55b1f778b5","last_reissued_at":"2026-07-05T09:32:59.045148Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:32:59.045148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reinforcement Learning for Adaptive Resource Scheduling in Complex System Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LG","authors_text":"Jinghua Yan, Pochun Li, Xiaoye Wang, Xuan Li, Yuyang Xiao","submitted_at":"2024-11-08T05:58:09Z","abstract_excerpt":"This study presents a novel computer system performance optimization and adaptive workload management scheduling algorithm based on Q-learning. In modern computing environments, characterized by increasing data volumes, task complexity, and dynamic workloads, traditional static scheduling methods such as Round-Robin and Priority Scheduling fail to meet the demands of efficient resource allocation and real-time adaptability. By contrast, Q-learning, a reinforcement learning algorithm, continuously learns from system state changes, enabling dynamic scheduling and resource optimization. Through e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.05346","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.05346/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.05346","created_at":"2026-07-05T09:32:59.045210+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.05346v1","created_at":"2026-07-05T09:32:59.045210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.05346","created_at":"2026-07-05T09:32:59.045210+00:00"},{"alias_kind":"pith_short_12","alias_value":"D3DQF2BUZW6A","created_at":"2026-07-05T09:32:59.045210+00:00"},{"alias_kind":"pith_short_16","alias_value":"D3DQF2BUZW6AWHNY","created_at":"2026-07-05T09:32:59.045210+00:00"},{"alias_kind":"pith_short_8","alias_value":"D3DQF2BU","created_at":"2026-07-05T09:32:59.045210+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.15222","citing_title":"Leveraging Generative Adversarial Networks for Addressing Data Imbalance in Financial Market Supervision","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D3DQF2BUZW6AWHNYJTN3F3K6OK","json":"https://pith.science/pith/D3DQF2BUZW6AWHNYJTN3F3K6OK.json","graph_json":"https://pith.science/api/pith-number/D3DQF2BUZW6AWHNYJTN3F3K6OK/graph.json","events_json":"https://pith.science/api/pith-number/D3DQF2BUZW6AWHNYJTN3F3K6OK/events.json","paper":"https://pith.science/paper/D3DQF2BU"},"agent_actions":{"view_html":"https://pith.science/pith/D3DQF2BUZW6AWHNYJTN3F3K6OK","download_json":"https://pith.science/pith/D3DQF2BUZW6AWHNYJTN3F3K6OK.json","view_paper":"https://pith.science/paper/D3DQF2BU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.05346&json=true","fetch_graph":"https://pith.science/api/pith-number/D3DQF2BUZW6AWHNYJTN3F3K6OK/graph.json","fetch_events":"https://pith.science/api/pith-number/D3DQF2BUZW6AWHNYJTN3F3K6OK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D3DQF2BUZW6AWHNYJTN3F3K6OK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D3DQF2BUZW6AWHNYJTN3F3K6OK/action/storage_attestation","attest_author":"https://pith.science/pith/D3DQF2BUZW6AWHNYJTN3F3K6OK/action/author_attestation","sign_citation":"https://pith.science/pith/D3DQF2BUZW6AWHNYJTN3F3K6OK/action/citation_signature","submit_replication":"https://pith.science/pith/D3DQF2BUZW6AWHNYJTN3F3K6OK/action/replication_record"}},"created_at":"2026-07-05T09:32:59.045210+00:00","updated_at":"2026-07-05T09:32:59.045210+00:00"}