{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001169489,0.0001583748,0.0004266847,0.0001052859,0.00005357946,0.0000217763,0.0003686413,0.00011562,0.0001920706],"category_scores_gemma":[0.000152727,0.0001099366,0.0002147599,0.0003923122,0.00007384783,0.0001250457,0.00001300852,0.0002897028,0.00001393696],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004446873,"about_ca_system_score_gemma":0.00006830558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006446202,"about_ca_topic_score_gemma":5.841076e-7,"domain_scores_codex":[0.9983553,0.0002510607,0.0006852733,0.00006598642,0.0004487097,0.0001936981],"domain_scores_gemma":[0.9986029,0.000464203,0.0003313574,0.0002423905,0.0002817322,0.00007743642],"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.00157822,0.0007987061,0.008547292,0.000232536,0.001322321,0.0001111854,0.002045975,0.008765461,0.09566692,0.8551467,0.02445343,0.001331252],"study_design_scores_gemma":[0.009510515,0.00341325,0.007843501,0.001588188,0.0005815232,0.0008365954,0.001357088,0.001369938,0.2005703,0.7217199,0.05004721,0.001161945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9769697,0.000191975,0.004854083,0.0001074965,0.005483313,0.0001751123,0.000003730518,0.00002295293,0.01219171],"genre_scores_gemma":[0.9993411,0.00005248818,0.0001125038,0.00001852925,0.0003411365,0.00000293327,3.246123e-7,0.00002808184,0.0001028571],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1334268,"threshold_uncertainty_score":0.4483085,"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."}}