{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008685144,0.0001639863,0.0002138235,0.00005587083,0.0001849887,0.00006076944,0.0004191857,0.00004745471,0.00002536744],"category_scores_gemma":[0.000004760176,0.00006576413,0.0000724909,0.0003732647,0.00009596795,0.0001634631,0.00001005244,0.0006003592,0.000003746201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006412111,"about_ca_system_score_gemma":0.0000680438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000469022,"about_ca_topic_score_gemma":0.000006278468,"domain_scores_codex":[0.9988378,0.0001354338,0.0002466001,0.00007486449,0.0003000257,0.0004052916],"domain_scores_gemma":[0.9994567,0.00007495151,0.0001039716,0.0002356857,0.0000715374,0.00005715972],"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.0004995004,0.0001416917,0.001095553,0.0001412005,0.001063915,0.00004005595,0.002210687,0.007585478,0.0009027018,0.9646654,0.006669981,0.0149838],"study_design_scores_gemma":[0.00436912,0.003875505,0.002758174,0.0003290218,0.0007746426,0.003513129,0.002553973,0.002159915,0.00280329,0.7217638,0.2541199,0.0009795231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9718133,0.02420103,0.0003544083,0.0005541504,0.0001525578,0.000177694,6.340156e-7,0.00004112764,0.002705051],"genre_scores_gemma":[0.9959457,0.003167847,0.000002960502,0.00001719171,0.00005217683,0.000004497706,2.034012e-7,0.00002568424,0.0007837723],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2474499,"threshold_uncertainty_score":0.2681783,"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."}}