{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002064971,0.0007078209,0.0009137086,0.004182797,0.001321213,0.0003175024,0.002300143,0.0009753968,0.0002928141],"category_scores_gemma":[0.0008813345,0.0007904624,0.0006185644,0.002587147,0.000484343,0.0003358102,0.0002159985,0.004096154,0.0002966917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00158756,"about_ca_system_score_gemma":0.001409606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001745688,"about_ca_topic_score_gemma":0.008301558,"domain_scores_codex":[0.9910569,0.002166138,0.0005460623,0.001496617,0.002897479,0.001836821],"domain_scores_gemma":[0.993921,0.002214198,0.0003453508,0.002142521,0.0007002629,0.000676643],"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.004091392,0.0007206632,0.0006247666,0.0005576728,0.0004914919,0.004987317,0.0005318157,0.000007102532,0.004102877,0.9589855,0.02319579,0.001703602],"study_design_scores_gemma":[0.002570991,0.004251611,0.01588826,0.001125483,0.0002519833,0.00005973018,0.00542147,0.00006965733,0.04000257,0.9006042,0.02792676,0.001827307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5875338,0.00007927671,0.000009639168,0.0001348088,0.0004876978,0.0008837342,0.00001917814,0.0002356587,0.4106162],"genre_scores_gemma":[0.6938656,0.00009997997,0.00007030595,0.000006324471,0.0003399093,0.00000878987,0.0001700327,0.0001599893,0.3052791],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1063317,"threshold_uncertainty_score":0.999979,"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."}}