{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:OSGEHYTVNTJWQ3CCOMKLJEVJ5Y","short_pith_number":"pith:OSGEHYTV","schema_version":"1.0","canonical_sha256":"748c43e2756cd3686c427314b492a9ee3ca400970fbe0480361d571fc27843f3","source":{"kind":"arxiv","id":"2504.19933","version":1},"attestation_state":"computed","paper":{"title":"Automated decision-making for dynamic task assignment at scale","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"cs.AI","authors_text":"Jeroen Middelhuis, Luca Begnardi, Remco Dijkman, Riccardo Lo Bianco, Willem van Jaarsveld","submitted_at":"2025-04-28T16:08:35Z","abstract_excerpt":"The Dynamic Task Assignment Problem (DTAP) concerns matching resources to tasks in real time while minimizing some objectives, like resource costs or task cycle time. In this work, we consider a DTAP variant where every task is a case composed of a stochastic sequence of activities. The DTAP, in this case, involves the decision of which employee to assign to which activity to process requests as quickly as possible. In recent years, Deep Reinforcement Learning (DRL) has emerged as a promising tool for tackling this DTAP variant, but most research is limited to solving small-scale, synthetic pr"},"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":"2504.19933","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2025-04-28T16:08:35Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"5542d6a063c7c80a41f07a263af611e51dea1f067f6b541c398a7064946de78e","abstract_canon_sha256":"7eb3e5abb6bc90546637083bbee4890c0a73bb473fc36181964eb07a5b0b1488"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:55:06.546120Z","signature_b64":"V6S6KiVEwME6yz3uN1ynAQmWFiB2ItLlIe0j+OOa+TBJn3acG5g5mRI2vSqYTML76iutJQzjXoBoHKKlq/DgAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"748c43e2756cd3686c427314b492a9ee3ca400970fbe0480361d571fc27843f3","last_reissued_at":"2026-07-05T10:55:06.545524Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:55:06.545524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automated decision-making for dynamic task assignment at scale","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"cs.AI","authors_text":"Jeroen Middelhuis, Luca Begnardi, Remco Dijkman, Riccardo Lo Bianco, Willem van Jaarsveld","submitted_at":"2025-04-28T16:08:35Z","abstract_excerpt":"The Dynamic Task Assignment Problem (DTAP) concerns matching resources to tasks in real time while minimizing some objectives, like resource costs or task cycle time. In this work, we consider a DTAP variant where every task is a case composed of a stochastic sequence of activities. The DTAP, in this case, involves the decision of which employee to assign to which activity to process requests as quickly as possible. In recent years, Deep Reinforcement Learning (DRL) has emerged as a promising tool for tackling this DTAP variant, but most research is limited to solving small-scale, synthetic pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.19933","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/2504.19933/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":"2504.19933","created_at":"2026-07-05T10:55:06.545611+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.19933v1","created_at":"2026-07-05T10:55:06.545611+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.19933","created_at":"2026-07-05T10:55:06.545611+00:00"},{"alias_kind":"pith_short_12","alias_value":"OSGEHYTVNTJW","created_at":"2026-07-05T10:55:06.545611+00:00"},{"alias_kind":"pith_short_16","alias_value":"OSGEHYTVNTJWQ3CC","created_at":"2026-07-05T10:55:06.545611+00:00"},{"alias_kind":"pith_short_8","alias_value":"OSGEHYTV","created_at":"2026-07-05T10:55:06.545611+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.20404","citing_title":"GymPN: A Library for Decision-Making in Process Management Systems","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OSGEHYTVNTJWQ3CCOMKLJEVJ5Y","json":"https://pith.science/pith/OSGEHYTVNTJWQ3CCOMKLJEVJ5Y.json","graph_json":"https://pith.science/api/pith-number/OSGEHYTVNTJWQ3CCOMKLJEVJ5Y/graph.json","events_json":"https://pith.science/api/pith-number/OSGEHYTVNTJWQ3CCOMKLJEVJ5Y/events.json","paper":"https://pith.science/paper/OSGEHYTV"},"agent_actions":{"view_html":"https://pith.science/pith/OSGEHYTVNTJWQ3CCOMKLJEVJ5Y","download_json":"https://pith.science/pith/OSGEHYTVNTJWQ3CCOMKLJEVJ5Y.json","view_paper":"https://pith.science/paper/OSGEHYTV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.19933&json=true","fetch_graph":"https://pith.science/api/pith-number/OSGEHYTVNTJWQ3CCOMKLJEVJ5Y/graph.json","fetch_events":"https://pith.science/api/pith-number/OSGEHYTVNTJWQ3CCOMKLJEVJ5Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OSGEHYTVNTJWQ3CCOMKLJEVJ5Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OSGEHYTVNTJWQ3CCOMKLJEVJ5Y/action/storage_attestation","attest_author":"https://pith.science/pith/OSGEHYTVNTJWQ3CCOMKLJEVJ5Y/action/author_attestation","sign_citation":"https://pith.science/pith/OSGEHYTVNTJWQ3CCOMKLJEVJ5Y/action/citation_signature","submit_replication":"https://pith.science/pith/OSGEHYTVNTJWQ3CCOMKLJEVJ5Y/action/replication_record"}},"created_at":"2026-07-05T10:55:06.545611+00:00","updated_at":"2026-07-05T10:55:06.545611+00:00"}