{"id":"W2910174849","doi":"10.1007/s10878-019-00378-1","title":"On the randomized online strategies for the k-Canadian traveler problem","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Competitive analysis; Theory of computation; Combinatorics; Graph; Randomized algorithm; Computer science; Disjoint sets; Undirected graph; Node (physics); Online algorithm; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Mathematics; Upper and lower bounds; Mathematical optimization; Algorithm; Artificial intelligence; Physics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002273174,0.0001181439,0.0002749639,0.0001557184,0.0002897627,0.000637488,0.0008464044,0.00007681797,0.00008521537],"category_scores_gemma":[0.0003311463,0.00005906323,0.0001803544,0.0003283155,0.0000594334,0.0005816675,0.00002823462,0.0002616064,0.000006698842],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008760597,"about_ca_system_score_gemma":0.0008341489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001522575,"about_ca_topic_score_gemma":0.00007333986,"domain_scores_codex":[0.9984519,0.0002811784,0.0004799413,0.0001179264,0.0004622034,0.0002067809],"domain_scores_gemma":[0.9972491,0.001159886,0.0004182544,0.0002638216,0.000810802,0.0000981132],"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.0005278373,0.0000318792,0.00000101229,0.000003159958,0.00002510829,2.895883e-7,0.0002252638,0.4869495,0.000002420048,0.5111561,0.0008399707,0.0002374132],"study_design_scores_gemma":[0.02426916,0.0002753905,0.000004962516,0.0000301256,0.00001896262,0.000005193926,0.00008642024,0.8640991,0.00001380054,0.1088864,0.002225266,0.00008521507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002552624,0.00005741535,0.9761607,0.01623107,0.002871639,0.001477169,0.000002642236,0.00001670763,0.002927368],"genre_scores_gemma":[0.7981842,0.0002046439,0.1980821,0.002235156,0.0005826635,0.00006131876,0.00001118672,0.00003621962,0.0006024825],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7979289,"threshold_uncertainty_score":0.6147312,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0171038450377816,"score_gpt":0.2554739539877305,"score_spread":0.238370108949949,"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."}}