{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:CXBXI6B4FUNVKIM6WCSP4B7NJB","short_pith_number":"pith:CXBXI6B4","canonical_record":{"source":{"id":"2212.02855","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-12-06T09:48:10Z","cross_cats_sorted":[],"title_canon_sha256":"497d714769103a584f3e6eb0177ff3bd5d359c2082cfddedf969aa2e6eda885d","abstract_canon_sha256":"3eea3d9c29ea9acace2d655b960a2a30eb9798cdce20f819f44e7631b37a0756"},"schema_version":"1.0"},"canonical_sha256":"15c374783c2d1b55219eb0a4fe07ed486c908ae97fd7fb35c99497777f7c2e46","source":{"kind":"arxiv","id":"2212.02855","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.02855","created_at":"2026-07-05T05:22:35Z"},{"alias_kind":"arxiv_version","alias_value":"2212.02855v1","created_at":"2026-07-05T05:22:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.02855","created_at":"2026-07-05T05:22:35Z"},{"alias_kind":"pith_short_12","alias_value":"CXBXI6B4FUNV","created_at":"2026-07-05T05:22:35Z"},{"alias_kind":"pith_short_16","alias_value":"CXBXI6B4FUNVKIM6","created_at":"2026-07-05T05:22:35Z"},{"alias_kind":"pith_short_8","alias_value":"CXBXI6B4","created_at":"2026-07-05T05:22:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:CXBXI6B4FUNVKIM6WCSP4B7NJB","target":"record","payload":{"canonical_record":{"source":{"id":"2212.02855","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-12-06T09:48:10Z","cross_cats_sorted":[],"title_canon_sha256":"497d714769103a584f3e6eb0177ff3bd5d359c2082cfddedf969aa2e6eda885d","abstract_canon_sha256":"3eea3d9c29ea9acace2d655b960a2a30eb9798cdce20f819f44e7631b37a0756"},"schema_version":"1.0"},"canonical_sha256":"15c374783c2d1b55219eb0a4fe07ed486c908ae97fd7fb35c99497777f7c2e46","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:22:35.110601Z","signature_b64":"RbAPpY4WHuuTyU1Fv8m8EdoNSsr+NsO7X4L4DiUCz0SgsfWcuuGPQMet4P8l95At8S5B9eRw0/ssFhLM80CiDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15c374783c2d1b55219eb0a4fe07ed486c908ae97fd7fb35c99497777f7c2e46","last_reissued_at":"2026-07-05T05:22:35.110264Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:22:35.110264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2212.02855","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-05T05:22:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"axI435pmrZcBFd7xkMJCsVewn6z8i2PKY2q/Y5pgPJrJRS1Znbr5gEatzeWS6Quqr71h5LJ+Rym5XF82ldvkDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T23:26:41.291442Z"},"content_sha256":"1df5073b83b18e25cc785763fa21932d933207f90d9692f134bd57009025ac3c","schema_version":"1.0","event_id":"sha256:1df5073b83b18e25cc785763fa21932d933207f90d9692f134bd57009025ac3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:CXBXI6B4FUNVKIM6WCSP4B7NJB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Resource Allocation for 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":"2022-12-06T09:48:10Z","abstract_excerpt":"We study a general model on reusable resource allocation under model uncertainty. A heterogeneous population of customers arrive at the decision maker's (DM's) platform sequentially. Upon observing a customer's type, the DM selects an allocation decision, which leads to rewards earned and resources occupied. Each resource unit is occupied for a random duration, and the unit is available for another allocation after the usage duration. Our model captures numerous applications involving admission control and assortment planning. The DM aims to simultaneously maximize multiple types of rewards, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.02855","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/2212.02855/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-05T05:22:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZAiwMXQrfEkc8iJ+HiyIvv9DAGIZ8uN82xIGfAHZ49CvBKUCCeEU33LCA8EuWijeNATjeO9yQrg/2vNByD28Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T23:26:41.291818Z"},"content_sha256":"5496e09b2d3d0e0bdd85eda1752063af9e13408ada6137ce14008e66846bce72","schema_version":"1.0","event_id":"sha256:5496e09b2d3d0e0bdd85eda1752063af9e13408ada6137ce14008e66846bce72"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CXBXI6B4FUNVKIM6WCSP4B7NJB/bundle.json","state_url":"https://pith.science/pith/CXBXI6B4FUNVKIM6WCSP4B7NJB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CXBXI6B4FUNVKIM6WCSP4B7NJB/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-06T23:26:41Z","links":{"resolver":"https://pith.science/pith/CXBXI6B4FUNVKIM6WCSP4B7NJB","bundle":"https://pith.science/pith/CXBXI6B4FUNVKIM6WCSP4B7NJB/bundle.json","state":"https://pith.science/pith/CXBXI6B4FUNVKIM6WCSP4B7NJB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CXBXI6B4FUNVKIM6WCSP4B7NJB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:CXBXI6B4FUNVKIM6WCSP4B7NJB","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":"3eea3d9c29ea9acace2d655b960a2a30eb9798cdce20f819f44e7631b37a0756","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-12-06T09:48:10Z","title_canon_sha256":"497d714769103a584f3e6eb0177ff3bd5d359c2082cfddedf969aa2e6eda885d"},"schema_version":"1.0","source":{"id":"2212.02855","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2212.02855","created_at":"2026-07-05T05:22:35Z"},{"alias_kind":"arxiv_version","alias_value":"2212.02855v1","created_at":"2026-07-05T05:22:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.02855","created_at":"2026-07-05T05:22:35Z"},{"alias_kind":"pith_short_12","alias_value":"CXBXI6B4FUNV","created_at":"2026-07-05T05:22:35Z"},{"alias_kind":"pith_short_16","alias_value":"CXBXI6B4FUNVKIM6","created_at":"2026-07-05T05:22:35Z"},{"alias_kind":"pith_short_8","alias_value":"CXBXI6B4","created_at":"2026-07-05T05:22:35Z"}],"graph_snapshots":[{"event_id":"sha256:5496e09b2d3d0e0bdd85eda1752063af9e13408ada6137ce14008e66846bce72","target":"graph","created_at":"2026-07-05T05:22:35Z","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/2212.02855/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study a general model on reusable resource allocation under model uncertainty. A heterogeneous population of customers arrive at the decision maker's (DM's) platform sequentially. Upon observing a customer's type, the DM selects an allocation decision, which leads to rewards earned and resources occupied. Each resource unit is occupied for a random duration, and the unit is available for another allocation after the usage duration. Our model captures numerous applications involving admission control and assortment planning. The DM aims to simultaneously maximize multiple types of rewards, w","authors_text":"Wang Chi Cheung, Xilin Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-12-06T09:48:10Z","title":"Online Resource Allocation for Reusable Resources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.02855","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:1df5073b83b18e25cc785763fa21932d933207f90d9692f134bd57009025ac3c","target":"record","created_at":"2026-07-05T05:22:35Z","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":"3eea3d9c29ea9acace2d655b960a2a30eb9798cdce20f819f44e7631b37a0756","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2022-12-06T09:48:10Z","title_canon_sha256":"497d714769103a584f3e6eb0177ff3bd5d359c2082cfddedf969aa2e6eda885d"},"schema_version":"1.0","source":{"id":"2212.02855","kind":"arxiv","version":1}},"canonical_sha256":"15c374783c2d1b55219eb0a4fe07ed486c908ae97fd7fb35c99497777f7c2e46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15c374783c2d1b55219eb0a4fe07ed486c908ae97fd7fb35c99497777f7c2e46","first_computed_at":"2026-07-05T05:22:35.110264Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:22:35.110264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RbAPpY4WHuuTyU1Fv8m8EdoNSsr+NsO7X4L4DiUCz0SgsfWcuuGPQMet4P8l95At8S5B9eRw0/ssFhLM80CiDw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:22:35.110601Z","signed_message":"canonical_sha256_bytes"},"source_id":"2212.02855","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1df5073b83b18e25cc785763fa21932d933207f90d9692f134bd57009025ac3c","sha256:5496e09b2d3d0e0bdd85eda1752063af9e13408ada6137ce14008e66846bce72"],"state_sha256":"cd8b6b870851fbaf3a4f84650ee60519cbb125d482a76ae6c93ef55b20595da7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xdW4DoXFa8cSc4hSSLAWKedk6lmojN0OyufFbX4SriwzrTHsQhdBaPdM7fmDKLUmx6VmfV+2cabZ6kCdI1E/Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T23:26:41.293772Z","bundle_sha256":"8852bb637270d5ce3090926f6ffa549d7af64e3a057d81073de21b49eb81b033"}}