{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TY4IFCELRRE7NIK35HP5DI5U5S","short_pith_number":"pith:TY4IFCEL","schema_version":"1.0","canonical_sha256":"9e3882888b8c49f6a15be9dfd1a3b4eca98df784351a0b39084201137d36dcaf","source":{"kind":"arxiv","id":"2501.19063","version":1},"attestation_state":"computed","paper":{"title":"Optimizing Job Allocation using Reinforcement Learning with Graph Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Lars C.P.M. Quaedvlieg","submitted_at":"2025-01-31T11:50:04Z","abstract_excerpt":"Efficient job allocation in complex scheduling problems poses significant challenges in real-world applications. In this report, we propose a novel approach that leverages the power of Reinforcement Learning (RL) and Graph Neural Networks (GNNs) to tackle the Job Allocation Problem (JAP). The JAP involves allocating a maximum set of jobs to available resources while considering several constraints. Our approach enables learning of adaptive policies through trial-and-error interactions with the environment while exploiting the graph-structured data of the problem. By leveraging RL, we eliminate"},"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":"2501.19063","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-31T11:50:04Z","cross_cats_sorted":[],"title_canon_sha256":"aa202bf58cb437bb7404330beb38e32c0d177d9b8f6102a7c263b28483c4d537","abstract_canon_sha256":"0ce94a8327ec1e12fc4f9503926a71cf760f672ac2d50f21a6585a57d0feffbb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:07:55.689611Z","signature_b64":"lzHlfbwWk/n2OaCymCivUw3Es5tzUOmCVOTaF140YJLtfhTtMqDGfxAFp6NEXqOO93DsgsOLstNNDFzo90BrDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e3882888b8c49f6a15be9dfd1a3b4eca98df784351a0b39084201137d36dcaf","last_reissued_at":"2026-07-05T10:07:55.689137Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:07:55.689137Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing Job Allocation using Reinforcement Learning with Graph Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Lars C.P.M. Quaedvlieg","submitted_at":"2025-01-31T11:50:04Z","abstract_excerpt":"Efficient job allocation in complex scheduling problems poses significant challenges in real-world applications. In this report, we propose a novel approach that leverages the power of Reinforcement Learning (RL) and Graph Neural Networks (GNNs) to tackle the Job Allocation Problem (JAP). The JAP involves allocating a maximum set of jobs to available resources while considering several constraints. Our approach enables learning of adaptive policies through trial-and-error interactions with the environment while exploiting the graph-structured data of the problem. By leveraging RL, we eliminate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.19063","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/2501.19063/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":"2501.19063","created_at":"2026-07-05T10:07:55.689193+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.19063v1","created_at":"2026-07-05T10:07:55.689193+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.19063","created_at":"2026-07-05T10:07:55.689193+00:00"},{"alias_kind":"pith_short_12","alias_value":"TY4IFCELRRE7","created_at":"2026-07-05T10:07:55.689193+00:00"},{"alias_kind":"pith_short_16","alias_value":"TY4IFCELRRE7NIK3","created_at":"2026-07-05T10:07:55.689193+00:00"},{"alias_kind":"pith_short_8","alias_value":"TY4IFCEL","created_at":"2026-07-05T10:07:55.689193+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/TY4IFCELRRE7NIK35HP5DI5U5S","json":"https://pith.science/pith/TY4IFCELRRE7NIK35HP5DI5U5S.json","graph_json":"https://pith.science/api/pith-number/TY4IFCELRRE7NIK35HP5DI5U5S/graph.json","events_json":"https://pith.science/api/pith-number/TY4IFCELRRE7NIK35HP5DI5U5S/events.json","paper":"https://pith.science/paper/TY4IFCEL"},"agent_actions":{"view_html":"https://pith.science/pith/TY4IFCELRRE7NIK35HP5DI5U5S","download_json":"https://pith.science/pith/TY4IFCELRRE7NIK35HP5DI5U5S.json","view_paper":"https://pith.science/paper/TY4IFCEL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.19063&json=true","fetch_graph":"https://pith.science/api/pith-number/TY4IFCELRRE7NIK35HP5DI5U5S/graph.json","fetch_events":"https://pith.science/api/pith-number/TY4IFCELRRE7NIK35HP5DI5U5S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TY4IFCELRRE7NIK35HP5DI5U5S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TY4IFCELRRE7NIK35HP5DI5U5S/action/storage_attestation","attest_author":"https://pith.science/pith/TY4IFCELRRE7NIK35HP5DI5U5S/action/author_attestation","sign_citation":"https://pith.science/pith/TY4IFCELRRE7NIK35HP5DI5U5S/action/citation_signature","submit_replication":"https://pith.science/pith/TY4IFCELRRE7NIK35HP5DI5U5S/action/replication_record"}},"created_at":"2026-07-05T10:07:55.689193+00:00","updated_at":"2026-07-05T10:07:55.689193+00:00"}