{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001148592,0.0007671768,0.0007725562,0.003254775,0.001552881,0.003241386,0.001542868,0.001073502,0.004221882],"category_scores_gemma":[0.01024776,0.0007190634,0.0009214937,0.003678874,0.003048473,0.006010366,0.003142645,0.002074995,0.0003887492],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002006415,"about_ca_system_score_gemma":0.001115052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002434838,"about_ca_topic_score_gemma":0.002532136,"domain_scores_codex":[0.997719,0.0005149401,0.0001392148,0.0005420219,0.000754785,0.0003301252],"domain_scores_gemma":[0.9829997,0.01036851,0.003023524,0.0015261,0.001167232,0.0009148144],"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.0005126089,0.0001340938,0.006789909,0.0005235079,0.0001790542,0.0006483322,0.001082268,0.03793301,0.01035821,0.8930801,0.005660306,0.04309848],"study_design_scores_gemma":[0.00004020181,0.00005732594,0.002133165,0.0001150291,0.00009601442,0.0003820755,0.0002992126,0.03500998,0.007165334,0.9418215,0.01284166,0.00003851391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7030968,0.006623578,0.2322385,0.002662428,0.000224471,0.0001580818,0.001412805,0.000746756,0.05283665],"genre_scores_gemma":[0.9630114,0.001749077,0.03138746,0.0002994621,0.0001994905,0.00006937038,0.0008525048,0.00008026793,0.002350915],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004221882,"threshold_uncertainty_score":0.0145576,"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."}}