{"id":"W7101429155","doi":"10.1007/s10107-025-02289-y","title":"A lower bound for the max entropy algorithm for TSP","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Sports injuries and prevention","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Directorate for Computer and Information Science and Engineering; National Science Foundation","keywords":"Upper and lower bounds; Conjecture; Entropy (arrow of time); Graph; Approximation algorithm; Travelling salesman problem; Graph theory","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004759211,0.000102343,0.0002182417,0.00003285765,0.0001797464,0.00006868573,0.00007509578,0.00006596947,0.0001472641],"category_scores_gemma":[0.0002506191,0.00006259925,0.0002331427,0.00009912886,0.00007470357,0.0000275706,0.00002777882,0.00008127384,0.000008285675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003105939,"about_ca_system_score_gemma":0.00003804962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002437886,"about_ca_topic_score_gemma":7.531715e-7,"domain_scores_codex":[0.9991866,0.000006387484,0.0002668676,0.0001608321,0.0001212853,0.0002580397],"domain_scores_gemma":[0.9991931,0.000403205,0.00004980344,0.0002286179,0.00007958119,0.00004569014],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001032531,0.000250338,0.00002619661,0.0005546416,0.0001354881,0.000002173626,0.0001071509,1.829568e-7,0.00003687674,0.07702827,0.003521015,0.9182344],"study_design_scores_gemma":[0.001697612,0.0004445853,0.00008284756,0.0003748644,0.0006708192,0.00001607177,0.0004367838,0.0263811,0.0004892647,0.1534169,0.8158599,0.0001293327],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001469855,0.0003591368,0.9911015,0.002963186,0.0003065985,0.002790021,0.000005551542,0.00007490185,0.0009292213],"genre_scores_gemma":[0.06016625,0.00001681041,0.9087557,0.001222207,0.000642807,0.002984635,0.00005309383,0.00005531757,0.02610323],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9181051,"threshold_uncertainty_score":0.2552724,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0186292029741697,"score_gpt":0.332336688331487,"score_spread":0.3137074853573173,"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."}}