{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:B44JUT3V36KWM777ESL5NFJOSJ","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":"2279dfb7e38f631f54227b52fdb84948149052f492d6fa4abdb34c9e30a48fc5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-07T16:39:34Z","title_canon_sha256":"a3ee138e1e1acee84f7fc3571a6a87a97e906612adc4448a98e373a86dd55ceb"},"schema_version":"1.0","source":{"id":"1110.1580","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.1580","created_at":"2026-05-18T04:11:29Z"},{"alias_kind":"arxiv_version","alias_value":"1110.1580v1","created_at":"2026-05-18T04:11:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.1580","created_at":"2026-05-18T04:11:29Z"},{"alias_kind":"pith_short_12","alias_value":"B44JUT3V36KW","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"B44JUT3V36KWM777","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"B44JUT3V","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:f54a1ba57d2016965dfa406d34dfece11e50b801b690926d55f0aac532aa9fae","target":"graph","created_at":"2026-05-18T04:11:29Z","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 give the first polylogarithmic-competitive randomized online algorithm for the $k$-server problem on an arbitrary finite metric space. In particular, our algorithm achieves a competitive ratio of O(log^3 n log^2 k log log n) for any metric space on n points. Our algorithm improves upon the deterministic (2k-1)-competitive algorithm of Koutsoupias and Papadimitriou [J.ACM'95] whenever n is sub-exponential in k.","authors_text":"Aleksander Madry, Joseph (Seffi) Naor, Nikhil Bansal, Niv Buchbinder","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-07T16:39:34Z","title":"A Polylogarithmic-Competitive Algorithm for the k-Server Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.1580","kind":"arxiv","version":1},"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:1aa4e6bf0af54d187b827347869dedbace1ff0c0ad8da93464a52195116534b0","target":"record","created_at":"2026-05-18T04:11:29Z","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":"2279dfb7e38f631f54227b52fdb84948149052f492d6fa4abdb34c9e30a48fc5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-10-07T16:39:34Z","title_canon_sha256":"a3ee138e1e1acee84f7fc3571a6a87a97e906612adc4448a98e373a86dd55ceb"},"schema_version":"1.0","source":{"id":"1110.1580","kind":"arxiv","version":1}},"canonical_sha256":"0f389a4f75df95667fff2497d6952e924a27050a9535b5b9009e04f93cf4b9fe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f389a4f75df95667fff2497d6952e924a27050a9535b5b9009e04f93cf4b9fe","first_computed_at":"2026-05-18T04:11:29.693421Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:29.693421Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KW068FumLKsqlzMSsIJ3+dS0URs/tvxUlDqS1i2A4miiZ/n/zLpDc/mfXWkGnKpExFobvlxuuSEtTe6GjLQiBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:29.694162Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.1580","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1aa4e6bf0af54d187b827347869dedbace1ff0c0ad8da93464a52195116534b0","sha256:f54a1ba57d2016965dfa406d34dfece11e50b801b690926d55f0aac532aa9fae"],"state_sha256":"7fea77a375c2fcaf277f7106360ab8f37486d8fd0a73244cc999981f893fd3ae"}