{"id":"W2467644617","doi":"10.1007/s00224-015-9649-x","title":"On the Advice Complexity of the k-server Problem Under Sparse Metrics","year":2015,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Advice (programming); Combinatorics; Binary logarithm; Competitive analysis; Mathematics; Online algorithm; Metric space; Discrete mathematics; Upper and lower bounds; Sequence (biology); Metric (unit); Tree (set theory); Deterministic algorithm; Path (computing); Time complexity; 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.005201743,0.0001291975,0.0002546363,0.0001003392,0.0001499107,0.00007741629,0.001698079,0.00004864592,0.000005542088],"category_scores_gemma":[0.0002541686,0.00007089526,0.00008743115,0.001094182,0.0002920575,0.0001013075,0.0004787388,0.0001843123,0.00001795055],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004990389,"about_ca_system_score_gemma":0.0001356371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008796351,"about_ca_topic_score_gemma":0.000003346295,"domain_scores_codex":[0.9969565,0.001418852,0.0004640007,0.0002124105,0.000721043,0.0002272379],"domain_scores_gemma":[0.9970981,0.001034986,0.0004469299,0.0009122823,0.0004322305,0.00007542886],"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.000007275632,0.00005403702,0.00009663063,0.00004533361,0.00002152246,1.877928e-7,0.001459112,0.1347593,0.00001721017,0.8624151,0.0009310208,0.0001932283],"study_design_scores_gemma":[0.0005608909,0.0001574493,0.0007733759,0.0003131739,0.00001046113,0.00001025063,0.00077705,0.7714335,0.0003530453,0.2250131,0.0004299005,0.000167842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0726807,0.0002293192,0.8925409,0.001767954,0.00109822,0.001039974,0.000004358714,0.0001946433,0.03044391],"genre_scores_gemma":[0.9950433,0.000001114534,0.004181414,0.0002503586,0.00003345194,0.000002990459,5.720328e-7,0.000009691045,0.0004770835],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9223626,"threshold_uncertainty_score":0.3155481,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1207327124076679,"score_gpt":0.2864676065370435,"score_spread":0.1657348941293756,"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."}}