{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001923592,0.0002123703,0.0004643242,0.0003368805,0.0004353199,0.0007998705,0.0009811347,0.0001511675,0.0001374062],"category_scores_gemma":[0.0002520657,0.0001380112,0.0002500926,0.0003958547,0.00008854517,0.001222005,0.0000385528,0.0003389891,0.000009560694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001731172,"about_ca_system_score_gemma":0.0006198512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004308694,"about_ca_topic_score_gemma":0.00003217256,"domain_scores_codex":[0.9975368,0.0003797265,0.0008437555,0.0002348016,0.0006351356,0.0003697807],"domain_scores_gemma":[0.9964847,0.0004909182,0.0005792229,0.0003677245,0.001682378,0.0003950685],"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.0005872354,0.000304495,0.000001484389,0.000005302668,0.00007036248,0.00000237862,0.000493466,0.947393,0.000008092514,0.01888994,0.001409778,0.03083446],"study_design_scores_gemma":[0.03254154,0.0006246459,0.00001028263,0.00003011103,0.00002804741,0.00001294542,0.0000439319,0.9615598,0.00006093592,0.003938832,0.0009813634,0.0001675815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007607941,0.0000527553,0.9906677,0.004956987,0.002305147,0.001571449,0.000006968532,0.00003454835,0.0003283539],"genre_scores_gemma":[0.02033131,0.0001361288,0.9779619,0.0007358728,0.0006004316,0.00008416885,0.00002555724,0.00003126058,0.00009339024],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03195431,"threshold_uncertainty_score":0.7713169,"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."}}