{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:J7OEVCB2XQQWUPDCU7AILTPDFX","short_pith_number":"pith:J7OEVCB2","canonical_record":{"source":{"id":"1705.05755","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-16T15:10:31Z","cross_cats_sorted":[],"title_canon_sha256":"353d94fa905e25893b309bad1eeb94f29533d00403661d11c9cc4a1c0555f190","abstract_canon_sha256":"e7ef55f9b27b0473e074963cfda84fc398d6ce8edd668b10d0cf1ee97021deb7"},"schema_version":"1.0"},"canonical_sha256":"4fdc4a883abc216a3c62a7c085cde32dc89a924f0b68d8d5488f70491f6b0c7c","source":{"kind":"arxiv","id":"1705.05755","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05755","created_at":"2026-05-18T00:43:20Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05755v2","created_at":"2026-05-18T00:43:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05755","created_at":"2026-05-18T00:43:20Z"},{"alias_kind":"pith_short_12","alias_value":"J7OEVCB2XQQW","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"J7OEVCB2XQQWUPDC","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"J7OEVCB2","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:J7OEVCB2XQQWUPDCU7AILTPDFX","target":"record","payload":{"canonical_record":{"source":{"id":"1705.05755","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-16T15:10:31Z","cross_cats_sorted":[],"title_canon_sha256":"353d94fa905e25893b309bad1eeb94f29533d00403661d11c9cc4a1c0555f190","abstract_canon_sha256":"e7ef55f9b27b0473e074963cfda84fc398d6ce8edd668b10d0cf1ee97021deb7"},"schema_version":"1.0"},"canonical_sha256":"4fdc4a883abc216a3c62a7c085cde32dc89a924f0b68d8d5488f70491f6b0c7c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:20.413972Z","signature_b64":"//AQ7qfLOPdOzsKcbPmYqgBP0arYFGGX4XPXfZ5cxlQ8MGGemElPLVNYAVc+CTsVVDa9I49kpdMy6sjW4x55Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4fdc4a883abc216a3c62a7c085cde32dc89a924f0b68d8d5488f70491f6b0c7c","last_reissued_at":"2026-05-18T00:43:20.413449Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:20.413449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.05755","source_version":2,"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:43:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D0qxDlT6yDa9C7IWzvV38YH1ud2mhWS/+fsYURwTqGcFpOA/029siqPXs9iu6oUvSk0U6S6XHlMDMFO5UYHOBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:19:34.412256Z"},"content_sha256":"7850d79c45390cde22a478dbc5c9d3fee3d5ede9847f398b3a435720ebd03857","schema_version":"1.0","event_id":"sha256:7850d79c45390cde22a478dbc5c9d3fee3d5ede9847f398b3a435720ebd03857"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:J7OEVCB2XQQWUPDCU7AILTPDFX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic k-Server: How Should Uber Work?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"MohammadTaghi Hajiaghayi, Saeed Seddighin, Sina Dehghani, Soheil Ehsani, Vahid Liaghat","submitted_at":"2017-05-16T15:10:31Z","abstract_excerpt":"In this paper, we study a stochastic variant of the celebrated k-server problem. In the k-server problem, we are required to minimize the total movement of k servers that are serving an online sequence of t requests in a metric. In the stochastic setting we are given t independent distributions <P_1, P_2,..., P_t> in advance, and at every time step i a request is drawn from Pi. Designing the optimal online algorithm in such setting is NP-hard, therefore the emphasis of our work is on designing an approximately optimal online algorithm. We first show a structural characterization for a certain "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05755","kind":"arxiv","version":2},"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:43:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9NG80DINUqTfLuJkXmF98ILj6TtYRtoN43xIKSHXjpQoUjrt5Gwbl0Zx2NQoXTsE0tg/vDfrZRNX6bz9BG5XAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:19:34.412613Z"},"content_sha256":"8df24037a30be39cd69eb7905bdaac43919edfab6efa45be1468144b2cf858ec","schema_version":"1.0","event_id":"sha256:8df24037a30be39cd69eb7905bdaac43919edfab6efa45be1468144b2cf858ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J7OEVCB2XQQWUPDCU7AILTPDFX/bundle.json","state_url":"https://pith.science/pith/J7OEVCB2XQQWUPDCU7AILTPDFX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J7OEVCB2XQQWUPDCU7AILTPDFX/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-01T11:19:34Z","links":{"resolver":"https://pith.science/pith/J7OEVCB2XQQWUPDCU7AILTPDFX","bundle":"https://pith.science/pith/J7OEVCB2XQQWUPDCU7AILTPDFX/bundle.json","state":"https://pith.science/pith/J7OEVCB2XQQWUPDCU7AILTPDFX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J7OEVCB2XQQWUPDCU7AILTPDFX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:J7OEVCB2XQQWUPDCU7AILTPDFX","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":"e7ef55f9b27b0473e074963cfda84fc398d6ce8edd668b10d0cf1ee97021deb7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-16T15:10:31Z","title_canon_sha256":"353d94fa905e25893b309bad1eeb94f29533d00403661d11c9cc4a1c0555f190"},"schema_version":"1.0","source":{"id":"1705.05755","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05755","created_at":"2026-05-18T00:43:20Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05755v2","created_at":"2026-05-18T00:43:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05755","created_at":"2026-05-18T00:43:20Z"},{"alias_kind":"pith_short_12","alias_value":"J7OEVCB2XQQW","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"J7OEVCB2XQQWUPDC","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"J7OEVCB2","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:8df24037a30be39cd69eb7905bdaac43919edfab6efa45be1468144b2cf858ec","target":"graph","created_at":"2026-05-18T00:43:20Z","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":"In this paper, we study a stochastic variant of the celebrated k-server problem. In the k-server problem, we are required to minimize the total movement of k servers that are serving an online sequence of t requests in a metric. In the stochastic setting we are given t independent distributions <P_1, P_2,..., P_t> in advance, and at every time step i a request is drawn from Pi. Designing the optimal online algorithm in such setting is NP-hard, therefore the emphasis of our work is on designing an approximately optimal online algorithm. We first show a structural characterization for a certain ","authors_text":"MohammadTaghi Hajiaghayi, Saeed Seddighin, Sina Dehghani, Soheil Ehsani, Vahid Liaghat","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-16T15:10:31Z","title":"Stochastic k-Server: How Should Uber Work?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05755","kind":"arxiv","version":2},"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:7850d79c45390cde22a478dbc5c9d3fee3d5ede9847f398b3a435720ebd03857","target":"record","created_at":"2026-05-18T00:43:20Z","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":"e7ef55f9b27b0473e074963cfda84fc398d6ce8edd668b10d0cf1ee97021deb7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-16T15:10:31Z","title_canon_sha256":"353d94fa905e25893b309bad1eeb94f29533d00403661d11c9cc4a1c0555f190"},"schema_version":"1.0","source":{"id":"1705.05755","kind":"arxiv","version":2}},"canonical_sha256":"4fdc4a883abc216a3c62a7c085cde32dc89a924f0b68d8d5488f70491f6b0c7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4fdc4a883abc216a3c62a7c085cde32dc89a924f0b68d8d5488f70491f6b0c7c","first_computed_at":"2026-05-18T00:43:20.413449Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:20.413449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"//AQ7qfLOPdOzsKcbPmYqgBP0arYFGGX4XPXfZ5cxlQ8MGGemElPLVNYAVc+CTsVVDa9I49kpdMy6sjW4x55Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:20.413972Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.05755","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7850d79c45390cde22a478dbc5c9d3fee3d5ede9847f398b3a435720ebd03857","sha256:8df24037a30be39cd69eb7905bdaac43919edfab6efa45be1468144b2cf858ec"],"state_sha256":"ae1c8d86b575686b4d3d9f5688941b28fb15a278cf75ed4aeaf05afc86d604ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jz40klc5Pwo5fTjkuL6mrWUpaFbEH5ZHuZ1sFWdyYgPgDcBpAZDm5EfJxkDy67YUZwAJ1dqF4DItqp2sC9jDCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:19:34.414561Z","bundle_sha256":"06708f31bc2782dcf0b9a91d2c570d12d96cb44c144104e99e338b87d9a2c31a"}}