{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WLECDCW4FZT3XMI35RSPL5MR6U","short_pith_number":"pith:WLECDCW4","canonical_record":{"source":{"id":"1401.3434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-15T04:50:50Z","cross_cats_sorted":[],"title_canon_sha256":"a592f5b2a9b5ded70308dd5d56fe101f5a32d05af826c4285992f29e657361d9","abstract_canon_sha256":"75d086afb8eeae1ea12bf0d5734f318aa4f9516e5b1e3ed673625b4eb90b5cde"},"schema_version":"1.0"},"canonical_sha256":"b2c8218adc2e67bbb11bec64f5f591f525c2f5dc75c616f3f65f794f4e39440e","source":{"kind":"arxiv","id":"1401.3434","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3434","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3434v1","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3434","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"pith_short_12","alias_value":"WLECDCW4FZT3","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WLECDCW4FZT3XMI3","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WLECDCW4","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WLECDCW4FZT3XMI35RSPL5MR6U","target":"record","payload":{"canonical_record":{"source":{"id":"1401.3434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-15T04:50:50Z","cross_cats_sorted":[],"title_canon_sha256":"a592f5b2a9b5ded70308dd5d56fe101f5a32d05af826c4285992f29e657361d9","abstract_canon_sha256":"75d086afb8eeae1ea12bf0d5734f318aa4f9516e5b1e3ed673625b4eb90b5cde"},"schema_version":"1.0"},"canonical_sha256":"b2c8218adc2e67bbb11bec64f5f591f525c2f5dc75c616f3f65f794f4e39440e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:09.210363Z","signature_b64":"N/TFRPAOPSLrblfJrLCNBV4ThIdUnOWykProPlZTrB34vB500F8ZfG6dRsWQXtQaIiqNLLceP3H3JSWI5qQ4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2c8218adc2e67bbb11bec64f5f591f525c2f5dc75c616f3f65f794f4e39440e","last_reissued_at":"2026-05-18T03:02:09.209643Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:09.209643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.3434","source_version":1,"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-05-18T03:02:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ULRGIFVTMjopu0RoLHMpAczuqDv2ffSbX4k8pCCjIcrmoqXSiW0H1dO4JsbKm9qctHqizcZRWf66txLpd05YCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:16:35.435780Z"},"content_sha256":"6e113632ef6f1dcd00d0c70be917d590a4808e103ccac4cc249b2fa29b0da354","schema_version":"1.0","event_id":"sha256:6e113632ef6f1dcd00d0c70be917d590a4808e103ccac4cc249b2fa29b0da354"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WLECDCW4FZT3XMI35RSPL5MR6U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Stochastic Resource Control: A Machine Learning Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Bal\\'azs Csan\\'ad Cs\\'aji, L\\'aszl\\'o Monostori","submitted_at":"2014-01-15T04:50:50Z","abstract_excerpt":"The paper investigates stochastic resource allocation problems with scarce, reusable resources and non-preemtive, time-dependent, interconnected tasks. This approach is a natural generalization of several standard resource management problems, such as scheduling and transportation problems. First, reactive solutions are considered and defined as control policies of suitably reformulated Markov decision processes (MDPs). We argue that this reformulation has several favorable properties, such as it has finite state and action spaces, it is aperiodic, hence all policies are proper and the space o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3434","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":""},"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-05-18T03:02:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7LCXx+T13gl8+wMHpqK14II5ziDYrHHQw5ZroztetF8X9SCR7NCAvVjOqUW8W1oXNX8XIFtLR5KjcB6laUkhAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T03:16:35.436162Z"},"content_sha256":"cf3ea5d2e60bf4a22a086da521098529bb14749f1dd7247ba61a26bfef6a1ec6","schema_version":"1.0","event_id":"sha256:cf3ea5d2e60bf4a22a086da521098529bb14749f1dd7247ba61a26bfef6a1ec6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WLECDCW4FZT3XMI35RSPL5MR6U/bundle.json","state_url":"https://pith.science/pith/WLECDCW4FZT3XMI35RSPL5MR6U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WLECDCW4FZT3XMI35RSPL5MR6U/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-06-27T03:16:35Z","links":{"resolver":"https://pith.science/pith/WLECDCW4FZT3XMI35RSPL5MR6U","bundle":"https://pith.science/pith/WLECDCW4FZT3XMI35RSPL5MR6U/bundle.json","state":"https://pith.science/pith/WLECDCW4FZT3XMI35RSPL5MR6U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WLECDCW4FZT3XMI35RSPL5MR6U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WLECDCW4FZT3XMI35RSPL5MR6U","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":"75d086afb8eeae1ea12bf0d5734f318aa4f9516e5b1e3ed673625b4eb90b5cde","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-15T04:50:50Z","title_canon_sha256":"a592f5b2a9b5ded70308dd5d56fe101f5a32d05af826c4285992f29e657361d9"},"schema_version":"1.0","source":{"id":"1401.3434","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.3434","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"arxiv_version","alias_value":"1401.3434v1","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3434","created_at":"2026-05-18T03:02:09Z"},{"alias_kind":"pith_short_12","alias_value":"WLECDCW4FZT3","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WLECDCW4FZT3XMI3","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WLECDCW4","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:cf3ea5d2e60bf4a22a086da521098529bb14749f1dd7247ba61a26bfef6a1ec6","target":"graph","created_at":"2026-05-18T03:02:09Z","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"},"paper":{"abstract_excerpt":"The paper investigates stochastic resource allocation problems with scarce, reusable resources and non-preemtive, time-dependent, interconnected tasks. This approach is a natural generalization of several standard resource management problems, such as scheduling and transportation problems. First, reactive solutions are considered and defined as control policies of suitably reformulated Markov decision processes (MDPs). We argue that this reformulation has several favorable properties, such as it has finite state and action spaces, it is aperiodic, hence all policies are proper and the space o","authors_text":"Bal\\'azs Csan\\'ad Cs\\'aji, L\\'aszl\\'o Monostori","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-15T04:50:50Z","title":"Adaptive Stochastic Resource Control: A Machine Learning Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3434","kind":"arxiv","version":1},"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:6e113632ef6f1dcd00d0c70be917d590a4808e103ccac4cc249b2fa29b0da354","target":"record","created_at":"2026-05-18T03:02:09Z","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":"75d086afb8eeae1ea12bf0d5734f318aa4f9516e5b1e3ed673625b4eb90b5cde","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-01-15T04:50:50Z","title_canon_sha256":"a592f5b2a9b5ded70308dd5d56fe101f5a32d05af826c4285992f29e657361d9"},"schema_version":"1.0","source":{"id":"1401.3434","kind":"arxiv","version":1}},"canonical_sha256":"b2c8218adc2e67bbb11bec64f5f591f525c2f5dc75c616f3f65f794f4e39440e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b2c8218adc2e67bbb11bec64f5f591f525c2f5dc75c616f3f65f794f4e39440e","first_computed_at":"2026-05-18T03:02:09.209643Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:09.209643Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N/TFRPAOPSLrblfJrLCNBV4ThIdUnOWykProPlZTrB34vB500F8ZfG6dRsWQXtQaIiqNLLceP3H3JSWI5qQ4BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:09.210363Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.3434","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e113632ef6f1dcd00d0c70be917d590a4808e103ccac4cc249b2fa29b0da354","sha256:cf3ea5d2e60bf4a22a086da521098529bb14749f1dd7247ba61a26bfef6a1ec6"],"state_sha256":"96068916f90e884db1f05692a3e8836ff8a6b8991ba4fc91eff921a7f4cedd91"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3KTQWTWa+vjzZhvgO0JZ87ofmk3xYdQae+oLG3G9KvjOEnmNS0GlBWF1XJtdA60vEtEMx9tdv9eXJxE/04LnCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T03:16:35.438012Z","bundle_sha256":"673207bb3adb127e7650b0b784808817e4cc6de305476292af3e92c153363bc0"}}