{"id":"W2955563424","doi":"10.1016/j.tcs.2019.05.031","title":"On the complexity of the k-kernel problem on cyclically k-partite digraphs","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Digraph; Combinatorics; Mathematics; Kernel (algebra); Integer (computer science); Vertex (graph theory); Discrete mathematics; Bipartite graph; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002078967,0.001215212,0.002891847,0.00178586,0.002599301,0.008460234,0.004915767,0.003702379,0.01971534],"category_scores_gemma":[0.02665476,0.00129803,0.001814409,0.003501002,0.003472058,0.0183677,0.004360759,0.005320632,0.001482682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004490156,"about_ca_system_score_gemma":0.003239838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007880896,"about_ca_topic_score_gemma":0.008788554,"domain_scores_codex":[0.9966904,0.0009875405,0.0001703143,0.0007171415,0.0006156722,0.0008189185],"domain_scores_gemma":[0.9412799,0.05021984,0.002615468,0.002545758,0.001268363,0.002070577],"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.002899533,0.001175944,0.01084963,0.00170293,0.0003635294,0.0007972913,0.001918703,0.3183009,0.005785918,0.5598463,0.04055957,0.0557998],"study_design_scores_gemma":[0.000244794,0.00008219553,0.001576327,0.00006071119,0.00009267484,0.0002663206,0.0004430086,0.3665941,0.001193631,0.6276144,0.00177234,0.0000593236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8312812,0.001579617,0.1077905,0.01228202,0.0002833682,0.0002873484,0.005241524,0.001094193,0.04016014],"genre_scores_gemma":[0.9605656,0.0009059021,0.02349191,0.0006153588,0.0004750922,0.0001868371,0.003329141,0.0004531989,0.009976934],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01971534,"threshold_uncertainty_score":0.06595439,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02525296307673684,"score_gpt":0.2781658327939047,"score_spread":0.2529128697171678,"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."}}