{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UHGN5HF75KKUT7BSE3PNUTL554","short_pith_number":"pith:UHGN5HF7","canonical_record":{"source":{"id":"1711.05764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-15T19:23:23Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"f8b8bd561752ce46640a69ac91944552aa0a072675a35971224e0d5070ec624e","abstract_canon_sha256":"ddfea5fcb3060d06f27f7a1bf59694761ddfdf2c7f6bc2654988431c07f03014"},"schema_version":"1.0"},"canonical_sha256":"a1ccde9cbfea9549fc3226deda4d7def392a05150566ed5de389a5973fd8c7f2","source":{"kind":"arxiv","id":"1711.05764","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.05764","created_at":"2026-05-18T00:30:24Z"},{"alias_kind":"arxiv_version","alias_value":"1711.05764v1","created_at":"2026-05-18T00:30:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05764","created_at":"2026-05-18T00:30:24Z"},{"alias_kind":"pith_short_12","alias_value":"UHGN5HF75KKU","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UHGN5HF75KKUT7BS","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UHGN5HF7","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UHGN5HF75KKUT7BSE3PNUTL554","target":"record","payload":{"canonical_record":{"source":{"id":"1711.05764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-15T19:23:23Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"f8b8bd561752ce46640a69ac91944552aa0a072675a35971224e0d5070ec624e","abstract_canon_sha256":"ddfea5fcb3060d06f27f7a1bf59694761ddfdf2c7f6bc2654988431c07f03014"},"schema_version":"1.0"},"canonical_sha256":"a1ccde9cbfea9549fc3226deda4d7def392a05150566ed5de389a5973fd8c7f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:24.199151Z","signature_b64":"PMZX6xSkMednLiaAVulBjwrjhxBtfx4aYKNYPCoNY47hyFimHACEAdkFXr+Sc00KDHHktpa/0PNNzx5EGlUbCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1ccde9cbfea9549fc3226deda4d7def392a05150566ed5de389a5973fd8c7f2","last_reissued_at":"2026-05-18T00:30:24.198544Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:24.198544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.05764","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:30:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3WwSB10sb/ol4Ugl0pqepGCIZLlZVc3ti22o6YVUziLEdyiUimdiYOWhH5E0azAn37pG7NL4Z2WUSFCdk70PAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T01:00:54.360373Z"},"content_sha256":"07d139c7fcddde1ceff45738eb55fc71c1639742ecbc919a3bba62dbe37ea0ac","schema_version":"1.0","event_id":"sha256:07d139c7fcddde1ceff45738eb55fc71c1639742ecbc919a3bba62dbe37ea0ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UHGN5HF75KKUT7BSE3PNUTL554","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Hossein Esfandiari, Nitish Korula, Vahab Mirrokni","submitted_at":"2017-11-15T19:23:23Z","abstract_excerpt":"Motivated by Internet advertising applications, online allocation problems have been studied extensively in various adversarial and stochastic models. While the adversarial arrival models are too pessimistic, many of the stochastic (such as i.i.d or random-order) arrival models do not realistically capture uncertainty in predictions. A significant cause for such uncertainty is the presence of unpredictable traffic spikes, often due to breaking news or similar events. To address this issue, a simultaneous approximation framework has been proposed to develop algorithms that work well both in the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05764","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:30:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wg8Kb1Ybwq6B5xozIWbf8adXFBBoTAXYsY5/GKs6YVFDAF8h3mRw0LHIjAfQikbOlqJKjeLbPkddJtQojh97BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T01:00:54.361010Z"},"content_sha256":"b903ea3169d94c32dcaa7342e46b059badd2060ca7e7981e1e448b9cf3fe9781","schema_version":"1.0","event_id":"sha256:b903ea3169d94c32dcaa7342e46b059badd2060ca7e7981e1e448b9cf3fe9781"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UHGN5HF75KKUT7BSE3PNUTL554/bundle.json","state_url":"https://pith.science/pith/UHGN5HF75KKUT7BSE3PNUTL554/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UHGN5HF75KKUT7BSE3PNUTL554/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-22T01:00:54Z","links":{"resolver":"https://pith.science/pith/UHGN5HF75KKUT7BSE3PNUTL554","bundle":"https://pith.science/pith/UHGN5HF75KKUT7BSE3PNUTL554/bundle.json","state":"https://pith.science/pith/UHGN5HF75KKUT7BSE3PNUTL554/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UHGN5HF75KKUT7BSE3PNUTL554/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UHGN5HF75KKUT7BSE3PNUTL554","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":"ddfea5fcb3060d06f27f7a1bf59694761ddfdf2c7f6bc2654988431c07f03014","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-15T19:23:23Z","title_canon_sha256":"f8b8bd561752ce46640a69ac91944552aa0a072675a35971224e0d5070ec624e"},"schema_version":"1.0","source":{"id":"1711.05764","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.05764","created_at":"2026-05-18T00:30:24Z"},{"alias_kind":"arxiv_version","alias_value":"1711.05764v1","created_at":"2026-05-18T00:30:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05764","created_at":"2026-05-18T00:30:24Z"},{"alias_kind":"pith_short_12","alias_value":"UHGN5HF75KKU","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UHGN5HF75KKUT7BS","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UHGN5HF7","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:b903ea3169d94c32dcaa7342e46b059badd2060ca7e7981e1e448b9cf3fe9781","target":"graph","created_at":"2026-05-18T00:30:24Z","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":"Motivated by Internet advertising applications, online allocation problems have been studied extensively in various adversarial and stochastic models. While the adversarial arrival models are too pessimistic, many of the stochastic (such as i.i.d or random-order) arrival models do not realistically capture uncertainty in predictions. A significant cause for such uncertainty is the presence of unpredictable traffic spikes, often due to breaking news or similar events. To address this issue, a simultaneous approximation framework has been proposed to develop algorithms that work well both in the","authors_text":"Hossein Esfandiari, Nitish Korula, Vahab Mirrokni","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-15T19:23:23Z","title":"Online Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05764","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:07d139c7fcddde1ceff45738eb55fc71c1639742ecbc919a3bba62dbe37ea0ac","target":"record","created_at":"2026-05-18T00:30:24Z","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":"ddfea5fcb3060d06f27f7a1bf59694761ddfdf2c7f6bc2654988431c07f03014","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-15T19:23:23Z","title_canon_sha256":"f8b8bd561752ce46640a69ac91944552aa0a072675a35971224e0d5070ec624e"},"schema_version":"1.0","source":{"id":"1711.05764","kind":"arxiv","version":1}},"canonical_sha256":"a1ccde9cbfea9549fc3226deda4d7def392a05150566ed5de389a5973fd8c7f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1ccde9cbfea9549fc3226deda4d7def392a05150566ed5de389a5973fd8c7f2","first_computed_at":"2026-05-18T00:30:24.198544Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:24.198544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PMZX6xSkMednLiaAVulBjwrjhxBtfx4aYKNYPCoNY47hyFimHACEAdkFXr+Sc00KDHHktpa/0PNNzx5EGlUbCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:24.199151Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.05764","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07d139c7fcddde1ceff45738eb55fc71c1639742ecbc919a3bba62dbe37ea0ac","sha256:b903ea3169d94c32dcaa7342e46b059badd2060ca7e7981e1e448b9cf3fe9781"],"state_sha256":"b9f4db01ea572c3ed766e801a94e2ea0ffc307c85bed018298be3b897c3f26f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M6MtkR6P2+B2vT6Z1KxJGyNEd4UFmCS+LbMhVtBxFrsEKdD8WnzGE4m3Brv2BsIW9foq3cbQUkaaMt3zxtwvDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T01:00:54.364614Z","bundle_sha256":"e43d9307135c74ccc7c0de70e6508dc03a732f005769b2b470ac62022e0c9efc"}}