{"id":"W2903758214","doi":"10.1016/j.disc.2019.05.021","title":"Constructions of optimal orthogonal arrays with repeated rows","year":2019,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Hadamard matrix; Conjecture; Combinatorics; Modulo; Hadamard transform; Row; Matrix (chemical analysis); Construct (python library); Order (exchange); Block (permutation group theory); Orthogonal array; Discrete mathematics; Computer science","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.00009868872,0.0001186251,0.0002241887,0.0000529755,0.00002279206,0.00001267079,0.00009340114,0.00004763165,0.0001875433],"category_scores_gemma":[0.000006158079,0.00009184944,0.00005944409,0.0001477601,0.0000581713,0.0000653907,0.00001032308,0.00008552866,0.00005811337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007786771,"about_ca_system_score_gemma":0.000009009511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.639283e-7,"about_ca_topic_score_gemma":0.000001246257,"domain_scores_codex":[0.9993842,0.00001202485,0.0002470725,0.00008848919,0.0001323968,0.0001358505],"domain_scores_gemma":[0.999544,0.0000381398,0.00006171945,0.0002813074,0.00003466073,0.00004012041],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005827591,0.0001067213,0.005462346,0.002836301,0.0007753326,0.00001541801,0.008124581,0.1318192,0.0419146,0.8080753,0.0004104286,0.0004015118],"study_design_scores_gemma":[0.005951632,0.001143377,0.002497894,0.003655069,0.0007593968,0.001602145,0.04868767,0.7287766,0.1408318,0.05850094,0.004136706,0.003456726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9252033,0.00002731744,0.02258076,0.000003743001,0.0001194502,0.0001825893,0.00002669862,0.0001319049,0.05172421],"genre_scores_gemma":[0.9862836,0.000002361291,0.01340847,0.000001893184,0.00001463016,0.000009759207,0.00001074731,0.00002683906,0.0002417236],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7495744,"threshold_uncertainty_score":0.3745511,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.004278981230616464,"score_gpt":0.1770726163529187,"score_spread":0.1727936351223023,"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."}}