{"id":"W2064645351","doi":"10.1016/j.disc.2010.10.005","title":"Strongly regular graphs with non-trivial automorphisms","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":42,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Automorphism; Combinatorics; Prime (order theory); Automorphism group; Strongly regular graph; Discrete mathematics; Two-graph; Order (exchange); Pathwidth; Graph; Line 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.0009748872,0.0009016349,0.001186558,0.001307556,0.00206673,0.002490503,0.001168834,0.001379059,0.005489246],"category_scores_gemma":[0.004593726,0.0008816709,0.001226912,0.001037293,0.004140807,0.005713367,0.00258354,0.002870358,0.000942916],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007770783,"about_ca_system_score_gemma":0.000564998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005094311,"about_ca_topic_score_gemma":0.0006354873,"domain_scores_codex":[0.9985521,0.000402931,0.00007283732,0.0004691109,0.0002629735,0.0002400458],"domain_scores_gemma":[0.9935573,0.002988752,0.0007074336,0.001476858,0.0005475759,0.0007220809],"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.0001121659,0.0000384531,0.0006471546,0.00004943856,0.00001957933,0.0002059186,0.000388841,0.0009124472,0.002542056,0.99079,0.0008994999,0.003394449],"study_design_scores_gemma":[0.00003349667,0.00002761972,0.000328619,0.000007659582,0.00002436268,0.0002594951,0.0001468451,0.003091698,0.00151417,0.9930068,0.001547843,0.00001140342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.75288,0.0003142736,0.1592322,0.002269866,0.000271692,0.0001068087,0.0004993763,0.0009000636,0.08352578],"genre_scores_gemma":[0.9725853,0.0001895633,0.01243184,0.0002522593,0.0001407955,0.00007621817,0.0003923673,0.000123475,0.0138082],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005489246,"threshold_uncertainty_score":0.01836342,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02602051795681323,"score_gpt":0.3024070351341039,"score_spread":0.2763865171772907,"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."}}