{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003805871,0.00008525702,0.0001390379,0.00003763615,0.0005749724,0.00006804575,0.0002659558,0.0001014749,0.00002125378],"category_scores_gemma":[0.0002431864,0.00006109782,0.00005041546,0.000064662,0.00008122267,0.00008179289,0.0001742514,0.000168123,0.000003541574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000127069,"about_ca_system_score_gemma":0.00001285041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001071647,"about_ca_topic_score_gemma":0.00002733832,"domain_scores_codex":[0.9993815,0.00005815208,0.0001674513,0.0001464048,0.0001174334,0.0001290631],"domain_scores_gemma":[0.9984508,0.0006313694,0.0002446283,0.0005220619,0.0001123805,0.00003873658],"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.00001861333,0.00009438198,0.005085778,0.000130214,0.00008961983,1.310371e-7,0.0006605513,0.000001804156,0.007433217,0.9842262,0.0003232228,0.001936271],"study_design_scores_gemma":[0.0006278684,0.00007125775,0.02593633,0.00008296305,0.00004250308,0.000004214097,0.0001981214,0.00391912,0.004099946,0.9603837,0.004456098,0.000177948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9644253,0.0002502144,0.02343662,0.003615256,0.00004667681,0.001114403,0.0003240746,0.00004227824,0.00674519],"genre_scores_gemma":[0.9984444,0.00004761501,0.0009360728,0.0000285566,0.00004157527,0.0001104132,0.000009504039,0.000009729742,0.0003721216],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03401912,"threshold_uncertainty_score":0.4422281,"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."}}