{"id":"W2109104984","doi":"10.37236/1545","title":"Hadamard Matrices and Strongly Regular Graphs with the $3$-e.c. Adjacency Property","year":2000,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge; Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Strongly regular graph; Adjacency matrix; Two-graph; Hadamard transform; Chordal graph; Discrete mathematics; Hadamard matrix; Graph; Pathwidth; Line graph; Graph power","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002425941,0.0003742968,0.0002528274,0.0006601561,0.0007553128,0.0009097098,0.0003496237,0.0005995707,0.001958271],"category_scores_gemma":[0.001612849,0.0002876532,0.0004174724,0.0006650742,0.001511312,0.0009728567,0.0006606386,0.001090104,0.0002891895],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004900323,"about_ca_system_score_gemma":0.0003305032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001117322,"about_ca_topic_score_gemma":0.0011194,"domain_scores_codex":[0.9997032,0.00005959477,0.0000160057,0.0000724665,0.00006267615,0.00008602845],"domain_scores_gemma":[0.9985006,0.0006635414,0.0003058218,0.0002166061,0.0001553978,0.0001580394],"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.0001055151,0.00003879654,0.00112755,0.00005174666,0.00001233263,0.0005588844,0.0003956374,0.009831054,0.01297695,0.9601322,0.001383472,0.01338584],"study_design_scores_gemma":[0.00003125733,0.00009187407,0.00126274,0.00001594747,0.00001441788,0.0009697624,0.0002099834,0.04322305,0.008236815,0.9377804,0.008129995,0.00003376726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.778309,0.000500576,0.1809284,0.0007113399,0.00008728158,0.00007955753,0.0002886566,0.0002716018,0.0388236],"genre_scores_gemma":[0.9611765,0.0002551878,0.03275268,0.0001850351,0.00004569928,0.00006350691,0.0001924808,0.00002821722,0.005300673],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001958271,"threshold_uncertainty_score":0.006551087,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.002538213338562106,"score_gpt":0.1560511398619552,"score_spread":0.1535129265233931,"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."}}