{"id":"W2132589312","doi":"10.1016/j.jcta.2010.10.003","title":"Divisible design graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Adjacency matrix; Combinatorics; Mathematics; Indifference graph; Discrete mathematics; Chordal graph; Adjacency list; Strongly regular graph; Incidence matrix; Generalization; Cograph; Pathwidth; Line graph; Graph","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005065526,0.0006472293,0.0005372823,0.001068862,0.001296085,0.001975273,0.0007371767,0.0009573801,0.01825853],"category_scores_gemma":[0.002514719,0.0005279933,0.0003885934,0.000955118,0.001061666,0.001975536,0.001357733,0.001747643,0.002270348],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008918262,"about_ca_system_score_gemma":0.0004791401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003006571,"about_ca_topic_score_gemma":0.0005726271,"domain_scores_codex":[0.9991978,0.0002506428,0.00002892715,0.000244184,0.0001850959,0.00009337442],"domain_scores_gemma":[0.9976724,0.0008496526,0.0002338319,0.0006745082,0.0003506492,0.0002190535],"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.00005255284,0.00003664248,0.0002381975,0.00004059265,0.00001156974,0.00005428478,0.00007653418,0.00240028,0.002495259,0.9633554,0.003579695,0.02765898],"study_design_scores_gemma":[0.00002695654,0.00004111566,0.0002027937,0.00002904431,0.00001620886,0.000197518,0.00004416728,0.00966379,0.001869671,0.9597744,0.02812202,0.00001236551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1979418,0.0007988627,0.5575082,0.002113912,0.0005240494,0.0002270624,0.0005978243,0.0006688311,0.2396194],"genre_scores_gemma":[0.7718272,0.0007443617,0.1254693,0.001138711,0.0003247626,0.0002302681,0.0005690235,0.0002030941,0.0994933],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01825853,"threshold_uncertainty_score":0.06108081,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006352779784245656,"score_gpt":0.1935049568511631,"score_spread":0.1871521770669175,"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."}}