{"id":"W3186141999","doi":"10.1002/jcd.21798","title":"On strongly regular designs admitting fusion to strongly regular decomposition","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mathematics; Strongly regular graph; Combinatorics; Regular graph; Vertex (graph theory); Graph; Two-graph; Homogeneous; Partition (number theory); Equivalence (formal languages); Discrete mathematics; Line graph; Graph power","routes":{"ca_aff":true,"ca_fund":false,"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.001155388,0.0002920771,0.0005310806,0.0002844363,0.0001787149,0.0001409432,0.0003227309,0.000197947,0.00009082039],"category_scores_gemma":[0.0002059183,0.0002924033,0.0002997165,0.0004520986,0.00002272405,0.000295133,0.00003674769,0.0004750934,0.00003529557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002391005,"about_ca_system_score_gemma":0.0001190078,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001426125,"about_ca_topic_score_gemma":9.516799e-7,"domain_scores_codex":[0.9974473,0.0004531301,0.0008205069,0.0002160099,0.0006527519,0.0004102835],"domain_scores_gemma":[0.9983627,0.0002749667,0.0002457529,0.000362702,0.0003993833,0.000354488],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0009649791,0.0004643416,0.0001710244,0.0001645509,0.000459963,0.0008583285,0.0007938368,0.1184774,0.684307,0.1768795,0.01272331,0.003735856],"study_design_scores_gemma":[0.009894934,0.0063553,0.002324308,0.002907795,0.00051117,0.001086343,0.001496656,0.00486015,0.8019174,0.1509146,0.01591135,0.001819968],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9324135,0.0004677942,0.05596631,0.0001127102,0.009337276,0.0002536745,0.000006290243,0.0001057989,0.001336619],"genre_scores_gemma":[0.996803,0.0000146859,0.001952456,0.00002868206,0.001050553,0.000006723864,0.000004725504,0.00006339954,0.00007571562],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1176105,"threshold_uncertainty_score":0.9999528,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01639599128742876,"score_gpt":0.2473943364020799,"score_spread":0.2309983451146511,"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."}}