{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001814687,0.001885215,0.002025177,0.00169119,0.002142004,0.003596607,0.004386523,0.003230538,0.01043759],"category_scores_gemma":[0.0242331,0.001929284,0.003073948,0.002784229,0.003942846,0.01232188,0.004251009,0.00631158,0.001185517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0014024,"about_ca_system_score_gemma":0.001305575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002312383,"about_ca_topic_score_gemma":0.002270144,"domain_scores_codex":[0.9958068,0.001070726,0.0002672883,0.0008247005,0.001314319,0.0007160204],"domain_scores_gemma":[0.9549698,0.03756806,0.001691036,0.003914891,0.001091895,0.0007644453],"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.001943024,0.0007621286,0.008253856,0.002601266,0.0005354344,0.001557228,0.00216389,0.2608329,0.01702419,0.5427304,0.03559861,0.1259972],"study_design_scores_gemma":[0.0002261235,0.0001342495,0.001686969,0.0001194929,0.0002553319,0.0007944889,0.0003728351,0.1840252,0.006385953,0.7997652,0.006151302,0.00008292696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1981005,0.001677293,0.7458919,0.005617522,0.0002749603,0.0002321237,0.001561267,0.002420438,0.04422404],"genre_scores_gemma":[0.8245463,0.001619472,0.1557943,0.001586255,0.0005881679,0.0003676676,0.002286514,0.000874069,0.01233733],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01043759,"threshold_uncertainty_score":0.03491718,"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."}}