{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004965587,0.002618153,0.002417837,0.002650638,0.002532337,0.004812056,0.004849619,0.003948325,0.02548119],"category_scores_gemma":[0.02819518,0.001018488,0.00211786,0.002744766,0.00311313,0.009709008,0.004188162,0.007699446,0.005313251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005634434,"about_ca_system_score_gemma":0.004472227,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002532883,"about_ca_topic_score_gemma":0.004277325,"domain_scores_codex":[0.9921051,0.002224251,0.000280163,0.001394019,0.002591962,0.001404511],"domain_scores_gemma":[0.9769977,0.01608016,0.0009110341,0.003143579,0.001456699,0.001410839],"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.003777511,0.000770738,0.003712384,0.001282201,0.0002475919,0.0003550016,0.0006344133,0.4388163,0.01073178,0.3070493,0.07304148,0.1595812],"study_design_scores_gemma":[0.0001419926,0.0001906188,0.0005029431,0.000087501,0.00005610033,0.0001359186,0.00006268694,0.8235787,0.003270681,0.1658739,0.006068994,0.00003006605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.122992,0.004066622,0.706286,0.0138915,0.0009349555,0.0006360636,0.003353567,0.008758215,0.1390811],"genre_scores_gemma":[0.6439614,0.001268306,0.3131692,0.003331564,0.001080603,0.0007864485,0.005207826,0.002573222,0.02862143],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02548119,"threshold_uncertainty_score":0.08524311,"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."}}