{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002095231,0.002352049,0.004352696,0.001465586,0.003112721,0.003578861,0.005378807,0.006400881,0.01676806],"category_scores_gemma":[0.008202987,0.001057085,0.0014545,0.003170104,0.0025799,0.004710668,0.003690878,0.002783921,0.00102292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005546247,"about_ca_system_score_gemma":0.006119312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.1330462,"about_ca_topic_score_gemma":0.09470004,"domain_scores_codex":[0.9984591,0.0005384626,0.00005612814,0.0003411137,0.0001447163,0.0004603775],"domain_scores_gemma":[0.9957905,0.002612965,0.0003090379,0.0002441384,0.0002963302,0.0007471284],"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.001099902,0.0003395347,0.001455477,0.0004271207,0.0001875722,0.0004808959,0.0002423749,0.865299,0.0004343379,0.08614002,0.02349453,0.02039907],"study_design_scores_gemma":[0.0001696119,0.0001185022,0.0003641131,0.00004078769,0.0000545936,0.00007999387,0.0002607363,0.9544687,0.0001640044,0.0402975,0.003939384,0.00004203001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3916399,0.004299483,0.4707976,0.01121432,0.0008242357,0.001340207,0.005276953,0.0008997014,0.1137076],"genre_scores_gemma":[0.8844002,0.001400997,0.07497565,0.0007949595,0.0002268226,0.0003780269,0.002029651,0.0002649321,0.03552888],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.1330462,"threshold_uncertainty_score":0.2645436,"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."}}