{"id":"W2753771241","doi":"10.1016/j.ffa.2017.08.012","title":"A strongly regular decomposition of the complete graph and its association scheme","year":2017,"lang":"en","type":"article","venue":"Finite Fields and Their Applications","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Japan Society for the Promotion of Science; Soochow University","keywords":"Association scheme; Mathematics; Scheme (mathematics); Decomposition; Graph; Regular graph; Combinatorics; Association (psychology); Strongly regular graph; Discrete mathematics; Voltage graph; Line graph; Graph power; Mathematical analysis","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.0009351501,0.0006566713,0.0008235462,0.002103769,0.001617526,0.002563399,0.001071084,0.0009800199,0.007276316],"category_scores_gemma":[0.001687366,0.0004884399,0.0009351314,0.001380793,0.003149452,0.004848492,0.001983723,0.002277754,0.0008618006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001146455,"about_ca_system_score_gemma":0.000633647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001146633,"about_ca_topic_score_gemma":0.0009693432,"domain_scores_codex":[0.9993949,0.0001279757,0.00002945973,0.0002123319,0.0001137571,0.0001215541],"domain_scores_gemma":[0.998597,0.0003735698,0.0002264402,0.0002226804,0.0001973433,0.0003829944],"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.00002025188,0.000009373878,0.0001091186,0.00001053725,0.000003548824,0.00001573246,0.000121151,0.0004065221,0.0004229369,0.9967282,0.0003101956,0.001842571],"study_design_scores_gemma":[0.000009688335,0.00001251671,0.0001818162,0.000009461198,0.000007118812,0.00004242112,0.00008661445,0.00381763,0.0002957107,0.9933164,0.002213396,0.000007252007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5174211,0.0006613521,0.4135214,0.001520887,0.0002405281,0.00009948376,0.0008493824,0.0002729959,0.06541295],"genre_scores_gemma":[0.8889366,0.0005958022,0.06828438,0.0003115995,0.0003097971,0.0001046299,0.0008819055,0.0001849421,0.04039048],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007276316,"threshold_uncertainty_score":0.02434176,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05837739689131383,"score_gpt":0.3306328660866852,"score_spread":0.2722554691953714,"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."}}