{"id":"W4390937016","doi":"10.1090/mcom/3943","title":"Few hamiltonian cycles in graphs with one or two vertex degrees","year":2024,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; Dawson College","funders":"KU Leuven; Fonds Wetenschappelijk Onderzoek; Natural Sciences and Engineering Research Council of Canada; Vlaamse regering; Japan Society for the Promotion of Science; Onderzoeksraad, KU Leuven; Vlaams Supercomputer Centrum","keywords":"Vertex (graph theory); Combinatorics; Hamiltonian (control theory); Hamiltonian path; Mathematics; Hamiltonian path problem; Graph; Mathematical optimization","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":[],"consensus_categories":[],"category_scores_codex":[0.0003058639,0.0001115108,0.0001939409,0.0003283331,0.00003549473,0.000125705,0.0002350281,0.00003077953,0.000003641072],"category_scores_gemma":[0.00002053281,0.00008096999,0.00003589554,0.0007793921,0.00004973912,0.0002319805,0.0000562784,0.00008236179,0.00001836354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000140262,"about_ca_system_score_gemma":0.00006473637,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003389254,"about_ca_topic_score_gemma":0.00007316958,"domain_scores_codex":[0.9989898,0.00002888762,0.000322264,0.0002167241,0.0002992415,0.0001430376],"domain_scores_gemma":[0.9993507,0.0002410757,0.00008063581,0.0002111268,0.00007717231,0.00003929572],"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.00001458377,0.0003782998,0.0002026408,0.0008182101,0.00006242791,0.00004108908,0.005909037,0.03626769,0.001660109,0.9148617,0.0001724113,0.03961185],"study_design_scores_gemma":[0.0002817339,0.0001020165,0.000423885,0.0006915137,0.000009622318,0.00001525481,0.00004231789,0.5963414,0.0006830192,0.4013063,0.00000594221,0.00009699925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4874356,0.0003204122,0.510788,0.0003290527,0.0001234379,0.0001847999,0.000001238056,0.0002160739,0.0006014129],"genre_scores_gemma":[0.7017906,0.000008129135,0.298138,0.00001972383,0.000001367312,0.000005641208,0.000001794245,0.000008491326,0.00002627515],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5600737,"threshold_uncertainty_score":0.330186,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03130157513689866,"score_gpt":0.2807987119287609,"score_spread":0.2494971367918623,"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."}}