{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HQQS7FW2NMVEQD7MUTRSF6KDLL","short_pith_number":"pith:HQQS7FW2","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"},"canonical_sha256":"3c212f96da6b2a480feca4e322f9435af331361d7f47bf49834be7f3458c1f18","source":{"kind":"arxiv","id":"1608.08527","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.08527","created_at":"2026-05-18T00:46:39Z"},{"alias_kind":"arxiv_version","alias_value":"1608.08527v2","created_at":"2026-05-18T00:46:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08527","created_at":"2026-05-18T00:46:39Z"},{"alias_kind":"pith_short_12","alias_value":"HQQS7FW2NMVE","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HQQS7FW2NMVEQD7M","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HQQS7FW2","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HQQS7FW2NMVEQD7MUTRSF6KDLL","target":"record","payload":{"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"},"canonical_sha256":"3c212f96da6b2a480feca4e322f9435af331361d7f47bf49834be7f3458c1f18","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"},"source_kind":"arxiv","source_id":"1608.08527","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:46:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8CPt/aUB+hC3f5SzTLyhHDuqzkOx6jnfc2+f/iKhl9Pw0BNsXnIS83oQbwpBCQPFGTfOKyxNZt6gKe+LvYiQCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:54:04.672068Z"},"content_sha256":"3eb52f9375e77f1fc5fed292aab7abfa36002ce8c02a59bbbfdf696eadedeb62","schema_version":"1.0","event_id":"sha256:3eb52f9375e77f1fc5fed292aab7abfa36002ce8c02a59bbbfdf696eadedeb62"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HQQS7FW2NMVEQD7MUTRSF6KDLL","target":"graph","payload":{"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"},"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:46:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/K6FEyAORDFGZCSrEzeFxvjUiIxlBFp174BwpxftHLzQKaMCDgTtDkyAV+i552VNYzucaVPhuh4/NLlvGKmPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:54:04.672738Z"},"content_sha256":"5a967588630aa94fdb20d399d3ab1bf9bab054fdc55712b6f51e4fef984475d1","schema_version":"1.0","event_id":"sha256:5a967588630aa94fdb20d399d3ab1bf9bab054fdc55712b6f51e4fef984475d1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HQQS7FW2NMVEQD7MUTRSF6KDLL/bundle.json","state_url":"https://pith.science/pith/HQQS7FW2NMVEQD7MUTRSF6KDLL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HQQS7FW2NMVEQD7MUTRSF6KDLL/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-30T23:54:04Z","links":{"resolver":"https://pith.science/pith/HQQS7FW2NMVEQD7MUTRSF6KDLL","bundle":"https://pith.science/pith/HQQS7FW2NMVEQD7MUTRSF6KDLL/bundle.json","state":"https://pith.science/pith/HQQS7FW2NMVEQD7MUTRSF6KDLL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HQQS7FW2NMVEQD7MUTRSF6KDLL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HQQS7FW2NMVEQD7MUTRSF6KDLL","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":"275d1692f55337802559758cb898255a7ee4222f155aec0f9719884c17a0a97a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-30T16:01:31Z","title_canon_sha256":"3397a3a5fce5d65d92c507aa3c2ab340e2828b3d05ee550108d41bbeb9851699"},"schema_version":"1.0","source":{"id":"1608.08527","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.08527","created_at":"2026-05-18T00:46:39Z"},{"alias_kind":"arxiv_version","alias_value":"1608.08527v2","created_at":"2026-05-18T00:46:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08527","created_at":"2026-05-18T00:46:39Z"},{"alias_kind":"pith_short_12","alias_value":"HQQS7FW2NMVE","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HQQS7FW2NMVEQD7M","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HQQS7FW2","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:5a967588630aa94fdb20d399d3ab1bf9bab054fdc55712b6f51e4fef984475d1","target":"graph","created_at":"2026-05-18T00:46:39Z","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":"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","authors_text":"Grigorios Koumoutsos, {\\L}ukasz Je\\.z, Marek Eli\\'a\\v{s}, Nikhil Bansal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-30T16:01:31Z","title":"The $(h,k)$-Server Problem on Bounded Depth Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08527","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:3eb52f9375e77f1fc5fed292aab7abfa36002ce8c02a59bbbfdf696eadedeb62","target":"record","created_at":"2026-05-18T00:46:39Z","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":"275d1692f55337802559758cb898255a7ee4222f155aec0f9719884c17a0a97a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-30T16:01:31Z","title_canon_sha256":"3397a3a5fce5d65d92c507aa3c2ab340e2828b3d05ee550108d41bbeb9851699"},"schema_version":"1.0","source":{"id":"1608.08527","kind":"arxiv","version":2}},"canonical_sha256":"3c212f96da6b2a480feca4e322f9435af331361d7f47bf49834be7f3458c1f18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c212f96da6b2a480feca4e322f9435af331361d7f47bf49834be7f3458c1f18","first_computed_at":"2026-05-18T00:46:39.944124Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:39.944124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e17v9WhoBmFcBlKIcmPQh0FTPdtrhohmmXLUoxebwl4vNBvbNL22CpXFpD2voz6+BFotl33NmnshJkmPMBmAAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:39.944784Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.08527","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3eb52f9375e77f1fc5fed292aab7abfa36002ce8c02a59bbbfdf696eadedeb62","sha256:5a967588630aa94fdb20d399d3ab1bf9bab054fdc55712b6f51e4fef984475d1"],"state_sha256":"97d729536c3c5b544b7c4534496b21b77b71957f0d4c9058d20221efae8a20de"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n6ZLCv1ol78H30gZsmg22kJCHawxYh7fMEFy2IC0z9cxKApWzZ8jsu8Hrt/Jrgr6GlURV5dNmHnIPvxR8bvNDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:54:04.677370Z","bundle_sha256":"3cd5ada2f873b526f8ed121e8901a0569bd94863abc69dd1589be3c8b85babcb"}}