{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6XRK5NVEW7RNTYPSDAYNPE6I4D","short_pith_number":"pith:6XRK5NVE","schema_version":"1.0","canonical_sha256":"f5e2aeb6a4b7e2d9e1f21830d793c8e0d96a9b74b499c848b9a23e527c35b1c3","source":{"kind":"arxiv","id":"2401.09706","version":1},"attestation_state":"computed","paper":{"title":"A HPC Co-Scheduler with Reinforcement Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Abel Souza, Johan Tordsson, Kristiaan Pelckmans","submitted_at":"2024-01-18T03:32:10Z","abstract_excerpt":"Although High Performance Computing (HPC) users understand basic resource requirements such as the number of CPUs and memory limits, internal infrastructural utilization data is exclusively leveraged by cluster operators, who use it to configure batch schedulers. This task is challenging and increasingly complex due to ever larger cluster scales and heterogeneity of modern scientific workflows. As a result, HPC systems achieve low utilization with long job completion times (makespans). To tackle these challenges, we propose a co-scheduling algorithm based on an adaptive reinforcement learning "},"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":"2401.09706","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2024-01-18T03:32:10Z","cross_cats_sorted":[],"title_canon_sha256":"1df0c7fda0f613097188dbe69f04b365ec08addbd781e68a6796e1b8295f2889","abstract_canon_sha256":"8c0be4fa41c4e67d0dbe6fb957fd7366cd40ba187d8de8052039669462e8c66a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:35:01.065717Z","signature_b64":"/aiTrJ0d+1OYBD6Tt9pLtA+1C1415YIQUa27szScjTE3SIaL6OUU0muGN7WvO4TWh7bDlkBmvxoxrSqgmU2iBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5e2aeb6a4b7e2d9e1f21830d793c8e0d96a9b74b499c848b9a23e527c35b1c3","last_reissued_at":"2026-07-05T07:35:01.065189Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:35:01.065189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A HPC Co-Scheduler with Reinforcement Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Abel Souza, Johan Tordsson, Kristiaan Pelckmans","submitted_at":"2024-01-18T03:32:10Z","abstract_excerpt":"Although High Performance Computing (HPC) users understand basic resource requirements such as the number of CPUs and memory limits, internal infrastructural utilization data is exclusively leveraged by cluster operators, who use it to configure batch schedulers. This task is challenging and increasingly complex due to ever larger cluster scales and heterogeneity of modern scientific workflows. As a result, HPC systems achieve low utilization with long job completion times (makespans). To tackle these challenges, we propose a co-scheduling algorithm based on an adaptive reinforcement learning "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.09706","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/2401.09706/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":"2401.09706","created_at":"2026-07-05T07:35:01.065245+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.09706v1","created_at":"2026-07-05T07:35:01.065245+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.09706","created_at":"2026-07-05T07:35:01.065245+00:00"},{"alias_kind":"pith_short_12","alias_value":"6XRK5NVEW7RN","created_at":"2026-07-05T07:35:01.065245+00:00"},{"alias_kind":"pith_short_16","alias_value":"6XRK5NVEW7RNTYPS","created_at":"2026-07-05T07:35:01.065245+00:00"},{"alias_kind":"pith_short_8","alias_value":"6XRK5NVE","created_at":"2026-07-05T07:35:01.065245+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/6XRK5NVEW7RNTYPSDAYNPE6I4D","json":"https://pith.science/pith/6XRK5NVEW7RNTYPSDAYNPE6I4D.json","graph_json":"https://pith.science/api/pith-number/6XRK5NVEW7RNTYPSDAYNPE6I4D/graph.json","events_json":"https://pith.science/api/pith-number/6XRK5NVEW7RNTYPSDAYNPE6I4D/events.json","paper":"https://pith.science/paper/6XRK5NVE"},"agent_actions":{"view_html":"https://pith.science/pith/6XRK5NVEW7RNTYPSDAYNPE6I4D","download_json":"https://pith.science/pith/6XRK5NVEW7RNTYPSDAYNPE6I4D.json","view_paper":"https://pith.science/paper/6XRK5NVE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.09706&json=true","fetch_graph":"https://pith.science/api/pith-number/6XRK5NVEW7RNTYPSDAYNPE6I4D/graph.json","fetch_events":"https://pith.science/api/pith-number/6XRK5NVEW7RNTYPSDAYNPE6I4D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6XRK5NVEW7RNTYPSDAYNPE6I4D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6XRK5NVEW7RNTYPSDAYNPE6I4D/action/storage_attestation","attest_author":"https://pith.science/pith/6XRK5NVEW7RNTYPSDAYNPE6I4D/action/author_attestation","sign_citation":"https://pith.science/pith/6XRK5NVEW7RNTYPSDAYNPE6I4D/action/citation_signature","submit_replication":"https://pith.science/pith/6XRK5NVEW7RNTYPSDAYNPE6I4D/action/replication_record"}},"created_at":"2026-07-05T07:35:01.065245+00:00","updated_at":"2026-07-05T07:35:01.065245+00:00"}