{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:REIFOKNDTEBCPVYTINTTVDGEZK","short_pith_number":"pith:REIFOKND","canonical_record":{"source":{"id":"2308.00281","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-08-01T04:37:38Z","cross_cats_sorted":[],"title_canon_sha256":"2a87a52dcc1178360497ae3b407f4b5d13c5ccb0f7ad879a2e8995b4dcb48479","abstract_canon_sha256":"f3261e5d3e8bce95dca349cc6c7c5072e78ad8871dfd4949572b6f49cfda16ed"},"schema_version":"1.0"},"canonical_sha256":"89105729a3990227d71343673a8cc4cab247d232013511851eb7267625193ac4","source":{"kind":"arxiv","id":"2308.00281","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.00281","created_at":"2026-07-05T06:36:16Z"},{"alias_kind":"arxiv_version","alias_value":"2308.00281v1","created_at":"2026-07-05T06:36:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.00281","created_at":"2026-07-05T06:36:16Z"},{"alias_kind":"pith_short_12","alias_value":"REIFOKNDTEBC","created_at":"2026-07-05T06:36:16Z"},{"alias_kind":"pith_short_16","alias_value":"REIFOKNDTEBCPVYT","created_at":"2026-07-05T06:36:16Z"},{"alias_kind":"pith_short_8","alias_value":"REIFOKND","created_at":"2026-07-05T06:36:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:REIFOKNDTEBCPVYTINTTVDGEZK","target":"record","payload":{"canonical_record":{"source":{"id":"2308.00281","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-08-01T04:37:38Z","cross_cats_sorted":[],"title_canon_sha256":"2a87a52dcc1178360497ae3b407f4b5d13c5ccb0f7ad879a2e8995b4dcb48479","abstract_canon_sha256":"f3261e5d3e8bce95dca349cc6c7c5072e78ad8871dfd4949572b6f49cfda16ed"},"schema_version":"1.0"},"canonical_sha256":"89105729a3990227d71343673a8cc4cab247d232013511851eb7267625193ac4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:36:16.975628Z","signature_b64":"sSTlq26TqncPbxZw/+ijKhncNb+NVEqoEeQ42DO51DVIyKPn3ZBtrXv0w0BtLk9dITUit/ono/trKdHdLvtqBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89105729a3990227d71343673a8cc4cab247d232013511851eb7267625193ac4","last_reissued_at":"2026-07-05T06:36:16.975100Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:36:16.975100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.00281","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-07-05T06:36:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/IUIHEmuqmsRVkR9RqJU/Gv2VQNQT8+2TmHGCHfLmfPM+8qM1+98tsu0gwBV2jx/uaVzJhos+9FM12aF9nbbBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:57:34.167801Z"},"content_sha256":"3248f414848a8e72b4b2d8624e98af7c7fae3a2091b1c7edde2a44f871115602","schema_version":"1.0","event_id":"sha256:3248f414848a8e72b4b2d8624e98af7c7fae3a2091b1c7edde2a44f871115602"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:REIFOKNDTEBCPVYTINTTVDGEZK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Stochastic Allocation of Reusable Resources","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Wang Chi Cheung, Xilin Zhang","submitted_at":"2023-08-01T04:37:38Z","abstract_excerpt":"We study a multi-objective model on the allocation of reusable resources under model uncertainty. Heterogeneous customers arrive sequentially according to a latent stochastic process, request for certain amounts of resources, and occupy them for random durations of time. The decision maker's goal is to simultaneously maximize multiple types of rewards generated by the customers, while satisfying the resource capacity constraints in each time step. We develop models and algorithms for deciding on the allocation actions. We show that when the usage duration is relatively small compared with the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.00281","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/2308.00281/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-05T06:36:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cCutg0ZuJsaayWIiDL3LkWAWtECkFCuMv3CpDHW/puHUh1LpIlCeU3A40eytTqXBGZhYS+TxHqae3BT3Yp0cAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:57:34.168161Z"},"content_sha256":"94e461ef231c31ca2a22a011610e34727920558fb48d8893716dae0d89425ef9","schema_version":"1.0","event_id":"sha256:94e461ef231c31ca2a22a011610e34727920558fb48d8893716dae0d89425ef9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/REIFOKNDTEBCPVYTINTTVDGEZK/bundle.json","state_url":"https://pith.science/pith/REIFOKNDTEBCPVYTINTTVDGEZK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/REIFOKNDTEBCPVYTINTTVDGEZK/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-07-07T07:57:34Z","links":{"resolver":"https://pith.science/pith/REIFOKNDTEBCPVYTINTTVDGEZK","bundle":"https://pith.science/pith/REIFOKNDTEBCPVYTINTTVDGEZK/bundle.json","state":"https://pith.science/pith/REIFOKNDTEBCPVYTINTTVDGEZK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/REIFOKNDTEBCPVYTINTTVDGEZK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:REIFOKNDTEBCPVYTINTTVDGEZK","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":"f3261e5d3e8bce95dca349cc6c7c5072e78ad8871dfd4949572b6f49cfda16ed","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-08-01T04:37:38Z","title_canon_sha256":"2a87a52dcc1178360497ae3b407f4b5d13c5ccb0f7ad879a2e8995b4dcb48479"},"schema_version":"1.0","source":{"id":"2308.00281","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.00281","created_at":"2026-07-05T06:36:16Z"},{"alias_kind":"arxiv_version","alias_value":"2308.00281v1","created_at":"2026-07-05T06:36:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.00281","created_at":"2026-07-05T06:36:16Z"},{"alias_kind":"pith_short_12","alias_value":"REIFOKNDTEBC","created_at":"2026-07-05T06:36:16Z"},{"alias_kind":"pith_short_16","alias_value":"REIFOKNDTEBCPVYT","created_at":"2026-07-05T06:36:16Z"},{"alias_kind":"pith_short_8","alias_value":"REIFOKND","created_at":"2026-07-05T06:36:16Z"}],"graph_snapshots":[{"event_id":"sha256:94e461ef231c31ca2a22a011610e34727920558fb48d8893716dae0d89425ef9","target":"graph","created_at":"2026-07-05T06:36:16Z","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/2308.00281/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study a multi-objective model on the allocation of reusable resources under model uncertainty. Heterogeneous customers arrive sequentially according to a latent stochastic process, request for certain amounts of resources, and occupy them for random durations of time. The decision maker's goal is to simultaneously maximize multiple types of rewards generated by the customers, while satisfying the resource capacity constraints in each time step. We develop models and algorithms for deciding on the allocation actions. We show that when the usage duration is relatively small compared with the ","authors_text":"Wang Chi Cheung, Xilin Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-08-01T04:37:38Z","title":"Online Stochastic Allocation of Reusable Resources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.00281","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:3248f414848a8e72b4b2d8624e98af7c7fae3a2091b1c7edde2a44f871115602","target":"record","created_at":"2026-07-05T06:36:16Z","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":"f3261e5d3e8bce95dca349cc6c7c5072e78ad8871dfd4949572b6f49cfda16ed","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-08-01T04:37:38Z","title_canon_sha256":"2a87a52dcc1178360497ae3b407f4b5d13c5ccb0f7ad879a2e8995b4dcb48479"},"schema_version":"1.0","source":{"id":"2308.00281","kind":"arxiv","version":1}},"canonical_sha256":"89105729a3990227d71343673a8cc4cab247d232013511851eb7267625193ac4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89105729a3990227d71343673a8cc4cab247d232013511851eb7267625193ac4","first_computed_at":"2026-07-05T06:36:16.975100Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:36:16.975100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sSTlq26TqncPbxZw/+ijKhncNb+NVEqoEeQ42DO51DVIyKPn3ZBtrXv0w0BtLk9dITUit/ono/trKdHdLvtqBA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:36:16.975628Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.00281","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3248f414848a8e72b4b2d8624e98af7c7fae3a2091b1c7edde2a44f871115602","sha256:94e461ef231c31ca2a22a011610e34727920558fb48d8893716dae0d89425ef9"],"state_sha256":"dbdfbd68ed88a10b2da1112c5a515bfeae0a780b2fed77a7a51fbd4ff0f24e06"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6DuNnTQct8+nQ3d5MDjt7j2XrOhrL2f9r6RLsZrbtZ2idvHNVg/wPd04GO6gQyBjxhC+GSzuAiiLkHfJ8WBXAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T07:57:34.170007Z","bundle_sha256":"611ae1f66fef61c12cf391d6d42c14d4d7533ddf939f7591d68842ea5e1573f8"}}