{"id":"W2084172672","doi":"10.1016/j.tcs.2011.07.010","title":"Hardness results for covering arrays avoiding forbidden edges and error-locating arrays","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa","funders":"Division of Electrical, Communications and Cyber Systems; Natural Sciences and Engineering Research Council of Canada","keywords":"Clique; Enhanced Data Rates for GSM Evolution; Binary number; Reduction (mathematics); Time complexity; Combinatorics; Hardness of approximation; Computer science; Computational complexity theory; Discrete mathematics; Mathematics; Algorithm; Approximation algorithm; Arithmetic; Artificial intelligence; Geometry","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.003276865,0.0002338792,0.0002617385,0.0001936494,0.0009276317,0.0004692273,0.001922594,0.00006722584,0.000001494829],"category_scores_gemma":[0.001376518,0.0002035639,0.00005868465,0.0006305939,0.001464689,0.000752718,0.001071537,0.0002231665,0.000006126857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000472435,"about_ca_system_score_gemma":0.00009833453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001648722,"about_ca_topic_score_gemma":5.209479e-7,"domain_scores_codex":[0.9975154,0.00008285043,0.0003650047,0.0009466435,0.0004040432,0.0006860742],"domain_scores_gemma":[0.997595,0.0009511621,0.0001341388,0.0008164158,0.0002440203,0.0002592562],"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.00002798121,0.0000421194,0.0002365454,0.00003666734,0.000005408736,0.000005393442,0.004804315,0.00003107609,0.0005412711,0.9280789,0.000467568,0.06572269],"study_design_scores_gemma":[0.0002914839,0.0002990983,0.0005169009,0.0001619431,0.000006266848,0.00006068854,0.00001537536,0.4368802,0.01773237,0.5436458,0.00005242063,0.0003374447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01264847,0.00002548542,0.9805384,0.0002164897,0.0006076021,0.0002568507,0.0000028576,0.003110666,0.002593231],"genre_scores_gemma":[0.5402136,0.000001351164,0.4595373,0.0001455414,0.00007420428,0.00001548473,3.812881e-7,0.000008065183,0.000004071187],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5275652,"threshold_uncertainty_score":0.8301094,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05730497221443467,"score_gpt":0.2806631798467533,"score_spread":0.2233582076323186,"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."}}