{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.002719071,0.0002383974,0.0002607103,0.0001607059,0.0005497864,0.0002595458,0.007800674,0.00005140624,0.00008767709],"category_scores_gemma":[0.0002264644,0.0001173642,0.0001800631,0.002372216,0.01211639,0.0003235845,0.002193445,0.0005835198,0.0002770235],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005130325,"about_ca_system_score_gemma":0.0001223425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002927629,"about_ca_topic_score_gemma":8.927696e-7,"domain_scores_codex":[0.9957562,0.0004916326,0.0003522983,0.0008615459,0.001777735,0.0007605795],"domain_scores_gemma":[0.9952102,0.001523562,0.0001419618,0.002691787,0.000234243,0.000198233],"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.00003466956,0.0001162444,0.0002299591,0.000007181892,0.000005238323,0.000001185966,0.0002134619,0.0006691875,0.001470281,0.9942636,0.00004961186,0.002939403],"study_design_scores_gemma":[0.0001836606,0.0004456802,0.004772833,0.00007384674,0.000001681614,0.000006387584,0.000003706317,0.1147118,0.009634187,0.8699492,0.00006497928,0.0001520937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4567193,0.000009445047,0.5002633,0.01145004,0.0006112296,0.001166141,0.000005479939,0.0001647664,0.02961032],"genre_scores_gemma":[0.9842667,0.000001431559,0.01378315,0.001847837,0.00002907866,0.0000147488,1.621264e-7,0.00001034164,0.00004657227],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5275474,"threshold_uncertainty_score":0.9975676,"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."}}