{"id":"W2802261039","doi":"10.1016/j.tcs.2018.04.022","title":"Approximation and complexity of multi-target graph search and the Canadian traveler problem","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Graph; Computer science; Approximation algorithm; Theoretical computer science; Mathematics; Combinatorics; Mathematical optimization","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.002848628,0.0001008026,0.0001499656,0.0001998472,0.0007637733,0.0004148422,0.0009633523,0.00003657165,0.00001925594],"category_scores_gemma":[0.00004764365,0.00006473534,0.00002069783,0.0008360131,0.01851522,0.0003748566,0.0004920376,0.0001430085,0.000005293011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002413158,"about_ca_system_score_gemma":0.0002182996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001637433,"about_ca_topic_score_gemma":0.001130682,"domain_scores_codex":[0.9983476,0.0002117827,0.0002007489,0.000394736,0.0004535375,0.0003915755],"domain_scores_gemma":[0.9988157,0.00009175914,0.00003467352,0.0003648129,0.0003803428,0.0003127034],"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.000006015096,0.00001480636,0.00007908883,0.000009140515,0.000001908757,3.666281e-7,0.002486381,0.00008869741,0.00004606444,0.9895151,0.000006148705,0.007746309],"study_design_scores_gemma":[0.0004423114,0.00008999603,0.001912737,0.00001035261,0.000001196689,0.00001113323,0.000009974909,0.8110456,0.0006615383,0.1857266,0.00001541463,0.0000731679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007786032,0.00002156321,0.9858069,0.003666954,0.00006709625,0.0003793469,0.000002004807,0.00003373934,0.002236325],"genre_scores_gemma":[0.6358315,0.000004137371,0.3638827,0.0002561319,0.00001533189,0.000003409607,3.691497e-7,0.000002251225,0.000004179833],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8109569,"threshold_uncertainty_score":0.9841558,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03937901021381209,"score_gpt":0.27466528492848,"score_spread":0.235286274714668,"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."}}