{"id":"W2949571619","doi":"10.48550/arxiv.1209.3759","title":"The Maximum Traveling Salesman Problem with Submodular Rewards","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Submodular set function; Oracle; Travelling salesman problem; Combinatorics; Graph; Mathematics; Set (abstract data type); Function (biology); Computer science; Path (computing); Discrete mathematics; Mathematical optimization","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001041975,0.001130263,0.001471642,0.0006101478,0.000715645,0.001618042,0.001560933,0.001496894,0.005124745],"category_scores_gemma":[0.005295511,0.0005335827,0.0009711153,0.001492739,0.0008431282,0.003500159,0.001161806,0.001685288,0.0007068501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001537037,"about_ca_system_score_gemma":0.001287442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002258036,"about_ca_topic_score_gemma":0.002310972,"domain_scores_codex":[0.999229,0.0003138747,0.00002513962,0.0002054128,0.000105007,0.0001215617],"domain_scores_gemma":[0.998055,0.001400234,0.0002080744,0.0001284853,0.0000798542,0.0001284479],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003770287,0.0001597986,0.0009496506,0.0004781537,0.0001213299,0.0002421527,0.0001718263,0.8190449,0.001938742,0.1118139,0.009560931,0.05514161],"study_design_scores_gemma":[0.00004749552,0.0000822041,0.0002654755,0.00002128438,0.00002089443,0.0001082093,0.00006826127,0.8826164,0.00071032,0.113259,0.00278403,0.00001635047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1473201,0.001442508,0.8306248,0.00289868,0.0001733807,0.0002264974,0.001071488,0.00100506,0.01523756],"genre_scores_gemma":[0.6267762,0.001009857,0.3604945,0.000432709,0.0001762783,0.00031833,0.001082023,0.0003287514,0.009381329],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005124745,"threshold_uncertainty_score":0.01714396,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06363039629362593,"score_gpt":0.1758602718545296,"score_spread":0.1122298755609036,"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."}}