{"id":"W2043815754","doi":"10.1007/s10878-013-9634-8","title":"An optimal randomized online algorithm for the $$k$$ k -Canadian Traveller Problem on node-disjoint paths","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Competitive analysis; Randomized algorithm; Theory of computation; Disjoint sets; Online algorithm; Shortest path problem; Computer science; Node (physics); Graph; Combinatorics; Path (computing); Algorithm; Upper and lower bounds; Enhanced Data Rates for GSM Evolution; Mathematics; Discrete mathematics; Artificial intelligence; Computer network","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001611617,0.003043783,0.004240959,0.002241432,0.003483916,0.004092182,0.008950352,0.004984265,0.03419734],"category_scores_gemma":[0.007063992,0.001581797,0.001963502,0.003773784,0.002189449,0.006294255,0.004383666,0.003843785,0.004010078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007102969,"about_ca_system_score_gemma":0.01557092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.07809363,"about_ca_topic_score_gemma":0.1136943,"domain_scores_codex":[0.9977384,0.000441802,0.00008501046,0.0007772253,0.0003089671,0.0006485788],"domain_scores_gemma":[0.9955893,0.00251052,0.0002673373,0.0005688648,0.0003860119,0.0006780699],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00246409,0.001652251,0.002139628,0.001064835,0.0002558806,0.0003690659,0.0004647148,0.6432492,0.003365465,0.06828017,0.09744879,0.1792459],"study_design_scores_gemma":[0.0007145631,0.0001955137,0.0004937129,0.00005570056,0.00008055361,0.0001335437,0.0003332098,0.9432073,0.0009839021,0.04823056,0.005505507,0.00006592539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2195997,0.001707649,0.6645606,0.007444151,0.0009075918,0.0038111,0.009539356,0.009468022,0.08296183],"genre_scores_gemma":[0.4281222,0.0005730549,0.5331843,0.0009258587,0.0002003498,0.00126595,0.008317052,0.001011712,0.02639958],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.07809363,"threshold_uncertainty_score":0.1552782,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01434579864123511,"score_gpt":0.2585192954949509,"score_spread":0.2441734968537158,"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."}}