{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YNE7HSHSF27Z7ZBDI35DKWRBF4","short_pith_number":"pith:YNE7HSHS","schema_version":"1.0","canonical_sha256":"c349f3c8f22ebf9fe42346fa355a212f06f0b4dc9d746477e427cb26b5c3713d","source":{"kind":"arxiv","id":"1702.08474","version":1},"attestation_state":"computed","paper":{"title":"The Infinite Server Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Coester, Elias Koutsoupias, Philip Lazos","submitted_at":"2017-02-27T19:11:44Z","abstract_excerpt":"We study a variant of the $k$-server problem, the infinite server problem, in which infinitely many servers reside initially at a particular point of the metric space and serve a sequence of requests. In the framework of competitive analysis, we show a surprisingly tight connection between this problem and the $(h,k)$-server problem, in which an online algorithm with $k$ servers competes against an offline algorithm with $h$ servers. Specifically, we show that the infinite server problem has bounded competitive ratio if and only if the $(h,k)$-server problem has bounded competitive ratio for s"},"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":"1702.08474","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-27T19:11:44Z","cross_cats_sorted":[],"title_canon_sha256":"a25cd27f7718eebe202d98da096c8fa56ab333fc1456f2483fd737d30cac7038","abstract_canon_sha256":"494a99b472fa55813c939b71b9f6b6029e8e96a37aedd4439610840a0f9ce7d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:48.626296Z","signature_b64":"2dkQJDBdySREuaI1MFvM6BMyDaBu4t4e7vVcPa2EF++8qJHZIa3jMOzALUNiS2BUjDc8qmeD8zq0+oP1LI7DBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c349f3c8f22ebf9fe42346fa355a212f06f0b4dc9d746477e427cb26b5c3713d","last_reissued_at":"2026-05-18T00:49:48.625497Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:48.625497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Infinite Server Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Coester, Elias Koutsoupias, Philip Lazos","submitted_at":"2017-02-27T19:11:44Z","abstract_excerpt":"We study a variant of the $k$-server problem, the infinite server problem, in which infinitely many servers reside initially at a particular point of the metric space and serve a sequence of requests. In the framework of competitive analysis, we show a surprisingly tight connection between this problem and the $(h,k)$-server problem, in which an online algorithm with $k$ servers competes against an offline algorithm with $h$ servers. Specifically, we show that the infinite server problem has bounded competitive ratio if and only if the $(h,k)$-server problem has bounded competitive ratio for s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08474","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1702.08474","created_at":"2026-05-18T00:49:48.625633+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.08474v1","created_at":"2026-05-18T00:49:48.625633+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08474","created_at":"2026-05-18T00:49:48.625633+00:00"},{"alias_kind":"pith_short_12","alias_value":"YNE7HSHSF27Z","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"YNE7HSHSF27Z7ZBD","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"YNE7HSHS","created_at":"2026-05-18T12:31:56.362134+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/YNE7HSHSF27Z7ZBDI35DKWRBF4","json":"https://pith.science/pith/YNE7HSHSF27Z7ZBDI35DKWRBF4.json","graph_json":"https://pith.science/api/pith-number/YNE7HSHSF27Z7ZBDI35DKWRBF4/graph.json","events_json":"https://pith.science/api/pith-number/YNE7HSHSF27Z7ZBDI35DKWRBF4/events.json","paper":"https://pith.science/paper/YNE7HSHS"},"agent_actions":{"view_html":"https://pith.science/pith/YNE7HSHSF27Z7ZBDI35DKWRBF4","download_json":"https://pith.science/pith/YNE7HSHSF27Z7ZBDI35DKWRBF4.json","view_paper":"https://pith.science/paper/YNE7HSHS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.08474&json=true","fetch_graph":"https://pith.science/api/pith-number/YNE7HSHSF27Z7ZBDI35DKWRBF4/graph.json","fetch_events":"https://pith.science/api/pith-number/YNE7HSHSF27Z7ZBDI35DKWRBF4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YNE7HSHSF27Z7ZBDI35DKWRBF4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YNE7HSHSF27Z7ZBDI35DKWRBF4/action/storage_attestation","attest_author":"https://pith.science/pith/YNE7HSHSF27Z7ZBDI35DKWRBF4/action/author_attestation","sign_citation":"https://pith.science/pith/YNE7HSHSF27Z7ZBDI35DKWRBF4/action/citation_signature","submit_replication":"https://pith.science/pith/YNE7HSHSF27Z7ZBDI35DKWRBF4/action/replication_record"}},"created_at":"2026-05-18T00:49:48.625633+00:00","updated_at":"2026-05-18T00:49:48.625633+00:00"}