{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:JL2CUKM7PQKC3AMI4PYACGZ5BX","short_pith_number":"pith:JL2CUKM7","schema_version":"1.0","canonical_sha256":"4af42a299f7c142d8188e3f0011b3d0dccb9ece18abb1cb37a51107ae7da03eb","source":{"kind":"arxiv","id":"2102.10474","version":1},"attestation_state":"computed","paper":{"title":"Towards the k-server conjecture: A unifying potential, pushing the frontier to the circle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Coester, Elias Koutsoupias","submitted_at":"2021-02-20T23:29:31Z","abstract_excerpt":"The $k$-server conjecture, first posed by Manasse, McGeoch and Sleator in 1988, states that a $k$-competitive deterministic algorithm for the $k$-server problem exists. It is conjectured that the work function algorithm (WFA) achieves this guarantee, a multi-purpose algorithm with applications to various online problems. This has been shown for several special cases: $k=2$, $(k+1)$-point metrics, $(k+2)$-point metrics, the line metric, weighted star metrics, and $k=3$ in the Manhattan plane.\n  The known proofs of these results are based on potential functions tied to each particular special ca"},"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":"2102.10474","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-02-20T23:29:31Z","cross_cats_sorted":[],"title_canon_sha256":"9b07bc4f631d8758e732ee2f902238595e8a3ad8d8d833e30eef8343f7bf465a","abstract_canon_sha256":"c7d16aee193886fce540568aabc79603b262d8201c0b61c883f4b7a0adf1b50a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:16:58.303313Z","signature_b64":"X8tkfZ7Zw18mMuhuNSuqJjSpAPdZv9b80ug0RjYNZ8gqeuOjuIvGyu2UMd+9CsGBFkOuvXG3NcRb5v+nCkUSCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4af42a299f7c142d8188e3f0011b3d0dccb9ece18abb1cb37a51107ae7da03eb","last_reissued_at":"2026-07-05T02:16:58.302818Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:16:58.302818Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards the k-server conjecture: A unifying potential, pushing the frontier to the circle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Coester, Elias Koutsoupias","submitted_at":"2021-02-20T23:29:31Z","abstract_excerpt":"The $k$-server conjecture, first posed by Manasse, McGeoch and Sleator in 1988, states that a $k$-competitive deterministic algorithm for the $k$-server problem exists. It is conjectured that the work function algorithm (WFA) achieves this guarantee, a multi-purpose algorithm with applications to various online problems. This has been shown for several special cases: $k=2$, $(k+1)$-point metrics, $(k+2)$-point metrics, the line metric, weighted star metrics, and $k=3$ in the Manhattan plane.\n  The known proofs of these results are based on potential functions tied to each particular special ca"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.10474","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/2102.10474/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":"2102.10474","created_at":"2026-07-05T02:16:58.302886+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.10474v1","created_at":"2026-07-05T02:16:58.302886+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.10474","created_at":"2026-07-05T02:16:58.302886+00:00"},{"alias_kind":"pith_short_12","alias_value":"JL2CUKM7PQKC","created_at":"2026-07-05T02:16:58.302886+00:00"},{"alias_kind":"pith_short_16","alias_value":"JL2CUKM7PQKC3AMI","created_at":"2026-07-05T02:16:58.302886+00:00"},{"alias_kind":"pith_short_8","alias_value":"JL2CUKM7","created_at":"2026-07-05T02:16:58.302886+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":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JL2CUKM7PQKC3AMI4PYACGZ5BX","json":"https://pith.science/pith/JL2CUKM7PQKC3AMI4PYACGZ5BX.json","graph_json":"https://pith.science/api/pith-number/JL2CUKM7PQKC3AMI4PYACGZ5BX/graph.json","events_json":"https://pith.science/api/pith-number/JL2CUKM7PQKC3AMI4PYACGZ5BX/events.json","paper":"https://pith.science/paper/JL2CUKM7"},"agent_actions":{"view_html":"https://pith.science/pith/JL2CUKM7PQKC3AMI4PYACGZ5BX","download_json":"https://pith.science/pith/JL2CUKM7PQKC3AMI4PYACGZ5BX.json","view_paper":"https://pith.science/paper/JL2CUKM7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.10474&json=true","fetch_graph":"https://pith.science/api/pith-number/JL2CUKM7PQKC3AMI4PYACGZ5BX/graph.json","fetch_events":"https://pith.science/api/pith-number/JL2CUKM7PQKC3AMI4PYACGZ5BX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JL2CUKM7PQKC3AMI4PYACGZ5BX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JL2CUKM7PQKC3AMI4PYACGZ5BX/action/storage_attestation","attest_author":"https://pith.science/pith/JL2CUKM7PQKC3AMI4PYACGZ5BX/action/author_attestation","sign_citation":"https://pith.science/pith/JL2CUKM7PQKC3AMI4PYACGZ5BX/action/citation_signature","submit_replication":"https://pith.science/pith/JL2CUKM7PQKC3AMI4PYACGZ5BX/action/replication_record"}},"created_at":"2026-07-05T02:16:58.302886+00:00","updated_at":"2026-07-05T02:16:58.302886+00:00"}