{"id":"W1975073433","doi":"10.1016/j.dam.2005.03.004","title":"On the computational complexity of defining sets","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Computational complexity theory; Feedback vertex set; Discrete mathematics; Dominating set; Integer (computer science); Set (abstract data type); Graph; Algorithm; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006119671,0.0012121,0.002515237,0.002631514,0.002917858,0.00892555,0.004691903,0.002954261,0.01263359],"category_scores_gemma":[0.04876159,0.001274445,0.00213802,0.004099404,0.008462459,0.02725356,0.006954283,0.009794336,0.0009755702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004117159,"about_ca_system_score_gemma":0.002161928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00253314,"about_ca_topic_score_gemma":0.002093324,"domain_scores_codex":[0.9924435,0.00327551,0.0003462656,0.000936963,0.002195216,0.0008024824],"domain_scores_gemma":[0.8886559,0.09893495,0.002535975,0.005919972,0.002623261,0.00132989],"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.00008507787,0.00004947483,0.0004902799,0.00006747656,0.00001609801,0.00004079559,0.0002223763,0.0112784,0.0001892936,0.9799187,0.001826424,0.005815595],"study_design_scores_gemma":[0.00001396691,0.00000828816,0.00012677,0.00001241713,0.0000074941,0.00002523811,0.0000510104,0.02715611,0.0001160537,0.9718332,0.0006397368,0.000009548405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3239352,0.003063187,0.539788,0.0231862,0.0004958111,0.0002233074,0.00193158,0.0003963104,0.1069805],"genre_scores_gemma":[0.9104229,0.002376068,0.069428,0.001299886,0.001014484,0.0004159072,0.001605699,0.0003023805,0.01313481],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01263359,"threshold_uncertainty_score":0.04226357,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02291151716440014,"score_gpt":0.2281042403252777,"score_spread":0.2051927231608776,"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."}}