{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2OGAQA7PPAET6VAKC6CSU7XGPO","short_pith_number":"pith:2OGAQA7P","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"},"canonical_sha256":"d38c0803ef78093f540a17852a7ee67b9dd7d62b63fd99fc95eb81befd4ddffe","source":{"kind":"arxiv","id":"1707.04519","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04519","created_at":"2026-05-18T00:40:12Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04519v2","created_at":"2026-05-18T00:40:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04519","created_at":"2026-05-18T00:40:12Z"},{"alias_kind":"pith_short_12","alias_value":"2OGAQA7PPAET","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2OGAQA7PPAET6VAK","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2OGAQA7P","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2OGAQA7PPAET6VAKC6CSU7XGPO","target":"record","payload":{"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"},"canonical_sha256":"d38c0803ef78093f540a17852a7ee67b9dd7d62b63fd99fc95eb81befd4ddffe","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"},"source_kind":"arxiv","source_id":"1707.04519","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:40:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1lMTSh2A9L1eEIE6wROGbD0jP+4rUN33/DtYrzYbTGvcW/jJUyb4AtW2RYGVNGsc7Y9N4SnMh47BB8oji1k+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:02:25.968411Z"},"content_sha256":"82b17d4852f8bb66d1710222ff3bb55b289cb16dbabe556f8284373e46a16441","schema_version":"1.0","event_id":"sha256:82b17d4852f8bb66d1710222ff3bb55b289cb16dbabe556f8284373e46a16441"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2OGAQA7PPAET6VAKC6CSU7XGPO","target":"graph","payload":{"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"},"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:40:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oosfgqP/AnIgaRDyzNWYmvUbR6jnlpsI0TzlyAcdNMw0iUvr1FBVbw21CrmasjLbB7YIlrou/tJzZgcxbFvdAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:02:25.968761Z"},"content_sha256":"10e1300331333044e5802795bed7f79cc84e3fab957058b26efb98332f245812","schema_version":"1.0","event_id":"sha256:10e1300331333044e5802795bed7f79cc84e3fab957058b26efb98332f245812"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2OGAQA7PPAET6VAKC6CSU7XGPO/bundle.json","state_url":"https://pith.science/pith/2OGAQA7PPAET6VAKC6CSU7XGPO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2OGAQA7PPAET6VAKC6CSU7XGPO/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-31T03:02:25Z","links":{"resolver":"https://pith.science/pith/2OGAQA7PPAET6VAKC6CSU7XGPO","bundle":"https://pith.science/pith/2OGAQA7PPAET6VAKC6CSU7XGPO/bundle.json","state":"https://pith.science/pith/2OGAQA7PPAET6VAKC6CSU7XGPO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2OGAQA7PPAET6VAKC6CSU7XGPO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2OGAQA7PPAET6VAKC6CSU7XGPO","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":"57b6a892395e19510956f1c38d6cdb9a235cf392e1b1d94e9873667ef9c77e2c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-14T14:19:26Z","title_canon_sha256":"e4ae32ffe0acd56e12b2a10b27a0cd2402904a8321d11a4959686ce74ad27db8"},"schema_version":"1.0","source":{"id":"1707.04519","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04519","created_at":"2026-05-18T00:40:12Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04519v2","created_at":"2026-05-18T00:40:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04519","created_at":"2026-05-18T00:40:12Z"},{"alias_kind":"pith_short_12","alias_value":"2OGAQA7PPAET","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2OGAQA7PPAET6VAK","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2OGAQA7P","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:10e1300331333044e5802795bed7f79cc84e3fab957058b26efb98332f245812","target":"graph","created_at":"2026-05-18T00:40:12Z","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":"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","authors_text":"Grigorios Koumoutsos, Jesper Nederlof, Marek Elias, Nikhil Bansal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-14T14:19:26Z","title":"Competitive Algorithms for Generalized k-Server in Uniform Metrics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04519","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:82b17d4852f8bb66d1710222ff3bb55b289cb16dbabe556f8284373e46a16441","target":"record","created_at":"2026-05-18T00:40:12Z","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":"57b6a892395e19510956f1c38d6cdb9a235cf392e1b1d94e9873667ef9c77e2c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-14T14:19:26Z","title_canon_sha256":"e4ae32ffe0acd56e12b2a10b27a0cd2402904a8321d11a4959686ce74ad27db8"},"schema_version":"1.0","source":{"id":"1707.04519","kind":"arxiv","version":2}},"canonical_sha256":"d38c0803ef78093f540a17852a7ee67b9dd7d62b63fd99fc95eb81befd4ddffe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d38c0803ef78093f540a17852a7ee67b9dd7d62b63fd99fc95eb81befd4ddffe","first_computed_at":"2026-05-18T00:40:12.567602Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:12.567602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MzgYP3itQ125Bio33BVgoaAOnC/yAouwT4Qj+TJkSupVbAEI2CN5AP+CEBijkHTK+qU2acXi+k9fnmYD9415Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:12.568079Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04519","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82b17d4852f8bb66d1710222ff3bb55b289cb16dbabe556f8284373e46a16441","sha256:10e1300331333044e5802795bed7f79cc84e3fab957058b26efb98332f245812"],"state_sha256":"3f8d8b21a180af09efabd2455a12eed4fb4639f8b505d9784bef36d6464ec880"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DmD1o5dutTaagH/pUajNY6r3c13+5HgYJXkhQKCK6j/lmXVekg3eJu1ZoKkHJo/TBNamXfyfL62jgqnbuKwTCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:02:25.970698Z","bundle_sha256":"e1816f7db2ac66ff18e9d6ed9b21362a7a408466efd22655a405fe6311dfdf76"}}