{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001280981,0.0004466223,0.000612033,0.0002566801,0.0002408486,0.0001787252,0.0008471371,0.0002437794,0.0006796169],"category_scores_gemma":[0.0006325805,0.0003291124,0.0001924355,0.000522464,0.000531573,0.000229737,0.00021827,0.0009267323,0.0002584225],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003506348,"about_ca_system_score_gemma":0.0001148695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007624551,"about_ca_topic_score_gemma":0.00006359043,"domain_scores_codex":[0.9970341,0.0000768901,0.0005839905,0.0004631346,0.001055141,0.0007866987],"domain_scores_gemma":[0.9967977,0.0008156818,0.0002846394,0.001589707,0.0002207675,0.0002915379],"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.00008247113,0.0003887041,0.0003687886,0.0004968037,0.0001633832,0.00008693807,0.002411734,0.000004872719,0.01403145,0.9793745,0.002255518,0.000334868],"study_design_scores_gemma":[0.00189069,0.0004657338,0.00024017,0.0002111427,0.0001902635,0.0001883631,0.001179387,0.007439001,0.01028413,0.9759403,0.001121377,0.0008494439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9500306,0.000008314952,0.02269808,0.0002449581,0.0002234049,0.0009887528,0.00005631766,0.0003731968,0.02537639],"genre_scores_gemma":[0.804866,0.000002606192,0.1918701,0.0000257108,0.0001659942,0.0001064977,0.00002577431,0.0001846589,0.00275269],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.169172,"threshold_uncertainty_score":0.9999161,"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."}}