{"id":"W3118763906","doi":"10.1007/s00453-020-00792-6","title":"Approximating the Canadian Traveller Problem with Online Randomization","year":2021,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Ministry of Science and Technology, Taiwan","keywords":"Competitive analysis; Theory of computation; Randomized algorithm; Combinatorics; Online algorithm; Deterministic algorithm; Bounded function; Time complexity; Vertex (graph theory); Upper and lower bounds; Approximation algorithm; Mathematics; Computer science; Discrete mathematics; Algorithm; Graph","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.0002943828,0.00008989537,0.0001068604,0.00005547088,0.0003788928,0.0003111318,0.0003713256,0.0000403558,0.00005406332],"category_scores_gemma":[0.0000414835,0.0000573801,0.00002763966,0.0006029952,0.00004130524,0.0002055014,0.00006078506,0.0001555947,0.00001830786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004995925,"about_ca_system_score_gemma":0.0006438374,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003061127,"about_ca_topic_score_gemma":0.034922,"domain_scores_codex":[0.9989532,0.0001170155,0.0001729521,0.0002442086,0.000246889,0.0002657888],"domain_scores_gemma":[0.9991727,0.00006600361,0.00005185702,0.0003266325,0.000249775,0.0001329622],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003904985,0.0003962362,0.0002725662,0.0000802173,0.0002476269,0.0002150328,0.01124347,0.06634855,0.000322469,0.2540124,0.006107187,0.6607152],"study_design_scores_gemma":[0.001380716,0.00002711078,0.0001121486,0.00002170212,0.000005606385,0.00005593732,0.0001049627,0.9862571,0.0005022966,0.001267763,0.0101244,0.0001401969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001863532,0.00005648841,0.9770033,0.01415957,0.00006394208,0.0003264662,0.000004911993,0.00007526507,0.008123744],"genre_scores_gemma":[0.06823082,0.00001855543,0.9272133,0.002208821,0.00008814708,0.00004295966,0.00006933363,0.00001688505,0.002111186],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9199086,"threshold_uncertainty_score":0.9826881,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01295788017039657,"score_gpt":0.2200355506260261,"score_spread":0.2070776704556295,"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."}}