{"id":"W2040255444","doi":"10.1016/j.jctb.2011.09.001","title":"Decomposing locally semicomplete digraphs into strong spanning subdigraphs","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Digraph; Combinatorics; Partition (number theory); Disjoint sets; Arc (geometry); Discrete mathematics","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.0003268017,0.0004223925,0.0005720191,0.001106137,0.0008191433,0.001366303,0.0006539761,0.0005616931,0.006883318],"category_scores_gemma":[0.001609555,0.0005030837,0.0005746857,0.001259037,0.0008604853,0.002451805,0.001543697,0.001513611,0.0008355579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003973491,"about_ca_system_score_gemma":0.0004307244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006460691,"about_ca_topic_score_gemma":0.001775253,"domain_scores_codex":[0.9997296,0.00004451792,0.0000219223,0.00008287092,0.00006178922,0.00005931165],"domain_scores_gemma":[0.9985352,0.000615635,0.0001594483,0.0002684,0.0001782913,0.0002430051],"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.0001246546,0.0001175139,0.00179893,0.0002128885,0.00003933346,0.0005644419,0.001021962,0.0146104,0.01070892,0.924351,0.002721019,0.04372896],"study_design_scores_gemma":[0.00001994094,0.00004981858,0.0009509217,0.00003214192,0.00003508496,0.0002838968,0.0003651163,0.03892407,0.002031664,0.9525384,0.004757307,0.00001159479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5586319,0.0002827527,0.4022849,0.0003567228,0.00007938918,0.000175386,0.0007258901,0.0005709347,0.03689217],"genre_scores_gemma":[0.866774,0.0003562198,0.1140765,0.0002496479,0.00007948928,0.0001285818,0.001359252,0.0002128534,0.01676341],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006883318,"threshold_uncertainty_score":0.023027,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02491616962830137,"score_gpt":0.2732788796411783,"score_spread":0.2483627100128769,"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."}}