{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006255764,0.0003998514,0.0003170852,0.000133141,0.0007109405,0.0003217826,0.003291271,0.0002313665,0.00001006078],"category_scores_gemma":[0.00001095583,0.0003243988,0.0002279189,0.0006932503,0.000330553,0.000398894,0.002159476,0.0009412957,0.00004721914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001439656,"about_ca_system_score_gemma":0.0002211178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001476296,"about_ca_topic_score_gemma":0.0001521278,"domain_scores_codex":[0.9976892,0.000182397,0.0002220404,0.001026195,0.0001983415,0.000681767],"domain_scores_gemma":[0.9972835,0.0001398868,0.0002642697,0.001904391,0.0001847622,0.000223171],"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.00005861013,0.0001674562,0.002527834,0.0001305598,0.0002949771,0.0003201378,0.0009406329,0.04507903,0.00001580488,0.9371675,0.0002206789,0.01307677],"study_design_scores_gemma":[0.00086039,0.0001387152,0.003574214,0.0003048842,0.0001738769,0.00005864584,0.0002279032,0.3590967,0.0001826238,0.6225035,0.01149667,0.001381902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06367926,0.0002881857,0.9285143,0.0003388697,0.0007568321,0.0004830224,0.00001064397,0.0003915855,0.005537291],"genre_scores_gemma":[0.9844102,0.0002501912,0.01420092,0.00005850978,0.000161351,0.000002717,0.000009080112,0.00002610254,0.0008809037],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9207309,"threshold_uncertainty_score":0.9999208,"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."}}