{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HQQS7FW2NMVEQD7MUTRSF6KDLL","short_pith_number":"pith:HQQS7FW2","schema_version":"1.0","canonical_sha256":"3c212f96da6b2a480feca4e322f9435af331361d7f47bf49834be7f3458c1f18","source":{"kind":"arxiv","id":"1608.08527","version":2},"attestation_state":"computed","paper":{"title":"The $(h,k)$-Server Problem on Bounded Depth Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Grigorios Koumoutsos, {\\L}ukasz Je\\.z, Marek Eli\\'a\\v{s}, Nikhil Bansal","submitted_at":"2016-08-30T16:01:31Z","abstract_excerpt":"We study the $k$-server problem in the resource augmentation setting i.e., when the performance of the online algorithm with $k$ servers is compared to the offline optimal solution with $h \\leq k$ servers. The problem is very poorly understood beyond uniform metrics. For this special case, the classic $k$-server algorithms are roughly $(1+1/\\epsilon)$-competitive when $k=(1+\\epsilon) h$, for any $\\epsilon >0$. Surprisingly however, no $o(h)$-competitive algorithm is known even for HSTs of depth 2 and even when $k/h$ is arbitrarily large.\n  We obtain several new results for the problem. First w"},"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":"1608.08527","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-30T16:01:31Z","cross_cats_sorted":[],"title_canon_sha256":"3397a3a5fce5d65d92c507aa3c2ab340e2828b3d05ee550108d41bbeb9851699","abstract_canon_sha256":"275d1692f55337802559758cb898255a7ee4222f155aec0f9719884c17a0a97a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:39.944784Z","signature_b64":"e17v9WhoBmFcBlKIcmPQh0FTPdtrhohmmXLUoxebwl4vNBvbNL22CpXFpD2voz6+BFotl33NmnshJkmPMBmAAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c212f96da6b2a480feca4e322f9435af331361d7f47bf49834be7f3458c1f18","last_reissued_at":"2026-05-18T00:46:39.944124Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:39.944124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The $(h,k)$-Server Problem on Bounded Depth Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Grigorios Koumoutsos, {\\L}ukasz Je\\.z, Marek Eli\\'a\\v{s}, Nikhil Bansal","submitted_at":"2016-08-30T16:01:31Z","abstract_excerpt":"We study the $k$-server problem in the resource augmentation setting i.e., when the performance of the online algorithm with $k$ servers is compared to the offline optimal solution with $h \\leq k$ servers. The problem is very poorly understood beyond uniform metrics. For this special case, the classic $k$-server algorithms are roughly $(1+1/\\epsilon)$-competitive when $k=(1+\\epsilon) h$, for any $\\epsilon >0$. Surprisingly however, no $o(h)$-competitive algorithm is known even for HSTs of depth 2 and even when $k/h$ is arbitrarily large.\n  We obtain several new results for the problem. First w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08527","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":"1608.08527","created_at":"2026-05-18T00:46:39.944215+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.08527v2","created_at":"2026-05-18T00:46:39.944215+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08527","created_at":"2026-05-18T00:46:39.944215+00:00"},{"alias_kind":"pith_short_12","alias_value":"HQQS7FW2NMVE","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HQQS7FW2NMVEQD7M","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HQQS7FW2","created_at":"2026-05-18T12:30:19.053100+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/HQQS7FW2NMVEQD7MUTRSF6KDLL","json":"https://pith.science/pith/HQQS7FW2NMVEQD7MUTRSF6KDLL.json","graph_json":"https://pith.science/api/pith-number/HQQS7FW2NMVEQD7MUTRSF6KDLL/graph.json","events_json":"https://pith.science/api/pith-number/HQQS7FW2NMVEQD7MUTRSF6KDLL/events.json","paper":"https://pith.science/paper/HQQS7FW2"},"agent_actions":{"view_html":"https://pith.science/pith/HQQS7FW2NMVEQD7MUTRSF6KDLL","download_json":"https://pith.science/pith/HQQS7FW2NMVEQD7MUTRSF6KDLL.json","view_paper":"https://pith.science/paper/HQQS7FW2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.08527&json=true","fetch_graph":"https://pith.science/api/pith-number/HQQS7FW2NMVEQD7MUTRSF6KDLL/graph.json","fetch_events":"https://pith.science/api/pith-number/HQQS7FW2NMVEQD7MUTRSF6KDLL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HQQS7FW2NMVEQD7MUTRSF6KDLL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HQQS7FW2NMVEQD7MUTRSF6KDLL/action/storage_attestation","attest_author":"https://pith.science/pith/HQQS7FW2NMVEQD7MUTRSF6KDLL/action/author_attestation","sign_citation":"https://pith.science/pith/HQQS7FW2NMVEQD7MUTRSF6KDLL/action/citation_signature","submit_replication":"https://pith.science/pith/HQQS7FW2NMVEQD7MUTRSF6KDLL/action/replication_record"}},"created_at":"2026-05-18T00:46:39.944215+00:00","updated_at":"2026-05-18T00:46:39.944215+00:00"}