{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:IKDRNBJ74OEAJUITGAWZO6FI2V","short_pith_number":"pith:IKDRNBJ7","canonical_record":{"source":{"id":"2504.11250","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-04-15T14:46:58Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"cd38237912ba0633a9728ecfa5c457205c4b9fea7cf370e08e904aeffb569308","abstract_canon_sha256":"10d99ced99df213dafcd11aa67bed9dc89797ac70dff8b71ed2d5b1639bf1a64"},"schema_version":"1.0"},"canonical_sha256":"428716853fe38804d113302d9778a8d5727e67a5659335f7154fbd75e793fd52","source":{"kind":"arxiv","id":"2504.11250","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.11250","created_at":"2026-07-05T12:03:26Z"},{"alias_kind":"arxiv_version","alias_value":"2504.11250v2","created_at":"2026-07-05T12:03:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.11250","created_at":"2026-07-05T12:03:26Z"},{"alias_kind":"pith_short_12","alias_value":"IKDRNBJ74OEA","created_at":"2026-07-05T12:03:26Z"},{"alias_kind":"pith_short_16","alias_value":"IKDRNBJ74OEAJUIT","created_at":"2026-07-05T12:03:26Z"},{"alias_kind":"pith_short_8","alias_value":"IKDRNBJ7","created_at":"2026-07-05T12:03:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:IKDRNBJ74OEAJUITGAWZO6FI2V","target":"record","payload":{"canonical_record":{"source":{"id":"2504.11250","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-04-15T14:46:58Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"cd38237912ba0633a9728ecfa5c457205c4b9fea7cf370e08e904aeffb569308","abstract_canon_sha256":"10d99ced99df213dafcd11aa67bed9dc89797ac70dff8b71ed2d5b1639bf1a64"},"schema_version":"1.0"},"canonical_sha256":"428716853fe38804d113302d9778a8d5727e67a5659335f7154fbd75e793fd52","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:03:26.170424Z","signature_b64":"3OOIUf3ipFHqffPDWJ4kfxS/O76UXSbmOQ1nLTKASZRIF1M1foq4s83zlMxsvP4S2xG0w+Lt1qNahNKDsuPbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"428716853fe38804d113302d9778a8d5727e67a5659335f7154fbd75e793fd52","last_reissued_at":"2026-07-05T12:03:26.169892Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:03:26.169892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.11250","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T12:03:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZhFThnCjMHIihpgo8iDxmfn2XIj7mnjwYLJ2kp5tCxEZKhg76qcEFGIe65yjw9oKA/fMIekwaeDGrgwgV7H+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T03:02:38.633888Z"},"content_sha256":"94945901eeae08da45f5f68eb8dcc4cf6747ce201c3e198a793eec43c118e693","schema_version":"1.0","event_id":"sha256:94945901eeae08da45f5f68eb8dcc4cf6747ce201c3e198a793eec43c118e693"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:IKDRNBJ74OEAJUITGAWZO6FI2V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Rollout-Based Algorithm and Reward Function for Resource Allocation in Business Processes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Ivo Adan, Jeroen Middelhuis, Remco Dijkman, Zaharah Bukhsh","submitted_at":"2025-04-15T14:46:58Z","abstract_excerpt":"Resource allocation plays a critical role in minimizing cycle time and improving the efficiency of business processes. Recently, Deep Reinforcement Learning (DRL) has emerged as a powerful technique to optimize resource allocation policies in business processes. In the DRL framework, an agent learns a policy through interaction with the environment, guided solely by reward signals that indicate the quality of its decisions. However, existing algorithms are not suitable for dynamic environments such as business processes. Furthermore, existing DRL-based methods rely on engineered reward functio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.11250","kind":"arxiv","version":2},"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.11250/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T12:03:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gT4qzxgmoqHTjef81hWiV2CYnNU/a3os5uCajQ9SgvoXrYvbMMCIlBFiWXDigQLMNgd5Maloy3hYGQEf/zLZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T03:02:38.635287Z"},"content_sha256":"5bd1536e59567c5e4b9d78a69c47275c9aaec3dcf267159db82f425861da73e1","schema_version":"1.0","event_id":"sha256:5bd1536e59567c5e4b9d78a69c47275c9aaec3dcf267159db82f425861da73e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IKDRNBJ74OEAJUITGAWZO6FI2V/bundle.json","state_url":"https://pith.science/pith/IKDRNBJ74OEAJUITGAWZO6FI2V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IKDRNBJ74OEAJUITGAWZO6FI2V/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-17T03:02:38Z","links":{"resolver":"https://pith.science/pith/IKDRNBJ74OEAJUITGAWZO6FI2V","bundle":"https://pith.science/pith/IKDRNBJ74OEAJUITGAWZO6FI2V/bundle.json","state":"https://pith.science/pith/IKDRNBJ74OEAJUITGAWZO6FI2V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IKDRNBJ74OEAJUITGAWZO6FI2V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IKDRNBJ74OEAJUITGAWZO6FI2V","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"10d99ced99df213dafcd11aa67bed9dc89797ac70dff8b71ed2d5b1639bf1a64","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-04-15T14:46:58Z","title_canon_sha256":"cd38237912ba0633a9728ecfa5c457205c4b9fea7cf370e08e904aeffb569308"},"schema_version":"1.0","source":{"id":"2504.11250","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.11250","created_at":"2026-07-05T12:03:26Z"},{"alias_kind":"arxiv_version","alias_value":"2504.11250v2","created_at":"2026-07-05T12:03:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.11250","created_at":"2026-07-05T12:03:26Z"},{"alias_kind":"pith_short_12","alias_value":"IKDRNBJ74OEA","created_at":"2026-07-05T12:03:26Z"},{"alias_kind":"pith_short_16","alias_value":"IKDRNBJ74OEAJUIT","created_at":"2026-07-05T12:03:26Z"},{"alias_kind":"pith_short_8","alias_value":"IKDRNBJ7","created_at":"2026-07-05T12:03:26Z"}],"graph_snapshots":[{"event_id":"sha256:5bd1536e59567c5e4b9d78a69c47275c9aaec3dcf267159db82f425861da73e1","target":"graph","created_at":"2026-07-05T12:03:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2504.11250/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Resource allocation plays a critical role in minimizing cycle time and improving the efficiency of business processes. Recently, Deep Reinforcement Learning (DRL) has emerged as a powerful technique to optimize resource allocation policies in business processes. In the DRL framework, an agent learns a policy through interaction with the environment, guided solely by reward signals that indicate the quality of its decisions. However, existing algorithms are not suitable for dynamic environments such as business processes. Furthermore, existing DRL-based methods rely on engineered reward functio","authors_text":"Ivo Adan, Jeroen Middelhuis, Remco Dijkman, Zaharah Bukhsh","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-04-15T14:46:58Z","title":"A Rollout-Based Algorithm and Reward Function for Resource Allocation in Business Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.11250","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:94945901eeae08da45f5f68eb8dcc4cf6747ce201c3e198a793eec43c118e693","target":"record","created_at":"2026-07-05T12:03:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"10d99ced99df213dafcd11aa67bed9dc89797ac70dff8b71ed2d5b1639bf1a64","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-04-15T14:46:58Z","title_canon_sha256":"cd38237912ba0633a9728ecfa5c457205c4b9fea7cf370e08e904aeffb569308"},"schema_version":"1.0","source":{"id":"2504.11250","kind":"arxiv","version":2}},"canonical_sha256":"428716853fe38804d113302d9778a8d5727e67a5659335f7154fbd75e793fd52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"428716853fe38804d113302d9778a8d5727e67a5659335f7154fbd75e793fd52","first_computed_at":"2026-07-05T12:03:26.169892Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:03:26.169892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3OOIUf3ipFHqffPDWJ4kfxS/O76UXSbmOQ1nLTKASZRIF1M1foq4s83zlMxsvP4S2xG0w+Lt1qNahNKDsuPbDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T12:03:26.170424Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.11250","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94945901eeae08da45f5f68eb8dcc4cf6747ce201c3e198a793eec43c118e693","sha256:5bd1536e59567c5e4b9d78a69c47275c9aaec3dcf267159db82f425861da73e1"],"state_sha256":"7579e3b95a85639334a0668bed0f99d8fc8e9c244de9d3b9c29d760db5a2dce0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"quPfWETWtmD4RkkLW1OTop822TkHugXCdj1yhOA9z/KkdFEhWSY2YAeallYLrdcSbxpXvXgkSX0DQcmHp4MUBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T03:02:38.646302Z","bundle_sha256":"8b3466529b658401b513ffe729f51af64ad85b75233114ef9e0ce3d558ab0c8a"}}