{"id":"W4412042334","doi":"10.1112/blms.70134","title":"Longest cycles in vertex‐transitive and highly connected graphs","year":2025,"lang":"en","type":"article","venue":"Bulletin of the London Mathematical Society","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Mathematics; Transitive relation; Vertex (graph theory); Combinatorics; Graph","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.0006476442,0.0001415979,0.0002860864,0.00004853736,0.00009884941,0.00004077975,0.000835144,0.0000949477,0.0000301493],"category_scores_gemma":[0.0003352851,0.00009969228,0.0001704379,0.0005943709,0.0005145003,0.00003624438,0.0004856341,0.0002803201,0.000007371004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003031951,"about_ca_system_score_gemma":0.00003294386,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000177779,"about_ca_topic_score_gemma":0.000003876002,"domain_scores_codex":[0.9986289,0.0001952765,0.000291994,0.0003095285,0.0002849868,0.0002893419],"domain_scores_gemma":[0.998019,0.00126193,0.00006511446,0.0005169868,0.00008422726,0.00005277405],"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.00002317735,0.0001803259,0.0008147592,0.0002491874,0.0000521959,0.000002852703,0.000989309,0.00001722752,0.002335282,0.9917131,0.001945809,0.00167674],"study_design_scores_gemma":[0.00102387,0.00004529622,0.007094101,0.0003850568,0.0000151959,0.000006890668,0.0002380094,0.007158257,0.01071486,0.9720789,0.001063212,0.0001764057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8296466,0.001283138,0.1048923,0.04857337,0.0001911821,0.001344766,0.00001126339,0.0001964394,0.01386087],"genre_scores_gemma":[0.9743379,0.0001167755,0.02401448,0.0007294717,0.000004748847,0.00003323951,3.925376e-7,0.00001059497,0.000752372],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1446913,"threshold_uncertainty_score":0.4065333,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009607886391988337,"score_gpt":0.2566998037470482,"score_spread":0.2470919173550599,"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."}}