{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3VQJ3PWUM6EJA5IRXSBTVK3KMQ","short_pith_number":"pith:3VQJ3PWU","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"},"canonical_sha256":"dd609dbed46788907511bc833aab6a6403ddd510129df998e24da880167cf8ee","source":{"kind":"arxiv","id":"1305.2108","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.2108","created_at":"2026-05-18T03:26:09Z"},{"alias_kind":"arxiv_version","alias_value":"1305.2108v1","created_at":"2026-05-18T03:26:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2108","created_at":"2026-05-18T03:26:09Z"},{"alias_kind":"pith_short_12","alias_value":"3VQJ3PWUM6EJ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3VQJ3PWUM6EJA5IR","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3VQJ3PWU","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3VQJ3PWUM6EJA5IRXSBTVK3KMQ","target":"record","payload":{"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"},"canonical_sha256":"dd609dbed46788907511bc833aab6a6403ddd510129df998e24da880167cf8ee","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"},"source_kind":"arxiv","source_id":"1305.2108","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:26:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lt9U3cwEBQ6lt4/CKbTTPpuH+sTeoF/DMkMrspsD0WpCoIvypO6I9bqP0kzegcc10Pps/XIK4ap5h06KLiHtDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T17:13:26.779885Z"},"content_sha256":"f3218b50117cdd8001b78397da97e3bf2efb32b2f4a14475f3e1f7008f35314b","schema_version":"1.0","event_id":"sha256:f3218b50117cdd8001b78397da97e3bf2efb32b2f4a14475f3e1f7008f35314b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3VQJ3PWUM6EJA5IRXSBTVK3KMQ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:26:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FmGpYR9gbesXV0ZcTUAOM6aNyO1ZV5cVEEGVuyD31Ytd3sP5WNx9aTX+fPLQmld1MKOABJ20YKp3QXafgodOAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T17:13:26.780245Z"},"content_sha256":"ad5c3e1575e6e683a5cc05c4a7bd787220e78d12baea8ec20a6aae834658ddc9","schema_version":"1.0","event_id":"sha256:ad5c3e1575e6e683a5cc05c4a7bd787220e78d12baea8ec20a6aae834658ddc9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3VQJ3PWUM6EJA5IRXSBTVK3KMQ/bundle.json","state_url":"https://pith.science/pith/3VQJ3PWUM6EJA5IRXSBTVK3KMQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3VQJ3PWUM6EJA5IRXSBTVK3KMQ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-22T17:13:26Z","links":{"resolver":"https://pith.science/pith/3VQJ3PWUM6EJA5IRXSBTVK3KMQ","bundle":"https://pith.science/pith/3VQJ3PWUM6EJA5IRXSBTVK3KMQ/bundle.json","state":"https://pith.science/pith/3VQJ3PWUM6EJA5IRXSBTVK3KMQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3VQJ3PWUM6EJA5IRXSBTVK3KMQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3VQJ3PWUM6EJA5IRXSBTVK3KMQ","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":"1b60c96150014a88353f9f77635cdd3dc4c002c4c79672006c37409c5ad716b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-09T14:40:06Z","title_canon_sha256":"d05e1b4a41647dfcc0b6b3ef808bf7b042964427130c0d048aaa4eb8153f0463"},"schema_version":"1.0","source":{"id":"1305.2108","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.2108","created_at":"2026-05-18T03:26:09Z"},{"alias_kind":"arxiv_version","alias_value":"1305.2108v1","created_at":"2026-05-18T03:26:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2108","created_at":"2026-05-18T03:26:09Z"},{"alias_kind":"pith_short_12","alias_value":"3VQJ3PWUM6EJ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3VQJ3PWUM6EJA5IR","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3VQJ3PWU","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:ad5c3e1575e6e683a5cc05c4a7bd787220e78d12baea8ec20a6aae834658ddc9","target":"graph","created_at":"2026-05-18T03:26:09Z","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 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","authors_text":"Alejandro L\\'opez-Ortiz, Shahin Kamali, Sushmita Gupta","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-09T14:40:06Z","title":"On Advice Complexity of the k-server Problem under Sparse Metrics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2108","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:f3218b50117cdd8001b78397da97e3bf2efb32b2f4a14475f3e1f7008f35314b","target":"record","created_at":"2026-05-18T03:26:09Z","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":"1b60c96150014a88353f9f77635cdd3dc4c002c4c79672006c37409c5ad716b3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-09T14:40:06Z","title_canon_sha256":"d05e1b4a41647dfcc0b6b3ef808bf7b042964427130c0d048aaa4eb8153f0463"},"schema_version":"1.0","source":{"id":"1305.2108","kind":"arxiv","version":1}},"canonical_sha256":"dd609dbed46788907511bc833aab6a6403ddd510129df998e24da880167cf8ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd609dbed46788907511bc833aab6a6403ddd510129df998e24da880167cf8ee","first_computed_at":"2026-05-18T03:26:09.337102Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:09.337102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7io9fgl6I6w8vld1Ux6byHrdUDRO5udZlCY71l9tamuN6jaE1gdFfd185Z94D0+2oSGCU8U8bKhddFeC/O/rDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:09.337946Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.2108","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3218b50117cdd8001b78397da97e3bf2efb32b2f4a14475f3e1f7008f35314b","sha256:ad5c3e1575e6e683a5cc05c4a7bd787220e78d12baea8ec20a6aae834658ddc9"],"state_sha256":"c80f0fafb462b082ab0da5a2c35821c57bec268f2e12b559a737833f5707845a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DVsQa6TjXPK4mv8sKzm+mBJcB9J9Ms2235+/2gSA29x2PxtKtHcdogTRHvoxFQTijhlJfeyHTkk38DmygkSpAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T17:13:26.782308Z","bundle_sha256":"42e0cea5bddd04b069d97b724856b4bcecdfb26c44b94b4f21d094041647462b"}}