{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CSRH5C62QUVSFUMHTBHWF53FJG","short_pith_number":"pith:CSRH5C62","canonical_record":{"source":{"id":"1810.00447","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-30T18:46:15Z","cross_cats_sorted":[],"title_canon_sha256":"d622791f0048350b245c98737b7f58a24e792afb1032cc19b52682a0e33ff0fd","abstract_canon_sha256":"36db47ff0d0c7f86b59df470214ea0a5dde6c08f5bddddd5c90dc5a1ff3e3f5f"},"schema_version":"1.0"},"canonical_sha256":"14a27e8bda852b22d187984f62f76549bb238e96506452f3394912ab8abaffa4","source":{"kind":"arxiv","id":"1810.00447","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00447","created_at":"2026-05-18T00:04:27Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00447v1","created_at":"2026-05-18T00:04:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00447","created_at":"2026-05-18T00:04:27Z"},{"alias_kind":"pith_short_12","alias_value":"CSRH5C62QUVS","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"CSRH5C62QUVSFUMH","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"CSRH5C62","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CSRH5C62QUVSFUMHTBHWF53FJG","target":"record","payload":{"canonical_record":{"source":{"id":"1810.00447","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-30T18:46:15Z","cross_cats_sorted":[],"title_canon_sha256":"d622791f0048350b245c98737b7f58a24e792afb1032cc19b52682a0e33ff0fd","abstract_canon_sha256":"36db47ff0d0c7f86b59df470214ea0a5dde6c08f5bddddd5c90dc5a1ff3e3f5f"},"schema_version":"1.0"},"canonical_sha256":"14a27e8bda852b22d187984f62f76549bb238e96506452f3394912ab8abaffa4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:27.853534Z","signature_b64":"n9bGYEmFzD2sIDc4hL06uNH2y5HcAj6RBJ4AYrs8Lc4yq21geOGPrwsdX/rljuc2xjIYRaK1soZ1/1taLOOeAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14a27e8bda852b22d187984f62f76549bb238e96506452f3394912ab8abaffa4","last_reissued_at":"2026-05-18T00:04:27.853068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:27.853068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.00447","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:04:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xRvzpcxfYg6JVUMJ4L887w07Y2r8UyAjXnu7yYZdZ1jycWcAudlvRIPDnjp4zz1B8bswyYNqkEMTn6WyiC63DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:55:41.530728Z"},"content_sha256":"194b83543380643d39fe01381164dbe1accf0cce3bf848de995917a433b02051","schema_version":"1.0","event_id":"sha256:194b83543380643d39fe01381164dbe1accf0cce3bf848de995917a433b02051"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CSRH5C62QUVSFUMHTBHWF53FJG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Resource Allocation under Partially Predictable Demand","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dawsen Hwang, Patrick Jaillet, Vahideh Manshadi","submitted_at":"2018-09-30T18:46:15Z","abstract_excerpt":"For online resource allocation problems, we propose a new demand arrival model where the sequence of arrivals contains both an adversarial component and a stochastic one. Our model requires no demand forecasting; however, due to the presence of the stochastic component, we can partially predict future demand as the sequence of arrivals unfolds. Under the proposed model, we study the problem of the online allocation of a single resource to two types of customers, and design online algorithms that outperform existing ones. Our algorithms are adjustable to the relative size of the stochastic comp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00447","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:04:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hcSMWw1AOUgb9NyL4MHbK19c1ZbDJ8jkp4OEE8Te0kU1x3GM3SN2HfXY4WLvGTJ3gZogmte/Ox4LI07ocxe/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:55:41.531479Z"},"content_sha256":"741dbc842253d61ddad11fe185d9d1fc058dafe15aae3474cc3d3997da19930c","schema_version":"1.0","event_id":"sha256:741dbc842253d61ddad11fe185d9d1fc058dafe15aae3474cc3d3997da19930c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CSRH5C62QUVSFUMHTBHWF53FJG/bundle.json","state_url":"https://pith.science/pith/CSRH5C62QUVSFUMHTBHWF53FJG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CSRH5C62QUVSFUMHTBHWF53FJG/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-10T19:55:41Z","links":{"resolver":"https://pith.science/pith/CSRH5C62QUVSFUMHTBHWF53FJG","bundle":"https://pith.science/pith/CSRH5C62QUVSFUMHTBHWF53FJG/bundle.json","state":"https://pith.science/pith/CSRH5C62QUVSFUMHTBHWF53FJG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CSRH5C62QUVSFUMHTBHWF53FJG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CSRH5C62QUVSFUMHTBHWF53FJG","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":"36db47ff0d0c7f86b59df470214ea0a5dde6c08f5bddddd5c90dc5a1ff3e3f5f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-30T18:46:15Z","title_canon_sha256":"d622791f0048350b245c98737b7f58a24e792afb1032cc19b52682a0e33ff0fd"},"schema_version":"1.0","source":{"id":"1810.00447","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.00447","created_at":"2026-05-18T00:04:27Z"},{"alias_kind":"arxiv_version","alias_value":"1810.00447v1","created_at":"2026-05-18T00:04:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00447","created_at":"2026-05-18T00:04:27Z"},{"alias_kind":"pith_short_12","alias_value":"CSRH5C62QUVS","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"CSRH5C62QUVSFUMH","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"CSRH5C62","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:741dbc842253d61ddad11fe185d9d1fc058dafe15aae3474cc3d3997da19930c","target":"graph","created_at":"2026-05-18T00:04:27Z","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":"For online resource allocation problems, we propose a new demand arrival model where the sequence of arrivals contains both an adversarial component and a stochastic one. Our model requires no demand forecasting; however, due to the presence of the stochastic component, we can partially predict future demand as the sequence of arrivals unfolds. Under the proposed model, we study the problem of the online allocation of a single resource to two types of customers, and design online algorithms that outperform existing ones. Our algorithms are adjustable to the relative size of the stochastic comp","authors_text":"Dawsen Hwang, Patrick Jaillet, Vahideh Manshadi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-30T18:46:15Z","title":"Online Resource Allocation under Partially Predictable Demand"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00447","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:194b83543380643d39fe01381164dbe1accf0cce3bf848de995917a433b02051","target":"record","created_at":"2026-05-18T00:04:27Z","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":"36db47ff0d0c7f86b59df470214ea0a5dde6c08f5bddddd5c90dc5a1ff3e3f5f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-30T18:46:15Z","title_canon_sha256":"d622791f0048350b245c98737b7f58a24e792afb1032cc19b52682a0e33ff0fd"},"schema_version":"1.0","source":{"id":"1810.00447","kind":"arxiv","version":1}},"canonical_sha256":"14a27e8bda852b22d187984f62f76549bb238e96506452f3394912ab8abaffa4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14a27e8bda852b22d187984f62f76549bb238e96506452f3394912ab8abaffa4","first_computed_at":"2026-05-18T00:04:27.853068Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:27.853068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n9bGYEmFzD2sIDc4hL06uNH2y5HcAj6RBJ4AYrs8Lc4yq21geOGPrwsdX/rljuc2xjIYRaK1soZ1/1taLOOeAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:27.853534Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.00447","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:194b83543380643d39fe01381164dbe1accf0cce3bf848de995917a433b02051","sha256:741dbc842253d61ddad11fe185d9d1fc058dafe15aae3474cc3d3997da19930c"],"state_sha256":"7da7d06c9e76b7580f4acb69b4adca7997cd6f31ddb6293f699caccf9203bc52"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qf4sDqITynXb5Rz4z9Hhs8vNRID02xGLzlFJQ59R9yyTOjDrCU2+Mqs6B7iGgFGvtY8x7Aqdiput7aSYNDXzDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T19:55:41.536260Z","bundle_sha256":"43d44073e1eaa69db27d192236fe333d9362f628e6c54bef9e8c5e95f449d8ab"}}