{"id":"W2513559281","doi":"10.1007/s10878-016-0079-8","title":"On the online multi-agent O–D k-Canadian Traveler Problem","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Disjoint sets; Computer science; Focus (optics); Theory of computation; Graph; A priori and a posteriori; Enhanced Data Rates for GSM Evolution; Node (physics); Competitive analysis; Combinatorics; Theoretical computer science; Mathematics; Upper and lower bounds; Artificial intelligence; Algorithm","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.0007865075,0.0001239515,0.0001604186,0.0002612429,0.0001684411,0.0001645323,0.0007708304,0.00007956372,0.0001484799],"category_scores_gemma":[0.0003298381,0.0000645117,0.00009213024,0.0003893455,0.00003875685,0.0005713632,0.00004481897,0.0001802828,0.00002361356],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000193996,"about_ca_system_score_gemma":0.0004204594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005531016,"about_ca_topic_score_gemma":0.00002929815,"domain_scores_codex":[0.9984496,0.0002102844,0.0004589932,0.0001444059,0.0004883524,0.0002483226],"domain_scores_gemma":[0.9983208,0.0001710736,0.0003329489,0.0002678982,0.000654121,0.0002532123],"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.00005108828,0.0005281401,0.00008963898,0.000006240188,0.00005147401,0.00002130995,0.000508977,0.3671167,0.0001986145,0.6108127,0.008053963,0.01256119],"study_design_scores_gemma":[0.009646433,0.001892218,0.0005749047,0.0004032884,0.00003258165,0.00007472614,0.00006062583,0.9077303,0.0008676885,0.05124253,0.02684935,0.0006253157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004749407,0.00002036248,0.9793867,0.01695171,0.002026623,0.0002498068,0.000003741915,0.00002372003,0.0008624191],"genre_scores_gemma":[0.5095323,0.0003163874,0.4867649,0.001877391,0.0005367285,0.00001075854,0.000004376613,0.00003950434,0.0009176325],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5595701,"threshold_uncertainty_score":0.2630711,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02635618243659009,"score_gpt":0.2547440991462963,"score_spread":0.2283879167097062,"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."}}