{"id":"W2153817623","doi":"10.1016/j.dam.2015.01.004","title":"Informative path planning as a maximum traveling salesman problem with submodular rewards","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Submodular set function; Mathematics; Travelling salesman problem; Greedy algorithm; Mathematical optimization; Hamiltonian path; Graph; Combinatorics","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005860931,0.0003143637,0.0003731919,0.0001142487,0.0001942102,0.0002922454,0.000950488,0.00008644669,0.000004692477],"category_scores_gemma":[0.00002377683,0.0002457613,0.00006707447,0.0005219096,0.0001238811,0.0004607337,0.0003494755,0.000291769,0.00007869601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005533762,"about_ca_system_score_gemma":0.0001561862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008771107,"about_ca_topic_score_gemma":0.000001602863,"domain_scores_codex":[0.9979901,0.00001811736,0.0004463432,0.0003561482,0.0007152397,0.0004740334],"domain_scores_gemma":[0.9985652,0.00007989936,0.0002625145,0.0007256878,0.0001203988,0.000246283],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003216083,0.0001258966,0.00003116438,0.0002628554,0.00009650222,0.00005626124,0.06780384,0.001726672,0.0001167424,0.9226139,0.0005057195,0.006628248],"study_design_scores_gemma":[0.001355446,0.0003224608,0.00004921368,0.0003529932,0.00003849546,0.0001616178,0.00741757,0.1477443,0.001595923,0.8380698,0.002105994,0.0007861848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01969956,0.00003821127,0.9130486,0.0001312116,0.00005976269,0.0005162586,0.000006201434,0.0003495529,0.06615065],"genre_scores_gemma":[0.2645402,0.000002662926,0.7350472,0.0001652533,0.00004748804,0.00008690835,0.00001652436,0.00002851761,0.0000651868],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2448407,"threshold_uncertainty_score":0.9999995,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02951044027997913,"score_gpt":0.2557570293357331,"score_spread":0.226246589055754,"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."}}