{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:FKL5CCGEXY5J47MOK5YEQ43K3C","short_pith_number":"pith:FKL5CCGE","schema_version":"1.0","canonical_sha256":"2a97d108c4be3a9e7d8e577048736ad8992626db77f7b2df1907cb2cf7a71e21","source":{"kind":"arxiv","id":"2205.08103","version":1},"attestation_state":"computed","paper":{"title":"Deterministic 3-Server on a Circle and the Limitation of Canonical Potentials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hanwen Zhang, Zhiyi Huang","submitted_at":"2022-05-17T05:49:46Z","abstract_excerpt":"The deterministic $k$-server conjecture states that there is a $k$-competitive deterministic algorithm for the $k$-server problem for any metric space. We show that the work function algorithm is $3$-competitive for the $3$-server problem on circle metrics, a case left open by Coester and Koutsoupias (2021). Our analysis follows the existing framework but introduces a new potential function which may be viewed as a relaxation of the counterpart by Coester and Koutsoupias (2021). We further notice that the new potential function and many existing ones can be rewritten in a canonical form. Throu"},"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":"2205.08103","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2022-05-17T05:49:46Z","cross_cats_sorted":[],"title_canon_sha256":"89dfed6a7c418e853a671c1a7617ba77ff6b31c7ea884f5d23704fa583843516","abstract_canon_sha256":"bf6b486b72ff1e5355fda9cd54c6ca6a47994efe24352047e1c5e9d0072228d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:23:59.330686Z","signature_b64":"hYwRBqrvD73zJGrx9+LVPn+9xMN7dwoOhZxVC7UUJsCUTrNEZ1MwgOtUR1P8tTL0jB1uDxqWF1Qv8vz7n/zGCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a97d108c4be3a9e7d8e577048736ad8992626db77f7b2df1907cb2cf7a71e21","last_reissued_at":"2026-07-05T04:23:59.330202Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:23:59.330202Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic 3-Server on a Circle and the Limitation of Canonical Potentials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hanwen Zhang, Zhiyi Huang","submitted_at":"2022-05-17T05:49:46Z","abstract_excerpt":"The deterministic $k$-server conjecture states that there is a $k$-competitive deterministic algorithm for the $k$-server problem for any metric space. We show that the work function algorithm is $3$-competitive for the $3$-server problem on circle metrics, a case left open by Coester and Koutsoupias (2021). Our analysis follows the existing framework but introduces a new potential function which may be viewed as a relaxation of the counterpart by Coester and Koutsoupias (2021). We further notice that the new potential function and many existing ones can be rewritten in a canonical form. Throu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.08103","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.08103/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2205.08103","created_at":"2026-07-05T04:23:59.330258+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.08103v1","created_at":"2026-07-05T04:23:59.330258+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.08103","created_at":"2026-07-05T04:23:59.330258+00:00"},{"alias_kind":"pith_short_12","alias_value":"FKL5CCGEXY5J","created_at":"2026-07-05T04:23:59.330258+00:00"},{"alias_kind":"pith_short_16","alias_value":"FKL5CCGEXY5J47MO","created_at":"2026-07-05T04:23:59.330258+00:00"},{"alias_kind":"pith_short_8","alias_value":"FKL5CCGE","created_at":"2026-07-05T04:23:59.330258+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.07240","citing_title":"$k$-server-bench: Automating Potential Discovery for the $k$-Server Conjecture","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FKL5CCGEXY5J47MOK5YEQ43K3C","json":"https://pith.science/pith/FKL5CCGEXY5J47MOK5YEQ43K3C.json","graph_json":"https://pith.science/api/pith-number/FKL5CCGEXY5J47MOK5YEQ43K3C/graph.json","events_json":"https://pith.science/api/pith-number/FKL5CCGEXY5J47MOK5YEQ43K3C/events.json","paper":"https://pith.science/paper/FKL5CCGE"},"agent_actions":{"view_html":"https://pith.science/pith/FKL5CCGEXY5J47MOK5YEQ43K3C","download_json":"https://pith.science/pith/FKL5CCGEXY5J47MOK5YEQ43K3C.json","view_paper":"https://pith.science/paper/FKL5CCGE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.08103&json=true","fetch_graph":"https://pith.science/api/pith-number/FKL5CCGEXY5J47MOK5YEQ43K3C/graph.json","fetch_events":"https://pith.science/api/pith-number/FKL5CCGEXY5J47MOK5YEQ43K3C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FKL5CCGEXY5J47MOK5YEQ43K3C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FKL5CCGEXY5J47MOK5YEQ43K3C/action/storage_attestation","attest_author":"https://pith.science/pith/FKL5CCGEXY5J47MOK5YEQ43K3C/action/author_attestation","sign_citation":"https://pith.science/pith/FKL5CCGEXY5J47MOK5YEQ43K3C/action/citation_signature","submit_replication":"https://pith.science/pith/FKL5CCGEXY5J47MOK5YEQ43K3C/action/replication_record"}},"created_at":"2026-07-05T04:23:59.330258+00:00","updated_at":"2026-07-05T04:23:59.330258+00:00"}