{"id":"W1993464679","doi":"10.1016/j.jda.2006.03.004","title":"On the probabilistic behaviour of a heuristic algorithm for maximal Hamiltonian tours","year":2006,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Queen's University","funders":"","keywords":"Heuristics; Travelling salesman problem; Heuristic; Consistent heuristic; Mathematics; Null-move heuristic; Algorithm; Mathematical optimization; Probabilistic logic; Matching (statistics); Set (abstract data type); Hamiltonian (control theory); Combinatorics; Computer science; Search algorithm; Incremental heuristic search","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":[],"consensus_categories":[],"category_scores_codex":[0.0006867942,0.0001416856,0.0002362637,0.0001701046,0.0001321013,0.00009943222,0.0005244955,0.0000468128,0.000009047376],"category_scores_gemma":[0.0001350913,0.00009381625,0.0002189135,0.0003404585,0.00006052176,0.0002304383,0.00005311559,0.0001592267,0.000002239391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005296413,"about_ca_system_score_gemma":0.0001566171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001781598,"about_ca_topic_score_gemma":0.000003964301,"domain_scores_codex":[0.9984437,0.00007932357,0.0005754763,0.000176597,0.0005208097,0.0002040837],"domain_scores_gemma":[0.9982637,0.0004656183,0.0005148775,0.0002317269,0.0004578073,0.00006631137],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001637238,0.001478577,0.0003134994,0.00009994859,0.0002581569,0.0001342512,0.0006988792,0.07162286,0.001809543,0.4083613,0.02250918,0.4925501],"study_design_scores_gemma":[0.00159208,0.002247471,0.01320983,0.0001304614,0.0001106205,0.0002789754,0.00006075991,0.7602439,0.003263117,0.2172988,0.001225591,0.0003384062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02544626,0.0001880126,0.9716367,0.001697359,0.0005618809,0.0002696335,0.00003633871,0.00001231597,0.0001515394],"genre_scores_gemma":[0.6783066,0.000006744366,0.3206366,0.0001359978,0.0005787608,0.00001761213,0.00001032481,0.00001410317,0.0002932443],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.688621,"threshold_uncertainty_score":0.3825715,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01273892851071396,"score_gpt":0.2494105867855291,"score_spread":0.2366716582748151,"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."}}