{"id":"W173255084","doi":"","title":"On strongly regular graphs","year":2009,"lang":"en","type":"dissertation","venue":"Spectrum Research Repository (Concordia University)","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Two-graph; Strongly regular graph; Automorphism; Combinatorics; Adjacency matrix; Indifference graph; Symmetric graph; Discrete mathematics; Regular graph; Upper and lower bounds; Graph automorphism; Chordal graph; Pathwidth; Graph; Line graph; Voltage 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001549209,0.001205138,0.001018615,0.003048749,0.001837252,0.00309627,0.001429364,0.001415155,0.009825336],"category_scores_gemma":[0.007198543,0.0006376375,0.001355311,0.002828394,0.004576781,0.007286048,0.004004673,0.003478378,0.002440472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002317149,"about_ca_system_score_gemma":0.0007861445,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001287167,"about_ca_topic_score_gemma":0.000964107,"domain_scores_codex":[0.9966589,0.0008006961,0.0002114826,0.000965549,0.0009151273,0.0004482444],"domain_scores_gemma":[0.9927782,0.003961134,0.000653146,0.001348516,0.0008549879,0.0004039436],"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.00002105218,0.00001727733,0.0002605981,0.00007820568,0.000008254335,0.0000634247,0.0002205526,0.003035801,0.001117758,0.982747,0.002067812,0.01036237],"study_design_scores_gemma":[0.0000089836,0.00002196724,0.0002363146,0.00004104554,0.000007593067,0.0001314032,0.00006191099,0.008172625,0.0006916267,0.9776159,0.01299945,0.00001117633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.1245737,0.003153917,0.6947336,0.003083232,0.0003615534,0.0003749633,0.001714083,0.0006129797,0.1713919],"genre_scores_gemma":[0.730685,0.007470181,0.199325,0.002157951,0.001653903,0.0008244161,0.003684397,0.0005052339,0.05369389],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.009825336,"threshold_uncertainty_score":0.03286904,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04394334906857728,"score_gpt":0.3196782808228685,"score_spread":0.2757349317542912,"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."}}