{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3VQJ3PWUM6EJA5IRXSBTVK3KMQ","short_pith_number":"pith:3VQJ3PWU","schema_version":"1.0","canonical_sha256":"dd609dbed46788907511bc833aab6a6403ddd510129df998e24da880167cf8ee","source":{"kind":"arxiv","id":"1305.2108","version":1},"attestation_state":"computed","paper":{"title":"On Advice Complexity of the k-server Problem under Sparse Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alejandro L\\'opez-Ortiz, Shahin Kamali, Sushmita Gupta","submitted_at":"2013-05-09T14:40:06Z","abstract_excerpt":"We consider the k-server problem under the advice model of computation when the underlying metric space is sparse. On one side, we show that an advice of size {\\Omega}(n) is required to obtain a 1-competitive algorithm for sequences of size n, even for the 2-server problem on a path metric of size N >= 5. Through another lower bound argument, we show that at least (n/2)(log {\\alpha} - 1.22) bits of advice is required to obtain an optimal solution for metric spaces of treewidth {\\alpha}, where 4 <= {\\alpha} < 2k. On the other side, we introduce {\\Theta}(1)-competitive algorithms for a wide rang"},"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":"1305.2108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-09T14:40:06Z","cross_cats_sorted":[],"title_canon_sha256":"d05e1b4a41647dfcc0b6b3ef808bf7b042964427130c0d048aaa4eb8153f0463","abstract_canon_sha256":"1b60c96150014a88353f9f77635cdd3dc4c002c4c79672006c37409c5ad716b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:09.337946Z","signature_b64":"7io9fgl6I6w8vld1Ux6byHrdUDRO5udZlCY71l9tamuN6jaE1gdFfd185Z94D0+2oSGCU8U8bKhddFeC/O/rDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd609dbed46788907511bc833aab6a6403ddd510129df998e24da880167cf8ee","last_reissued_at":"2026-05-18T03:26:09.337102Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:09.337102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Advice Complexity of the k-server Problem under Sparse Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alejandro L\\'opez-Ortiz, Shahin Kamali, Sushmita Gupta","submitted_at":"2013-05-09T14:40:06Z","abstract_excerpt":"We consider the k-server problem under the advice model of computation when the underlying metric space is sparse. On one side, we show that an advice of size {\\Omega}(n) is required to obtain a 1-competitive algorithm for sequences of size n, even for the 2-server problem on a path metric of size N >= 5. Through another lower bound argument, we show that at least (n/2)(log {\\alpha} - 1.22) bits of advice is required to obtain an optimal solution for metric spaces of treewidth {\\alpha}, where 4 <= {\\alpha} < 2k. On the other side, we introduce {\\Theta}(1)-competitive algorithms for a wide rang"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2108","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":""},"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":"1305.2108","created_at":"2026-05-18T03:26:09.337266+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.2108v1","created_at":"2026-05-18T03:26:09.337266+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2108","created_at":"2026-05-18T03:26:09.337266+00:00"},{"alias_kind":"pith_short_12","alias_value":"3VQJ3PWUM6EJ","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3VQJ3PWUM6EJA5IR","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3VQJ3PWU","created_at":"2026-05-18T12:27:32.513160+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/3VQJ3PWUM6EJA5IRXSBTVK3KMQ","json":"https://pith.science/pith/3VQJ3PWUM6EJA5IRXSBTVK3KMQ.json","graph_json":"https://pith.science/api/pith-number/3VQJ3PWUM6EJA5IRXSBTVK3KMQ/graph.json","events_json":"https://pith.science/api/pith-number/3VQJ3PWUM6EJA5IRXSBTVK3KMQ/events.json","paper":"https://pith.science/paper/3VQJ3PWU"},"agent_actions":{"view_html":"https://pith.science/pith/3VQJ3PWUM6EJA5IRXSBTVK3KMQ","download_json":"https://pith.science/pith/3VQJ3PWUM6EJA5IRXSBTVK3KMQ.json","view_paper":"https://pith.science/paper/3VQJ3PWU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.2108&json=true","fetch_graph":"https://pith.science/api/pith-number/3VQJ3PWUM6EJA5IRXSBTVK3KMQ/graph.json","fetch_events":"https://pith.science/api/pith-number/3VQJ3PWUM6EJA5IRXSBTVK3KMQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3VQJ3PWUM6EJA5IRXSBTVK3KMQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3VQJ3PWUM6EJA5IRXSBTVK3KMQ/action/storage_attestation","attest_author":"https://pith.science/pith/3VQJ3PWUM6EJA5IRXSBTVK3KMQ/action/author_attestation","sign_citation":"https://pith.science/pith/3VQJ3PWUM6EJA5IRXSBTVK3KMQ/action/citation_signature","submit_replication":"https://pith.science/pith/3VQJ3PWUM6EJA5IRXSBTVK3KMQ/action/replication_record"}},"created_at":"2026-05-18T03:26:09.337266+00:00","updated_at":"2026-05-18T03:26:09.337266+00:00"}