{"id":"W2050672239","doi":"10.1007/s10732-011-9173-3","title":"D-optimal matrices via quadratic integer optimization","year":2011,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Integer (computer science); Integer matrix; Circulant matrix; Matrix (chemical analysis); Mathematical optimization; Quadratic equation; Quadratic assignment problem; Optimization problem; Block matrix; Algorithm; Computer science; Symmetric matrix; Nonnegative matrix; Eigenvalues and eigenvectors","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.001160029,0.001493871,0.001257846,0.001741113,0.0008713279,0.002016183,0.00144175,0.001697239,0.01278461],"category_scores_gemma":[0.007579332,0.001093969,0.0008323903,0.002374959,0.001000257,0.002139033,0.0019899,0.001905584,0.001508297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001645702,"about_ca_system_score_gemma":0.002319845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007933808,"about_ca_topic_score_gemma":0.0087607,"domain_scores_codex":[0.9991367,0.0003496734,0.00003006379,0.0001295917,0.0002084686,0.0001455211],"domain_scores_gemma":[0.9966655,0.002687865,0.0001173785,0.0001815347,0.0002411032,0.0001066176],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001676,0.0002357672,0.0002628413,0.0001718814,0.00003937199,0.00006062888,0.00008978879,0.8367434,0.001346769,0.06214567,0.01116138,0.08757485],"study_design_scores_gemma":[0.00004981953,0.00003079989,0.00004465258,0.00001646315,0.000008513224,0.00001604336,0.00003177583,0.9645262,0.0003576984,0.03382447,0.001086266,0.00000738554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02020657,0.0004600872,0.9533308,0.001073086,0.0001748299,0.0001839655,0.0003413399,0.0005878177,0.02364145],"genre_scores_gemma":[0.2948857,0.0004343512,0.6925814,0.0004869714,0.0001582662,0.0004088389,0.0004213426,0.000343359,0.01027983],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01278461,"threshold_uncertainty_score":0.04276878,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01112715678127564,"score_gpt":0.1882485438579949,"score_spread":0.1771213870767193,"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."}}