{"id":"W2950401695","doi":"10.48550/arxiv.1305.2108","title":"On Advice Complexity of the k-server Problem under Sparse Metrics","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Advice (programming); Combinatorics; Competitive analysis; Binary logarithm; Mathematics; Online algorithm; Metric space; Discrete mathematics; Upper and lower bounds; Tree (set theory); Omega; Metric (unit); Path (computing); Sequence (biology); Graph; Algorithm; Computer science; Pathwidth; Line graph","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003331192,0.0002467715,0.0002855385,0.0002879947,0.0001593338,0.0001112125,0.002890264,0.0002150488,0.0001379041],"category_scores_gemma":[0.00004648334,0.0002069431,0.0002197799,0.001467261,0.0002660351,0.0002956895,0.003011192,0.0006349807,0.0001287352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001713,"about_ca_system_score_gemma":0.0002386163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004321404,"about_ca_topic_score_gemma":0.00007222843,"domain_scores_codex":[0.9981707,0.0003051567,0.0002398152,0.0007420304,0.0002351385,0.000307162],"domain_scores_gemma":[0.9973021,0.0001524641,0.0003604312,0.001643023,0.000400715,0.0001412694],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004194634,0.00009228723,0.0003747304,0.0000462637,0.00003091481,0.000003177858,0.00006790303,0.4253162,0.000002679469,0.5732831,0.000727721,0.00005080191],"study_design_scores_gemma":[0.000348717,0.00004380397,0.002247022,0.00008271818,0.00002061781,7.365973e-7,0.00002324557,0.6842353,0.00006450254,0.3124531,0.0002454754,0.0002348112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1115353,0.0000321861,0.8603678,0.001173141,0.0007251274,0.001320853,0.00002440461,0.0003272374,0.02449389],"genre_scores_gemma":[0.9875712,0.00006181412,0.007870603,0.0003626896,0.00001538406,0.000001391194,0.000006508809,0.00001410888,0.004096315],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8760358,"threshold_uncertainty_score":0.8438897,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1632582415286409,"score_gpt":0.2140488262519795,"score_spread":0.05079058472333864,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}