{"id":"W2002893084","doi":"10.1016/j.jctb.2003.08.004","title":"Bounded degree acyclic decompositions of digraphs","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series B","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Digraph; Partition (number theory); Combinatorics; Directed acyclic graph; Mathematics; Degree (music); Bounded function; Integer (computer science); Vertex (graph theory); Decomposition; Directed graph; Discrete mathematics; Graph; Chemistry; Computer science; Physics","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.0005145145,0.0005640548,0.0005319714,0.002236727,0.0009103787,0.002590576,0.0008597588,0.0006286093,0.00808238],"category_scores_gemma":[0.0035559,0.0006552257,0.0005380479,0.001690901,0.0007819083,0.002179042,0.0009014368,0.001296071,0.000848455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009262256,"about_ca_system_score_gemma":0.0004677775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001698802,"about_ca_topic_score_gemma":0.003966633,"domain_scores_codex":[0.9994977,0.0001269341,0.00003643526,0.0001214464,0.0001024392,0.0001149704],"domain_scores_gemma":[0.9960001,0.002129188,0.0003990372,0.0004099214,0.000475397,0.0005863921],"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.0001596654,0.0001088845,0.001711414,0.0001704363,0.00004055016,0.0002748923,0.0005479506,0.01580624,0.005197091,0.9390061,0.006071742,0.03090492],"study_design_scores_gemma":[0.00002712186,0.00001901478,0.0008947363,0.00005601426,0.00003601343,0.0001945491,0.0001828294,0.04663282,0.001070313,0.9439397,0.00693246,0.00001440136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4604042,0.001425044,0.4635815,0.00109862,0.0001281297,0.0001856969,0.003240506,0.0006806427,0.0692556],"genre_scores_gemma":[0.8836208,0.001221112,0.08697587,0.0003848973,0.0001072427,0.0001607004,0.003752402,0.0002020808,0.02357491],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00808238,"threshold_uncertainty_score":0.02703828,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009481242828341514,"score_gpt":0.2070802576993297,"score_spread":0.1975990148709882,"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."}}