{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WLECDCW4FZT3XMI35RSPL5MR6U","short_pith_number":"pith:WLECDCW4","schema_version":"1.0","canonical_sha256":"b2c8218adc2e67bbb11bec64f5f591f525c2f5dc75c616f3f65f794f4e39440e","source":{"kind":"arxiv","id":"1401.3434","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1401.3434","created_at":"2026-05-18T03:02:09.209761+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.3434v1","created_at":"2026-05-18T03:02:09.209761+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3434","created_at":"2026-05-18T03:02:09.209761+00:00"},{"alias_kind":"pith_short_12","alias_value":"WLECDCW4FZT3","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WLECDCW4FZT3XMI3","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WLECDCW4","created_at":"2026-05-18T12:28:54.890064+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/WLECDCW4FZT3XMI35RSPL5MR6U","json":"https://pith.science/pith/WLECDCW4FZT3XMI35RSPL5MR6U.json","graph_json":"https://pith.science/api/pith-number/WLECDCW4FZT3XMI35RSPL5MR6U/graph.json","events_json":"https://pith.science/api/pith-number/WLECDCW4FZT3XMI35RSPL5MR6U/events.json","paper":"https://pith.science/paper/WLECDCW4"},"agent_actions":{"view_html":"https://pith.science/pith/WLECDCW4FZT3XMI35RSPL5MR6U","download_json":"https://pith.science/pith/WLECDCW4FZT3XMI35RSPL5MR6U.json","view_paper":"https://pith.science/paper/WLECDCW4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.3434&json=true","fetch_graph":"https://pith.science/api/pith-number/WLECDCW4FZT3XMI35RSPL5MR6U/graph.json","fetch_events":"https://pith.science/api/pith-number/WLECDCW4FZT3XMI35RSPL5MR6U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WLECDCW4FZT3XMI35RSPL5MR6U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WLECDCW4FZT3XMI35RSPL5MR6U/action/storage_attestation","attest_author":"https://pith.science/pith/WLECDCW4FZT3XMI35RSPL5MR6U/action/author_attestation","sign_citation":"https://pith.science/pith/WLECDCW4FZT3XMI35RSPL5MR6U/action/citation_signature","submit_replication":"https://pith.science/pith/WLECDCW4FZT3XMI35RSPL5MR6U/action/replication_record"}},"created_at":"2026-05-18T03:02:09.209761+00:00","updated_at":"2026-05-18T03:02:09.209761+00:00"}