{"id":"W2074300802","doi":"10.1002/jcd.1017","title":"Bounds on the number of Hadamard designs of even order","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Hadamard transform; Combinatorics; Upper and lower bounds; Order (exchange); Hadamard matrix; Hadamard's maximal determinant problem; Prime (order theory); Hadamard's inequality; Discrete mathematics","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.003684246,0.001450207,0.001797539,0.002050525,0.002045129,0.003689337,0.002157536,0.001928871,0.01298554],"category_scores_gemma":[0.01767875,0.001099999,0.001308527,0.001271515,0.002514299,0.005489225,0.002352118,0.002517446,0.002177052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002755441,"about_ca_system_score_gemma":0.001608277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006051605,"about_ca_topic_score_gemma":0.0008162126,"domain_scores_codex":[0.9930372,0.001576771,0.0004968363,0.0009953537,0.002708571,0.001185385],"domain_scores_gemma":[0.974151,0.01499207,0.002347077,0.004497875,0.002443182,0.001568751],"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.005611225,0.00068946,0.0141504,0.001323701,0.0003317037,0.001203773,0.0007612952,0.1238898,0.08493713,0.5649953,0.01807607,0.1840302],"study_design_scores_gemma":[0.0006890023,0.001159937,0.004016452,0.0002643382,0.0002384635,0.002431045,0.0002427844,0.2118942,0.08279665,0.6613714,0.03466693,0.0002287999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5867232,0.005021601,0.3192247,0.003524711,0.0007804665,0.0002970558,0.001424812,0.001357405,0.081646],"genre_scores_gemma":[0.8987388,0.001374441,0.08084381,0.0004563718,0.0004447456,0.0004577623,0.00106644,0.0001752679,0.01644235],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01298554,"threshold_uncertainty_score":0.04344094,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02602588023385388,"score_gpt":0.2473306858712236,"score_spread":0.2213048056373697,"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."}}