{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:O5H3PERKIDXYS767FUEL776QAC","short_pith_number":"pith:O5H3PERK","canonical_record":{"source":{"id":"1801.01221","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-04T01:50:03Z","cross_cats_sorted":[],"title_canon_sha256":"a5ea12adad225f3f6592a853aad9bce6804ee8ce2e92475db42142f90eb828c8","abstract_canon_sha256":"56529b0058000d69b66d09d1e4a909670145fd1a28d78fe5ccf7caf400be7784"},"schema_version":"1.0"},"canonical_sha256":"774fb7922a40ef897fdf2d08bfffd00081ada325ba727880457156cbee78826d","source":{"kind":"arxiv","id":"1801.01221","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.01221","created_at":"2026-05-18T00:26:42Z"},{"alias_kind":"arxiv_version","alias_value":"1801.01221v1","created_at":"2026-05-18T00:26:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01221","created_at":"2026-05-18T00:26:42Z"},{"alias_kind":"pith_short_12","alias_value":"O5H3PERKIDXY","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"O5H3PERKIDXYS767","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"O5H3PERK","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:O5H3PERKIDXYS767FUEL776QAC","target":"record","payload":{"canonical_record":{"source":{"id":"1801.01221","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-04T01:50:03Z","cross_cats_sorted":[],"title_canon_sha256":"a5ea12adad225f3f6592a853aad9bce6804ee8ce2e92475db42142f90eb828c8","abstract_canon_sha256":"56529b0058000d69b66d09d1e4a909670145fd1a28d78fe5ccf7caf400be7784"},"schema_version":"1.0"},"canonical_sha256":"774fb7922a40ef897fdf2d08bfffd00081ada325ba727880457156cbee78826d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:42.742800Z","signature_b64":"4fVLyShGiIexxv2tX18co+J6kx6evNsDDXShp8fihfKRuiqe4InahljWBWvwgWxnuAFEVlaijsyddUbO2yzQDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"774fb7922a40ef897fdf2d08bfffd00081ada325ba727880457156cbee78826d","last_reissued_at":"2026-05-18T00:26:42.741992Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:42.741992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.01221","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-18T00:26:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BSs33cMxrh578fDQWZqGf1wYRn/L3TaLmczFLPZKe+ipAPQOVWtX/ZCSosXxt+n9t1fnKtkgB8IVkWpD7FC0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T20:20:53.372244Z"},"content_sha256":"5481d18f90e221dd3d03305295d64ae803305e588cc072b0c84341c9236e32cf","schema_version":"1.0","event_id":"sha256:5481d18f90e221dd3d03305295d64ae803305e588cc072b0c84341c9236e32cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:O5H3PERKIDXYS767FUEL776QAC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounded-Velocity Stochastic Control for Dynamic Resource Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Joost W.Bosman, Mark S.Squillante, Mayank Sharma, Xuefeng Gao, Yingdong Lu","submitted_at":"2018-01-04T01:50:03Z","abstract_excerpt":"We consider a general class of dynamic resource allocation problems within a stochastic optimal control framework. This class of problems arises in a wide variety of applications, each of which intrinsically involves resources of different types and demand with uncertainty and/or variability. The goal involves dynamically allocating capacity for every resource type in order to serve the uncertain/variable demand, modeled as Brownian motion, and maximize the discounted expected net-benefit over an infinite time horizon based on the rewards and costs associated with the different resource types,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01221","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-18T00:26:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xRdpmdbG8RsbPuER0eWOWcWgB6oA3tiA6+hf2w7uZHyRoVc56nMBKil94440idRrLBHsGSlAKBf9kCRm6s9UBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T20:20:53.372717Z"},"content_sha256":"247a5e6663626395b6dbcfbf4e428a20aaec1d4b6f845f85e847c7c4fe0afd13","schema_version":"1.0","event_id":"sha256:247a5e6663626395b6dbcfbf4e428a20aaec1d4b6f845f85e847c7c4fe0afd13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O5H3PERKIDXYS767FUEL776QAC/bundle.json","state_url":"https://pith.science/pith/O5H3PERKIDXYS767FUEL776QAC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O5H3PERKIDXYS767FUEL776QAC/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-05-23T20:20:53Z","links":{"resolver":"https://pith.science/pith/O5H3PERKIDXYS767FUEL776QAC","bundle":"https://pith.science/pith/O5H3PERKIDXYS767FUEL776QAC/bundle.json","state":"https://pith.science/pith/O5H3PERKIDXYS767FUEL776QAC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O5H3PERKIDXYS767FUEL776QAC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:O5H3PERKIDXYS767FUEL776QAC","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":"56529b0058000d69b66d09d1e4a909670145fd1a28d78fe5ccf7caf400be7784","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-04T01:50:03Z","title_canon_sha256":"a5ea12adad225f3f6592a853aad9bce6804ee8ce2e92475db42142f90eb828c8"},"schema_version":"1.0","source":{"id":"1801.01221","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.01221","created_at":"2026-05-18T00:26:42Z"},{"alias_kind":"arxiv_version","alias_value":"1801.01221v1","created_at":"2026-05-18T00:26:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01221","created_at":"2026-05-18T00:26:42Z"},{"alias_kind":"pith_short_12","alias_value":"O5H3PERKIDXY","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"O5H3PERKIDXYS767","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"O5H3PERK","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:247a5e6663626395b6dbcfbf4e428a20aaec1d4b6f845f85e847c7c4fe0afd13","target":"graph","created_at":"2026-05-18T00:26:42Z","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":"We consider a general class of dynamic resource allocation problems within a stochastic optimal control framework. This class of problems arises in a wide variety of applications, each of which intrinsically involves resources of different types and demand with uncertainty and/or variability. The goal involves dynamically allocating capacity for every resource type in order to serve the uncertain/variable demand, modeled as Brownian motion, and maximize the discounted expected net-benefit over an infinite time horizon based on the rewards and costs associated with the different resource types,","authors_text":"Joost W.Bosman, Mark S.Squillante, Mayank Sharma, Xuefeng Gao, Yingdong Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-04T01:50:03Z","title":"Bounded-Velocity Stochastic Control for Dynamic Resource Allocation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01221","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:5481d18f90e221dd3d03305295d64ae803305e588cc072b0c84341c9236e32cf","target":"record","created_at":"2026-05-18T00:26:42Z","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":"56529b0058000d69b66d09d1e4a909670145fd1a28d78fe5ccf7caf400be7784","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-01-04T01:50:03Z","title_canon_sha256":"a5ea12adad225f3f6592a853aad9bce6804ee8ce2e92475db42142f90eb828c8"},"schema_version":"1.0","source":{"id":"1801.01221","kind":"arxiv","version":1}},"canonical_sha256":"774fb7922a40ef897fdf2d08bfffd00081ada325ba727880457156cbee78826d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"774fb7922a40ef897fdf2d08bfffd00081ada325ba727880457156cbee78826d","first_computed_at":"2026-05-18T00:26:42.741992Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:42.741992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4fVLyShGiIexxv2tX18co+J6kx6evNsDDXShp8fihfKRuiqe4InahljWBWvwgWxnuAFEVlaijsyddUbO2yzQDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:42.742800Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.01221","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5481d18f90e221dd3d03305295d64ae803305e588cc072b0c84341c9236e32cf","sha256:247a5e6663626395b6dbcfbf4e428a20aaec1d4b6f845f85e847c7c4fe0afd13"],"state_sha256":"7a569fd96d73c148738519ff1b2143ea8ac2bf9e0fae3eea5d4356bc101e9f94"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WMxr8HBJIZs9Z7UzCeuseiy7eZ+sSZmjh9XXlXByBc3nwEyK6WPuJ3qufCTSPCwa54XDlXmFzOIyktmyi4v5BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T20:20:53.376068Z","bundle_sha256":"ba8a022b23fb7f756afcd77dddb7826dc3ca13b2651639171c8dd55713b31264"}}