{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001972934,0.0001073441,0.0001573802,0.00002989672,0.00005767926,0.00001320102,0.0001424182,0.00003342968,0.00008516727],"category_scores_gemma":[0.000009457362,0.00007554649,0.00004901383,0.00008650665,0.00008851718,0.00001956347,0.00001643329,0.00009288538,0.0001651361],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001192472,"about_ca_system_score_gemma":0.000003776093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.211321e-7,"about_ca_topic_score_gemma":0.000001081405,"domain_scores_codex":[0.9993998,0.000008680252,0.0002401411,0.00006725199,0.0001648533,0.0001192318],"domain_scores_gemma":[0.9994492,0.0002659267,0.00005432475,0.0001928927,0.00001235729,0.00002529063],"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.000002421309,0.00001720428,0.0000016895,0.00008756311,0.00002771093,1.194741e-7,0.001070984,0.060169,0.0004231292,0.9374378,0.0004951595,0.0002672264],"study_design_scores_gemma":[0.0002006572,0.00001178534,0.00007829362,0.00006655887,0.00001708723,0.000003941651,0.0007972466,0.2312295,0.00261771,0.7645816,0.0002398545,0.000155778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7739216,0.00005474337,0.04760599,0.0001228248,0.00007041456,0.0003436658,0.00006851314,0.0002142466,0.177598],"genre_scores_gemma":[0.9854142,9.962334e-7,0.01446044,0.00004774576,0.00001122693,0.00002098321,0.000016558,0.00001930613,0.000008558281],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2114926,"threshold_uncertainty_score":0.3080696,"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."}}