{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BOBWTRVD5TZRBR4COYMHP33CSI","short_pith_number":"pith:BOBWTRVD","schema_version":"1.0","canonical_sha256":"0b8369c6a3ecf310c782761877ef629227415983fc5a05daa8a0c6eea13acdb5","source":{"kind":"arxiv","id":"1810.07508","version":3},"attestation_state":"computed","paper":{"title":"$k$-Servers with a Smile: Online Algorithms via Projections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anupam Gupta, Joseph (Seffi) Naor, Marco Molinaro, Niv Buchbinder","submitted_at":"2018-10-17T12:57:51Z","abstract_excerpt":"We consider the $k$-server problem on trees and HSTs. We give an algorithm based on Bregman projections. This algorithm has a competitive ratios that match some of the recent results given by Bubeck et al. (STOC 2018), whose algorithm was based on mirror-descent-based continuous dynamics prescribed via a differential inclusion."},"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":"1810.07508","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-10-17T12:57:51Z","cross_cats_sorted":[],"title_canon_sha256":"34b41a3f0b4f0a40e5c3e996ca5c42e632cbf158e7e6c30db485410625c9ff90","abstract_canon_sha256":"65eb2de51506c65d3fdf4a95c290b9c484b1db20dff93e5af0362dc8174166b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:54.011549Z","signature_b64":"956M1yRQjcO7KWHEc2v5lHao+UDsIyEivWIxLD0PMGXbQMPovFml9hVacCuq03vS3TMfEqHkkqXrkhzmAmhzAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b8369c6a3ecf310c782761877ef629227415983fc5a05daa8a0c6eea13acdb5","last_reissued_at":"2026-05-17T23:57:54.010869Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:54.010869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$k$-Servers with a Smile: Online Algorithms via Projections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anupam Gupta, Joseph (Seffi) Naor, Marco Molinaro, Niv Buchbinder","submitted_at":"2018-10-17T12:57:51Z","abstract_excerpt":"We consider the $k$-server problem on trees and HSTs. We give an algorithm based on Bregman projections. This algorithm has a competitive ratios that match some of the recent results given by Bubeck et al. (STOC 2018), whose algorithm was based on mirror-descent-based continuous dynamics prescribed via a differential inclusion."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07508","kind":"arxiv","version":3},"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":"1810.07508","created_at":"2026-05-17T23:57:54.010972+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.07508v3","created_at":"2026-05-17T23:57:54.010972+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07508","created_at":"2026-05-17T23:57:54.010972+00:00"},{"alias_kind":"pith_short_12","alias_value":"BOBWTRVD5TZR","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"BOBWTRVD5TZRBR4C","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"BOBWTRVD","created_at":"2026-05-18T12:32:16.446611+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/BOBWTRVD5TZRBR4COYMHP33CSI","json":"https://pith.science/pith/BOBWTRVD5TZRBR4COYMHP33CSI.json","graph_json":"https://pith.science/api/pith-number/BOBWTRVD5TZRBR4COYMHP33CSI/graph.json","events_json":"https://pith.science/api/pith-number/BOBWTRVD5TZRBR4COYMHP33CSI/events.json","paper":"https://pith.science/paper/BOBWTRVD"},"agent_actions":{"view_html":"https://pith.science/pith/BOBWTRVD5TZRBR4COYMHP33CSI","download_json":"https://pith.science/pith/BOBWTRVD5TZRBR4COYMHP33CSI.json","view_paper":"https://pith.science/paper/BOBWTRVD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.07508&json=true","fetch_graph":"https://pith.science/api/pith-number/BOBWTRVD5TZRBR4COYMHP33CSI/graph.json","fetch_events":"https://pith.science/api/pith-number/BOBWTRVD5TZRBR4COYMHP33CSI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BOBWTRVD5TZRBR4COYMHP33CSI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BOBWTRVD5TZRBR4COYMHP33CSI/action/storage_attestation","attest_author":"https://pith.science/pith/BOBWTRVD5TZRBR4COYMHP33CSI/action/author_attestation","sign_citation":"https://pith.science/pith/BOBWTRVD5TZRBR4COYMHP33CSI/action/citation_signature","submit_replication":"https://pith.science/pith/BOBWTRVD5TZRBR4COYMHP33CSI/action/replication_record"}},"created_at":"2026-05-17T23:57:54.010972+00:00","updated_at":"2026-05-17T23:57:54.010972+00:00"}