{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7I2XI4FNERY7F5PLB4DS3KUWOC","short_pith_number":"pith:7I2XI4FN","schema_version":"1.0","canonical_sha256":"fa357470ad2471f2f5eb0f072daa96708091b73096ee239766d4b0d3ea15a500","source":{"kind":"arxiv","id":"1704.03318","version":2},"attestation_state":"computed","paper":{"title":"Weighted k-Server Bounds via Combinatorial Dichotomies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Grigorios Koumoutsos, Marek Elias, Nikhil Bansal","submitted_at":"2017-04-11T14:39:52Z","abstract_excerpt":"The weighted $k$-server problem is a natural generalization of the $k$-server problem where each server has a different weight. We consider the problem on uniform metrics, which corresponds to a natural generalization of paging. Our main result is a doubly exponential lower bound on the competitive ratio of any deterministic online algorithm, that essentially matches the known upper bounds for the problem and closes a large and long-standing gap.\n  The lower bound is based on relating the weighted $k$-server problem to a certain combinatorial problem and proving a Ramsey-theoretic lower bound "},"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":"1704.03318","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-11T14:39:52Z","cross_cats_sorted":[],"title_canon_sha256":"f5d6ca7613e84304ea08462bc49fdb3a7567fbff6ae1806d94e3fe53c699bb00","abstract_canon_sha256":"4d1e0e6b1586b3bd9c7c899f15fbf63bef1d9ce1e0875bae42600be436b8a4b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:51.405769Z","signature_b64":"sbgj12sSuXtDjzq86g6AaI2ZlZ1vxyqp2MCBjfUXjlVO2quGcO4KFgjQUZt7WYNapHDJ+chxeLwkJyK+W7IaDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa357470ad2471f2f5eb0f072daa96708091b73096ee239766d4b0d3ea15a500","last_reissued_at":"2026-05-18T00:35:51.405257Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:51.405257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weighted k-Server Bounds via Combinatorial Dichotomies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Grigorios Koumoutsos, Marek Elias, Nikhil Bansal","submitted_at":"2017-04-11T14:39:52Z","abstract_excerpt":"The weighted $k$-server problem is a natural generalization of the $k$-server problem where each server has a different weight. We consider the problem on uniform metrics, which corresponds to a natural generalization of paging. Our main result is a doubly exponential lower bound on the competitive ratio of any deterministic online algorithm, that essentially matches the known upper bounds for the problem and closes a large and long-standing gap.\n  The lower bound is based on relating the weighted $k$-server problem to a certain combinatorial problem and proving a Ramsey-theoretic lower bound "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03318","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":"1704.03318","created_at":"2026-05-18T00:35:51.405331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.03318v2","created_at":"2026-05-18T00:35:51.405331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03318","created_at":"2026-05-18T00:35:51.405331+00:00"},{"alias_kind":"pith_short_12","alias_value":"7I2XI4FNERY7","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7I2XI4FNERY7F5PL","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7I2XI4FN","created_at":"2026-05-18T12:31:05.417338+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/7I2XI4FNERY7F5PLB4DS3KUWOC","json":"https://pith.science/pith/7I2XI4FNERY7F5PLB4DS3KUWOC.json","graph_json":"https://pith.science/api/pith-number/7I2XI4FNERY7F5PLB4DS3KUWOC/graph.json","events_json":"https://pith.science/api/pith-number/7I2XI4FNERY7F5PLB4DS3KUWOC/events.json","paper":"https://pith.science/paper/7I2XI4FN"},"agent_actions":{"view_html":"https://pith.science/pith/7I2XI4FNERY7F5PLB4DS3KUWOC","download_json":"https://pith.science/pith/7I2XI4FNERY7F5PLB4DS3KUWOC.json","view_paper":"https://pith.science/paper/7I2XI4FN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.03318&json=true","fetch_graph":"https://pith.science/api/pith-number/7I2XI4FNERY7F5PLB4DS3KUWOC/graph.json","fetch_events":"https://pith.science/api/pith-number/7I2XI4FNERY7F5PLB4DS3KUWOC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7I2XI4FNERY7F5PLB4DS3KUWOC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7I2XI4FNERY7F5PLB4DS3KUWOC/action/storage_attestation","attest_author":"https://pith.science/pith/7I2XI4FNERY7F5PLB4DS3KUWOC/action/author_attestation","sign_citation":"https://pith.science/pith/7I2XI4FNERY7F5PLB4DS3KUWOC/action/citation_signature","submit_replication":"https://pith.science/pith/7I2XI4FNERY7F5PLB4DS3KUWOC/action/replication_record"}},"created_at":"2026-05-18T00:35:51.405331+00:00","updated_at":"2026-05-18T00:35:51.405331+00:00"}