{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:J7OEVCB2XQQWUPDCU7AILTPDFX","short_pith_number":"pith:J7OEVCB2","schema_version":"1.0","canonical_sha256":"4fdc4a883abc216a3c62a7c085cde32dc89a924f0b68d8d5488f70491f6b0c7c","source":{"kind":"arxiv","id":"1705.05755","version":2},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.05755","created_at":"2026-05-18T00:43:20.413538+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.05755v2","created_at":"2026-05-18T00:43:20.413538+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05755","created_at":"2026-05-18T00:43:20.413538+00:00"},{"alias_kind":"pith_short_12","alias_value":"J7OEVCB2XQQW","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"J7OEVCB2XQQWUPDC","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"J7OEVCB2","created_at":"2026-05-18T12:31:21.493067+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J7OEVCB2XQQWUPDCU7AILTPDFX","json":"https://pith.science/pith/J7OEVCB2XQQWUPDCU7AILTPDFX.json","graph_json":"https://pith.science/api/pith-number/J7OEVCB2XQQWUPDCU7AILTPDFX/graph.json","events_json":"https://pith.science/api/pith-number/J7OEVCB2XQQWUPDCU7AILTPDFX/events.json","paper":"https://pith.science/paper/J7OEVCB2"},"agent_actions":{"view_html":"https://pith.science/pith/J7OEVCB2XQQWUPDCU7AILTPDFX","download_json":"https://pith.science/pith/J7OEVCB2XQQWUPDCU7AILTPDFX.json","view_paper":"https://pith.science/paper/J7OEVCB2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.05755&json=true","fetch_graph":"https://pith.science/api/pith-number/J7OEVCB2XQQWUPDCU7AILTPDFX/graph.json","fetch_events":"https://pith.science/api/pith-number/J7OEVCB2XQQWUPDCU7AILTPDFX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J7OEVCB2XQQWUPDCU7AILTPDFX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J7OEVCB2XQQWUPDCU7AILTPDFX/action/storage_attestation","attest_author":"https://pith.science/pith/J7OEVCB2XQQWUPDCU7AILTPDFX/action/author_attestation","sign_citation":"https://pith.science/pith/J7OEVCB2XQQWUPDCU7AILTPDFX/action/citation_signature","submit_replication":"https://pith.science/pith/J7OEVCB2XQQWUPDCU7AILTPDFX/action/replication_record"}},"created_at":"2026-05-18T00:43:20.413538+00:00","updated_at":"2026-05-18T00:43:20.413538+00:00"}