{"id":"W2123039547","doi":"10.1016/j.disc.2011.10.026","title":"Cover starters for covering arrays of strength two","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"Toronto Metropolitan University; Carleton University","funders":"","keywords":"Cover (algebra); Mathematics; Combinatorics; Heuristic; Covering space; Upper and lower bounds; Representation (politics); Discrete mathematics; Mathematical optimization; Engineering","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.0009887561,0.0009944177,0.0009023108,0.001420927,0.001164051,0.001672255,0.001013292,0.001495069,0.01250879],"category_scores_gemma":[0.00943219,0.0007187784,0.0009906815,0.001046387,0.001508873,0.00385835,0.002791884,0.002214333,0.002314525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007306283,"about_ca_system_score_gemma":0.0005213452,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004882733,"about_ca_topic_score_gemma":0.00080023,"domain_scores_codex":[0.998502,0.0002829878,0.00007278978,0.0002787759,0.0005699944,0.0002933655],"domain_scores_gemma":[0.99331,0.004263401,0.0004350776,0.0009864792,0.0005992664,0.0004058398],"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.0009029787,0.0001972973,0.003287156,0.0002627003,0.00007464481,0.001021732,0.001242027,0.02618474,0.0241023,0.7934746,0.0135591,0.1356907],"study_design_scores_gemma":[0.00009047465,0.0002054681,0.000847258,0.00008598264,0.00007249391,0.0006312641,0.000222928,0.1365478,0.01957943,0.8283504,0.0133149,0.00005146243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1758929,0.0002894017,0.7852436,0.0005383377,0.0001499,0.0001403031,0.0003177401,0.003110356,0.03431749],"genre_scores_gemma":[0.7645515,0.0002426208,0.2022518,0.0004051684,0.0001291975,0.0002732207,0.0008118855,0.001450795,0.02988376],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01250879,"threshold_uncertainty_score":0.04184604,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04715693982522598,"score_gpt":0.2780852931107338,"score_spread":0.2309283532855078,"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."}}