{"id":"W2783589701","doi":"10.1016/j.disopt.2017.08.005","title":"A linear time algorithm for the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml167\" display=\"inline\" overflow=\"scroll\" altimg=\"si167.gif\"><mml:mn>3</mml:mn></mml:math>-neighbour Travelling Salesman Problem on a Halin graph and extensions","year":2017,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Travelling salesman problem; Hamiltonian path; Algorithm; Graph; Discrete mathematics","routes":{"ca_aff":true,"ca_fund":true,"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","sts"],"consensus_categories":[],"category_scores_codex":[0.00100084,0.0003917059,0.0002739925,0.0001542644,0.002051993,0.000804919,0.001260694,0.0002850931,0.000009203649],"category_scores_gemma":[0.0003261277,0.0003462219,0.0002874557,0.0003085718,0.0004523656,0.001074598,0.000597143,0.0004511661,0.00009175299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001806125,"about_ca_system_score_gemma":0.0001495544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004427515,"about_ca_topic_score_gemma":0.00002014772,"domain_scores_codex":[0.9970631,0.0001222722,0.0005112562,0.0009097264,0.0006770201,0.0007166523],"domain_scores_gemma":[0.9969477,0.0006037748,0.0005255494,0.001497247,0.0001814796,0.0002442361],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001373662,0.00007808116,0.000002881558,0.00005656667,0.0001070473,0.00003798695,0.000478996,0.0880162,0.0002918996,0.9038758,0.00007392748,0.006843215],"study_design_scores_gemma":[0.000859103,0.0003875118,0.00004268718,0.0002248715,0.00008533859,0.00006024826,0.00008626396,0.993951,0.0008261456,0.002588198,0.0005328686,0.0003557606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09048519,0.0002313863,0.9067416,0.000984285,0.000290291,0.0004499979,0.0002355001,0.0001881826,0.0003935493],"genre_scores_gemma":[0.3006951,0.001211677,0.6943742,0.0006180558,0.0006474738,0.0007759868,0.0006981443,0.0002661918,0.0007131788],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9059348,"threshold_uncertainty_score":0.999899,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02012742426041067,"score_gpt":0.2707476361752828,"score_spread":0.2506202119148722,"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."}}