{"id":"W2042481350","doi":"10.1016/j.ins.2011.02.009","title":"New complexity results for the k-covers problem","year":2011,"lang":"en","type":"article","venue":"Information Sciences","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Vertex cover; Cover (algebra); Bounded function; Cardinality (data modeling); Combinatorics; Mathematics; Reduction (mathematics); Vertex (graph theory); Parameterized complexity; Time complexity; String (physics); Discrete mathematics; Set (abstract data type); Set cover problem; NP-complete; Graph; Computer science","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007625842,0.00005737934,0.00005114253,0.00005629713,0.000512692,0.0003548134,0.001290638,0.00001885646,0.00001337106],"category_scores_gemma":[0.00005214629,0.00003187694,0.00002944701,0.0002902556,0.0001159553,0.004860484,0.0002034079,0.00003747901,0.00007779713],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009391494,"about_ca_system_score_gemma":0.0001272665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004286213,"about_ca_topic_score_gemma":0.00001326979,"domain_scores_codex":[0.9991961,0.00001082431,0.0002304449,0.000110245,0.0002964749,0.0001558907],"domain_scores_gemma":[0.9993414,0.0001182717,0.0001523482,0.0002720092,0.00006603824,0.00004994588],"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.00002453789,0.00001008796,0.00004647511,0.000005297273,0.000004938672,1.037704e-7,0.008943195,0.0003724417,0.000009164539,0.4782717,0.08994909,0.422363],"study_design_scores_gemma":[0.0006489779,0.000161307,0.006746191,0.00001600209,0.000003192025,0.000007304896,0.0005061402,0.5024385,0.0007810738,0.06898092,0.4195325,0.000177859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007723852,0.00001313157,0.9658853,0.00109881,0.0003294279,0.0002178573,0.00001588585,0.00006757507,0.03229476],"genre_scores_gemma":[0.07438604,0.00001084509,0.924269,0.001078638,0.000064113,0.00002082503,0.000009546287,0.00000125268,0.0001597662],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5020661,"threshold_uncertainty_score":0.3943264,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1345540655591279,"score_gpt":0.2963074091520994,"score_spread":0.1617533435929715,"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."}}