{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2OGAQA7PPAET6VAKC6CSU7XGPO","short_pith_number":"pith:2OGAQA7P","schema_version":"1.0","canonical_sha256":"d38c0803ef78093f540a17852a7ee67b9dd7d62b63fd99fc95eb81befd4ddffe","source":{"kind":"arxiv","id":"1707.04519","version":2},"attestation_state":"computed","paper":{"title":"Competitive Algorithms for Generalized k-Server in Uniform Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Grigorios Koumoutsos, Jesper Nederlof, Marek Elias, Nikhil Bansal","submitted_at":"2017-07-14T14:19:26Z","abstract_excerpt":"The generalized k-server problem is a far-reaching extension of the k-server problem with several applications. Here, each server $s_i$ lies in its own metric space $M_i$. A request is a k-tuple $r = (r_1,r_2,\\dotsc,r_k)$ and to serve it, we need to move some server $s_i$ to the point $r_i \\in M_i$, and the goal is to minimize the total distance traveled by the servers. Despite much work, no f(k)-competitive algorithm is known for the problem for k > 2 servers, even for special cases such as uniform metrics and lines.\n  Here, we consider the problem in uniform metrics and give the first f(k)-c"},"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":"1707.04519","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-14T14:19:26Z","cross_cats_sorted":[],"title_canon_sha256":"e4ae32ffe0acd56e12b2a10b27a0cd2402904a8321d11a4959686ce74ad27db8","abstract_canon_sha256":"57b6a892395e19510956f1c38d6cdb9a235cf392e1b1d94e9873667ef9c77e2c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:12.568079Z","signature_b64":"MzgYP3itQ125Bio33BVgoaAOnC/yAouwT4Qj+TJkSupVbAEI2CN5AP+CEBijkHTK+qU2acXi+k9fnmYD9415Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d38c0803ef78093f540a17852a7ee67b9dd7d62b63fd99fc95eb81befd4ddffe","last_reissued_at":"2026-05-18T00:40:12.567602Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:12.567602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Competitive Algorithms for Generalized k-Server in Uniform Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Grigorios Koumoutsos, Jesper Nederlof, Marek Elias, Nikhil Bansal","submitted_at":"2017-07-14T14:19:26Z","abstract_excerpt":"The generalized k-server problem is a far-reaching extension of the k-server problem with several applications. Here, each server $s_i$ lies in its own metric space $M_i$. A request is a k-tuple $r = (r_1,r_2,\\dotsc,r_k)$ and to serve it, we need to move some server $s_i$ to the point $r_i \\in M_i$, and the goal is to minimize the total distance traveled by the servers. Despite much work, no f(k)-competitive algorithm is known for the problem for k > 2 servers, even for special cases such as uniform metrics and lines.\n  Here, we consider the problem in uniform metrics and give the first f(k)-c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04519","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":"1707.04519","created_at":"2026-05-18T00:40:12.567673+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.04519v2","created_at":"2026-05-18T00:40:12.567673+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04519","created_at":"2026-05-18T00:40:12.567673+00:00"},{"alias_kind":"pith_short_12","alias_value":"2OGAQA7PPAET","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2OGAQA7PPAET6VAK","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2OGAQA7P","created_at":"2026-05-18T12:30:55.937587+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/2OGAQA7PPAET6VAKC6CSU7XGPO","json":"https://pith.science/pith/2OGAQA7PPAET6VAKC6CSU7XGPO.json","graph_json":"https://pith.science/api/pith-number/2OGAQA7PPAET6VAKC6CSU7XGPO/graph.json","events_json":"https://pith.science/api/pith-number/2OGAQA7PPAET6VAKC6CSU7XGPO/events.json","paper":"https://pith.science/paper/2OGAQA7P"},"agent_actions":{"view_html":"https://pith.science/pith/2OGAQA7PPAET6VAKC6CSU7XGPO","download_json":"https://pith.science/pith/2OGAQA7PPAET6VAKC6CSU7XGPO.json","view_paper":"https://pith.science/paper/2OGAQA7P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.04519&json=true","fetch_graph":"https://pith.science/api/pith-number/2OGAQA7PPAET6VAKC6CSU7XGPO/graph.json","fetch_events":"https://pith.science/api/pith-number/2OGAQA7PPAET6VAKC6CSU7XGPO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2OGAQA7PPAET6VAKC6CSU7XGPO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2OGAQA7PPAET6VAKC6CSU7XGPO/action/storage_attestation","attest_author":"https://pith.science/pith/2OGAQA7PPAET6VAKC6CSU7XGPO/action/author_attestation","sign_citation":"https://pith.science/pith/2OGAQA7PPAET6VAKC6CSU7XGPO/action/citation_signature","submit_replication":"https://pith.science/pith/2OGAQA7PPAET6VAKC6CSU7XGPO/action/replication_record"}},"created_at":"2026-05-18T00:40:12.567673+00:00","updated_at":"2026-05-18T00:40:12.567673+00:00"}