{"id":"W4401741676","doi":"10.1002/jgt.23166","title":"On vertex‐transitive graphs with a unique hamiltonian cycle","year":2024,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; Hamiltonian path; Cayley graph; Hamiltonian path problem; Discrete mathematics; Pancyclic graph; Vertex-transitive graph; Symmetric graph; Indifference graph; Vertex (graph theory); Transitive relation; Hamiltonian (control theory); Chordal graph; Graph; 1-planar graph; Voltage graph; Line graph","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.0009869491,0.0001542029,0.0003039078,0.0008681426,0.00005659068,0.00003044469,0.0001780136,0.00008814415,0.0001438642],"category_scores_gemma":[0.0001864074,0.00009739393,0.0002138011,0.0007599246,0.0001875435,0.00008621937,0.00001123355,0.0004879301,0.000008974507],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002756203,"about_ca_system_score_gemma":0.00009390098,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002848831,"about_ca_topic_score_gemma":0.000005418271,"domain_scores_codex":[0.9988798,0.0002062159,0.0003108723,0.0001321738,0.0002610702,0.0002098002],"domain_scores_gemma":[0.9980417,0.001458728,0.000135984,0.0001586124,0.00009990675,0.0001050102],"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.0002851073,0.0001160081,0.00005688172,0.00005320875,0.0003477803,0.0005332152,0.001124392,0.000007391592,0.0001261748,0.9932634,0.0007858356,0.003300581],"study_design_scores_gemma":[0.0004481283,0.0009347041,0.0004918012,0.0003282368,0.0001344574,0.0006339063,0.0005645328,0.00001708087,0.000489141,0.9955552,0.0002812069,0.0001216586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9712924,0.0009368837,0.01444951,0.000769462,0.0004791922,0.000110799,0.000006281765,0.00005831025,0.01189715],"genre_scores_gemma":[0.9981613,0.00007525075,0.001083173,0.0002364354,0.00004854805,0.000001995924,2.847826e-7,0.00002922013,0.000363837],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02686884,"threshold_uncertainty_score":0.3971609,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01094825979942778,"score_gpt":0.2674741695891387,"score_spread":0.2565259097897109,"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."}}