{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002582992,0.001254843,0.002097639,0.0008133345,0.001319332,0.00331962,0.003190745,0.003032533,0.01011909],"category_scores_gemma":[0.02860627,0.0005914603,0.0009884716,0.002166783,0.002242426,0.007931853,0.00263549,0.003306589,0.001409241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002731472,"about_ca_system_score_gemma":0.002174143,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005982394,"about_ca_topic_score_gemma":0.004630347,"domain_scores_codex":[0.9967151,0.001117178,0.000196606,0.000609066,0.0006097449,0.0007523182],"domain_scores_gemma":[0.9661958,0.02807957,0.001493254,0.001866571,0.00101498,0.001349704],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003618177,0.0005746771,0.009929563,0.001264812,0.0002059693,0.0005801924,0.001142325,0.6333418,0.01484389,0.2202318,0.02030334,0.09396341],"study_design_scores_gemma":[0.0001725518,0.0001199401,0.001133137,0.00002515644,0.00003913137,0.0001678209,0.000131089,0.8683017,0.001259681,0.1275646,0.001058244,0.0000268997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6802332,0.00183513,0.2786045,0.01156864,0.0001802659,0.0003471964,0.001855345,0.001696324,0.02367938],"genre_scores_gemma":[0.8789935,0.001284559,0.1077289,0.0008894687,0.0003949957,0.0004386646,0.001652627,0.0005084703,0.008108698],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01011909,"threshold_uncertainty_score":0.03385168,"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."}}