{"id":"W4406141787","doi":"10.1137/1.9781611978322.34","title":"Approximating Traveling Salesman Problems Using a Bridge Lemma","year":2025,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Travelling salesman problem; Lemma (botany); Bridge (graph theory); Computer science; Mathematics; Mathematical optimization; Biology; Botany; Anatomy","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.003936991,0.0005602564,0.001173627,0.0001531574,0.0009741014,0.0005580594,0.0005550124,0.001074065,0.00002445547],"category_scores_gemma":[0.0005385333,0.0004736101,0.0009677867,0.00009853322,0.0003152231,0.00004465435,0.0002778938,0.0008884484,0.0000127812],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008755678,"about_ca_system_score_gemma":0.0004557978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000749043,"about_ca_topic_score_gemma":0.000003585074,"domain_scores_codex":[0.9959908,0.00001143524,0.001675247,0.0008687571,0.0009184245,0.0005353861],"domain_scores_gemma":[0.9959914,0.001842527,0.001124265,0.0006095966,0.0002639775,0.0001682368],"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.00001703996,0.00003655836,6.320384e-7,0.0003374258,0.0004507717,4.269905e-7,0.0026309,0.0002992797,0.0003955,0.9558407,0.004540705,0.03545008],"study_design_scores_gemma":[0.001472763,0.00003866963,1.091809e-7,0.000932146,0.0006967338,0.0000112137,0.000769084,0.03230785,0.0001945292,0.9298136,0.03307293,0.0006904108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.002526739,0.0003237078,0.2861085,0.0002297635,0.0009799538,0.00484919,0.0006609237,0.0003583926,0.7039629],"genre_scores_gemma":[0.007586248,0.00002104709,0.4376947,0.0002630603,0.00226071,0.0002533942,0.0001008134,0.0002213619,0.5515986],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.1523643,"threshold_uncertainty_score":0.9997715,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.3603334120662399,"score_gpt":0.3621988861380646,"score_spread":0.001865474071824691,"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."}}