{"id":"W2594692962","doi":"10.1016/j.jcta.2013.05.008","title":"There is no upper bound for the diameter of the commuting graph of a finite group","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":49,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Australian Research Council; Banff International Research Station for Mathematical Innovation and Discovery","keywords":"Mathematics; Combinatorics; Graph; Upper and lower bounds; Construct (python library); Finite group; Group (periodic table); Discrete mathematics; Mathematical analysis; Computer science","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004636513,0.0002165629,0.0005997299,0.0001149662,0.0002765266,0.00008875345,0.001297348,0.0001350949,0.0006265545],"category_scores_gemma":[0.004364543,0.00011101,0.0006683231,0.0003205707,0.0007648302,0.0003664905,0.0002276855,0.0005429724,0.000005475429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003689633,"about_ca_system_score_gemma":0.00009589845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001445883,"about_ca_topic_score_gemma":0.000001666129,"domain_scores_codex":[0.9970364,0.0008508119,0.001000646,0.000114333,0.0006630066,0.0003347795],"domain_scores_gemma":[0.9851,0.0116954,0.001262965,0.0007478438,0.001125613,0.00006816872],"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.001635542,0.0003028323,0.0006318419,0.0002793593,0.0005328615,0.000001049671,0.003498613,0.000002601528,0.005348369,0.9838638,0.00308081,0.0008222837],"study_design_scores_gemma":[0.001531713,0.000925072,0.0002935744,0.0002403331,0.0001279161,0.00001819804,0.002204606,0.00003709363,0.008843388,0.9824258,0.003231693,0.0001205897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9822136,0.0009446777,0.00414484,0.001751467,0.005471825,0.001874268,0.00006602775,0.00001969771,0.003513569],"genre_scores_gemma":[0.9971184,0.00006617898,0.001657509,0.0001188492,0.0003847987,0.00003367648,4.309867e-7,0.00005499999,0.0005651301],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0149048,"threshold_uncertainty_score":0.6860332,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03221502957088206,"score_gpt":0.2928860373630313,"score_spread":0.2606710077921492,"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."}}