{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:TYURXG57MFBDRFJZ22KCDCFN4Z","short_pith_number":"pith:TYURXG57","canonical_record":{"source":{"id":"1301.0123","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-01T19:11:25Z","cross_cats_sorted":[],"title_canon_sha256":"e503dd08524e82edeec148085d1deea709d40e1c3c57be76ea9cb4fdf4a94af7","abstract_canon_sha256":"dd6cd0bb402a4a119e72ead75cfe350f07fcea83014c5c02a002dcaca2585285"},"schema_version":"1.0"},"canonical_sha256":"9e291b9bbf6142389539d6942188ade670f5259a28064b991df7398f3122c038","source":{"kind":"arxiv","id":"1301.0123","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0123","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0123v5","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0123","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"pith_short_12","alias_value":"TYURXG57MFBD","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TYURXG57MFBDRFJZ","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TYURXG57","created_at":"2026-05-18T12:28:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:TYURXG57MFBDRFJZ22KCDCFN4Z","target":"record","payload":{"canonical_record":{"source":{"id":"1301.0123","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-01T19:11:25Z","cross_cats_sorted":[],"title_canon_sha256":"e503dd08524e82edeec148085d1deea709d40e1c3c57be76ea9cb4fdf4a94af7","abstract_canon_sha256":"dd6cd0bb402a4a119e72ead75cfe350f07fcea83014c5c02a002dcaca2585285"},"schema_version":"1.0"},"canonical_sha256":"9e291b9bbf6142389539d6942188ade670f5259a28064b991df7398f3122c038","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:59:04.562338Z","signature_b64":"9BGlziHethS1WfiUDPJOLpa7xm6kh4yAidc/mWzGE7tcmYlJdFo4zmOd5QdlOFX/p2P8eTgH9KSmFPMICZviDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e291b9bbf6142389539d6942188ade670f5259a28064b991df7398f3122c038","last_reissued_at":"2026-05-18T00:59:04.561564Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:59:04.561564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.0123","source_version":5,"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:59:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ghGbMknyXttVfAh+ziE+6zt6MPouQbuaUN7TNTwLaAq3I8E/T9ePLI/BgEuv0RQw1DLTTyCooxs1GLW2Nl/SAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:00:01.559803Z"},"content_sha256":"e3f04de638672f26ca4ef784a3f5a5617037b514d89a0dd0547a0c7878e73d5f","schema_version":"1.0","event_id":"sha256:e3f04de638672f26ca4ef784a3f5a5617037b514d89a0dd0547a0c7878e73d5f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:TYURXG57MFBDRFJZ22KCDCFN4Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Randomized Memoryless Algorithms for the Weighted $k$-server Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ashish Chiplunkar, Sundar Vishwanathan","submitted_at":"2013-01-01T19:11:25Z","abstract_excerpt":"The weighted $k$-server problem is a generalization of the $k$-server problem in which the cost of moving a server of weight $\\beta_i$ through a distance $d$ is $\\beta_i\\cdot d$. The weighted server problem on uniform spaces models caching where caches have different write costs. We prove tight bounds on the performance of randomized memoryless algorithms for this problem on uniform metric spaces. We prove that there is an $\\alpha_k$-competitive memoryless algorithm for this problem, where $\\alpha_k=\\alpha_{k-1}^2+3\\alpha_{k-1}+1$; $\\alpha_1=1$. On the other hand we also prove that no randomiz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0123","kind":"arxiv","version":5},"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:59:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7m0qY/nuOAELk755m9kw36cmhQrCCC2kdL4GnS2RPN+YyY+JAvuuEsin84N7gErZP0Zl5daZaeOxLuJKFnO5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T23:00:01.560147Z"},"content_sha256":"605e95db7042cf7ced7f68914f6429af300d7c2eb202c1db59fab73db4f1b3d5","schema_version":"1.0","event_id":"sha256:605e95db7042cf7ced7f68914f6429af300d7c2eb202c1db59fab73db4f1b3d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TYURXG57MFBDRFJZ22KCDCFN4Z/bundle.json","state_url":"https://pith.science/pith/TYURXG57MFBDRFJZ22KCDCFN4Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TYURXG57MFBDRFJZ22KCDCFN4Z/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-06-21T23:00:01Z","links":{"resolver":"https://pith.science/pith/TYURXG57MFBDRFJZ22KCDCFN4Z","bundle":"https://pith.science/pith/TYURXG57MFBDRFJZ22KCDCFN4Z/bundle.json","state":"https://pith.science/pith/TYURXG57MFBDRFJZ22KCDCFN4Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TYURXG57MFBDRFJZ22KCDCFN4Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:TYURXG57MFBDRFJZ22KCDCFN4Z","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":"dd6cd0bb402a4a119e72ead75cfe350f07fcea83014c5c02a002dcaca2585285","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-01T19:11:25Z","title_canon_sha256":"e503dd08524e82edeec148085d1deea709d40e1c3c57be76ea9cb4fdf4a94af7"},"schema_version":"1.0","source":{"id":"1301.0123","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0123","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0123v5","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0123","created_at":"2026-05-18T00:59:04Z"},{"alias_kind":"pith_short_12","alias_value":"TYURXG57MFBD","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_16","alias_value":"TYURXG57MFBDRFJZ","created_at":"2026-05-18T12:28:02Z"},{"alias_kind":"pith_short_8","alias_value":"TYURXG57","created_at":"2026-05-18T12:28:02Z"}],"graph_snapshots":[{"event_id":"sha256:605e95db7042cf7ced7f68914f6429af300d7c2eb202c1db59fab73db4f1b3d5","target":"graph","created_at":"2026-05-18T00:59:04Z","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 weighted $k$-server problem is a generalization of the $k$-server problem in which the cost of moving a server of weight $\\beta_i$ through a distance $d$ is $\\beta_i\\cdot d$. The weighted server problem on uniform spaces models caching where caches have different write costs. We prove tight bounds on the performance of randomized memoryless algorithms for this problem on uniform metric spaces. We prove that there is an $\\alpha_k$-competitive memoryless algorithm for this problem, where $\\alpha_k=\\alpha_{k-1}^2+3\\alpha_{k-1}+1$; $\\alpha_1=1$. On the other hand we also prove that no randomiz","authors_text":"Ashish Chiplunkar, Sundar Vishwanathan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-01T19:11:25Z","title":"On Randomized Memoryless Algorithms for the Weighted $k$-server Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0123","kind":"arxiv","version":5},"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:e3f04de638672f26ca4ef784a3f5a5617037b514d89a0dd0547a0c7878e73d5f","target":"record","created_at":"2026-05-18T00:59:04Z","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":"dd6cd0bb402a4a119e72ead75cfe350f07fcea83014c5c02a002dcaca2585285","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-01T19:11:25Z","title_canon_sha256":"e503dd08524e82edeec148085d1deea709d40e1c3c57be76ea9cb4fdf4a94af7"},"schema_version":"1.0","source":{"id":"1301.0123","kind":"arxiv","version":5}},"canonical_sha256":"9e291b9bbf6142389539d6942188ade670f5259a28064b991df7398f3122c038","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e291b9bbf6142389539d6942188ade670f5259a28064b991df7398f3122c038","first_computed_at":"2026-05-18T00:59:04.561564Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:59:04.561564Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9BGlziHethS1WfiUDPJOLpa7xm6kh4yAidc/mWzGE7tcmYlJdFo4zmOd5QdlOFX/p2P8eTgH9KSmFPMICZviDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:59:04.562338Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.0123","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3f04de638672f26ca4ef784a3f5a5617037b514d89a0dd0547a0c7878e73d5f","sha256:605e95db7042cf7ced7f68914f6429af300d7c2eb202c1db59fab73db4f1b3d5"],"state_sha256":"cf32f91c7bd0ce00726dfe5b8fc188ae99508be723dc2d3dc9030a549f6594b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zUhLqRUg4BkttUB5VZeOAAwUKpcAJxd02GG7LKogVsnu3EACWUWBRPYX3kHISyioUnKgtZKWAsmpirN+XLhKCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T23:00:01.562100Z","bundle_sha256":"dbee4671f72dc91e717c8e8f02bb58b1cf729281290b04ada590471736c5b81f"}}